{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008781309,0.00047096334,0.98242193,0.0005927304,0.00016310647,0.00037369548,0.0001952125,0.0046123457,0.0023886466],"genre_scores_gemma":[0.18636297,0.00066949375,0.8007052,0.00038650594,0.00039337017,0.00074575754,0.00086267956,0.00034630726,0.009527716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738973,0.00055182615,0.0003550585,0.0005195961,0.0010587648,0.00012507227],"domain_scores_gemma":[0.992595,0.0018444804,0.0009830514,0.0028921163,0.0012855432,0.00039979033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037846772,0.00063557696,0.001072529,0.002550483,0.0025198092,0.0027863507,0.00384626,0.0022807135,0.0036515552],"category_scores_gemma":[0.0091010975,0.0006137456,0.0006343821,0.0031168985,0.001620903,0.0056608235,0.0040674964,0.0016659406,0.002050811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008526183,0.0005359099,0.0025408862,0.0010663315,0.0001904253,0.0013987707,0.001333905,0.033045456,0.09047318,0.24854492,0.034154736,0.5858628],"study_design_scores_gemma":[0.00078672456,0.0018271828,0.0025166785,0.00026963284,0.00036649717,0.004305248,0.0006546929,0.39987713,0.15627113,0.119995475,0.31263557,0.0004941367],"about_ca_topic_score_codex":0.0011416515,"about_ca_topic_score_gemma":0.0009372097,"teacher_disagreement_score":0.00384626,"about_ca_system_score_codex":0.0013036013,"about_ca_system_score_gemma":0.0019896377,"threshold_uncertainty_score":0.020015478},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010784661,0.0048424574,0.03942747,0.003371248,0.0061072614,0.0010615368,0.14241184,0.3981086,0.4035911],"genre_scores_gemma":[0.012511296,0.008584283,0.022761662,0.003790029,0.0028557885,0.0015676151,0.22293122,0.0772647,0.64773357],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960532,0.00050872,0.00036491235,0.001033314,0.0014297952,0.00060998305],"domain_scores_gemma":[0.99035877,0.0013968125,0.0006773186,0.002696325,0.0016061567,0.0032646167],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032631753,0.004708082,0.004047968,0.0047199638,0.0025427758,0.013485108,0.0060529015,0.0051248153,0.74360883],"category_scores_gemma":[0.0132560255,0.0033302626,0.0022067418,0.006960796,0.0022496532,0.008125816,0.007425596,0.004790943,0.8168627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024956162,0.00006775573,0.00030252355,0.00198426,0.00009250173,0.0002981738,0.00021823915,0.00029200423,0.006610732,0.008443431,0.90196836,0.07947239],"study_design_scores_gemma":[0.00009484862,0.00007469481,0.00064499833,0.00020510274,0.000028863016,0.00023342497,0.00007828061,0.0005746184,0.0013018642,0.004898606,0.99180275,0.000062019746],"about_ca_topic_score_codex":0.003996387,"about_ca_topic_score_gemma":0.0044703125,"teacher_disagreement_score":0.74360883,"about_ca_system_score_codex":0.0028989208,"about_ca_system_score_gemma":0.007203933,"threshold_uncertainty_score":0.36571085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14672859,0.0012619355,0.53925425,0.00073283154,0.0008046799,0.0023096353,0.0060724644,0.28329384,0.019541772],"genre_scores_gemma":[0.7433815,0.001264342,0.19728686,0.0007102431,0.0007272025,0.0010038232,0.012655386,0.005199638,0.037771076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996655,0.00003896673,0.000030585103,0.00009546263,0.00013393248,0.000035528978],"domain_scores_gemma":[0.99916613,0.00020818587,0.00007030788,0.00016788555,0.00021627189,0.00017122633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070559146,0.00090978,0.0007878198,0.0013202808,0.0005790982,0.0011502535,0.0018099888,0.0008504559,0.008449605],"category_scores_gemma":[0.0021316165,0.00042727165,0.00031514562,0.0005875889,0.0003106108,0.001514056,0.0014422094,0.0008223108,0.0021498012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009079335,0.001565017,0.0074285083,0.0007016094,0.00029798283,0.0018071375,0.00093840813,0.02130832,0.1812531,0.0067038857,0.14236388,0.6265528],"study_design_scores_gemma":[0.0021398214,0.0017531713,0.007583215,0.00008349678,0.00026690026,0.0016507542,0.0002861732,0.73462963,0.1287143,0.0051331203,0.11753635,0.00022303467],"about_ca_topic_score_codex":0.0030922014,"about_ca_topic_score_gemma":0.002017171,"teacher_disagreement_score":0.008449605,"about_ca_system_score_codex":0.0006951185,"about_ca_system_score_gemma":0.0005069603,"threshold_uncertainty_score":0.028266788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7808143,0.007656739,0.1682318,0.0013466642,0.0009893774,0.000385906,0.0005673005,0.024806663,0.015201275],"genre_scores_gemma":[0.94305104,0.0005076635,0.051219054,0.00015274824,0.00014425382,0.000074950534,0.00044941253,0.00021804184,0.0041828677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899083,0.00030153646,0.00006132807,0.00012763352,0.00030221933,0.00021638926],"domain_scores_gemma":[0.99545825,0.002082375,0.0002094158,0.0011379248,0.00083837524,0.00027368715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093399786,0.0010473925,0.0007547487,0.00087465346,0.00097363413,0.0011241699,0.0022951455,0.0010739425,0.002831785],"category_scores_gemma":[0.0075033475,0.00048248307,0.0002448801,0.001482649,0.0003705768,0.0025218679,0.0011526622,0.0010883834,0.0011284277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067185136,0.002259938,0.019615944,0.00055892544,0.00025722352,0.0011047248,0.00050832995,0.104536034,0.10518837,0.004662621,0.044778205,0.70981115],"study_design_scores_gemma":[0.00027661506,0.0010851588,0.0041771755,0.00003118774,0.00012873171,0.0005046681,0.00023968097,0.9167917,0.06484712,0.005165874,0.0066905976,0.00006160133],"about_ca_topic_score_codex":0.0058512697,"about_ca_topic_score_gemma":0.0076348362,"teacher_disagreement_score":0.0058512697,"about_ca_system_score_codex":0.0005851246,"about_ca_system_score_gemma":0.0014067836,"threshold_uncertainty_score":0.011634409},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040358156,0.028830282,0.8286254,0.0030557073,0.0013708764,0.00021093199,0.0003345365,0.0050758286,0.09213832],"genre_scores_gemma":[0.50509804,0.02017764,0.33710712,0.0007413227,0.0013507954,0.00013045165,0.00056279864,0.00082673394,0.13400503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996947,0.000042506508,0.0000131423085,0.000073806266,0.00013331058,0.000042513722],"domain_scores_gemma":[0.9997609,0.00009936621,0.000009984777,0.00004890619,0.00005905557,0.000021690816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039221,0.00061468076,0.00087681593,0.00047718766,0.0008154713,0.002041048,0.0016656616,0.0011584415,0.0053597586],"category_scores_gemma":[0.00082309585,0.00034719714,0.00030746506,0.0015885177,0.00054122513,0.0029643632,0.0008981353,0.0012654617,0.002077466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034373687,0.0001999403,0.00059876556,0.00058736,0.000063331245,0.00060979946,0.00039885394,0.07419652,0.038659327,0.11528336,0.07691173,0.6921473],"study_design_scores_gemma":[0.00006469073,0.00013572794,0.0010046904,0.000091032314,0.000069971706,0.0011342689,0.0003140194,0.73235875,0.021661784,0.12042844,0.1226448,0.00009183373],"about_ca_topic_score_codex":0.00368025,"about_ca_topic_score_gemma":0.0029846064,"teacher_disagreement_score":0.0053597586,"about_ca_system_score_codex":0.0009191393,"about_ca_system_score_gemma":0.0006544265,"threshold_uncertainty_score":0.01793021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035962483,0.0010812379,0.9713438,0.0005993933,0.0002449767,0.00019822476,0.00021890107,0.015399281,0.0073180352],"genre_scores_gemma":[0.17403325,0.0026012522,0.7964859,0.00052171014,0.00054663775,0.0005202598,0.002105582,0.0030573064,0.020128071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968081,0.00073498924,0.0005033346,0.00036285396,0.0014067565,0.00018380076],"domain_scores_gemma":[0.99736065,0.0007522791,0.00021248024,0.0011301553,0.0003519888,0.00019239445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271942,0.0007774982,0.0009364073,0.00091411144,0.0009492632,0.005224312,0.0036931199,0.0013890411,0.006398738],"category_scores_gemma":[0.008887763,0.0007670756,0.0010489193,0.0013970354,0.00094320986,0.005183201,0.0027471466,0.0023585742,0.0039762734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049051136,0.0003858432,0.0020136163,0.001037407,0.00021559879,0.0012169867,0.0010146402,0.05793103,0.026499925,0.55718386,0.04108829,0.31092227],"study_design_scores_gemma":[0.00019461612,0.00019862007,0.0012078425,0.0002096312,0.00013699531,0.0009669958,0.00029581858,0.33832192,0.027879015,0.25297502,0.3774669,0.00014667933],"about_ca_topic_score_codex":0.0019312274,"about_ca_topic_score_gemma":0.0016082535,"teacher_disagreement_score":0.006398738,"about_ca_system_score_codex":0.0011290665,"about_ca_system_score_gemma":0.0011820658,"threshold_uncertainty_score":0.022592425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018090747,0.00025024774,0.9776834,0.0001952021,0.000038838254,0.000119871445,0.00005311994,0.00033498125,0.0032334765],"genre_scores_gemma":[0.5745472,0.0004149719,0.4212762,0.000050812032,0.00006292005,0.0002059075,0.00013776516,0.000084869476,0.0032193796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883515,0.0003168218,0.00010155401,0.00012402791,0.0005116246,0.00011082285],"domain_scores_gemma":[0.99893147,0.00033380467,0.00016708366,0.00012760013,0.00031039957,0.00012959447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010508298,0.00034857437,0.0005699367,0.0006953279,0.00084707205,0.0014712071,0.0011049438,0.00055375235,0.0014853899],"category_scores_gemma":[0.0033082566,0.0003674524,0.00030353776,0.0006299348,0.00057689677,0.0018648356,0.001362267,0.00061498577,0.00032678046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031466378,0.00020897803,0.0013953071,0.0005349327,0.000074118296,0.00052778976,0.00077012164,0.356933,0.08124907,0.403343,0.006051027,0.14859791],"study_design_scores_gemma":[0.000027468524,0.00010403951,0.00022124256,0.000020623478,0.000030632047,0.00016249261,0.00008895517,0.9278484,0.0089997575,0.052705634,0.009771916,0.000018811623],"about_ca_topic_score_codex":0.0015302554,"about_ca_topic_score_gemma":0.0022783384,"teacher_disagreement_score":0.0015302554,"about_ca_system_score_codex":0.0013656503,"about_ca_system_score_gemma":0.0012619621,"threshold_uncertainty_score":0.009908497},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061431783,0.05263943,0.6683702,0.010158997,0.002638867,0.000110157445,0.00012544268,0.0012744466,0.25853938],"genre_scores_gemma":[0.22870612,0.08747204,0.44825307,0.002928254,0.0037194788,0.00037013282,0.0005487875,0.0004999856,0.22750217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969864,0.000053186122,0.000015090828,0.00006253191,0.00014405794,0.000026500084],"domain_scores_gemma":[0.9995534,0.0002225173,0.000026888192,0.00007580559,0.00007789964,0.00004342414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066061685,0.0005665427,0.0004795934,0.0006204391,0.0006246322,0.003936486,0.0011739581,0.0012960896,0.004648429],"category_scores_gemma":[0.0013327644,0.00038868684,0.0003117833,0.0013750428,0.0013690263,0.0061152824,0.0014293403,0.002273454,0.0025696224],"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.000020650332,0.000049050643,0.0001366277,0.00028707288,0.000024693938,0.00008370087,0.000442985,0.006114438,0.0017866978,0.683931,0.039639756,0.2674833],"study_design_scores_gemma":[0.00001035179,0.000022586037,0.00018470005,0.00017378686,0.000014854128,0.00025156484,0.00014703527,0.023326138,0.0013419907,0.71098775,0.26352194,0.000017355753],"about_ca_topic_score_codex":0.00055909564,"about_ca_topic_score_gemma":0.00070999074,"teacher_disagreement_score":0.004648429,"about_ca_system_score_codex":0.0006923081,"about_ca_system_score_gemma":0.00080653274,"threshold_uncertainty_score":0.015550494},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096526414,0.0036167782,0.86846036,0.0027388758,0.00029221456,0.0002892712,0.00008810653,0.0011271276,0.026860837],"genre_scores_gemma":[0.688398,0.002898421,0.29604986,0.0004537379,0.0003753929,0.00022449503,0.00010727728,0.00019964851,0.011293251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991792,0.00027038902,0.00003402792,0.00016534935,0.00021877192,0.0001321438],"domain_scores_gemma":[0.99904734,0.00040235423,0.0001013741,0.00022941855,0.00012623203,0.00009325803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011546105,0.00045154276,0.00050890783,0.0005405683,0.0014856191,0.003497391,0.0012934018,0.0009286436,0.0021928467],"category_scores_gemma":[0.0023482833,0.0002739723,0.0003363092,0.0010050227,0.0009015756,0.004566259,0.0024290623,0.000836331,0.0007180651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004438483,0.00037429063,0.0032057976,0.00061833306,0.00011056848,0.00076494936,0.00306809,0.10797315,0.036832243,0.32684812,0.019176286,0.50058436],"study_design_scores_gemma":[0.000103371516,0.00030285554,0.0011348015,0.00013000808,0.00009977824,0.0006832991,0.0012599662,0.76180553,0.024709009,0.10330084,0.10639311,0.000077393044],"about_ca_topic_score_codex":0.0023834137,"about_ca_topic_score_gemma":0.00202819,"teacher_disagreement_score":0.003497391,"about_ca_system_score_codex":0.000817911,"about_ca_system_score_gemma":0.0014301314,"threshold_uncertainty_score":0.0073358417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018222552,0.109349705,0.23453793,0.006897977,0.002107017,0.00043423794,0.00008244451,0.00088969455,0.62747836],"genre_scores_gemma":[0.3998554,0.118666984,0.085686706,0.0017990094,0.0027112868,0.0006925204,0.00022170214,0.00038666243,0.3899798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914134,0.00018994282,0.000032890755,0.00012729534,0.00043182538,0.00007661777],"domain_scores_gemma":[0.9985935,0.001056624,0.000058739777,0.00009050493,0.00014986173,0.00005084338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512848,0.00062044064,0.00058388617,0.00069899805,0.00089780753,0.0021510075,0.0012288679,0.0018327842,0.008940655],"category_scores_gemma":[0.0029621683,0.00036729354,0.0005390648,0.0006719531,0.0016154627,0.0030634357,0.0011673883,0.0026717936,0.002341734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081345956,0.00015145107,0.0002605455,0.0008820683,0.000029472736,0.0005965766,0.0013931341,0.01664726,0.004039747,0.62172365,0.03675951,0.3174352],"study_design_scores_gemma":[0.000043734883,0.00034696498,0.00072953326,0.00095182064,0.000054843484,0.002245104,0.0007655844,0.07390716,0.005944487,0.41501123,0.4999237,0.00007585996],"about_ca_topic_score_codex":0.0006074248,"about_ca_topic_score_gemma":0.0004935349,"teacher_disagreement_score":0.008940655,"about_ca_system_score_codex":0.001468166,"about_ca_system_score_gemma":0.00056880544,"threshold_uncertainty_score":0.029909492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10800112,0.06870872,0.6163394,0.026410682,0.004688824,0.0021360633,0.00045662554,0.009012867,0.16424574],"genre_scores_gemma":[0.83293223,0.017108217,0.11537218,0.00081223587,0.001083986,0.00047566363,0.00029691588,0.0004010592,0.031517494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958762,0.0016978455,0.00016318935,0.0003995809,0.0016203921,0.00024277005],"domain_scores_gemma":[0.9821915,0.0055445596,0.001605867,0.0028665187,0.0067401677,0.0010514292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055336035,0.00043561563,0.0004660475,0.0010427953,0.0012361258,0.0019482019,0.0012079593,0.0010853151,0.01360924],"category_scores_gemma":[0.027833527,0.00014810711,0.00021376931,0.0011969706,0.00090599834,0.005409142,0.0018137842,0.0008281596,0.0029077248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016648769,0.00020350117,0.0018977443,0.0018189993,0.00008048477,0.000387538,0.00079256814,0.017024837,0.017260777,0.10392413,0.049568404,0.8068745],"study_design_scores_gemma":[0.00015321052,0.0009643944,0.0053026397,0.0010297813,0.00015079898,0.0010872002,0.0014634803,0.058519777,0.0304536,0.12607303,0.7746982,0.0001039257],"about_ca_topic_score_codex":0.001020774,"about_ca_topic_score_gemma":0.001605722,"teacher_disagreement_score":0.01360924,"about_ca_system_score_codex":0.0008511259,"about_ca_system_score_gemma":0.0021438764,"threshold_uncertainty_score":0.0455274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2079378,0.017032465,0.55047375,0.00498241,0.0006682125,0.00020682576,0.00020753827,0.0011096769,0.21738136],"genre_scores_gemma":[0.90864956,0.0029218504,0.03982638,0.00011167033,0.00023412875,0.00007487131,0.0000890851,0.00014218758,0.047950298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.00017852872,0.000026060101,0.0000897989,0.00014060695,0.00012159899],"domain_scores_gemma":[0.9983949,0.00085416733,0.0001511448,0.00020168128,0.00021861249,0.00017948376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010836306,0.00035572253,0.00050905434,0.0008277218,0.0015738426,0.0039128866,0.0014561116,0.0009858091,0.008479909],"category_scores_gemma":[0.004525868,0.00038300597,0.00026178217,0.0016231625,0.0012631189,0.00600962,0.0016864329,0.0012736529,0.0007296309],"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.00026833045,0.00013579638,0.0025105954,0.00015885853,0.00002841245,0.00019902077,0.0017221835,0.037040323,0.0044994466,0.75259423,0.013668887,0.18717389],"study_design_scores_gemma":[0.000041525058,0.00010699597,0.0055028666,0.00012477023,0.00007086686,0.0005278121,0.003341514,0.29964,0.0049555823,0.5979034,0.0877131,0.0000715329],"about_ca_topic_score_codex":0.0058649825,"about_ca_topic_score_gemma":0.008327198,"teacher_disagreement_score":0.008479909,"about_ca_system_score_codex":0.0014328435,"about_ca_system_score_gemma":0.00071651465,"threshold_uncertainty_score":0.028368175},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2227815,0.00043355502,0.77113986,0.00038680513,0.0000447139,0.0001692925,0.00006109637,0.0010518003,0.0039313836],"genre_scores_gemma":[0.90137243,0.00029352505,0.09630291,0.000034955214,0.0000290849,0.00015123517,0.000082581675,0.00015092266,0.00158235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966331,0.0016427101,0.00014654879,0.0003943143,0.00077899685,0.00040433157],"domain_scores_gemma":[0.9886955,0.0072534964,0.0010054673,0.0014191807,0.00133609,0.00029022343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035871305,0.0010404766,0.0011124663,0.00079398334,0.001147307,0.0022996343,0.0022692645,0.0015743438,0.0017409622],"category_scores_gemma":[0.021128668,0.0006469335,0.0006298165,0.0008417223,0.0014793728,0.0048955185,0.0017350272,0.0014835792,0.00043747845],"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.00012451924,0.0001177346,0.0022637032,0.00008969974,0.000022653985,0.00006890798,0.0005070968,0.9535558,0.0024179951,0.021157425,0.00051144697,0.019162958],"study_design_scores_gemma":[0.000008175879,0.000030090767,0.00014473696,0.0000040288305,0.000006262689,0.000012013226,0.000038118476,0.9938828,0.00069634395,0.0048491033,0.00032289836,0.0000054120287],"about_ca_topic_score_codex":0.008691769,"about_ca_topic_score_gemma":0.003465618,"teacher_disagreement_score":0.008691769,"about_ca_system_score_codex":0.0016791798,"about_ca_system_score_gemma":0.002247935,"threshold_uncertainty_score":0.018970788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020249538,0.045520246,0.7985359,0.0029039239,0.0025937273,0.00047917923,0.00033470994,0.0030731794,0.12630962],"genre_scores_gemma":[0.38525352,0.08436519,0.36550218,0.0007632147,0.0038631067,0.0005297172,0.0010845659,0.00063726364,0.15800117],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993395,0.00008861697,0.000034431927,0.00013828535,0.0003517389,0.00004738329],"domain_scores_gemma":[0.99903274,0.00054481585,0.00003380826,0.00013518895,0.00019803004,0.00005543066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008673622,0.00088534923,0.0012469373,0.00053939095,0.0006779879,0.0021868027,0.0019580147,0.0009586164,0.0065265265],"category_scores_gemma":[0.0027177471,0.00038272858,0.00024713742,0.0017680369,0.00095808954,0.003847285,0.00093689095,0.0014477555,0.0027225737],"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.000113430986,0.00013580003,0.00030484077,0.0009946374,0.000074899115,0.00029610624,0.00056919584,0.03096864,0.0105974,0.3959384,0.057979852,0.5020268],"study_design_scores_gemma":[0.00008677812,0.00019903512,0.0006282441,0.0001995204,0.0000866463,0.0011331679,0.00022172825,0.20926468,0.009334623,0.43955636,0.33920503,0.000084245505],"about_ca_topic_score_codex":0.0007895837,"about_ca_topic_score_gemma":0.0006838917,"teacher_disagreement_score":0.0065265265,"about_ca_system_score_codex":0.0007331008,"about_ca_system_score_gemma":0.0006942046,"threshold_uncertainty_score":0.02183342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027539825,0.00058016507,0.9497746,0.0008538999,0.0004954452,0.0002804508,0.00026373644,0.0035715592,0.016640274],"genre_scores_gemma":[0.66697377,0.0010430227,0.31728664,0.000539003,0.00048086216,0.0003483857,0.0007854782,0.00038210303,0.01216065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944764,0.0001579266,0.00006655,0.000080425125,0.00019965183,0.000047705373],"domain_scores_gemma":[0.99863154,0.00033752606,0.00010523123,0.00051607384,0.00031894215,0.000090648835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008121348,0.00037531208,0.000360077,0.0005771137,0.00056232116,0.0012137948,0.0012001649,0.0009273412,0.0032440987],"category_scores_gemma":[0.0022553382,0.00020780879,0.00026881788,0.0006422452,0.00064746616,0.001307858,0.0017136495,0.0009357798,0.0010205616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005827753,0.00019304435,0.0016187,0.0005035164,0.000100433535,0.0009725895,0.00041430793,0.14158465,0.13664672,0.16894497,0.04584921,0.50258917],"study_design_scores_gemma":[0.00005342766,0.00020189746,0.00070177374,0.000041802723,0.00002788063,0.00045495518,0.00006259952,0.82509494,0.047387637,0.036593903,0.08932038,0.000058961636],"about_ca_topic_score_codex":0.0011872991,"about_ca_topic_score_gemma":0.0011880401,"teacher_disagreement_score":0.0032440987,"about_ca_system_score_codex":0.0005004818,"about_ca_system_score_gemma":0.00058689294,"threshold_uncertainty_score":0.010852575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025776012,0.0006681715,0.9723704,0.00090444053,0.00019803537,0.0005453902,0.0003341667,0.011452656,0.010949169],"genre_scores_gemma":[0.087116644,0.0012641262,0.89451045,0.00047562414,0.00025888422,0.0011395509,0.0013243546,0.001301856,0.012608567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622065,0.0010855274,0.0003312328,0.00059161696,0.0013619765,0.00040903973],"domain_scores_gemma":[0.99636805,0.0009241686,0.00024195385,0.0013738008,0.00055469846,0.00053729187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049606464,0.0010285485,0.0013937345,0.0020749469,0.0044362643,0.006498562,0.00637695,0.0029595247,0.0061312225],"category_scores_gemma":[0.009113236,0.0012407611,0.0012051762,0.002691498,0.0025440243,0.008912702,0.0072998335,0.0028488461,0.003911532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026161395,0.0002237792,0.000988413,0.0006637046,0.00013034554,0.0009374063,0.0013025763,0.035669204,0.005913919,0.64709556,0.09028849,0.21652494],"study_design_scores_gemma":[0.000108567976,0.0001148049,0.00030545695,0.00015981273,0.000072113806,0.00085696083,0.00028995174,0.21986209,0.006548958,0.3175953,0.45391485,0.00017109323],"about_ca_topic_score_codex":0.011153093,"about_ca_topic_score_gemma":0.008960738,"teacher_disagreement_score":0.011153093,"about_ca_system_score_codex":0.0018271209,"about_ca_system_score_gemma":0.003963876,"threshold_uncertainty_score":0.026234686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45057818,0.0010636805,0.5297303,0.000893797,0.00016652836,0.00061904127,0.00044463627,0.011899686,0.0046041077],"genre_scores_gemma":[0.9403977,0.00021721158,0.058232695,0.00006294652,0.00006334312,0.000095790136,0.00026682953,0.00009262233,0.00057082233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945979,0.0016198856,0.0003650815,0.0010336462,0.0020294865,0.00035396958],"domain_scores_gemma":[0.9817393,0.007286932,0.0022230882,0.0051105507,0.002701204,0.000938959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031201656,0.0009835726,0.0010950733,0.0012882885,0.0017324539,0.0023631665,0.002561714,0.0012952627,0.000808674],"category_scores_gemma":[0.017899817,0.0005511884,0.0002962332,0.0019354738,0.0009484158,0.0046811583,0.0030021984,0.0011860434,0.00050040433],"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.0013128956,0.0009606361,0.053511526,0.0007540993,0.0005363668,0.001124474,0.0023978967,0.45763597,0.13937792,0.013156316,0.0077178245,0.32151416],"study_design_scores_gemma":[0.00010249711,0.00046845063,0.012942166,0.000036444144,0.00011884228,0.0004797343,0.00078145316,0.9224817,0.046086904,0.009748199,0.0066727865,0.00008082943],"about_ca_topic_score_codex":0.003189613,"about_ca_topic_score_gemma":0.0029600284,"teacher_disagreement_score":0.003189613,"about_ca_system_score_codex":0.0011407281,"about_ca_system_score_gemma":0.0009357263,"threshold_uncertainty_score":0.016501248},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16228081,0.004811014,0.77623296,0.0017600685,0.00068755297,0.0015897368,0.0006358881,0.013677361,0.038324635],"genre_scores_gemma":[0.7922649,0.002774734,0.194271,0.00021651971,0.00037236055,0.00040489147,0.00062593527,0.0002970864,0.008772633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658644,0.00092022796,0.00015956462,0.00043960023,0.0017132022,0.00018095702],"domain_scores_gemma":[0.9831215,0.008801136,0.00090680615,0.003990948,0.002555008,0.00062468025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004005936,0.0005207706,0.0010064389,0.0006996598,0.0013483647,0.002894475,0.0022869676,0.0010914603,0.0053130114],"category_scores_gemma":[0.015029502,0.00047657537,0.0002479115,0.0019208685,0.0012937918,0.0053980276,0.0012845668,0.00095925375,0.002323461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013424103,0.0014501328,0.008941489,0.0023074076,0.00027061746,0.0011260555,0.000993514,0.1622961,0.11053956,0.13459507,0.044243485,0.531894],"study_design_scores_gemma":[0.00037044028,0.0013618298,0.0031615908,0.00008170285,0.0001904953,0.0014305348,0.000542122,0.7648735,0.050730955,0.07796725,0.0991422,0.00014741575],"about_ca_topic_score_codex":0.0010949554,"about_ca_topic_score_gemma":0.00091008114,"teacher_disagreement_score":0.0053130114,"about_ca_system_score_codex":0.00068481424,"about_ca_system_score_gemma":0.0010085636,"threshold_uncertainty_score":0.021185696},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07509028,0.01944543,0.6076574,0.04119556,0.0022750366,0.00029120618,0.0002192032,0.0008071002,0.25301877],"genre_scores_gemma":[0.79340625,0.009854654,0.12064613,0.0017559143,0.003529134,0.00077466515,0.00028529364,0.0007247268,0.069023296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876671,0.0050649173,0.0005484258,0.0012076143,0.0042883335,0.0012236992],"domain_scores_gemma":[0.96633595,0.022419633,0.0009875932,0.0068778046,0.0023482163,0.001030821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012931704,0.00061311154,0.0014886857,0.0013573453,0.0059225205,0.009807858,0.0036605056,0.0067381123,0.010582425],"category_scores_gemma":[0.038850807,0.0011275155,0.0009879312,0.0029649977,0.010190049,0.03412843,0.010255076,0.007154875,0.0020496089],"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.000037172304,0.00004545863,0.00020041398,0.000073447954,0.000009662689,0.00007556403,0.000719612,0.0022114597,0.00020982404,0.956166,0.0063143703,0.033937007],"study_design_scores_gemma":[0.000007519479,0.000008229881,0.000063034684,0.00003367677,0.000004012454,0.00010292206,0.00023571364,0.006754027,0.00024134184,0.98054606,0.011991613,0.000011771696],"about_ca_topic_score_codex":0.0016378119,"about_ca_topic_score_gemma":0.0008809924,"teacher_disagreement_score":0.012931704,"about_ca_system_score_codex":0.0032207936,"about_ca_system_score_gemma":0.002385806,"threshold_uncertainty_score":0.06839019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30426612,0.0059150457,0.6747392,0.0016097778,0.00020374985,0.0005272887,0.0020630874,0.0038763378,0.0067994357],"genre_scores_gemma":[0.6794465,0.0017581732,0.3101838,0.00017965674,0.00016890779,0.00029971774,0.0033161293,0.0004364995,0.004210681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960598,0.0009818921,0.00035922063,0.00068099546,0.0016987901,0.00021935109],"domain_scores_gemma":[0.991134,0.0058800825,0.0005313909,0.0009367973,0.0009708829,0.0005468555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028941445,0.000658759,0.0019561667,0.0038811236,0.0021543119,0.0039749495,0.002986196,0.0020216943,0.0014815659],"category_scores_gemma":[0.01785562,0.000792367,0.00088913704,0.00585935,0.00089614274,0.008087917,0.0043944432,0.0012605428,0.00050598296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002306027,0.0010164073,0.024441803,0.0020857472,0.0005487333,0.0023730327,0.0051222574,0.21230555,0.030446548,0.12857325,0.025197214,0.5655835],"study_design_scores_gemma":[0.0001690374,0.00014593644,0.0019723738,0.00012055354,0.00013298896,0.0013444033,0.0020513781,0.8213931,0.013710336,0.14004953,0.018832881,0.000077614546],"about_ca_topic_score_codex":0.0040136087,"about_ca_topic_score_gemma":0.005199251,"teacher_disagreement_score":0.0040136087,"about_ca_system_score_codex":0.001067533,"about_ca_system_score_gemma":0.00063384266,"threshold_uncertainty_score":0.015305877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010053331,0.00040991267,0.7818295,0.000379317,0.0002875472,0.00034637662,0.00054127234,0.19851872,0.0076340297],"genre_scores_gemma":[0.2702025,0.00094716676,0.6707378,0.000800823,0.00023069498,0.0009928513,0.00636275,0.022103488,0.02762186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785006,0.0003138765,0.0002508843,0.00029555475,0.0009245089,0.00036517833],"domain_scores_gemma":[0.9959279,0.00063557003,0.00034034016,0.0019359523,0.0006102944,0.00054993137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036410827,0.0010361277,0.0009046308,0.0011933459,0.0010319964,0.0025571866,0.005579396,0.0012544624,0.0085352585],"category_scores_gemma":[0.008182185,0.0011401615,0.0009095957,0.00078001065,0.00079704577,0.0053477664,0.0055827205,0.0024101096,0.0038695876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002575728,0.0007110677,0.0057486896,0.0015106383,0.00043734495,0.0010891331,0.0012953638,0.040335163,0.12731573,0.10156173,0.16772844,0.549691],"study_design_scores_gemma":[0.00051446265,0.00076346245,0.0032567936,0.00021918565,0.00024941834,0.000984402,0.00033637873,0.41291127,0.09898901,0.044618733,0.4367698,0.00038701668],"about_ca_topic_score_codex":0.003874898,"about_ca_topic_score_gemma":0.003987641,"teacher_disagreement_score":0.0085352585,"about_ca_system_score_codex":0.0016517609,"about_ca_system_score_gemma":0.0029957942,"threshold_uncertainty_score":0.028553307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33942726,0.0017178626,0.65082264,0.00037546406,0.000071656046,0.00026373324,0.00017540714,0.0030011933,0.004144758],"genre_scores_gemma":[0.8947409,0.00017877048,0.10290918,0.00006771212,0.000028839822,0.00013754368,0.00015590721,0.000080323756,0.0017008943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908257,0.000341803,0.000057145968,0.00013460235,0.0002784051,0.00010543822],"domain_scores_gemma":[0.9969862,0.0018843428,0.00023422549,0.00029479043,0.00038909592,0.0002113548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021682181,0.00061765226,0.001247382,0.001407504,0.00091149233,0.0012336829,0.002139394,0.00088170316,0.00096638646],"category_scores_gemma":[0.005065953,0.000427336,0.0003291712,0.0011132616,0.0010085227,0.001927285,0.0015843825,0.0003992371,0.00038336468],"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.0011859966,0.00016235374,0.0046374383,0.00028202398,0.00021414286,0.0004335831,0.0007475643,0.7915638,0.019727334,0.026960809,0.0038964192,0.15018845],"study_design_scores_gemma":[0.00008014802,0.00010201769,0.00038165937,0.000008412102,0.000024399375,0.00008400674,0.00008637668,0.9852005,0.0032523707,0.009389651,0.0013737266,0.000016719638],"about_ca_topic_score_codex":0.0042846305,"about_ca_topic_score_gemma":0.0039786403,"teacher_disagreement_score":0.0042846305,"about_ca_system_score_codex":0.0008914784,"about_ca_system_score_gemma":0.0008465818,"threshold_uncertainty_score":0.011466801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008598104,0.0006675834,0.9595045,0.0028694654,0.00016549556,0.0002555776,0.00010113337,0.0036347809,0.024203464],"genre_scores_gemma":[0.22616366,0.00303513,0.73516315,0.00076544983,0.00045787898,0.00027631535,0.00054227974,0.0016530154,0.03194315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965862,0.00070536294,0.00024535836,0.0003750601,0.0017642298,0.00032385852],"domain_scores_gemma":[0.99721956,0.0008474978,0.00022489193,0.00075033423,0.00056196796,0.00039578808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039611617,0.0011216038,0.00065630244,0.0024493507,0.0016940468,0.009484435,0.0034695957,0.0019457001,0.003354349],"category_scores_gemma":[0.0048563275,0.00088359,0.0010632925,0.0025833764,0.002472382,0.008783733,0.0029069064,0.0028331804,0.0015121987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019849298,0.00037082063,0.0019840584,0.0006157403,0.00012857722,0.00063505815,0.00223751,0.025439674,0.02441431,0.6802258,0.01288236,0.25086758],"study_design_scores_gemma":[0.00007522215,0.00019474835,0.0014006379,0.00031054378,0.00036333178,0.0012774986,0.002040742,0.29561904,0.04746723,0.36002097,0.29107377,0.00015625513],"about_ca_topic_score_codex":0.0052143075,"about_ca_topic_score_gemma":0.004209957,"teacher_disagreement_score":0.009484435,"about_ca_system_score_codex":0.0023119354,"about_ca_system_score_gemma":0.0024738102,"threshold_uncertainty_score":0.020948887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072374806,0.0018881824,0.81897104,0.0012008102,0.00070426037,0.0010834197,0.0009461454,0.08639234,0.0164391],"genre_scores_gemma":[0.6995704,0.0013120666,0.27715266,0.00070656993,0.0003141642,0.00044785585,0.001878214,0.0035209444,0.015097154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988481,0.00014514285,0.000100511825,0.00017390322,0.00056567165,0.00016659495],"domain_scores_gemma":[0.99804026,0.00043063922,0.00013240935,0.00076159637,0.00026301574,0.0003720847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015742967,0.00071440445,0.00076748105,0.00082363683,0.0012632549,0.0022183352,0.0031949831,0.00071137,0.003446949],"category_scores_gemma":[0.0034992676,0.000691796,0.00047601853,0.000923588,0.0007181619,0.0033741614,0.0036063676,0.0018543802,0.0012364844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026298005,0.0011495532,0.011676744,0.0015753971,0.0003782363,0.001863398,0.0012822982,0.107930504,0.14082147,0.05636878,0.08291535,0.5914085],"study_design_scores_gemma":[0.00046215556,0.0005217631,0.004398149,0.000089924986,0.00013659378,0.0010845303,0.0005153268,0.7840452,0.057428308,0.027257826,0.123798825,0.00026145432],"about_ca_topic_score_codex":0.0033278419,"about_ca_topic_score_gemma":0.0031073564,"teacher_disagreement_score":0.003446949,"about_ca_system_score_codex":0.0010135015,"about_ca_system_score_gemma":0.0026317004,"threshold_uncertainty_score":0.011531174},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418731,0.000038578855,0.045867164,0.00007895261,0.00005890892,0.00036264246,0.00057697535,0.0045142323,0.0066293245],"genre_scores_gemma":[0.98514104,0.000024923993,0.012346687,0.000041776348,0.0000040469386,0.0001286223,0.00033458552,0.0002558704,0.0017224916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993451,0.00010422906,0.000042787964,0.0001296778,0.0002384576,0.0001396376],"domain_scores_gemma":[0.99813265,0.00068250124,0.00013305456,0.0003072969,0.00057810376,0.00016643484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072279404,0.0007923092,0.00044418982,0.00086512,0.0003480686,0.0005952672,0.0012364944,0.0004983874,0.0021563156],"category_scores_gemma":[0.0021433656,0.00033580072,0.00030116484,0.00044783636,0.0005503427,0.00075897516,0.0004851158,0.0010321415,0.00039171433],"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.0020461578,0.0030184614,0.0440809,0.00045855477,0.00018164114,0.0012624594,0.0013913581,0.59731704,0.25696194,0.008063575,0.010313273,0.07490462],"study_design_scores_gemma":[0.00004085548,0.00047138534,0.006498356,0.000012512959,0.000020543877,0.0001445923,0.0000821159,0.9467686,0.043373127,0.00064088416,0.0019157613,0.00003131283],"about_ca_topic_score_codex":0.005263056,"about_ca_topic_score_gemma":0.004067079,"teacher_disagreement_score":0.005263056,"about_ca_system_score_codex":0.0010629826,"about_ca_system_score_gemma":0.0005060589,"threshold_uncertainty_score":0.010464847},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018842835,0.0005307701,0.92451376,0.0002256498,0.0003441513,0.00023623435,0.0011561948,0.0435083,0.010642071],"genre_scores_gemma":[0.2309749,0.00080806605,0.7393064,0.00024563298,0.0005389795,0.00037251666,0.003679987,0.0023811026,0.021692416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991679,0.0001347752,0.00010384163,0.00013706023,0.00038737248,0.000069098074],"domain_scores_gemma":[0.9972567,0.0007809672,0.00013002112,0.0012864157,0.0003296665,0.0002161777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245721,0.00069973146,0.0016979526,0.0017753452,0.0011854423,0.00260552,0.0031682523,0.0014999155,0.01785556],"category_scores_gemma":[0.0045833616,0.0006869612,0.0006224488,0.0029127572,0.0006924889,0.004323477,0.002992422,0.0011535733,0.0073208967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022879702,0.00042034738,0.0012048921,0.00050077215,0.00017925056,0.00032923382,0.00021501924,0.031180272,0.04064971,0.072089165,0.0905416,0.7604018],"study_design_scores_gemma":[0.0005226787,0.00031583442,0.00061308895,0.000039870625,0.00010737775,0.0006321018,0.00008637562,0.7274758,0.04058095,0.12258544,0.10694904,0.00009142638],"about_ca_topic_score_codex":0.0015262594,"about_ca_topic_score_gemma":0.0012114467,"teacher_disagreement_score":0.01785556,"about_ca_system_score_codex":0.00053697306,"about_ca_system_score_gemma":0.00093370606,"threshold_uncertainty_score":0.059732795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060899,0.00051547756,0.9325157,0.00037933516,0.00008657948,0.00011978396,0.000034282824,0.0005532261,0.004896616],"genre_scores_gemma":[0.91134006,0.0002984315,0.08622627,0.00010709838,0.000047924495,0.00010790892,0.000036983452,0.00004471116,0.0017905626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955064,0.00013617383,0.000013990047,0.00005825791,0.00018190661,0.000059027774],"domain_scores_gemma":[0.9985877,0.00085549615,0.00009622867,0.00012326725,0.0002535416,0.000083804494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008970013,0.00039332782,0.00042442698,0.00047696035,0.00081372785,0.00053359463,0.0010258704,0.00077705126,0.0010273913],"category_scores_gemma":[0.0034551616,0.00014007174,0.00021426396,0.0004030364,0.0008890929,0.0014703318,0.0013459303,0.0009130482,0.00013072503],"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.00024261726,0.00017940799,0.0010324945,0.00015859523,0.00004182376,0.00055826845,0.0005822956,0.7621838,0.033440392,0.07998662,0.0035952602,0.117998414],"study_design_scores_gemma":[0.000009722521,0.000027279031,0.000087882545,0.000006710609,0.0000062355293,0.000050838265,0.0000509794,0.9876615,0.002561338,0.008678351,0.00085109007,0.000008129717],"about_ca_topic_score_codex":0.0059849494,"about_ca_topic_score_gemma":0.0056097866,"teacher_disagreement_score":0.0059849494,"about_ca_system_score_codex":0.0008565077,"about_ca_system_score_gemma":0.0010478861,"threshold_uncertainty_score":0.011900246},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034780428,0.4779009,0.16030547,0.01466972,0.03945505,0.00069442875,0.0053435494,0.0088292565,0.2893237],"genre_scores_gemma":[0.0062890854,0.14273022,0.031122947,0.0010518234,0.003968707,0.00015318753,0.004365287,0.001490292,0.8088284],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881446,0.00007999092,0.000059692964,0.00021117691,0.0007395555,0.00009518489],"domain_scores_gemma":[0.9979995,0.0003675125,0.00004624833,0.0001835185,0.0011247458,0.00027841085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016574939,0.0018871964,0.0026023348,0.0023378204,0.0013249379,0.007772497,0.0023837131,0.0015459859,0.06468017],"category_scores_gemma":[0.002366857,0.0013687628,0.00069322874,0.0084310565,0.0012533003,0.006635978,0.0015581176,0.002734556,0.042810097],"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.00006111557,0.00004144801,0.000087398774,0.00088983064,0.00001982698,0.0000657089,0.00015695694,0.0006265731,0.001616896,0.010631238,0.8086467,0.1771563],"study_design_scores_gemma":[0.000017054568,0.000027978655,0.00029363675,0.00018394695,0.000018600123,0.00025998976,0.00006852977,0.0010591333,0.0007509022,0.0037598107,0.9935448,0.00001561345],"about_ca_topic_score_codex":0.021965543,"about_ca_topic_score_gemma":0.03890227,"teacher_disagreement_score":0.06468017,"about_ca_system_score_codex":0.0033260994,"about_ca_system_score_gemma":0.0056979377,"threshold_uncertainty_score":0.21637666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022566519,0.00006200167,0.99450254,0.000052235147,0.000035695273,0.000098327604,0.000037828348,0.0021603275,0.00079445506],"genre_scores_gemma":[0.05566211,0.0001134394,0.9409554,0.000045429817,0.000043020453,0.00032605758,0.00014872187,0.0002828634,0.0024229526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981007,0.00052221667,0.00015773617,0.00026519076,0.0007705665,0.00018355444],"domain_scores_gemma":[0.9968071,0.0008388742,0.00011912469,0.001300299,0.000798947,0.00013573558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017308177,0.0011110663,0.0013987541,0.0011469278,0.0012240182,0.0021212425,0.0022144841,0.0013747711,0.0072846413],"category_scores_gemma":[0.006532274,0.0007995489,0.00075009983,0.0017637064,0.0009076258,0.0030387032,0.0026509608,0.0018961238,0.0032547584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005104606,0.0002206234,0.00066203345,0.0004250434,0.000116038485,0.00018016685,0.00035869435,0.08501227,0.028415775,0.12359842,0.014704853,0.7457956],"study_design_scores_gemma":[0.0001811303,0.00015043806,0.00024155552,0.00003814408,0.0000776989,0.00025792068,0.00009597883,0.86828166,0.018500172,0.09370425,0.01840619,0.00006481086],"about_ca_topic_score_codex":0.0020261363,"about_ca_topic_score_gemma":0.002710397,"teacher_disagreement_score":0.0072846413,"about_ca_system_score_codex":0.0009748566,"about_ca_system_score_gemma":0.0019494253,"threshold_uncertainty_score":0.024369538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024742616,0.0013437842,0.96458113,0.0003345034,0.00024701678,0.00011144616,0.000049119273,0.0012138144,0.00737662],"genre_scores_gemma":[0.6160914,0.0019379093,0.36095792,0.00015553468,0.0002857975,0.00019781156,0.00014819173,0.00016408901,0.020061294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993387,0.00015083057,0.000039479,0.00017111811,0.00023698517,0.00006290235],"domain_scores_gemma":[0.998961,0.00057778734,0.00006413397,0.00016038532,0.0001690332,0.000067687375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008686321,0.0005601563,0.0013767784,0.0006832148,0.0011820428,0.001433019,0.0024590222,0.0013079036,0.0023898943],"category_scores_gemma":[0.0026658957,0.00047638488,0.00031370646,0.0012258763,0.0007704734,0.0023680078,0.0014954588,0.0008665551,0.0010057315],"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.0006652909,0.00019595554,0.0011760539,0.00044105432,0.00011632102,0.0010125405,0.00055792066,0.51795805,0.043501865,0.103868134,0.011606005,0.3189008],"study_design_scores_gemma":[0.000048702703,0.000116704105,0.00021686133,0.00002213832,0.00004985927,0.00039619324,0.00010437609,0.9448248,0.008032116,0.03610425,0.010040566,0.000043458924],"about_ca_topic_score_codex":0.0015762323,"about_ca_topic_score_gemma":0.0018771528,"teacher_disagreement_score":0.0024590222,"about_ca_system_score_codex":0.00063470803,"about_ca_system_score_gemma":0.0005732501,"threshold_uncertainty_score":0.007995009},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044245835,0.00139346,0.6191538,0.001396324,0.0010892091,0.0017669757,0.001752391,0.25293288,0.07626918],"genre_scores_gemma":[0.42931014,0.0018618152,0.34900537,0.0016393758,0.0009979293,0.0021713674,0.0059030084,0.016197788,0.19291322],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884295,0.00014301704,0.000088809604,0.00020710166,0.00060400635,0.00011404184],"domain_scores_gemma":[0.99823976,0.0005846136,0.00013133856,0.0003883992,0.00031005952,0.0003457325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001596901,0.00075141806,0.00069095194,0.0013559484,0.0014590202,0.0033396438,0.0036438464,0.0013201998,0.015537906],"category_scores_gemma":[0.004274519,0.00071464514,0.00036868785,0.00075282645,0.0012233148,0.0045913914,0.0029854777,0.0025351718,0.0058114403],"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.0071322313,0.0014598862,0.0051308544,0.0020499309,0.0002570136,0.0023751135,0.0040173167,0.011170554,0.20361903,0.082012236,0.15744595,0.52333],"study_design_scores_gemma":[0.0015251891,0.00084858964,0.0024867763,0.00019116908,0.00022155496,0.0013289927,0.000518325,0.15323357,0.10394528,0.019011667,0.7164236,0.0002652179],"about_ca_topic_score_codex":0.0013559504,"about_ca_topic_score_gemma":0.0009518068,"teacher_disagreement_score":0.015537906,"about_ca_system_score_codex":0.00064354023,"about_ca_system_score_gemma":0.00092198513,"threshold_uncertainty_score":0.05197954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86386657,0.0014987687,0.1264489,0.00064994296,0.00030074103,0.00025007842,0.00008689379,0.0017542597,0.005143868],"genre_scores_gemma":[0.9916128,0.00009314592,0.0077049327,0.000070587565,0.00005111389,0.00001971056,0.000019154315,0.000026615739,0.00040197614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.00026423426,0.000071146926,0.000089173154,0.00022330813,0.00014837459],"domain_scores_gemma":[0.9943402,0.0037497452,0.00030467598,0.00026077923,0.00087366754,0.00047088374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019674094,0.00067895907,0.0008038442,0.0006960061,0.00080393656,0.0019392725,0.0012650676,0.00073366304,0.0021957995],"category_scores_gemma":[0.009387942,0.00029338655,0.00018068201,0.0005539456,0.00036115976,0.0012554922,0.00066691806,0.0008877474,0.00030970332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008773952,0.0053805583,0.021012764,0.00060183444,0.0002785681,0.0005941538,0.0017155135,0.1316735,0.13274612,0.012005953,0.005661338,0.6795557],"study_design_scores_gemma":[0.00080033,0.0017644512,0.019397011,0.000056903176,0.00035506827,0.00041682844,0.0007307834,0.9291978,0.032672733,0.012592827,0.0019150332,0.00010015242],"about_ca_topic_score_codex":0.0027535262,"about_ca_topic_score_gemma":0.003261538,"teacher_disagreement_score":0.0027535262,"about_ca_system_score_codex":0.00084789377,"about_ca_system_score_gemma":0.0009840726,"threshold_uncertainty_score":0.010404825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022017097,0.002881202,0.9604942,0.0004526244,0.0006809127,0.00030286837,0.00019363362,0.0036998047,0.029093044],"genre_scores_gemma":[0.13092156,0.005345273,0.75173974,0.00038967098,0.0007994816,0.0006589603,0.0010287941,0.0010345103,0.10808206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.00011370258,0.000025647145,0.00010114741,0.00027597035,0.000042190095],"domain_scores_gemma":[0.9991431,0.00042591733,0.000032295924,0.00023040293,0.00012509612,0.00004314721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073234667,0.0008558999,0.0011983654,0.0007904823,0.0010039083,0.00160619,0.0028153479,0.0014360045,0.017146267],"category_scores_gemma":[0.0022522565,0.00040548565,0.00032174253,0.0017231904,0.0007106548,0.0033655553,0.0012808754,0.0011582981,0.008996616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019695672,0.00012268104,0.000100044104,0.0012146801,0.00008268565,0.00038895835,0.00028958096,0.019510278,0.01888536,0.302597,0.0924111,0.56420076],"study_design_scores_gemma":[0.000072504496,0.00012551068,0.00017405179,0.00013028152,0.00007234425,0.0011582248,0.000118694756,0.21532333,0.020526271,0.3683729,0.3938417,0.00008414873],"about_ca_topic_score_codex":0.0005017328,"about_ca_topic_score_gemma":0.0010612296,"teacher_disagreement_score":0.017146267,"about_ca_system_score_codex":0.000492386,"about_ca_system_score_gemma":0.0004985,"threshold_uncertainty_score":0.057359934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010649586,0.0014003924,0.9480787,0.0012850773,0.0006500609,0.00069820974,0.00034611867,0.0024924753,0.034399454],"genre_scores_gemma":[0.4243184,0.0024034278,0.52319324,0.00083296245,0.00045838635,0.0035269125,0.0017367498,0.0005302785,0.04299967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988613,0.00035726817,0.000084800864,0.00009150326,0.0004942645,0.000110844885],"domain_scores_gemma":[0.9985176,0.00059985765,0.000117543634,0.0002766846,0.0003528359,0.00013561729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010593665,0.0005403509,0.0005286922,0.0009524721,0.0010289267,0.0013969777,0.0017906645,0.0010286802,0.007545377],"category_scores_gemma":[0.0044398014,0.00025479085,0.00036063165,0.0010883745,0.0009772261,0.0023540973,0.001995719,0.0017293049,0.0016771716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047993255,0.00018722085,0.000502871,0.00052784954,0.000084095256,0.0011318742,0.0005616312,0.05056306,0.024571469,0.6742311,0.039925616,0.20723335],"study_design_scores_gemma":[0.00029482454,0.00034052343,0.0004467281,0.00012912849,0.00007853751,0.0014423876,0.00019501148,0.4266336,0.013811867,0.27658504,0.27992404,0.00011833504],"about_ca_topic_score_codex":0.0013943685,"about_ca_topic_score_gemma":0.0017337633,"teacher_disagreement_score":0.007545377,"about_ca_system_score_codex":0.0009663068,"about_ca_system_score_gemma":0.0008537442,"threshold_uncertainty_score":0.025241792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115714386,0.0010217633,0.87370765,0.000399282,0.00012494817,0.00017556039,0.000110348,0.0017889049,0.0069571133],"genre_scores_gemma":[0.67724264,0.00056004385,0.3159211,0.000053170046,0.00006182167,0.000105095925,0.00024680572,0.00019316225,0.0056160535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999041,0.00028876847,0.0000417947,0.00019519831,0.0002282019,0.00020496816],"domain_scores_gemma":[0.9990326,0.00041493616,0.000115469025,0.0001840125,0.00010603625,0.00014699076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009319711,0.0009134697,0.0012235466,0.00084286154,0.0014696592,0.0016288053,0.0019532598,0.0014934366,0.0026915695],"category_scores_gemma":[0.0030874147,0.00095541374,0.00046737125,0.0020783185,0.0009785463,0.0020000031,0.002432797,0.0008014048,0.00077354995],"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.00028064687,0.00008015952,0.0010662028,0.0001360791,0.000030470797,0.0003653455,0.0002844185,0.8471454,0.0055619013,0.027981695,0.0035622413,0.11350549],"study_design_scores_gemma":[0.000021808732,0.00006013263,0.0002120297,0.000012169938,0.000009161119,0.00013454544,0.00013850546,0.9776365,0.0019944482,0.016705096,0.0030646706,0.000011040718],"about_ca_topic_score_codex":0.0038462288,"about_ca_topic_score_gemma":0.0034002527,"teacher_disagreement_score":0.0038462288,"about_ca_system_score_codex":0.002275022,"about_ca_system_score_gemma":0.0011919553,"threshold_uncertainty_score":0.016506493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017122358,0.00057694816,0.9688247,0.00054442586,0.00010627687,0.00017555029,0.00025199467,0.003047889,0.009349877],"genre_scores_gemma":[0.31554917,0.00065900723,0.6758295,0.000120337456,0.00007034601,0.00016100565,0.0013365691,0.00039006962,0.005883875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827206,0.0005571493,0.00012125418,0.0002442134,0.00069898576,0.000106330364],"domain_scores_gemma":[0.9976738,0.00092005066,0.00012227645,0.0008222742,0.0003241291,0.00013754024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022337055,0.00048532858,0.0010862465,0.0030329449,0.0017951372,0.002901542,0.0017556278,0.0008991632,0.0021726824],"category_scores_gemma":[0.0055857548,0.0006668927,0.0009299753,0.005135268,0.00093093724,0.004929193,0.0033267224,0.0010306961,0.0008308403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055600103,0.00037238296,0.002410407,0.0005598549,0.0003096256,0.00050642964,0.0008695416,0.10848301,0.008393573,0.30448723,0.022448642,0.5506034],"study_design_scores_gemma":[0.00006919732,0.000032646934,0.00038178,0.00006390752,0.000081863625,0.00033071593,0.00029818827,0.6630709,0.009346215,0.29514894,0.031122968,0.000052663432],"about_ca_topic_score_codex":0.0049807806,"about_ca_topic_score_gemma":0.007901002,"teacher_disagreement_score":0.0049807806,"about_ca_system_score_codex":0.00088122446,"about_ca_system_score_gemma":0.0013080786,"threshold_uncertainty_score":0.011813045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010739565,0.00037480603,0.98009175,0.00035487578,0.00030779085,0.00034066156,0.00017212366,0.0025099379,0.005108506],"genre_scores_gemma":[0.35248542,0.0004943153,0.6293145,0.00036085534,0.00047166407,0.0006656924,0.0005969499,0.00050282624,0.0151078375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475336,0.0014704044,0.00058175006,0.0007356265,0.0018014534,0.0006573986],"domain_scores_gemma":[0.9818664,0.00641956,0.0009800667,0.007021061,0.0026411354,0.0010717873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072130687,0.0011554555,0.0018858076,0.0023733117,0.0031099294,0.003900682,0.0038874445,0.0019243564,0.008695011],"category_scores_gemma":[0.015210075,0.00078392006,0.000749505,0.0026779159,0.0015941915,0.006866919,0.0051227496,0.0027745995,0.0029454946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025465745,0.0006065023,0.0008211405,0.00056087394,0.000084682295,0.00019008508,0.0007362779,0.033772808,0.031758316,0.3353183,0.01765027,0.5759542],"study_design_scores_gemma":[0.0005095307,0.0007973697,0.00062657276,0.00014322963,0.0002049198,0.00053967244,0.0003227283,0.5900014,0.03967118,0.31667784,0.050289158,0.0002163889],"about_ca_topic_score_codex":0.0015114738,"about_ca_topic_score_gemma":0.0015499863,"teacher_disagreement_score":0.008695011,"about_ca_system_score_codex":0.0020721713,"about_ca_system_score_gemma":0.0027977258,"threshold_uncertainty_score":0.038146794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025379257,0.017365204,0.78867203,0.004565954,0.0005532553,0.00036862446,0.000277277,0.0012376546,0.16158077],"genre_scores_gemma":[0.6487879,0.012092774,0.24321176,0.00027499712,0.00036228847,0.0008287023,0.0007313307,0.00031933846,0.09339087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991523,0.00033348484,0.00008030526,0.000109896246,0.00023327289,0.000090779096],"domain_scores_gemma":[0.9987644,0.0007687,0.00007046645,0.00012815167,0.00018738816,0.00008084553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013308129,0.00086918636,0.0008982397,0.0007233653,0.0010080785,0.003634705,0.0013045688,0.001667371,0.008010428],"category_scores_gemma":[0.0030274924,0.000602103,0.00037852747,0.0010805869,0.001201366,0.0036441528,0.0013781184,0.0010825229,0.002391598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019205583,0.00016257029,0.00063592935,0.00053637044,0.000090284884,0.00048854464,0.001007929,0.11469228,0.0053678956,0.5906703,0.03067442,0.2554814],"study_design_scores_gemma":[0.00010410398,0.00010624445,0.00042596585,0.00012779523,0.00006650117,0.000416913,0.0005542824,0.43519285,0.0024153055,0.4396265,0.12092086,0.000042668198],"about_ca_topic_score_codex":0.0031217278,"about_ca_topic_score_gemma":0.0028014863,"teacher_disagreement_score":0.008010428,"about_ca_system_score_codex":0.000902398,"about_ca_system_score_gemma":0.0009817479,"threshold_uncertainty_score":0.026797533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023058036,0.0049915244,0.98098344,0.0011861089,0.0003545759,0.00013673704,0.00003148229,0.0002790053,0.009731413],"genre_scores_gemma":[0.2392735,0.0069755446,0.739457,0.0006614149,0.0011642879,0.0011163086,0.00014910114,0.0001464073,0.011056495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978428,0.0009922547,0.00013840929,0.00026469375,0.0006776896,0.000084175306],"domain_scores_gemma":[0.99793065,0.0013071281,0.00019045138,0.00022594821,0.00024254255,0.00010322234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019408496,0.0011048717,0.0013362156,0.00079919474,0.0014069927,0.0023534242,0.0020932187,0.002498776,0.004642183],"category_scores_gemma":[0.0047106054,0.0005329217,0.00077331014,0.0011332181,0.0022822958,0.0033660159,0.002066412,0.0030486365,0.0011886882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003837223,0.000050139024,0.00029871715,0.00040887014,0.00008099676,0.00032717225,0.00044215328,0.13540666,0.0027786575,0.8056259,0.0048723007,0.04967003],"study_design_scores_gemma":[0.000060827748,0.00006997913,0.00016245284,0.000109380875,0.000043204305,0.00020347898,0.00012853112,0.49097636,0.0013373288,0.4537897,0.05307531,0.000043477266],"about_ca_topic_score_codex":0.0017780596,"about_ca_topic_score_gemma":0.0018118047,"teacher_disagreement_score":0.004642183,"about_ca_system_score_codex":0.0012989782,"about_ca_system_score_gemma":0.0011820125,"threshold_uncertainty_score":0.015529692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011272691,0.0007073688,0.98123217,0.0006686423,0.00024269517,0.00013686293,0.000034752593,0.0010778153,0.004627022],"genre_scores_gemma":[0.36269686,0.0028639443,0.62299854,0.00034787288,0.0007510927,0.00050017453,0.00022051054,0.00039151037,0.009229496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99813324,0.0005165375,0.00015351373,0.00018529904,0.0008638826,0.000147557],"domain_scores_gemma":[0.9948088,0.0025683737,0.00049482594,0.0012539194,0.0006913465,0.00018261558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028770221,0.0006192334,0.0006023016,0.0005813049,0.0007847055,0.002961139,0.0015189846,0.0013864653,0.003903275],"category_scores_gemma":[0.010316491,0.000652204,0.00046348656,0.0011164278,0.0012551862,0.0044680913,0.0019497325,0.0019482169,0.0019318094],"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.00020075215,0.00023426072,0.0016101933,0.0013338975,0.00015292123,0.0008163156,0.0011147484,0.10463722,0.0811006,0.50181013,0.011945477,0.29504353],"study_design_scores_gemma":[0.00020207015,0.000424869,0.00059840694,0.00008788127,0.00010439583,0.00096680096,0.0002530774,0.48184234,0.04148279,0.3453041,0.12864023,0.000093034076],"about_ca_topic_score_codex":0.00037823187,"about_ca_topic_score_gemma":0.00040439784,"teacher_disagreement_score":0.003903275,"about_ca_system_score_codex":0.0005943964,"about_ca_system_score_gemma":0.0009107271,"threshold_uncertainty_score":0.015215337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103695095,0.00030487703,0.88769233,0.00023924981,0.00007037535,0.0002522975,0.000035938523,0.0012263238,0.006483486],"genre_scores_gemma":[0.7363992,0.00020392945,0.2593731,0.000104830026,0.000060015558,0.00036075077,0.00010176466,0.00012502103,0.0032714321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987079,0.0004817629,0.000055682962,0.00013861239,0.00048057394,0.00013541708],"domain_scores_gemma":[0.9985703,0.000535338,0.0001673075,0.0004309939,0.00021671258,0.00007933721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886937,0.0003066343,0.0003706312,0.0007411459,0.0008105263,0.0007081807,0.0015337389,0.0007744613,0.00093921076],"category_scores_gemma":[0.0030068336,0.00031633466,0.0004932473,0.0004408224,0.0008950867,0.0016904225,0.0017340438,0.0009309181,0.0002753715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012805768,0.0004630075,0.0068424814,0.00051530893,0.00010775852,0.0014942667,0.0031041899,0.116993494,0.12780035,0.38777652,0.005533218,0.34808883],"study_design_scores_gemma":[0.00025911228,0.0012924176,0.0015892576,0.000066043984,0.00013159453,0.0022530698,0.00058477675,0.81480145,0.051004246,0.10141068,0.026472514,0.0001348071],"about_ca_topic_score_codex":0.0007422475,"about_ca_topic_score_gemma":0.00059674523,"teacher_disagreement_score":0.001886937,"about_ca_system_score_codex":0.00041742442,"about_ca_system_score_gemma":0.00049102446,"threshold_uncertainty_score":0.009979188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018386686,0.003313412,0.94463915,0.001538958,0.0005066321,0.00054831366,0.000034676043,0.0019371923,0.029094946],"genre_scores_gemma":[0.39104202,0.004049946,0.58940226,0.0002536969,0.00041576877,0.0005883516,0.00016474919,0.00042930024,0.013653859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598145,0.001908813,0.000172142,0.00033029064,0.0013685663,0.0002386302],"domain_scores_gemma":[0.992751,0.004191087,0.00021926743,0.0015408973,0.00087559334,0.00042204323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042282594,0.0005725905,0.0007223877,0.0007879194,0.0018631845,0.0035063333,0.0022230526,0.0017658352,0.0057447394],"category_scores_gemma":[0.019615617,0.00060280063,0.00042234638,0.00077408465,0.0028202625,0.0071048266,0.004491718,0.0017564078,0.0024547286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020076944,0.0004420225,0.0018699854,0.0013919491,0.00017553438,0.0012676803,0.004308592,0.054639846,0.018223057,0.240254,0.024455525,0.652771],"study_design_scores_gemma":[0.0001533627,0.0004606068,0.0011394898,0.00032016463,0.00011063517,0.0009906166,0.0017973143,0.17559886,0.027286615,0.62355566,0.16845015,0.00013654],"about_ca_topic_score_codex":0.001417732,"about_ca_topic_score_gemma":0.0014947228,"teacher_disagreement_score":0.0057447394,"about_ca_system_score_codex":0.0007148189,"about_ca_system_score_gemma":0.0014737956,"threshold_uncertainty_score":0.022361457},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018023836,0.008958952,0.7764197,0.002162495,0.0018318357,0.00030990774,0.00033877313,0.0033368624,0.20483907],"genre_scores_gemma":[0.05943061,0.02132013,0.5967924,0.00096995087,0.0012075194,0.00055081974,0.00078566547,0.0007674578,0.31817544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989405,0.00011011003,0.00004272816,0.00014047847,0.0007154263,0.000050635517],"domain_scores_gemma":[0.9995877,0.0001726021,0.0000140100055,0.00010461171,0.000095647105,0.000025314537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075111305,0.0010611508,0.0008626624,0.0012814386,0.0012010959,0.003933447,0.0025433153,0.0022248249,0.013000156],"category_scores_gemma":[0.0015340018,0.00055962027,0.0006133234,0.003243422,0.0011317267,0.0045444244,0.0015679215,0.0023958555,0.009359987],"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.000035746834,0.00006264133,0.00006304618,0.0005687478,0.00004434059,0.00040784356,0.00028093168,0.005344823,0.0040836493,0.5942069,0.06365875,0.33124256],"study_design_scores_gemma":[0.000018808742,0.00003496409,0.00009481475,0.00011196247,0.00003808703,0.0012434109,0.00009004549,0.033315305,0.0049849306,0.35867223,0.6013594,0.000036039342],"about_ca_topic_score_codex":0.0019173794,"about_ca_topic_score_gemma":0.0022317455,"teacher_disagreement_score":0.013000156,"about_ca_system_score_codex":0.0011618675,"about_ca_system_score_gemma":0.0011550697,"threshold_uncertainty_score":0.043489873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030006004,0.0002890382,0.95755404,0.00022083838,0.00006801097,0.00024335142,0.00036521378,0.006862491,0.0043911394],"genre_scores_gemma":[0.2429045,0.00049946195,0.74465877,0.000056423753,0.00007571835,0.00024335727,0.0014972475,0.0012465294,0.008817953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816495,0.00037716443,0.00014294559,0.00042636375,0.0007393587,0.00014924842],"domain_scores_gemma":[0.99226224,0.003213291,0.0003227844,0.0031000164,0.0006826322,0.00041896602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019163978,0.00096414937,0.0016415266,0.002727782,0.0021218876,0.003943273,0.0039664293,0.0015712033,0.004412821],"category_scores_gemma":[0.0076599135,0.0008030679,0.0016541169,0.004713526,0.0011156533,0.005168886,0.004743842,0.0015475582,0.0015502076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006071858,0.0005390662,0.0028585212,0.00080611004,0.00032622323,0.0018510981,0.0029606582,0.1085218,0.07052976,0.06603587,0.019404296,0.72555935],"study_design_scores_gemma":[0.00013376055,0.00020438283,0.0021716557,0.00007764217,0.00021871211,0.0013781916,0.0010560459,0.72123545,0.08125713,0.14115104,0.05092838,0.00018769376],"about_ca_topic_score_codex":0.005109253,"about_ca_topic_score_gemma":0.0057992786,"teacher_disagreement_score":0.005109253,"about_ca_system_score_codex":0.0008655257,"about_ca_system_score_gemma":0.0012689112,"threshold_uncertainty_score":0.014762402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36616868,0.0010487083,0.62019163,0.00079406466,0.00008559043,0.0004462773,0.00016123558,0.00044613332,0.010657571],"genre_scores_gemma":[0.9454504,0.00031456875,0.052073315,0.000030057163,0.000023331562,0.00020730366,0.00008372998,0.000043410462,0.0017738651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763775,0.0012826514,0.00012319355,0.0002884913,0.00044289493,0.00022501113],"domain_scores_gemma":[0.98356205,0.014178752,0.00070861686,0.00041775397,0.00086684583,0.0002659591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004395394,0.0013461149,0.0014425829,0.0009020714,0.0008536771,0.0026694923,0.0024697515,0.0022714464,0.0018182244],"category_scores_gemma":[0.017549215,0.0008582269,0.00067239703,0.0011692257,0.0018235563,0.0037080771,0.0012688454,0.0013562236,0.00023412151],"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.000048685466,0.000051641728,0.0005667931,0.000027912181,0.000014845198,0.00003200349,0.000045713045,0.9847247,0.00023256593,0.008573641,0.00013943386,0.005542024],"study_design_scores_gemma":[0.0000045271404,0.000013508881,0.000048212325,0.0000015407696,0.000003902795,0.0000038475205,0.00001388258,0.9959835,0.000086534674,0.0038035281,0.000035158973,0.0000018812736],"about_ca_topic_score_codex":0.012761764,"about_ca_topic_score_gemma":0.008491379,"teacher_disagreement_score":0.012761764,"about_ca_system_score_codex":0.0026873501,"about_ca_system_score_gemma":0.0019829378,"threshold_uncertainty_score":0.025375009},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01814171,0.00035453227,0.9671387,0.0002510936,0.00013719381,0.0003200245,0.000037177997,0.0033806048,0.010239067],"genre_scores_gemma":[0.41158614,0.00040084432,0.5696759,0.00018071552,0.000045651712,0.0006348854,0.00016522802,0.00025988463,0.017050825],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990087,0.0002654444,0.000066330475,0.00021580106,0.00034348568,0.00010024442],"domain_scores_gemma":[0.9989472,0.00023401817,0.00008380133,0.00024833207,0.00041093878,0.00007562318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015034848,0.000425136,0.0004015754,0.00040247603,0.00082073495,0.0012163584,0.0017849801,0.0007133091,0.005110683],"category_scores_gemma":[0.002602632,0.00036054928,0.00031276487,0.0004327375,0.000659071,0.0018303659,0.0010982403,0.0008501144,0.0012917885],"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.00065584487,0.00036461616,0.002974757,0.00064736203,0.00014461139,0.00045526284,0.002334799,0.04699247,0.08834969,0.16928986,0.016567992,0.6712228],"study_design_scores_gemma":[0.00016748371,0.000698647,0.0011149058,0.00010805821,0.00024140162,0.0006724605,0.00048561292,0.6755762,0.12057205,0.04792061,0.15232585,0.00011667611],"about_ca_topic_score_codex":0.001695018,"about_ca_topic_score_gemma":0.0019992446,"teacher_disagreement_score":0.005110683,"about_ca_system_score_codex":0.0005727611,"about_ca_system_score_gemma":0.0015199244,"threshold_uncertainty_score":0.017096937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027983388,0.000124121,0.96668965,0.00034223727,0.000106298634,0.00040319274,0.000056167846,0.0011948325,0.0031001412],"genre_scores_gemma":[0.590567,0.00014923049,0.4035727,0.00016607255,0.00010111876,0.0008212932,0.00010839152,0.00012540082,0.004388792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976519,0.00075556285,0.00018299223,0.0003932162,0.0007970568,0.00021926925],"domain_scores_gemma":[0.99563193,0.0017450991,0.0005179029,0.0010731658,0.0006091328,0.00042270886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037485908,0.00069766596,0.000832246,0.00081801467,0.0022217256,0.001429712,0.002048164,0.0012659047,0.0027884434],"category_scores_gemma":[0.009794118,0.00047303946,0.00063671434,0.0008722633,0.0027495655,0.0035348246,0.0029612854,0.0016815611,0.00039220642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011189001,0.00047377916,0.0015241754,0.00040080954,0.0002208119,0.0009405166,0.0014780974,0.19406539,0.044151954,0.590234,0.008294096,0.1570974],"study_design_scores_gemma":[0.00060805405,0.0005159056,0.00048100893,0.000042460815,0.00015526678,0.0004164151,0.00011794873,0.79111946,0.019721875,0.16408929,0.022591706,0.00014070742],"about_ca_topic_score_codex":0.0029758147,"about_ca_topic_score_gemma":0.002395109,"teacher_disagreement_score":0.0037485908,"about_ca_system_score_codex":0.0013297626,"about_ca_system_score_gemma":0.0029320817,"threshold_uncertainty_score":0.019824684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17878689,0.00063587603,0.8035039,0.00063628634,0.0002650717,0.0003588277,0.00023756406,0.0072469297,0.008328673],"genre_scores_gemma":[0.80942625,0.00018920515,0.184711,0.0001349066,0.00007208666,0.00016642909,0.0003361601,0.00019481094,0.0047691353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784493,0.0006056279,0.00018127213,0.00044706865,0.00069718715,0.00022395821],"domain_scores_gemma":[0.9967186,0.001110498,0.00013256281,0.0012810384,0.0004178315,0.0003394058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024465886,0.0004984798,0.0013394105,0.0007972152,0.0020830184,0.0037635376,0.0035721904,0.0016464886,0.0026435433],"category_scores_gemma":[0.004656321,0.0007450517,0.0005184095,0.0016908483,0.00079992117,0.002867336,0.0035659808,0.0014418638,0.0007087016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004956777,0.0016356015,0.010064191,0.00055540353,0.0005201154,0.003431675,0.003478427,0.28630397,0.097972296,0.11041134,0.027469233,0.45320114],"study_design_scores_gemma":[0.00016915258,0.00016360673,0.00063215784,0.000015679478,0.00008754423,0.0004119086,0.00033863488,0.944896,0.024572533,0.02081033,0.007847025,0.00005535137],"about_ca_topic_score_codex":0.004910119,"about_ca_topic_score_gemma":0.0040522264,"teacher_disagreement_score":0.004910119,"about_ca_system_score_codex":0.00080294424,"about_ca_system_score_gemma":0.0017049155,"threshold_uncertainty_score":0.012938976},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030899182,0.00035974168,0.9592542,0.0003328095,0.00012543095,0.00014490906,0.0001361974,0.0018037967,0.0069436496],"genre_scores_gemma":[0.8438023,0.00016439306,0.14830202,0.00015778949,0.00009777136,0.00015634998,0.00018958299,0.00019732774,0.0069324896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892586,0.00030466833,0.000061794206,0.00022734457,0.00025020234,0.00023013524],"domain_scores_gemma":[0.9968532,0.0019963686,0.00022019297,0.00032392333,0.00040696468,0.00019937905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025399306,0.00066650065,0.0021819056,0.00096652634,0.0010347585,0.0019987929,0.0031926606,0.0012733618,0.00869052],"category_scores_gemma":[0.0053903423,0.0005988374,0.0007010919,0.001531065,0.0009692832,0.0032190704,0.0017160779,0.0013770361,0.0008920205],"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.00024447145,0.00027790465,0.00061827066,0.00008469351,0.00007166681,0.00009675864,0.00007088735,0.8338827,0.0022582158,0.036186263,0.0065425136,0.11966559],"study_design_scores_gemma":[0.000005844214,0.000008422372,0.000030965406,0.000001377316,0.00000316927,0.0000051334905,0.000004040894,0.99358433,0.00018425327,0.006037498,0.00013181582,0.0000031023264],"about_ca_topic_score_codex":0.006026326,"about_ca_topic_score_gemma":0.007320602,"teacher_disagreement_score":0.00869052,"about_ca_system_score_codex":0.0018431864,"about_ca_system_score_gemma":0.0018128201,"threshold_uncertainty_score":0.029072642},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04782333,0.0013600299,0.9359174,0.00064797106,0.0002347664,0.0003122132,0.0001534195,0.0032214758,0.010329457],"genre_scores_gemma":[0.6788987,0.0014722109,0.311342,0.00016708844,0.00013313376,0.00025686968,0.00032526802,0.00018092759,0.007223854],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935275,0.00019483492,0.00004628164,0.00008363579,0.0002573406,0.000065278524],"domain_scores_gemma":[0.9990858,0.00035265778,0.00006227244,0.000208675,0.00014156762,0.00014895335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851477,0.00036193617,0.0004670624,0.000719305,0.001124248,0.0015153274,0.0008753539,0.00082653674,0.0013550455],"category_scores_gemma":[0.003010764,0.00023098986,0.00030668193,0.00065249926,0.0007060139,0.002248706,0.0024589498,0.00078723073,0.00022499633],"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.00060774066,0.00031493045,0.0039088842,0.00075081136,0.00018788113,0.0012922693,0.0033393144,0.15654929,0.07168923,0.2319188,0.021658959,0.5077818],"study_design_scores_gemma":[0.00025420758,0.0003311551,0.0018009633,0.00009277059,0.00012962038,0.00072469295,0.00073831104,0.75102866,0.033458706,0.06846506,0.14287019,0.000105645464],"about_ca_topic_score_codex":0.006062568,"about_ca_topic_score_gemma":0.0052356026,"teacher_disagreement_score":0.006062568,"about_ca_system_score_codex":0.00075871305,"about_ca_system_score_gemma":0.0010573902,"threshold_uncertainty_score":0.012054563},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019102236,0.012366712,0.057036385,0.0133722555,0.08518031,0.009014156,0.032014918,0.07005515,0.7018579],"genre_scores_gemma":[0.029165253,0.009026385,0.017243791,0.0059924577,0.020999057,0.0012255267,0.02045575,0.01100467,0.88488716],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995272,0.00045811132,0.000520797,0.0012796379,0.0018078462,0.000661623],"domain_scores_gemma":[0.9867209,0.0019715342,0.00056249136,0.0047279894,0.001648174,0.004368928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0064467923,0.0046919147,0.0069901026,0.007988932,0.0046912287,0.016612416,0.004538914,0.0054957913,0.76975244],"category_scores_gemma":[0.014612978,0.005125788,0.0028529277,0.012598021,0.005420585,0.012025602,0.009293162,0.007515971,0.7169126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060959824,0.0009642349,0.0038559663,0.004916022,0.00049929356,0.0026501238,0.00050979905,0.0021546825,0.02470047,0.014568154,0.72205466,0.22251698],"study_design_scores_gemma":[0.00020142809,0.000163652,0.0024395965,0.00021657493,0.000051396775,0.0010285018,0.00019641593,0.0022979605,0.0036063446,0.004584222,0.98507166,0.00014216217],"about_ca_topic_score_codex":0.00095942966,"about_ca_topic_score_gemma":0.002799802,"teacher_disagreement_score":0.76975244,"about_ca_system_score_codex":0.002582014,"about_ca_system_score_gemma":0.0026483084,"threshold_uncertainty_score":0.32842016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08807965,0.006509557,0.8562113,0.0018004692,0.0011320558,0.0007998751,0.00024653485,0.003148026,0.042072557],"genre_scores_gemma":[0.81339985,0.0031169085,0.12439629,0.0002947761,0.0007325182,0.0003886094,0.00031929088,0.0005040945,0.05684777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981324,0.00045266523,0.000110073626,0.00029042334,0.0006583402,0.00035606726],"domain_scores_gemma":[0.99512637,0.0028611447,0.00023120391,0.0007066869,0.000720856,0.00035366998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025531761,0.0009340722,0.0022861417,0.0010110977,0.0033686147,0.0033457184,0.0040019164,0.003061294,0.010662617],"category_scores_gemma":[0.0099774925,0.0009024466,0.0006239191,0.0013113037,0.001365474,0.007896907,0.003981773,0.0020409808,0.0021952048],"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.0012945285,0.0005587458,0.002451028,0.0016503892,0.00024586727,0.0022377835,0.0031302148,0.25140744,0.011849172,0.28153107,0.05630997,0.38733384],"study_design_scores_gemma":[0.00016476204,0.00028529344,0.0005954578,0.00011694536,0.0001365618,0.0010123544,0.0010314421,0.66785145,0.0068862494,0.27403632,0.04777885,0.000104415085],"about_ca_topic_score_codex":0.0028036588,"about_ca_topic_score_gemma":0.0028320341,"teacher_disagreement_score":0.010662617,"about_ca_system_score_codex":0.00086710934,"about_ca_system_score_gemma":0.0010491102,"threshold_uncertainty_score":0.035669982},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032386005,0.002699443,0.94400203,0.0022497363,0.00083419017,0.00039893237,0.0002131504,0.0016902536,0.015526327],"genre_scores_gemma":[0.5930781,0.0016170597,0.36739248,0.00034639423,0.0011830688,0.00030668874,0.00029678075,0.00027014915,0.03550933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972308,0.0009751992,0.00016208368,0.00047413848,0.0008811754,0.0002767054],"domain_scores_gemma":[0.9932041,0.0027788626,0.0003667557,0.0022299679,0.00093412166,0.0004860201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039657173,0.000637742,0.0017856193,0.00097319274,0.0023385466,0.003091793,0.003385551,0.0022593322,0.00695502],"category_scores_gemma":[0.01224071,0.0005031166,0.000923386,0.001829373,0.0014703871,0.005739045,0.002445247,0.0032606218,0.0019207663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012813704,0.0005359301,0.0011916085,0.00038154385,0.00019578518,0.00029688337,0.00059906347,0.08092194,0.015952958,0.49273705,0.0428873,0.36301854],"study_design_scores_gemma":[0.00035145177,0.0004856746,0.0008519958,0.00006272136,0.00016045215,0.0005430869,0.0001153608,0.7833983,0.0069510583,0.17568254,0.031247094,0.0001502571],"about_ca_topic_score_codex":0.0015409543,"about_ca_topic_score_gemma":0.0015195735,"teacher_disagreement_score":0.00695502,"about_ca_system_score_codex":0.0019823443,"about_ca_system_score_gemma":0.0016408048,"threshold_uncertainty_score":0.023266912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012295327,0.0014467319,0.95684594,0.00087001035,0.0013197692,0.0003109205,0.00018886646,0.008395246,0.018327232],"genre_scores_gemma":[0.27961132,0.0017948769,0.68224645,0.00055770983,0.0009195598,0.00045414147,0.0011094252,0.00080625736,0.032500308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893326,0.00018461062,0.00007135118,0.00015227002,0.0005273632,0.0001310743],"domain_scores_gemma":[0.9987043,0.00021683241,0.00007891694,0.0004244628,0.00043576656,0.00013967881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014756698,0.00051653216,0.0008134301,0.00091508264,0.001575509,0.0020452286,0.0032471146,0.0013907374,0.0041242465],"category_scores_gemma":[0.0023072998,0.00041062635,0.0004252189,0.0010369172,0.00061653624,0.004310343,0.002481756,0.0016448442,0.0021019562],"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.0005870221,0.00033810388,0.00077475613,0.00049491273,0.00010918214,0.00057237037,0.00054344384,0.037421856,0.06426586,0.22665231,0.085469216,0.58277094],"study_design_scores_gemma":[0.00016484536,0.0003992674,0.00062213675,0.00008432559,0.00017436664,0.0012138272,0.00019860969,0.5905956,0.038941305,0.08448763,0.28292307,0.00019497694],"about_ca_topic_score_codex":0.0023641044,"about_ca_topic_score_gemma":0.0040900656,"teacher_disagreement_score":0.0041242465,"about_ca_system_score_codex":0.000978063,"about_ca_system_score_gemma":0.0013716728,"threshold_uncertainty_score":0.013796985},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1907873,0.0033875823,0.7825088,0.00065274537,0.00045565623,0.00038878832,0.00027691326,0.00439335,0.017148836],"genre_scores_gemma":[0.8247548,0.0005373026,0.1677821,0.00021284774,0.0001042856,0.00014192406,0.000324659,0.00009623791,0.0060458737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992449,0.00019307365,0.0000488885,0.00017787745,0.00024632213,0.00008893291],"domain_scores_gemma":[0.9984711,0.00046531996,0.00021856728,0.0004948293,0.000255138,0.00009498137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096325035,0.0003884203,0.0006974513,0.0005707733,0.0007361069,0.0005140849,0.0016367782,0.0004859452,0.0010441148],"category_scores_gemma":[0.0028513244,0.00022006163,0.00029109267,0.0006482148,0.0003542117,0.0010103784,0.0012707103,0.00049546815,0.00040595673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007247507,0.00033827467,0.0079740565,0.00056419,0.00014936762,0.0009685389,0.0009046581,0.23561256,0.05350886,0.05196274,0.013666846,0.6336252],"study_design_scores_gemma":[0.00007105269,0.00044969507,0.0015363921,0.000022339285,0.0000971983,0.0012823046,0.00018899993,0.9557904,0.014037756,0.00658997,0.019889196,0.00004460991],"about_ca_topic_score_codex":0.002037406,"about_ca_topic_score_gemma":0.0046346365,"teacher_disagreement_score":0.002037406,"about_ca_system_score_codex":0.00037598732,"about_ca_system_score_gemma":0.0006895058,"threshold_uncertainty_score":0.00509423},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010627474,0.000121822384,0.9877445,0.000114357215,0.000043767148,0.00006327257,0.000009374138,0.00021280735,0.0010625735],"genre_scores_gemma":[0.56635284,0.00019469035,0.4282237,0.00016236826,0.00010430519,0.00024724673,0.000054388995,0.00013289612,0.004527565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962417,0.0013240572,0.0002583403,0.00057164097,0.001279892,0.00032444418],"domain_scores_gemma":[0.992078,0.003931404,0.0005608919,0.0016370058,0.0015369229,0.00025565864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004906991,0.0007372156,0.0016013517,0.0009130273,0.0013042805,0.0021976002,0.0039217467,0.0018669368,0.0021267394],"category_scores_gemma":[0.016643861,0.00063048373,0.0006019455,0.0012008116,0.0014546424,0.0034610939,0.0031676043,0.0021708328,0.0005829997],"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.0006502456,0.00023190487,0.00106633,0.0002853198,0.00014794695,0.00015193572,0.00047237249,0.6269634,0.013476558,0.16518599,0.004275457,0.18709257],"study_design_scores_gemma":[0.000023282362,0.00005577739,0.000037437883,0.0000068147924,0.000016899347,0.000038986935,0.000021311902,0.9767278,0.0018032932,0.020609073,0.0006517208,0.0000075453445],"about_ca_topic_score_codex":0.00077934976,"about_ca_topic_score_gemma":0.0012022754,"teacher_disagreement_score":0.004906991,"about_ca_system_score_codex":0.0016333986,"about_ca_system_score_gemma":0.0015740875,"threshold_uncertainty_score":0.025950968},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008540768,0.016886229,0.44683996,0.016625654,0.0036933192,0.00046697588,0.0027560117,0.036809705,0.4673814],"genre_scores_gemma":[0.16448265,0.023592658,0.19080837,0.00631906,0.003922572,0.00076978817,0.012669891,0.005682228,0.5917527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986105,0.00027917413,0.00008785391,0.00019046101,0.0006541032,0.00017787423],"domain_scores_gemma":[0.99816257,0.00040278383,0.00012222547,0.00070001546,0.0002667194,0.00034570048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012111565,0.0013228026,0.0007290832,0.0015095717,0.0019459595,0.0045659402,0.0015134469,0.0037781403,0.05475677],"category_scores_gemma":[0.003957899,0.0007935782,0.0005919402,0.0024802207,0.0014837804,0.010462824,0.00508519,0.002673817,0.048120823],"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.00015319191,0.000114872186,0.00041119152,0.00036175677,0.00002299513,0.00043323624,0.00032116205,0.0012096908,0.0025491742,0.2503364,0.36724213,0.37684423],"study_design_scores_gemma":[0.000029638726,0.000051918858,0.00057468336,0.00016503745,0.00002178938,0.00094284024,0.00015670275,0.008059193,0.003212705,0.17661884,0.8101222,0.000044436343],"about_ca_topic_score_codex":0.001055551,"about_ca_topic_score_gemma":0.0012862405,"teacher_disagreement_score":0.05475677,"about_ca_system_score_codex":0.0007596786,"about_ca_system_score_gemma":0.001191141,"threshold_uncertainty_score":0.18317968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040852617,0.0021312975,0.91432905,0.003428593,0.0010074192,0.00040802773,0.000124821,0.003725733,0.033992536],"genre_scores_gemma":[0.84076625,0.001325133,0.14132546,0.0017457192,0.001097273,0.0006069164,0.00023531255,0.0006717116,0.012226263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923711,0.002278382,0.00075170473,0.0005768403,0.0031287072,0.000893346],"domain_scores_gemma":[0.9784711,0.010648734,0.0022906433,0.0044744103,0.003191068,0.0009240413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013732559,0.00059186795,0.00083256245,0.0012672528,0.0019969512,0.007021387,0.0031645512,0.0021334116,0.0019665847],"category_scores_gemma":[0.0251438,0.0007527497,0.0005991914,0.001284795,0.0027772645,0.005486019,0.0025129032,0.0047741528,0.0009681397],"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.0002558905,0.00037545108,0.0020883891,0.00017018987,0.000062465144,0.00016315415,0.0010320928,0.030640516,0.009997312,0.82625294,0.012539228,0.11642244],"study_design_scores_gemma":[0.00017800498,0.00018315681,0.0023088993,0.00027233528,0.0001844374,0.00041453587,0.0004187039,0.4823918,0.028924253,0.38297415,0.10159484,0.00015487289],"about_ca_topic_score_codex":0.001447426,"about_ca_topic_score_gemma":0.0015200394,"teacher_disagreement_score":0.013732559,"about_ca_system_score_codex":0.0022058233,"about_ca_system_score_gemma":0.00281995,"threshold_uncertainty_score":0.07262552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43191138,0.00078885385,0.5522993,0.00092559913,0.00029531575,0.00023963093,0.00010675238,0.0047347234,0.008698346],"genre_scores_gemma":[0.9067823,0.00010173139,0.091799185,0.00007039004,0.000049761253,0.000078246405,0.00011193111,0.000060499144,0.0009459417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994518,0.00013519845,0.00004510272,0.00011517141,0.00016895134,0.00008373363],"domain_scores_gemma":[0.9984516,0.00038021617,0.00018436664,0.0004321514,0.00036965436,0.00018194139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011008059,0.00048575577,0.0006857889,0.0006030837,0.00093193684,0.0010712903,0.0013673843,0.0006480088,0.0010938117],"category_scores_gemma":[0.0034073198,0.00019606484,0.00021867178,0.00044881695,0.00041424244,0.0017502443,0.0013130434,0.0006453681,0.0003584211],"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.0010156578,0.0009331072,0.013548796,0.00020535948,0.00015467752,0.0004908078,0.0011459906,0.44823855,0.17017055,0.021222321,0.012213738,0.3306605],"study_design_scores_gemma":[0.00006920983,0.00016489044,0.0012021764,0.0000057855914,0.000016794493,0.00008547676,0.00007644461,0.97998023,0.012714364,0.0028885945,0.002779348,0.000016815617],"about_ca_topic_score_codex":0.0015733714,"about_ca_topic_score_gemma":0.00178016,"teacher_disagreement_score":0.0015733714,"about_ca_system_score_codex":0.0006547955,"about_ca_system_score_gemma":0.000715498,"threshold_uncertainty_score":0.005821705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045474827,0.061097477,0.7925838,0.039082635,0.0016645713,0.00018708935,0.0005654142,0.0012690062,0.05807521],"genre_scores_gemma":[0.6939591,0.06122294,0.19082423,0.0035760023,0.01038218,0.0005142589,0.0009483852,0.0010347974,0.037538156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513644,0.0013230185,0.00031524818,0.0013368538,0.0014652512,0.00042336286],"domain_scores_gemma":[0.94541085,0.03999986,0.0018466656,0.006171505,0.0056937556,0.0008773267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007737756,0.0013618338,0.0031071394,0.0034856994,0.0031383901,0.008086839,0.0062634973,0.006074069,0.0110944975],"category_scores_gemma":[0.04541884,0.0017050221,0.0014345291,0.012354066,0.006163005,0.023172358,0.0042377664,0.0045198244,0.0021761556],"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.00011982405,0.0002984536,0.0026927653,0.0006046565,0.00008557071,0.00034176686,0.0004686211,0.03672872,0.0007033729,0.720439,0.036808793,0.2007085],"study_design_scores_gemma":[0.00004475807,0.000025969337,0.0005338518,0.000088034954,0.00003459259,0.0005753815,0.0003736495,0.1358371,0.0008277414,0.84665716,0.014960654,0.000041124793],"about_ca_topic_score_codex":0.0038251756,"about_ca_topic_score_gemma":0.00205451,"teacher_disagreement_score":0.0110944975,"about_ca_system_score_codex":0.00377018,"about_ca_system_score_gemma":0.001318955,"threshold_uncertainty_score":0.04092163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90225524,0.0027217062,0.038472783,0.011128843,0.0005239783,0.00010211835,0.0007840042,0.000994209,0.04301709],"genre_scores_gemma":[0.9897488,0.0005109579,0.0042722207,0.0005407881,0.0002069339,0.000026809452,0.00023204756,0.000112932416,0.0043484857],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985833,0.00022710345,0.00005845808,0.00032915035,0.00056092074,0.00024105603],"domain_scores_gemma":[0.9876385,0.0045718527,0.0015799333,0.0011220679,0.0033127675,0.0017749808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017732396,0.0002519279,0.0006573945,0.0008056152,0.0011593655,0.0026093717,0.0014022266,0.0018046098,0.007776319],"category_scores_gemma":[0.019760694,0.00030971513,0.00026111215,0.0011370016,0.0014681519,0.005361417,0.0011043698,0.0010985689,0.002245955],"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.002494166,0.00063627824,0.14051153,0.0014994073,0.00043923972,0.0026140905,0.0087779565,0.012658902,0.087396584,0.1488261,0.057285987,0.5368597],"study_design_scores_gemma":[0.0005807832,0.0013322079,0.21948658,0.00033568338,0.0006000256,0.0063267504,0.029328793,0.09211739,0.05506014,0.49763304,0.096845545,0.0003530828],"about_ca_topic_score_codex":0.0027387517,"about_ca_topic_score_gemma":0.0026133833,"teacher_disagreement_score":0.007776319,"about_ca_system_score_codex":0.0006716672,"about_ca_system_score_gemma":0.00063603086,"threshold_uncertainty_score":0.026014388},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603781,0.00016820985,0.03618138,0.00011527458,0.000023568404,0.00016860494,0.0002437242,0.0008831951,0.0018379966],"genre_scores_gemma":[0.9830146,0.00003774903,0.015796846,0.000012967977,0.00001898544,0.000057401532,0.0003037071,0.00004849901,0.0007091419],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968388,0.00095666025,0.0001707021,0.0006865931,0.0011306336,0.00021656656],"domain_scores_gemma":[0.9746192,0.014619516,0.0025086352,0.0016791179,0.00351749,0.003056079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002760455,0.00045334257,0.0009046169,0.0030247848,0.0014333772,0.0020979694,0.0019897001,0.001285565,0.0012411217],"category_scores_gemma":[0.0144827245,0.00041199868,0.00036795205,0.0022666706,0.00092864677,0.0034343272,0.0026739254,0.0011092151,0.000503654],"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.009354535,0.00492316,0.44741198,0.0007455781,0.0007583469,0.002158512,0.009878637,0.09998533,0.108336836,0.013431193,0.0046305805,0.29838532],"study_design_scores_gemma":[0.0002050508,0.00096822344,0.06628006,0.000040431496,0.00019690905,0.0005786441,0.0018587284,0.90108484,0.016640538,0.010046619,0.002011238,0.00008864744],"about_ca_topic_score_codex":0.00399552,"about_ca_topic_score_gemma":0.0041196425,"teacher_disagreement_score":0.00399552,"about_ca_system_score_codex":0.00062080944,"about_ca_system_score_gemma":0.00065153267,"threshold_uncertainty_score":0.014598846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1341211,0.004523376,0.84237534,0.0010796993,0.00089420285,0.00022111007,0.00011307842,0.0058224946,0.010849604],"genre_scores_gemma":[0.8872489,0.0012470589,0.10473543,0.00019407515,0.0003371014,0.0000961585,0.00015314297,0.00029329638,0.005694832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993012,0.00015231331,0.00004358455,0.00011762825,0.00027428425,0.00011098088],"domain_scores_gemma":[0.99814355,0.0008998056,0.00009125266,0.00029826633,0.00043616196,0.00013094534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011417555,0.0009608622,0.0010074726,0.0008557282,0.0014358656,0.0018578618,0.0023698988,0.0008964117,0.0026958496],"category_scores_gemma":[0.004908549,0.00042466473,0.00027459417,0.0011973531,0.0006354486,0.0022698909,0.0016596224,0.0016336443,0.0008571375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001218117,0.00053249655,0.0017476832,0.00058361614,0.00016492984,0.0003216965,0.0008625769,0.3017319,0.17395236,0.046272904,0.020204514,0.45240718],"study_design_scores_gemma":[0.00007445193,0.0001928199,0.00033363703,0.000018816876,0.000059068843,0.00015287446,0.00008402536,0.95243204,0.02246262,0.017257731,0.0068969927,0.000035004075],"about_ca_topic_score_codex":0.0019994997,"about_ca_topic_score_gemma":0.0031712865,"teacher_disagreement_score":0.0026958496,"about_ca_system_score_codex":0.0012153815,"about_ca_system_score_gemma":0.00087734207,"threshold_uncertainty_score":0.00901854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03402986,0.0020764496,0.9102462,0.00029367468,0.0005976953,0.000535286,0.0011420832,0.031120975,0.019957794],"genre_scores_gemma":[0.3460102,0.0014726893,0.62055016,0.00022688638,0.00025439516,0.0003441159,0.003263651,0.0014900404,0.0263879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996099,0.00004819573,0.000031304666,0.000082833416,0.00018408883,0.00004361552],"domain_scores_gemma":[0.99927086,0.00013918955,0.000028496026,0.00024186652,0.00018997108,0.0001296197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779035,0.000544087,0.0010877465,0.00068910304,0.0009101948,0.001718662,0.002773274,0.0009646372,0.006901694],"category_scores_gemma":[0.001055372,0.00044363737,0.0003127589,0.001004167,0.0005014844,0.0027919582,0.0018586445,0.0009650532,0.0031741548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029330044,0.00034497675,0.0013543443,0.0017806732,0.00035051815,0.0007257937,0.00069633813,0.038859062,0.16611959,0.091482505,0.07851908,0.6168341],"study_design_scores_gemma":[0.00095523463,0.0011543221,0.001922114,0.00010508339,0.00038448352,0.0025377935,0.00028440158,0.4288212,0.116259046,0.09710232,0.35010865,0.0003653809],"about_ca_topic_score_codex":0.0012142129,"about_ca_topic_score_gemma":0.0013488316,"teacher_disagreement_score":0.006901694,"about_ca_system_score_codex":0.00047695075,"about_ca_system_score_gemma":0.00085092883,"threshold_uncertainty_score":0.023088396},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06669424,0.00022328894,0.9089935,0.00024844773,0.0001360988,0.0007430901,0.000081560385,0.014398304,0.00848153],"genre_scores_gemma":[0.5087194,0.00029929134,0.47574514,0.0001325325,0.0000989462,0.0005965695,0.00045143437,0.0006835634,0.013273036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859756,0.00028805566,0.00010531861,0.00032183572,0.0005455223,0.00014160697],"domain_scores_gemma":[0.99792033,0.00070132216,0.00011170677,0.00058118283,0.00037109156,0.0003144169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013051578,0.0009795565,0.0010632875,0.00089112076,0.0018494001,0.0021628242,0.0026087167,0.001696328,0.0044804187],"category_scores_gemma":[0.00391313,0.0007544452,0.00073761906,0.0009830381,0.00066253985,0.002817521,0.0038054902,0.0013634604,0.002217626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091059203,0.0027507881,0.0067537,0.00078813365,0.00038113393,0.0020808664,0.0025487866,0.19927576,0.107937284,0.02719629,0.016367266,0.63300943],"study_design_scores_gemma":[0.00024315316,0.00043373948,0.001538648,0.00005836243,0.00014912411,0.00042796036,0.00062900136,0.8703172,0.05703209,0.029576216,0.03951191,0.000082682],"about_ca_topic_score_codex":0.001516547,"about_ca_topic_score_gemma":0.0019585215,"teacher_disagreement_score":0.0044804187,"about_ca_system_score_codex":0.00051213044,"about_ca_system_score_gemma":0.00083124737,"threshold_uncertainty_score":0.014988482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12600972,0.00042803987,0.8646534,0.00025453398,0.00012282968,0.00016956395,0.00012077531,0.0028069348,0.005434164],"genre_scores_gemma":[0.80304176,0.00024995845,0.19370873,0.000068938345,0.000070240334,0.00008038484,0.0002275624,0.000116447845,0.0024359077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911207,0.00032144986,0.000046708614,0.00013524391,0.00029710124,0.000087465305],"domain_scores_gemma":[0.9970282,0.0014218147,0.00019122273,0.0006648409,0.0005727403,0.00012116593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016211198,0.00035812464,0.00067773816,0.00093635055,0.0007248244,0.0010870704,0.0012785279,0.000716374,0.0009133249],"category_scores_gemma":[0.0041037723,0.00028445854,0.00028060583,0.00085632724,0.0006888559,0.002087436,0.0010329251,0.0005530184,0.00034400946],"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.00055500434,0.00021882707,0.0039009494,0.00026191134,0.00013283145,0.0008805209,0.00042609026,0.65590376,0.08300565,0.05097127,0.006307872,0.19743544],"study_design_scores_gemma":[0.00003320145,0.00007328115,0.0005930421,0.000006216287,0.000022385539,0.00017805427,0.000055178316,0.9706974,0.009069124,0.015451342,0.0038055086,0.0000152142775],"about_ca_topic_score_codex":0.0013879661,"about_ca_topic_score_gemma":0.0014758974,"teacher_disagreement_score":0.0016211198,"about_ca_system_score_codex":0.00079694745,"about_ca_system_score_gemma":0.00036854815,"threshold_uncertainty_score":0.008573413},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054314053,0.013096611,0.9024747,0.00076748675,0.00068508077,0.00016387226,0.00028359148,0.0017349023,0.0753623],"genre_scores_gemma":[0.13617735,0.016039656,0.6509429,0.0005588468,0.00084629795,0.0004610154,0.0019814256,0.00069892604,0.1922935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999226,0.000115739014,0.000046442263,0.00022448643,0.00032966735,0.0000576243],"domain_scores_gemma":[0.9994117,0.00023951735,0.000024504598,0.00022366113,0.00007945739,0.000021070062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000591325,0.0009455632,0.0015506446,0.0014947669,0.00076469197,0.0022183182,0.0020840177,0.0013360223,0.0135976765],"category_scores_gemma":[0.0021659217,0.0005341766,0.00070307904,0.0043773856,0.0011557599,0.0043487526,0.001821164,0.0013412801,0.006850477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008069746,0.00008329027,0.00020684194,0.0004013213,0.000060975126,0.00010797154,0.00013700759,0.014663323,0.003048816,0.22850017,0.035355974,0.7173536],"study_design_scores_gemma":[0.00004531162,0.00006676402,0.00036128415,0.00010650389,0.00005505204,0.0007508245,0.00009072939,0.11945211,0.0053594834,0.71366346,0.16001152,0.00003693905],"about_ca_topic_score_codex":0.0009547145,"about_ca_topic_score_gemma":0.0010375615,"teacher_disagreement_score":0.0135976765,"about_ca_system_score_codex":0.00085455034,"about_ca_system_score_gemma":0.00072518986,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034527365,0.0030929195,0.9110203,0.0015857433,0.00025287128,0.00015492112,0.0009842644,0.00094265176,0.04743899],"genre_scores_gemma":[0.7848968,0.0056104143,0.16741614,0.0003901191,0.0005654415,0.000521932,0.00083705137,0.00033065368,0.039431438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985642,0.00052365486,0.00006725275,0.00021405723,0.0003605957,0.00027032496],"domain_scores_gemma":[0.9946449,0.0036177938,0.00034248986,0.0005776957,0.00059249165,0.00022466283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013602497,0.0011649044,0.001312967,0.0008370426,0.0009793246,0.002435275,0.0027285833,0.0012847235,0.008213468],"category_scores_gemma":[0.008715264,0.0009328031,0.00046849684,0.0026055574,0.0009267565,0.004973356,0.002420908,0.0019371444,0.001641586],"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.00018842076,0.00009798992,0.00025042356,0.00061588746,0.000055358818,0.00029396053,0.0001429294,0.5447552,0.004329577,0.34052184,0.017911904,0.09083648],"study_design_scores_gemma":[0.000034564495,0.00005209351,0.00010461759,0.000043385226,0.00003242726,0.00018684959,0.00004903856,0.812246,0.0017028814,0.17629993,0.009219528,0.000028648083],"about_ca_topic_score_codex":0.0024208964,"about_ca_topic_score_gemma":0.0031330348,"teacher_disagreement_score":0.008213468,"about_ca_system_score_codex":0.0020974982,"about_ca_system_score_gemma":0.0013489422,"threshold_uncertainty_score":0.027476788},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012561798,0.052617643,0.047494363,0.45711496,0.054176696,0.00020355478,0.0010029953,0.016159745,0.3586682],"genre_scores_gemma":[0.14523344,0.04791246,0.05985346,0.11020417,0.015700543,0.0004000106,0.0019283978,0.011715207,0.6070524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972234,0.0009598121,0.00014989007,0.00041576475,0.0007364688,0.0005147013],"domain_scores_gemma":[0.9952377,0.0006537324,0.0001942641,0.0005574315,0.0011667646,0.0021901524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055801426,0.0008847754,0.00051785656,0.0007256406,0.0053346665,0.014473289,0.0017089467,0.0047451523,0.060454596],"category_scores_gemma":[0.009143777,0.0005040123,0.00062769157,0.0006057777,0.0033690468,0.033538308,0.0063181743,0.00886524,0.025428737],"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.00013706689,0.000058817237,0.0013723647,0.00029910565,0.000012128332,0.00039730858,0.005717328,0.00009497089,0.0014137161,0.12872352,0.73763514,0.124138564],"study_design_scores_gemma":[0.0000075044445,0.000031858246,0.00039038956,0.00024407248,0.0000052192186,0.0002300074,0.0016632485,0.00006729735,0.00035139383,0.009075613,0.9879062,0.000027164411],"about_ca_topic_score_codex":0.006456741,"about_ca_topic_score_gemma":0.0051919287,"teacher_disagreement_score":0.060454596,"about_ca_system_score_codex":0.0014752223,"about_ca_system_score_gemma":0.00413912,"threshold_uncertainty_score":0.20224077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014786354,0.00055119523,0.9867771,0.0005676202,0.00032106656,0.00014468636,0.0004434692,0.0016679246,0.008048326],"genre_scores_gemma":[0.10609602,0.002636726,0.8592115,0.00064092054,0.0005308024,0.00096121035,0.003907952,0.0014559343,0.024559017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99439716,0.0013516055,0.0007804631,0.00092008925,0.0021988323,0.00035190576],"domain_scores_gemma":[0.99426347,0.0013893107,0.0002700096,0.0020051196,0.0018212392,0.00025077147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054883067,0.0012491381,0.0022408275,0.002836515,0.0026948215,0.007996202,0.007168196,0.004869136,0.009705598],"category_scores_gemma":[0.015902197,0.0010186859,0.0016629535,0.005582024,0.0023264394,0.016463488,0.0048406683,0.0033769752,0.0070613604],"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.00010225735,0.00005088742,0.00014423457,0.00027494028,0.00002718171,0.00021115676,0.0004278188,0.026638925,0.0011576226,0.8910264,0.013384909,0.06655364],"study_design_scores_gemma":[0.000053076885,0.000065098924,0.00006758187,0.00019160297,0.00008254892,0.00029334004,0.0001720948,0.1960959,0.0026993693,0.6597657,0.1404392,0.00007432942],"about_ca_topic_score_codex":0.0064270888,"about_ca_topic_score_gemma":0.0064113163,"teacher_disagreement_score":0.009705598,"about_ca_system_score_codex":0.0024623205,"about_ca_system_score_gemma":0.0029655683,"threshold_uncertainty_score":0.032468498},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018099943,0.0272348,0.6570892,0.21058452,0.005654245,0.00018805506,0.00022191544,0.0010939855,0.07983336],"genre_scores_gemma":[0.65473384,0.029396515,0.26800925,0.01593487,0.009085658,0.0006358603,0.00041768045,0.0007924202,0.020993883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9870853,0.006194078,0.00093521626,0.0012386225,0.0039935545,0.00055319123],"domain_scores_gemma":[0.96661323,0.023425547,0.0016524536,0.0037911967,0.0030625719,0.0014549163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025002588,0.0008171269,0.0014588089,0.0023255134,0.0074657938,0.015794083,0.0025311208,0.007046692,0.004053352],"category_scores_gemma":[0.056591246,0.001207023,0.00088229816,0.0053540603,0.018317536,0.050792564,0.006686131,0.0063929353,0.0016150568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021538026,0.000026584503,0.00028140986,0.00011896998,0.00001271146,0.00016432487,0.0016977653,0.0017078206,0.00011974013,0.9624989,0.007853525,0.025496798],"study_design_scores_gemma":[0.000010085224,0.000010761445,0.00007648847,0.000053267555,0.000009190638,0.00012781624,0.00061755546,0.0034183974,0.0001571973,0.95157516,0.04392538,0.000018657718],"about_ca_topic_score_codex":0.0025235636,"about_ca_topic_score_gemma":0.0017619191,"teacher_disagreement_score":0.025002588,"about_ca_system_score_codex":0.0030543285,"about_ca_system_score_gemma":0.003668014,"threshold_uncertainty_score":0.1322279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072836375,0.16816986,0.21494417,0.0023603947,0.010949818,0.0004226165,0.001499788,0.0065943366,0.59433067],"genre_scores_gemma":[0.0064880713,0.13195057,0.12743945,0.0015495433,0.0031369445,0.0004437719,0.0022291592,0.0012893351,0.7254732],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990903,0.000048765654,0.000039545146,0.00010762471,0.00066930393,0.000044464767],"domain_scores_gemma":[0.99900156,0.0003915387,0.000044604538,0.00009901594,0.00035477206,0.00010841927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006564795,0.0018981725,0.0021804795,0.0020689385,0.0008124185,0.0032220662,0.0026334054,0.0015465926,0.07765344],"category_scores_gemma":[0.0015757281,0.000980906,0.0005234617,0.003991696,0.00071389094,0.004544019,0.0014301193,0.0031439818,0.08249995],"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.000033507175,0.00008782753,0.000055981935,0.0009828754,0.000022402717,0.000103389844,0.00012445639,0.002516631,0.0024383164,0.042937323,0.49317843,0.4575189],"study_design_scores_gemma":[0.000008050945,0.000023889654,0.0000968228,0.00018160683,0.000008561854,0.00037646518,0.000020765157,0.0017143743,0.00035113073,0.013614974,0.98358625,0.000017126004],"about_ca_topic_score_codex":0.0010651554,"about_ca_topic_score_gemma":0.0023162134,"teacher_disagreement_score":0.07765344,"about_ca_system_score_codex":0.0008380749,"about_ca_system_score_gemma":0.0014892968,"threshold_uncertainty_score":0.25977665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08084952,0.0014161812,0.8926311,0.0004221131,0.00056644104,0.00031893747,0.00018311023,0.010083739,0.013528827],"genre_scores_gemma":[0.5361914,0.00043713895,0.4459931,0.00016669997,0.00034501203,0.00031392736,0.00029866802,0.0010618436,0.015192064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997623,0.00076379196,0.00014711829,0.00041382055,0.0008018446,0.00025045147],"domain_scores_gemma":[0.99073726,0.003763097,0.00029307324,0.0038881218,0.001034361,0.00028415525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028326658,0.0009876173,0.0020463218,0.0012015558,0.0016663539,0.0027719594,0.0027496675,0.0015238298,0.007029753],"category_scores_gemma":[0.008514892,0.0009317433,0.00075670786,0.0019265566,0.0010286268,0.004115884,0.0023406947,0.0021409316,0.001925226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034762502,0.0007704036,0.0035078677,0.0007291176,0.00024032514,0.0003787054,0.0012774112,0.11262991,0.088610396,0.19893274,0.021512304,0.5679347],"study_design_scores_gemma":[0.00023941483,0.00039273035,0.0008610016,0.00006519738,0.00016726876,0.000399924,0.00018262073,0.8320373,0.060570765,0.0877345,0.017234856,0.00011446504],"about_ca_topic_score_codex":0.0013596424,"about_ca_topic_score_gemma":0.0015627487,"teacher_disagreement_score":0.007029753,"about_ca_system_score_codex":0.0009795588,"about_ca_system_score_gemma":0.0010309755,"threshold_uncertainty_score":0.023516834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048480276,0.00018723914,0.9465429,0.0002997911,0.000036068388,0.00016743464,0.00016804926,0.0013559265,0.002762291],"genre_scores_gemma":[0.6572536,0.00029552638,0.33553526,0.000121431985,0.000053862666,0.0003177299,0.0007294958,0.00021677464,0.0054763216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648935,0.00082346617,0.00037130143,0.0005516327,0.0012806117,0.00048362775],"domain_scores_gemma":[0.99109566,0.0045459773,0.0007956483,0.0023029284,0.00095334265,0.00030652108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033421968,0.00043963923,0.001328677,0.0012895789,0.0014483581,0.0034002347,0.002180769,0.0015852277,0.0031376698],"category_scores_gemma":[0.016051363,0.0006267698,0.000646633,0.002805031,0.0009481681,0.0055303164,0.0029913865,0.0011255956,0.0009358704],"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.00063904363,0.0003605191,0.002148872,0.00031557243,0.00009252708,0.00023348785,0.0005832108,0.4176143,0.015501401,0.2708202,0.0063354615,0.28535536],"study_design_scores_gemma":[0.00006784111,0.000050190858,0.00021710437,0.000008340775,0.000022384362,0.00008642002,0.00006828464,0.8668021,0.005563896,0.12386313,0.003234636,0.000015704281],"about_ca_topic_score_codex":0.002442155,"about_ca_topic_score_gemma":0.001458518,"teacher_disagreement_score":0.0034002347,"about_ca_system_score_codex":0.0019373695,"about_ca_system_score_gemma":0.0024313407,"threshold_uncertainty_score":0.01767546},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060386233,0.0012082551,0.92585784,0.0014998723,0.00030525972,0.00030606074,0.00029271076,0.00043972427,0.009704039],"genre_scores_gemma":[0.91059405,0.0012026106,0.07070117,0.0001675893,0.00025762946,0.00037054232,0.00018889927,0.00015517608,0.016362367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752194,0.0008634416,0.00011609844,0.0003612328,0.00053093303,0.0006063581],"domain_scores_gemma":[0.9908103,0.006819815,0.0005908782,0.00025373226,0.0010705444,0.0004547059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048971237,0.0011446308,0.0020866701,0.0011219046,0.0009931268,0.0032383308,0.004155417,0.0029304118,0.0063042603],"category_scores_gemma":[0.015827019,0.0013648643,0.0011166369,0.0015715993,0.0013603495,0.003388247,0.0015753463,0.0022375388,0.00063296553],"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.00006632854,0.000068370035,0.0002654073,0.000054018965,0.00002008506,0.000042477557,0.00005914423,0.9491364,0.0004368746,0.043468945,0.0009053211,0.005476511],"study_design_scores_gemma":[0.000008771916,0.00000987728,0.000030356634,0.0000032587784,0.0000050961694,0.0000065531917,0.000007908299,0.99334747,0.00005044131,0.006355304,0.00017105509,0.00000389725],"about_ca_topic_score_codex":0.016001074,"about_ca_topic_score_gemma":0.008760133,"teacher_disagreement_score":0.016001074,"about_ca_system_score_codex":0.004543471,"about_ca_system_score_gemma":0.0038714113,"threshold_uncertainty_score":0.032965302},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020704048,0.00021926848,0.9868439,0.00084279705,0.00022547516,0.00031828193,0.00010634707,0.0050397953,0.0043338304],"genre_scores_gemma":[0.13742247,0.0007396012,0.8495878,0.00066235743,0.00036198096,0.0011255455,0.0007397945,0.00078091724,0.008579566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994643,0.0014121545,0.0009786551,0.00059000426,0.0019553888,0.00042085693],"domain_scores_gemma":[0.9950936,0.0017757663,0.00041867277,0.0011557831,0.0008905034,0.00066572824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01390366,0.00081390585,0.0012241277,0.002190313,0.0024897074,0.008590646,0.004940739,0.003703915,0.004363461],"category_scores_gemma":[0.009180204,0.0012732351,0.001669734,0.0014617076,0.002554498,0.0067172092,0.0038397575,0.004348171,0.0021466804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011911492,0.00032729108,0.00077545526,0.00032060154,0.0001331144,0.0009967427,0.00094092736,0.04038568,0.0061660847,0.87180185,0.014383995,0.063649155],"study_design_scores_gemma":[0.00016005998,0.00010452276,0.00024024479,0.00022824734,0.0001490822,0.00066678046,0.0002455783,0.54663306,0.011750866,0.24055625,0.19910717,0.00015809068],"about_ca_topic_score_codex":0.0040075593,"about_ca_topic_score_gemma":0.0027743725,"teacher_disagreement_score":0.01390366,"about_ca_system_score_codex":0.0031150647,"about_ca_system_score_gemma":0.0042064763,"threshold_uncertainty_score":0.073530495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053923274,0.00067387667,0.9808512,0.0009600746,0.00025444492,0.00020666192,0.00041010266,0.0035945252,0.0076569524],"genre_scores_gemma":[0.35569978,0.0042997645,0.6010907,0.001056511,0.0013999032,0.0015967878,0.002452183,0.0011101608,0.031294238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970132,0.00085637515,0.00047994035,0.00041349974,0.0010180997,0.00021888639],"domain_scores_gemma":[0.99567044,0.0014425175,0.00037744356,0.0015199753,0.00064602186,0.00034363515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031834792,0.0006383915,0.0010905728,0.0013888235,0.0016494807,0.008495508,0.0023799662,0.0017206742,0.004477759],"category_scores_gemma":[0.00543999,0.0006629011,0.001100307,0.002241988,0.0029844434,0.010952953,0.0026565276,0.0029045248,0.0026519974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015022831,0.00008582744,0.0007025742,0.00027878143,0.000033482,0.00032531502,0.0010481993,0.020049734,0.0032347676,0.9227186,0.009904915,0.041467633],"study_design_scores_gemma":[0.00010921679,0.00019652948,0.0002782762,0.00013597305,0.00008833905,0.0005614731,0.00036593247,0.18782616,0.0060617668,0.58321446,0.22106908,0.00009280253],"about_ca_topic_score_codex":0.003133988,"about_ca_topic_score_gemma":0.0021782864,"teacher_disagreement_score":0.008495508,"about_ca_system_score_codex":0.0014765109,"about_ca_system_score_gemma":0.003103368,"threshold_uncertainty_score":0.016836047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6339182,0.00055594475,0.3519737,0.00038029393,0.00007939052,0.00022239391,0.0004565795,0.0051683187,0.007245122],"genre_scores_gemma":[0.9142209,0.00012765705,0.083981745,0.00007040197,0.000020035055,0.00006735296,0.0005248466,0.000059771315,0.0009272428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987054,0.00030629148,0.00011772686,0.00014085718,0.00056563236,0.00016403281],"domain_scores_gemma":[0.99561405,0.0017035154,0.00034607534,0.001096752,0.0009935148,0.00024604014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012496754,0.00026672572,0.0005262232,0.0007876968,0.0008278303,0.00094324665,0.0010923372,0.0006220212,0.00088748825],"category_scores_gemma":[0.0045210156,0.00015943736,0.00024998598,0.0011896861,0.0003774592,0.0017868774,0.0012086527,0.00040595152,0.00034248162],"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.0012326527,0.0008241673,0.014611335,0.00049699144,0.00013779044,0.0012814859,0.001421387,0.47278333,0.19216913,0.024221407,0.01145856,0.27936178],"study_design_scores_gemma":[0.000065519765,0.00025189284,0.001676551,0.000011063411,0.000023460205,0.00021264226,0.0002617623,0.967426,0.019352637,0.006050767,0.0046357196,0.00003199451],"about_ca_topic_score_codex":0.0041905213,"about_ca_topic_score_gemma":0.0037494418,"teacher_disagreement_score":0.0041905213,"about_ca_system_score_codex":0.0006170086,"about_ca_system_score_gemma":0.00076330535,"threshold_uncertainty_score":0.008332312},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010325027,0.0036125851,0.928934,0.0017404667,0.0006205582,0.00016803085,0.0037962722,0.02915494,0.021648124],"genre_scores_gemma":[0.105061874,0.0055266223,0.8486315,0.0007832313,0.00028824533,0.00026546262,0.011666562,0.004206133,0.023570402],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992805,0.00007683304,0.00004705838,0.00007860724,0.0004322559,0.00008476626],"domain_scores_gemma":[0.9993673,0.000102429745,0.000026647183,0.00028762632,0.00014648518,0.000069501824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007791218,0.00082551985,0.00063668465,0.0013418096,0.00080817944,0.0039943606,0.0020238708,0.0008834132,0.0065117087],"category_scores_gemma":[0.001544644,0.00093351305,0.0008427817,0.0048083994,0.00073505566,0.0053123944,0.0042341664,0.0019358174,0.0052811787],"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.0004978991,0.00017359857,0.0012235573,0.00060603704,0.0001832231,0.0003899596,0.00070804876,0.037425548,0.0148706045,0.10116287,0.17756796,0.6651907],"study_design_scores_gemma":[0.00009672364,0.00010868709,0.0008994967,0.00018914357,0.00006923116,0.0007066974,0.0005830373,0.26834086,0.035081565,0.3273752,0.36641365,0.00013578258],"about_ca_topic_score_codex":0.0051778704,"about_ca_topic_score_gemma":0.0053860443,"teacher_disagreement_score":0.0065117087,"about_ca_system_score_codex":0.0007689144,"about_ca_system_score_gemma":0.0011457993,"threshold_uncertainty_score":0.021783888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039785956,0.0110405255,0.70694286,0.0016601611,0.0027035517,0.00038994759,0.00747221,0.07417907,0.19163305],"genre_scores_gemma":[0.06687025,0.016392289,0.5311937,0.0010768658,0.00210994,0.00088345027,0.028545756,0.016678901,0.33624896],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884295,0.00014195917,0.00011711548,0.00020420861,0.0005939855,0.000099751385],"domain_scores_gemma":[0.9985989,0.00025804315,0.00006739481,0.000692763,0.00029124232,0.00009169741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093815353,0.0015687975,0.0016144033,0.003461186,0.0013905108,0.006217193,0.0029094536,0.0014603011,0.07757726],"category_scores_gemma":[0.0034870664,0.0010367344,0.00076994643,0.0056265076,0.0009309217,0.0069571603,0.0031532536,0.0018219557,0.064869516],"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.00012918076,0.00005756389,0.00013835303,0.00053265324,0.000025846453,0.00007271971,0.00013217662,0.004832264,0.004294346,0.1129938,0.27387968,0.6029114],"study_design_scores_gemma":[0.000045019777,0.000056846482,0.00022940553,0.00020656807,0.000044253477,0.00044052725,0.00009119745,0.025260938,0.009400641,0.21389797,0.75025576,0.00007088228],"about_ca_topic_score_codex":0.0017225861,"about_ca_topic_score_gemma":0.0016316879,"teacher_disagreement_score":0.07757726,"about_ca_system_score_codex":0.0012994176,"about_ca_system_score_gemma":0.0016040427,"threshold_uncertainty_score":0.25952178},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021090657,0.00043249576,0.96607935,0.0008974041,0.000364502,0.0004883543,0.00030595768,0.0052674073,0.00507385],"genre_scores_gemma":[0.3248875,0.00083848555,0.66453683,0.00044041587,0.0001562039,0.0010466846,0.0010091978,0.0007853714,0.006299359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971527,0.001365654,0.00014525733,0.00019376984,0.00095036277,0.00019220525],"domain_scores_gemma":[0.9917115,0.0039446577,0.00030805767,0.0016192099,0.0017622539,0.0006543416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041400306,0.0007323634,0.0011344813,0.00053435354,0.0009712277,0.0021067506,0.0044741277,0.0023729063,0.00425998],"category_scores_gemma":[0.019157909,0.0009509846,0.00074649265,0.0005260868,0.001010605,0.003243015,0.002924551,0.0028060086,0.002239993],"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.00054991944,0.0002511099,0.0022488756,0.00035387135,0.00018860032,0.00025783572,0.00036241577,0.8692291,0.011261797,0.060817346,0.010339083,0.0441401],"study_design_scores_gemma":[0.000048894504,0.000044148288,0.00004283923,0.000013397235,0.000017352693,0.000031148436,0.000023107717,0.98041016,0.0020292618,0.0133179305,0.0040116403,0.0000101935175],"about_ca_topic_score_codex":0.0032949098,"about_ca_topic_score_gemma":0.002924551,"teacher_disagreement_score":0.0044741277,"about_ca_system_score_codex":0.00084916834,"about_ca_system_score_gemma":0.002144959,"threshold_uncertainty_score":0.021894872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054313842,0.0019176764,0.92182446,0.0008689279,0.00058348716,0.00035788544,0.00027670176,0.002865673,0.016991287],"genre_scores_gemma":[0.6612788,0.0019757212,0.29999143,0.00034824462,0.0009827606,0.00045550184,0.00074587757,0.0007683204,0.033453334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955605,0.0010865252,0.0004379776,0.0006264545,0.0018401268,0.00044836398],"domain_scores_gemma":[0.98402065,0.010406965,0.0005569119,0.0028321363,0.001383044,0.0008002071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065729585,0.00066466327,0.0031295547,0.00181984,0.0027626967,0.006873302,0.0026662035,0.0025367818,0.008650027],"category_scores_gemma":[0.017026113,0.0016211709,0.001030029,0.003978542,0.0021722224,0.009148293,0.003756343,0.002462808,0.0027025896],"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.0011704662,0.00055713195,0.002099103,0.0006076983,0.00013848755,0.00068156316,0.0010727888,0.06344925,0.010088526,0.71551025,0.013045061,0.19157968],"study_design_scores_gemma":[0.00021156161,0.00016856033,0.0004449906,0.000037545815,0.00013002261,0.00041706575,0.00016112173,0.3455825,0.0064896,0.6269432,0.01933804,0.00007583928],"about_ca_topic_score_codex":0.0012225221,"about_ca_topic_score_gemma":0.0012853378,"teacher_disagreement_score":0.008650027,"about_ca_system_score_codex":0.0016746154,"about_ca_system_score_gemma":0.0015627071,"threshold_uncertainty_score":0.034761548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050075177,0.00081109867,0.94061166,0.00036164976,0.000078751735,0.000109533,0.00009394747,0.00043837356,0.0074198036],"genre_scores_gemma":[0.84512836,0.0010290351,0.14630145,0.00010318834,0.00021096141,0.00017956902,0.00008779599,0.00020912892,0.0067505306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980573,0.0008792888,0.000071719514,0.0002151244,0.00044735192,0.00032919634],"domain_scores_gemma":[0.9947476,0.0041685477,0.00019252939,0.00029830626,0.00041559307,0.00017731496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002663004,0.0009792878,0.0024192054,0.0010105574,0.0007841248,0.00200054,0.0022948834,0.001295222,0.0030319055],"category_scores_gemma":[0.012500596,0.0009191157,0.00045380497,0.0021498809,0.001492676,0.0023821453,0.0022102399,0.0011862315,0.00053456315],"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.00035164558,0.00012403773,0.00037971872,0.0001731873,0.00003561748,0.000072072624,0.00014878907,0.8207219,0.0042871176,0.09149675,0.003328802,0.078880206],"study_design_scores_gemma":[0.00001830612,0.000022334909,0.00007176773,0.00000810533,0.000009483351,0.000028707898,0.000019033228,0.97737324,0.0006421253,0.021464065,0.0003347656,0.000008064465],"about_ca_topic_score_codex":0.0029050577,"about_ca_topic_score_gemma":0.001974381,"teacher_disagreement_score":0.0030319055,"about_ca_system_score_codex":0.0024692218,"about_ca_system_score_gemma":0.0012952652,"threshold_uncertainty_score":0.017915606},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6804628,0.0016854821,0.16948678,0.011654196,0.0007018888,0.00047029383,0.00033812638,0.0044690995,0.13073134],"genre_scores_gemma":[0.9245756,0.00058668264,0.059441753,0.0006379631,0.000101696605,0.00006119935,0.00024285926,0.00049194274,0.01386025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851865,0.0004000703,0.000047023488,0.00015253229,0.00057137106,0.00031037012],"domain_scores_gemma":[0.9976004,0.0006362598,0.00014742535,0.0002189587,0.0011125378,0.00028443197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018598328,0.00048578705,0.00030214898,0.0004922067,0.0023956331,0.0046703797,0.0009349448,0.0009535281,0.003585883],"category_scores_gemma":[0.008518167,0.0002835101,0.00012307212,0.0006394339,0.00058611034,0.0052041044,0.0009225963,0.00081997307,0.001217244],"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.001239571,0.00086086045,0.038018934,0.0003594274,0.00006928854,0.0011955397,0.00290604,0.09202955,0.04216072,0.032488838,0.07330971,0.7153616],"study_design_scores_gemma":[0.00036405836,0.0015819164,0.038794484,0.00025526356,0.00035679847,0.00210422,0.017349785,0.48532328,0.09843167,0.027379684,0.32769176,0.0003670465],"about_ca_topic_score_codex":0.03791274,"about_ca_topic_score_gemma":0.048146557,"teacher_disagreement_score":0.03791274,"about_ca_system_score_codex":0.0021455286,"about_ca_system_score_gemma":0.0023680415,"threshold_uncertainty_score":0.07538408},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6307737,0.0034859553,0.34245223,0.0008558268,0.00015578007,0.00012329764,0.0008392784,0.0008234727,0.020490434],"genre_scores_gemma":[0.995411,0.00030892977,0.003245523,0.000017646602,0.000034456785,0.000016450622,0.000062688356,0.000029277557,0.0008740877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939597,0.00014837369,0.000014400106,0.000104126666,0.00016665804,0.00017043881],"domain_scores_gemma":[0.9916121,0.0062681246,0.0003763781,0.000313955,0.0011681174,0.00026133514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010566511,0.0006666734,0.0007280022,0.0012902035,0.00055784814,0.001015168,0.0009961326,0.0006857017,0.002292762],"category_scores_gemma":[0.00684321,0.00031651114,0.00029900568,0.0011309873,0.001152897,0.0013783987,0.0007216453,0.0007510322,0.00021327031],"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.0002685416,0.0000667719,0.0007603652,0.00016100079,0.00003948302,0.0002741206,0.00015947479,0.9377563,0.015152895,0.036531247,0.00154889,0.007280943],"study_design_scores_gemma":[0.0000026139128,0.000024197036,0.00017553201,0.0000049016053,0.0000075323096,0.000040059404,0.000029420744,0.99505484,0.0011986773,0.0033099998,0.00014525757,0.0000069832627],"about_ca_topic_score_codex":0.0060989955,"about_ca_topic_score_gemma":0.0025363283,"teacher_disagreement_score":0.0060989955,"about_ca_system_score_codex":0.0021406852,"about_ca_system_score_gemma":0.0009306685,"threshold_uncertainty_score":0.015531838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95783085,0.0007441719,0.03785306,0.00018131937,0.00004849501,0.0001636766,0.00006661632,0.0004211006,0.0026905779],"genre_scores_gemma":[0.9944846,0.00009195583,0.0051467195,0.000009001934,0.000005797062,0.000019705567,0.000030732743,0.000006983562,0.00020450771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914885,0.00030365252,0.000082076105,0.000086376305,0.00026045376,0.000118565644],"domain_scores_gemma":[0.9931252,0.0045920587,0.0005532649,0.0004208827,0.00086781604,0.00044082475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448141,0.00075488206,0.0007184552,0.0009845452,0.0005823619,0.0006741719,0.00077083585,0.00060627214,0.0012244857],"category_scores_gemma":[0.0060687605,0.00018408535,0.00030285385,0.00062570587,0.00043584386,0.0007764254,0.0008412395,0.0004681096,0.00013125413],"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.0021204997,0.0006512758,0.0093316175,0.00036743292,0.0002236908,0.0006116038,0.0003291603,0.78253233,0.069856174,0.0028722966,0.0014629284,0.12964104],"study_design_scores_gemma":[0.000030095396,0.0010561104,0.0014995232,0.00000719073,0.000032204738,0.00013466743,0.00010549311,0.9862183,0.010349627,0.00034804878,0.00020017642,0.000018568451],"about_ca_topic_score_codex":0.0025389497,"about_ca_topic_score_gemma":0.0011914042,"teacher_disagreement_score":0.0025389497,"about_ca_system_score_codex":0.00077849434,"about_ca_system_score_gemma":0.00036125412,"threshold_uncertainty_score":0.007658601},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14662726,0.000114352086,0.8384718,0.0007356453,0.00005347265,0.00053896895,0.00027794912,0.009008215,0.0041723815],"genre_scores_gemma":[0.691721,0.00012534313,0.3034783,0.00021336884,0.000056381712,0.00030389617,0.00089828455,0.0003029482,0.0029004158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99592906,0.0010539896,0.00046026125,0.00073353155,0.0015256426,0.00029746786],"domain_scores_gemma":[0.9957087,0.0015837484,0.00026597158,0.0013055612,0.00075766526,0.00037832733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006425852,0.00047926544,0.0011554247,0.00096298795,0.0021633182,0.003077976,0.0029417523,0.0012643178,0.0019283309],"category_scores_gemma":[0.005671363,0.0005875052,0.00061634125,0.0014021305,0.0011138757,0.0054441835,0.0029981278,0.0010227165,0.0007012195],"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.0028993464,0.0026248125,0.011082376,0.0004506967,0.0004165722,0.0028007654,0.003073608,0.4641165,0.125045,0.106208846,0.016897302,0.26438412],"study_design_scores_gemma":[0.00016164694,0.00010086698,0.00043805884,0.000008582609,0.000041686704,0.00013718406,0.0003661908,0.956363,0.019386688,0.018338287,0.004618822,0.000038906306],"about_ca_topic_score_codex":0.0049939468,"about_ca_topic_score_gemma":0.0042146454,"teacher_disagreement_score":0.006425852,"about_ca_system_score_codex":0.0014112559,"about_ca_system_score_gemma":0.0029708263,"threshold_uncertainty_score":0.03398359},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77675104,0.0015116852,0.207292,0.0023923728,0.00003436125,0.000043685195,0.00045920289,0.00015211728,0.011363575],"genre_scores_gemma":[0.978567,0.0006293596,0.019456152,0.00004548242,0.00002137373,0.000025132107,0.00014608272,0.000026947184,0.0010825696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99961746,0.00015808936,0.000013889267,0.000094725474,0.00007981996,0.0000359537],"domain_scores_gemma":[0.9961844,0.002142155,0.00066975487,0.00032835745,0.0004923399,0.00018293125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010106936,0.00022669467,0.00025446166,0.00232635,0.00059551717,0.0015336265,0.0005346358,0.00055275066,0.0013292859],"category_scores_gemma":[0.007496937,0.0002099111,0.00028445205,0.0017834719,0.0010743196,0.003086229,0.00073863653,0.0005856103,0.00012444149],"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.00010268899,0.000060045917,0.080110624,0.00017799792,0.0001606205,0.00066261395,0.0030019297,0.45208445,0.008390469,0.35432598,0.0027366618,0.09818588],"study_design_scores_gemma":[0.000006877355,0.000028186614,0.042294975,0.000043289005,0.000042673426,0.00023690044,0.0008154454,0.74133146,0.0014544126,0.20494361,0.008760609,0.000041579566],"about_ca_topic_score_codex":0.007015704,"about_ca_topic_score_gemma":0.0036472257,"teacher_disagreement_score":0.007015704,"about_ca_system_score_codex":0.001452199,"about_ca_system_score_gemma":0.00032872809,"threshold_uncertainty_score":0.013949752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18559387,0.0005968157,0.8060484,0.0005421568,0.00017030664,0.00038693452,0.0000916454,0.0025342952,0.0040354473],"genre_scores_gemma":[0.9568109,0.00011809673,0.04188378,0.00010145885,0.00002474021,0.00013245454,0.00007092818,0.000032486914,0.0008251383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00018255599,0.00007194841,0.00010271859,0.00026839777,0.00006068974],"domain_scores_gemma":[0.9977458,0.0010163193,0.00024289804,0.00022845378,0.00064792513,0.000118605174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012701373,0.00044337905,0.00046859155,0.0005721879,0.00067795365,0.00069108827,0.00124409,0.00061550504,0.00075562415],"category_scores_gemma":[0.0034789976,0.00018154546,0.0002416672,0.0003497632,0.000512139,0.00086243934,0.00094569253,0.000709711,0.00012277406],"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.0008460948,0.0005320297,0.005834695,0.0003240193,0.00021213682,0.00090879784,0.00095298566,0.563771,0.12406268,0.028500058,0.0055624447,0.268493],"study_design_scores_gemma":[0.00002609229,0.00009400246,0.00043072834,0.0000067694805,0.000017373308,0.00009339696,0.000052849162,0.984774,0.010943654,0.0021457653,0.0013910647,0.000024346193],"about_ca_topic_score_codex":0.0018861269,"about_ca_topic_score_gemma":0.0016641096,"teacher_disagreement_score":0.0018861269,"about_ca_system_score_codex":0.0005744726,"about_ca_system_score_gemma":0.00059130276,"threshold_uncertainty_score":0.0067171454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29994774,0.00048420514,0.6735615,0.00031084774,0.000152606,0.00016537237,0.00015850014,0.018726632,0.006492525],"genre_scores_gemma":[0.9699407,0.00006288656,0.028064461,0.000054997505,0.000025847608,0.000031306347,0.00009834238,0.000035524165,0.0016858086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951077,0.000089406574,0.00004083147,0.00012944461,0.00015927883,0.00007015595],"domain_scores_gemma":[0.9995621,0.000057894966,0.00007278843,0.00010236699,0.00013562768,0.00006928479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036872283,0.00031909253,0.000516978,0.00057839154,0.00048823952,0.0006775067,0.00086588203,0.00034311952,0.00085312006],"category_scores_gemma":[0.000738163,0.00013492198,0.00019829685,0.00031822154,0.00027812374,0.00069995667,0.00076093525,0.000254625,0.00033185488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013528732,0.00041502574,0.032338455,0.0004633595,0.0001412043,0.0017893949,0.0016151243,0.07893631,0.3894284,0.010065356,0.007885157,0.47556925],"study_design_scores_gemma":[0.0001330137,0.00066142075,0.0104165515,0.000027945312,0.00011221522,0.0011829317,0.00046000956,0.84195036,0.11531947,0.0021260944,0.027536662,0.00007330563],"about_ca_topic_score_codex":0.0022373525,"about_ca_topic_score_gemma":0.0013735788,"teacher_disagreement_score":0.0022373525,"about_ca_system_score_codex":0.0005125319,"about_ca_system_score_gemma":0.00042422535,"threshold_uncertainty_score":0.004448712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019296544,0.000496067,0.97495085,0.0004958626,0.0000396598,0.0003665245,0.00013338849,0.0016533486,0.0025677187],"genre_scores_gemma":[0.42090493,0.00044607508,0.57554,0.00012661764,0.00007841231,0.00052555196,0.000564839,0.00013922561,0.0016744016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973671,0.0010095797,0.00020296477,0.0003378769,0.00088720553,0.00019535671],"domain_scores_gemma":[0.9973273,0.0016646439,0.00018657933,0.00031543704,0.0003770099,0.0001290935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034550352,0.00058830733,0.0011844536,0.0010189683,0.0013216496,0.0018988268,0.0016278318,0.00099892,0.0026649488],"category_scores_gemma":[0.007599153,0.00047682438,0.0003967877,0.001169644,0.0008845292,0.0025642836,0.0017407574,0.001080257,0.00072759925],"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.0011959504,0.00070830184,0.002806109,0.0009055803,0.00016008163,0.0010484873,0.0018735494,0.39867795,0.06577439,0.12411868,0.022744738,0.3799862],"study_design_scores_gemma":[0.00013331544,0.00021220894,0.00042786065,0.000030515845,0.000042232477,0.00021952389,0.00035321506,0.957072,0.007627212,0.024827171,0.0090186,0.00003610999],"about_ca_topic_score_codex":0.003487114,"about_ca_topic_score_gemma":0.003564575,"teacher_disagreement_score":0.003487114,"about_ca_system_score_codex":0.0008898036,"about_ca_system_score_gemma":0.0020302797,"threshold_uncertainty_score":0.018272161},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088200555,0.015896015,0.015482256,0.03214348,0.89101595,0.0005500204,0.001241057,0.0006049623,0.042184263],"genre_scores_gemma":[0.006808006,0.023705224,0.009210568,0.009484129,0.7087813,0.0008190392,0.0045543183,0.0011053808,0.23553206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987374,0.00019850406,0.00014663738,0.00024508333,0.0005723438,0.00009998016],"domain_scores_gemma":[0.9908358,0.0023581006,0.00047759598,0.0005169232,0.004404105,0.001407557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023062846,0.0018276123,0.0021110263,0.0032196473,0.0016356193,0.004598089,0.0018841991,0.0024962635,0.10100819],"category_scores_gemma":[0.007803408,0.00053395616,0.0016805906,0.0020720055,0.00061762694,0.0036416156,0.00163491,0.0054651834,0.054333568],"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.00003357693,0.000052486725,0.00010422078,0.00034523354,0.000020663549,0.00008927185,0.00004722339,0.00015317973,0.00047249114,0.0025018414,0.9691942,0.026985608],"study_design_scores_gemma":[0.000017107412,0.00007804477,0.00060015684,0.0001872136,0.00002979119,0.00022155207,0.00004898592,0.000498394,0.00019781016,0.0035498536,0.99455535,0.000015702088],"about_ca_topic_score_codex":0.0008422642,"about_ca_topic_score_gemma":0.0011718515,"teacher_disagreement_score":0.10100819,"about_ca_system_score_codex":0.0013465534,"about_ca_system_score_gemma":0.0016862866,"threshold_uncertainty_score":0.33790606},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022272805,0.004528661,0.9078597,0.0021316998,0.0014803759,0.00015414224,0.00013601825,0.010884979,0.050551612],"genre_scores_gemma":[0.41729635,0.004510927,0.41898167,0.0007368874,0.0009769534,0.00019908533,0.0006032774,0.0024515735,0.15424338],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994318,0.000099806566,0.000028729492,0.00006716819,0.00030279942,0.00006964559],"domain_scores_gemma":[0.9993286,0.00017564504,0.00004265566,0.00030869173,0.00008427179,0.00006016812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075538224,0.00072997896,0.00054506696,0.00050076004,0.0009158969,0.0017074724,0.0014439498,0.0011363638,0.009474729],"category_scores_gemma":[0.0016367394,0.0006434685,0.00028987383,0.0006393142,0.0007268244,0.004149787,0.0021483921,0.0022368566,0.00432053],"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.00062788755,0.00015556988,0.00041445423,0.0003280938,0.000081679354,0.00034297863,0.00067076244,0.02238784,0.028894765,0.22476725,0.09314273,0.628186],"study_design_scores_gemma":[0.00016612383,0.0004285536,0.00047735032,0.00015623149,0.00014145703,0.00129947,0.00023726479,0.31156358,0.059527133,0.258556,0.36730343,0.000143404],"about_ca_topic_score_codex":0.0004389558,"about_ca_topic_score_gemma":0.0008310687,"teacher_disagreement_score":0.009474729,"about_ca_system_score_codex":0.0004324466,"about_ca_system_score_gemma":0.0004684,"threshold_uncertainty_score":0.03169614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0202553,0.00085113326,0.97368276,0.0013360925,0.0002996666,0.00018420383,0.00007104793,0.0013985565,0.0019211769],"genre_scores_gemma":[0.6012873,0.0006670944,0.39074686,0.00051253935,0.00029445376,0.00024754004,0.00027033975,0.00037275054,0.005601068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414575,0.0023750341,0.0004430959,0.0011273964,0.0015707047,0.00033797548],"domain_scores_gemma":[0.9777076,0.013739032,0.001032085,0.004747095,0.0018611781,0.00091296015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009061599,0.00128948,0.0036589494,0.0022737766,0.004914781,0.0036360906,0.005158008,0.0045319498,0.0042490293],"category_scores_gemma":[0.050911963,0.001459617,0.0015424349,0.001665311,0.0035067997,0.01220401,0.00612929,0.004375003,0.0008607608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009857551,0.00028988847,0.0035974358,0.0005690855,0.0005410159,0.00077322946,0.0014515436,0.5282292,0.0048516383,0.14899386,0.011549942,0.29816747],"study_design_scores_gemma":[0.000046446687,0.00011758506,0.00020518916,0.00003614713,0.0000713267,0.0001496736,0.00015520104,0.9043712,0.0016910778,0.09064259,0.0024628807,0.000050650513],"about_ca_topic_score_codex":0.007801536,"about_ca_topic_score_gemma":0.011327908,"teacher_disagreement_score":0.009061599,"about_ca_system_score_codex":0.0015590294,"about_ca_system_score_gemma":0.0021432636,"threshold_uncertainty_score":0.04792291},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076821176,0.00029395925,0.985002,0.0002408168,0.00012622222,0.0001411063,0.00015627014,0.0026478015,0.003709652],"genre_scores_gemma":[0.25109634,0.00068196404,0.7375746,0.00024703966,0.00016464268,0.00025076297,0.0011342202,0.0007494293,0.008101092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667275,0.0008192719,0.00021343144,0.000343723,0.001674812,0.00027605463],"domain_scores_gemma":[0.9960079,0.0009539473,0.00011762663,0.0020922981,0.0006930729,0.00013515637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031687145,0.000679566,0.0014644356,0.0008173803,0.0012332422,0.003098786,0.0035374004,0.0021625268,0.0033289175],"category_scores_gemma":[0.006639244,0.0006134576,0.0008695679,0.0015988583,0.0018525363,0.008009356,0.007098754,0.0027452088,0.0022708036],"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.0007473056,0.00039504818,0.00077430444,0.0009940218,0.00014488988,0.0006236449,0.0013100307,0.06983546,0.05688775,0.5860405,0.018542282,0.2637047],"study_design_scores_gemma":[0.000080433645,0.00011098678,0.0002673922,0.00009593242,0.000093061615,0.000696308,0.00031066083,0.49007213,0.04394004,0.4078986,0.05634207,0.00009237509],"about_ca_topic_score_codex":0.0010731887,"about_ca_topic_score_gemma":0.0012328053,"teacher_disagreement_score":0.0035374004,"about_ca_system_score_codex":0.0009793973,"about_ca_system_score_gemma":0.0012499302,"threshold_uncertainty_score":0.016757965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16548128,0.0022948373,0.81126076,0.0023953686,0.00019450109,0.0004847893,0.00021931334,0.0009068712,0.016762262],"genre_scores_gemma":[0.9198647,0.0007095798,0.07363806,0.00007688593,0.00012636009,0.0002474013,0.00014310994,0.000047460246,0.005146438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673164,0.0015984108,0.00014643949,0.00041267497,0.00082513,0.0002857992],"domain_scores_gemma":[0.990484,0.0055258083,0.000982603,0.0009819182,0.0012166962,0.0008090252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030450139,0.00042354892,0.00082441146,0.0010080285,0.0026728816,0.0022995127,0.0018355716,0.0022136811,0.0018506912],"category_scores_gemma":[0.0190343,0.00047316466,0.00048033177,0.0012324865,0.0021727206,0.0043095537,0.0027362106,0.0011355327,0.00065478834],"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.00066622905,0.000316761,0.008464587,0.00061901205,0.0001588448,0.0018620469,0.0033578144,0.4480852,0.009398039,0.3453724,0.010949748,0.17074934],"study_design_scores_gemma":[0.000115378476,0.00014995127,0.0013205237,0.000052453386,0.000053596134,0.00046807295,0.00044496686,0.79882556,0.002354464,0.18572673,0.010433389,0.000054856457],"about_ca_topic_score_codex":0.0047689807,"about_ca_topic_score_gemma":0.0031847537,"teacher_disagreement_score":0.0047689807,"about_ca_system_score_codex":0.0016644591,"about_ca_system_score_gemma":0.0012741819,"threshold_uncertainty_score":0.016103745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06659131,0.00038252916,0.92330277,0.0007553217,0.00017801468,0.00026067655,0.00022083704,0.0026270265,0.0056815906],"genre_scores_gemma":[0.71283895,0.00050821714,0.2815751,0.00009009323,0.00010044311,0.00019261798,0.00042623578,0.00014993294,0.004118385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986999,0.00042065998,0.00014610325,0.0002261942,0.00039789284,0.000109255154],"domain_scores_gemma":[0.9958865,0.0013414298,0.00035646037,0.0013051779,0.0006894584,0.00042099226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030823601,0.00021805195,0.0007320648,0.0011584052,0.0018972091,0.0027299256,0.0013094665,0.0008169389,0.0014739017],"category_scores_gemma":[0.008346546,0.00033388872,0.00049320667,0.001366833,0.0009099321,0.004023183,0.0031443092,0.000968391,0.0004549027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010998666,0.00046451716,0.0073247,0.00037696757,0.00014712183,0.0012903797,0.0020830985,0.076900445,0.03787945,0.60103625,0.014209265,0.25718805],"study_design_scores_gemma":[0.00013505247,0.00032861804,0.0015340844,0.00005375542,0.0001847544,0.000715305,0.00064038613,0.7941069,0.020338412,0.12660691,0.055255882,0.00009994909],"about_ca_topic_score_codex":0.0025918966,"about_ca_topic_score_gemma":0.003099952,"teacher_disagreement_score":0.0030823601,"about_ca_system_score_codex":0.00084948394,"about_ca_system_score_gemma":0.0021499638,"threshold_uncertainty_score":0.016301274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744217,0.00047538267,0.02211008,0.000289372,0.000030090285,0.00005263512,0.00045914378,0.0005166649,0.0016449583],"genre_scores_gemma":[0.99352574,0.00016991684,0.0054842685,0.00002153651,0.000012187374,0.000019349147,0.00034622662,0.000048744336,0.00037211616],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855727,0.00042539957,0.00007104064,0.0003017219,0.0004725064,0.00017203932],"domain_scores_gemma":[0.99473697,0.0023554603,0.000653124,0.0009016723,0.0010319934,0.0003207172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012606586,0.00029281285,0.0006257077,0.0022265774,0.00075635716,0.0011126428,0.00084934925,0.0007239332,0.0004603511],"category_scores_gemma":[0.01171261,0.00034550758,0.0002828705,0.0013466098,0.0008339158,0.0023387915,0.0013000439,0.000676465,0.00027699326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015636976,0.0007556721,0.42311504,0.00083348504,0.0004384355,0.0046673976,0.013878475,0.14828816,0.10490935,0.043869253,0.0120943235,0.24558674],"study_design_scores_gemma":[0.00006108422,0.0003142507,0.15246598,0.000098302764,0.00010972323,0.002309842,0.003984557,0.77709264,0.026462631,0.025616495,0.011359615,0.00012488209],"about_ca_topic_score_codex":0.0035199127,"about_ca_topic_score_gemma":0.0026924736,"teacher_disagreement_score":0.0035199127,"about_ca_system_score_codex":0.00060264586,"about_ca_system_score_gemma":0.00051352725,"threshold_uncertainty_score":0.0069988966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04204181,0.0009788142,0.94828653,0.0008989989,0.0001445352,0.0001712856,0.000037494527,0.0008819529,0.006558573],"genre_scores_gemma":[0.7633779,0.0008205886,0.22774911,0.00018273192,0.00016370256,0.00033730586,0.0001356729,0.00008966149,0.007143251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976394,0.0011000746,0.0002150731,0.00035687044,0.0004536865,0.00023497584],"domain_scores_gemma":[0.9968315,0.0012365186,0.00038087147,0.0007190617,0.0004932647,0.00033884973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033901606,0.0006712119,0.0008852822,0.00063894014,0.001723421,0.0032712764,0.002429425,0.0017988571,0.002691965],"category_scores_gemma":[0.0044180825,0.00067410956,0.00061608106,0.0008905979,0.0022499743,0.005608342,0.0032253175,0.0014374739,0.00056263135],"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.00029469072,0.00020580243,0.00091435696,0.00028928454,0.00016574307,0.00042346684,0.00097256986,0.4879965,0.006943859,0.4276349,0.002876223,0.071282566],"study_design_scores_gemma":[0.00005730359,0.00012247672,0.00017023324,0.000017584089,0.000030626365,0.00009171552,0.00011619176,0.8258576,0.0013908164,0.16336836,0.008746247,0.000030840853],"about_ca_topic_score_codex":0.0023813942,"about_ca_topic_score_gemma":0.0023180677,"teacher_disagreement_score":0.0033901606,"about_ca_system_score_codex":0.0014512492,"about_ca_system_score_gemma":0.0012708997,"threshold_uncertainty_score":0.017929137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053893616,0.0010606126,0.9803925,0.001108366,0.00018027806,0.00029985013,0.0001801868,0.0022740357,0.009114769],"genre_scores_gemma":[0.2697391,0.002093047,0.71222645,0.00042526724,0.0002711985,0.0008946803,0.00083173485,0.00031829788,0.013200303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997382,0.00076399784,0.00025295478,0.00047509532,0.0009627335,0.00016321555],"domain_scores_gemma":[0.9979486,0.0007692824,0.00012973677,0.00072949,0.0003340658,0.00008884583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020518417,0.0006008315,0.0009916357,0.0008275325,0.0013163534,0.0030269786,0.0017357077,0.0017592367,0.0070953267],"category_scores_gemma":[0.0074135857,0.00055920804,0.00069925253,0.0020107438,0.0010767637,0.0044947895,0.0026857774,0.0015559767,0.0024291582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024208048,0.00012206481,0.0008275813,0.0006596685,0.00008258727,0.00059915986,0.00028897327,0.10810876,0.009543172,0.5034128,0.025111523,0.35100162],"study_design_scores_gemma":[0.00013385614,0.000082823484,0.00024831874,0.000053810458,0.00003189916,0.0005752386,0.00008887469,0.49839312,0.004530096,0.42081967,0.07500637,0.00003598325],"about_ca_topic_score_codex":0.0020390083,"about_ca_topic_score_gemma":0.0013066771,"teacher_disagreement_score":0.0070953267,"about_ca_system_score_codex":0.0016270533,"about_ca_system_score_gemma":0.0016412312,"threshold_uncertainty_score":0.023736238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97350025,0.00013234638,0.02440216,0.00016005883,0.000015815478,0.00006123689,0.00007097929,0.00010050269,0.0015566616],"genre_scores_gemma":[0.99840975,0.000033974356,0.0013745949,0.000010060804,0.00000228438,0.000012474782,0.00002895916,0.000004341975,0.00012359036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922967,0.00032420672,0.000037866623,0.000112377136,0.0001808522,0.000115006434],"domain_scores_gemma":[0.98461306,0.010914304,0.0017812491,0.0009068798,0.0012498742,0.00053448783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025301424,0.00037607746,0.00034298614,0.00082366425,0.00038382033,0.0006113936,0.0007047716,0.00077187706,0.00047823187],"category_scores_gemma":[0.011162515,0.0002072239,0.00028808578,0.00038087595,0.0010233046,0.001102472,0.0005861332,0.0006700331,0.00009835999],"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.00013709819,0.0001285789,0.010370075,0.000043003405,0.00004457519,0.00007256537,0.00008078486,0.9757052,0.0034970676,0.004889324,0.00030572823,0.0047260798],"study_design_scores_gemma":[0.000008240761,0.00023141463,0.002561804,0.000005046473,0.000008794114,0.000026351656,0.00006713894,0.9943316,0.0013181271,0.0013497537,0.000081476865,0.000010270006],"about_ca_topic_score_codex":0.002509233,"about_ca_topic_score_gemma":0.0020009123,"teacher_disagreement_score":0.0025301424,"about_ca_system_score_codex":0.0010077894,"about_ca_system_score_gemma":0.00053064304,"threshold_uncertainty_score":0.0133808255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4866236,0.0010571148,0.4827053,0.0005932249,0.000092679555,0.00012944834,0.00020929844,0.0006817186,0.027907705],"genre_scores_gemma":[0.9837443,0.00012209268,0.013175789,0.000020229356,0.000014718671,0.00001781552,0.000030095089,0.000026588095,0.0028482892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997482,0.000053962147,0.000005881361,0.00003532002,0.0001101588,0.00004653261],"domain_scores_gemma":[0.9994522,0.0002756824,0.000027784552,0.00003213697,0.00019251092,0.000019680621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038859755,0.00036140002,0.0003389912,0.00036052492,0.00040440744,0.00076081994,0.00070202287,0.00047191713,0.0041285553],"category_scores_gemma":[0.0011750971,0.00018654298,0.0001768645,0.00041757143,0.0002918026,0.00084343,0.0002357691,0.00026435705,0.00025904362],"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.0002195936,0.00007709791,0.0011978238,0.000098880846,0.00003990597,0.00018027327,0.000044985736,0.92112184,0.021178138,0.022463322,0.001410385,0.031967726],"study_design_scores_gemma":[0.0000031708648,0.00001748792,0.00013926768,0.0000011345977,0.000006785878,0.00001667629,0.000006837288,0.9976972,0.0010240759,0.00088640925,0.0001991378,0.0000018184934],"about_ca_topic_score_codex":0.0071647763,"about_ca_topic_score_gemma":0.006208696,"teacher_disagreement_score":0.0071647763,"about_ca_system_score_codex":0.0015701656,"about_ca_system_score_gemma":0.000680387,"threshold_uncertainty_score":0.014246166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032830127,0.00061707455,0.95783395,0.002182727,0.0003955168,0.00032735194,0.0077475365,0.0076016467,0.020011157],"genre_scores_gemma":[0.08989929,0.004142757,0.8234651,0.0020617018,0.0002768193,0.0013583343,0.044750348,0.0062028007,0.027842773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950913,0.0015459358,0.00084674585,0.00066681067,0.0015562103,0.00029293803],"domain_scores_gemma":[0.99520147,0.0020340236,0.00025908407,0.0015275696,0.0007960555,0.0001818037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045876773,0.0016004278,0.0011103658,0.004931937,0.0021704815,0.007442266,0.0025883708,0.0024896066,0.0068268315],"category_scores_gemma":[0.010524775,0.0016492296,0.002947135,0.005107651,0.0025871731,0.0192848,0.004750837,0.003984243,0.0028006353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067084686,0.000112272544,0.0009860412,0.0008679347,0.00018539677,0.0008802852,0.0022138897,0.024375288,0.002385206,0.82536685,0.044572547,0.0979872],"study_design_scores_gemma":[0.0000340584,0.000013911154,0.00023055475,0.0005840594,0.000139878,0.0004982628,0.00063812593,0.041545697,0.0053240163,0.41375104,0.53715134,0.00008891382],"about_ca_topic_score_codex":0.02401535,"about_ca_topic_score_gemma":0.020264586,"teacher_disagreement_score":0.02401535,"about_ca_system_score_codex":0.0025157556,"about_ca_system_score_gemma":0.0029625343,"threshold_uncertainty_score":0.04775113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.283301,0.000631493,0.70133054,0.0006193899,0.00027926877,0.00020525619,0.00008293709,0.0034009053,0.010149259],"genre_scores_gemma":[0.7751619,0.00024653203,0.21700361,0.00020592101,0.000059210754,0.0001297852,0.00007688287,0.000112542446,0.007003501],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991024,0.00001544055,0.000004119477,0.00002995182,0.000029820598,0.000010373129],"domain_scores_gemma":[0.99980944,0.00005107305,0.000016816328,0.000030887048,0.000042636602,0.000049166152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022134505,0.00021759793,0.00037459435,0.00032618627,0.0006314089,0.0005928193,0.0009630513,0.0006670922,0.0023474388],"category_scores_gemma":[0.0005672273,0.00017767855,0.0002589587,0.00024147554,0.0004283579,0.00060118124,0.00075169274,0.0003394841,0.0005597995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026717558,0.00026677255,0.0013165764,0.00013778228,0.000079457284,0.00068566785,0.00036326557,0.06137696,0.78471404,0.015190696,0.002896924,0.1327047],"study_design_scores_gemma":[0.00006532354,0.00034877632,0.0013881279,0.000012204992,0.00008290211,0.0005995571,0.00010974682,0.88806736,0.09129537,0.008425438,0.0095566865,0.000048418482],"about_ca_topic_score_codex":0.00092655304,"about_ca_topic_score_gemma":0.0007223499,"teacher_disagreement_score":0.0023474388,"about_ca_system_score_codex":0.0003627332,"about_ca_system_score_gemma":0.00028436852,"threshold_uncertainty_score":0.007852972},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04991231,0.00025516516,0.9429479,0.00034803117,0.00007833192,0.00007543675,0.0001122403,0.00051541,0.0057551046],"genre_scores_gemma":[0.75142264,0.0005493494,0.23796628,0.00016578619,0.00008111065,0.0001723289,0.0004223031,0.0003149083,0.008905319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.00034683893,0.00007980612,0.00019787613,0.00033268664,0.00009795953],"domain_scores_gemma":[0.9943175,0.0019756255,0.0008502523,0.0020609386,0.00057926873,0.00021650676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013923873,0.00081524556,0.0005302815,0.00085383485,0.0006643596,0.0016577187,0.0008483172,0.0011738356,0.0020697282],"category_scores_gemma":[0.009635172,0.00039950662,0.00043537296,0.0004768603,0.0020882376,0.006165645,0.003478464,0.0016245068,0.0006955055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019247908,0.00008034205,0.001223107,0.00023680343,0.000046186076,0.00028898913,0.00048054446,0.37254515,0.014608947,0.52412915,0.0040222793,0.08214608],"study_design_scores_gemma":[0.000014567957,0.00009199421,0.0002902797,0.0000415299,0.000021791127,0.0002853126,0.00013086603,0.7165741,0.008377074,0.26356268,0.010578276,0.000031583015],"about_ca_topic_score_codex":0.0003233748,"about_ca_topic_score_gemma":0.0005452244,"teacher_disagreement_score":0.0020697282,"about_ca_system_score_codex":0.00068301853,"about_ca_system_score_gemma":0.000532635,"threshold_uncertainty_score":0.0073637962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095438056,0.0024936576,0.8835585,0.00077916775,0.0002892455,0.0004987223,0.00056786294,0.0040068836,0.012367927],"genre_scores_gemma":[0.7047785,0.001347796,0.28571478,0.0003925343,0.00009595951,0.00028629592,0.0015009618,0.00020746693,0.0056757433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984127,0.0003966961,0.00011398119,0.00018475267,0.0007437719,0.00014804858],"domain_scores_gemma":[0.9978124,0.0006620115,0.00022205451,0.0006354077,0.00057439186,0.00009373471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023819087,0.0004185732,0.0004936975,0.0012909952,0.00096760807,0.0018468264,0.0020788882,0.0010540145,0.0010290797],"category_scores_gemma":[0.004235453,0.0002705831,0.00027530696,0.0017890426,0.00071578374,0.0023681396,0.0014223122,0.0012326421,0.0003715956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015644475,0.000392573,0.0077936375,0.00066093233,0.0001795242,0.0016441162,0.00055835856,0.26024312,0.06484659,0.16705978,0.018203197,0.47685376],"study_design_scores_gemma":[0.00014457943,0.00031850836,0.0027105634,0.00006524155,0.00013993327,0.0007451324,0.00018330247,0.8310739,0.0554732,0.043244775,0.0657941,0.00010671503],"about_ca_topic_score_codex":0.007156579,"about_ca_topic_score_gemma":0.0052223247,"teacher_disagreement_score":0.007156579,"about_ca_system_score_codex":0.0015467817,"about_ca_system_score_gemma":0.0017937936,"threshold_uncertainty_score":0.014229834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056524545,0.00012323617,0.93351036,0.00019337522,0.00004839552,0.0003353409,0.000036654073,0.0072758584,0.0019522489],"genre_scores_gemma":[0.63527393,0.00008489431,0.36051553,0.00011331635,0.000022211572,0.00033302954,0.00012323174,0.000674074,0.0028598339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655306,0.0011762162,0.0002873031,0.0005381606,0.0011360605,0.0003092689],"domain_scores_gemma":[0.9844493,0.005529716,0.0014027563,0.0061618327,0.0018965632,0.0005597367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046965666,0.0008513835,0.0006901842,0.0009698323,0.0012268709,0.0020882783,0.003973049,0.001125549,0.0015841163],"category_scores_gemma":[0.018330963,0.00094652537,0.0006438995,0.0005706338,0.0018028067,0.0034908908,0.0030701957,0.0020986462,0.0003388749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015496172,0.0019334217,0.013838075,0.000744854,0.00028141678,0.0017376095,0.0025089413,0.13500196,0.10555215,0.1314555,0.0066932836,0.5987032],"study_design_scores_gemma":[0.00026710547,0.0005018819,0.002509608,0.00006463528,0.00016632267,0.0009181949,0.00024628296,0.83384794,0.091134496,0.05345136,0.016748935,0.00014317197],"about_ca_topic_score_codex":0.00483595,"about_ca_topic_score_gemma":0.0053410945,"teacher_disagreement_score":0.00483595,"about_ca_system_score_codex":0.0010799988,"about_ca_system_score_gemma":0.0020185201,"threshold_uncertainty_score":0.02483809},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94910514,0.000041250736,0.049302246,0.000048219546,0.000016472899,0.00016809822,0.00013597129,0.0003257001,0.00085684203],"genre_scores_gemma":[0.9617155,0.000028871304,0.037456058,0.000022273089,0.0000039233323,0.000059006183,0.00015544651,0.00002417571,0.0005346617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993868,0.00017332444,0.000047061945,0.00015326841,0.00017190528,0.000067585126],"domain_scores_gemma":[0.99804354,0.0012034265,0.00015064041,0.00013041467,0.00028551597,0.0001863897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069876923,0.0008366095,0.0006350245,0.0010892365,0.00038494822,0.0007807639,0.00080560596,0.00063421734,0.0006460081],"category_scores_gemma":[0.0038469173,0.00032047942,0.0003452302,0.0005287323,0.00066131825,0.00081779755,0.00083007984,0.00042033874,0.00015623854],"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.0052736606,0.0024786845,0.08489695,0.0006530797,0.00035864773,0.0013888642,0.0033402732,0.4805858,0.056157988,0.004099936,0.0021481363,0.35861793],"study_design_scores_gemma":[0.00009112922,0.0010071336,0.02046908,0.000021844058,0.000037820584,0.00031330707,0.00044632354,0.9630942,0.011791109,0.0019161258,0.00073835615,0.00007355495],"about_ca_topic_score_codex":0.0068309326,"about_ca_topic_score_gemma":0.009550252,"teacher_disagreement_score":0.0068309326,"about_ca_system_score_codex":0.0004623578,"about_ca_system_score_gemma":0.00043410773,"threshold_uncertainty_score":0.013582349},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02889506,0.0014942728,0.94659996,0.001994144,0.00030701203,0.00020374515,0.0004761521,0.005450083,0.014579519],"genre_scores_gemma":[0.46455044,0.0025469465,0.5095033,0.0006833239,0.00038273048,0.00040798873,0.0019493274,0.0003671263,0.019608807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997858,0.0006876596,0.0002353274,0.0004758929,0.0006191253,0.0001240617],"domain_scores_gemma":[0.9978119,0.00102019,0.00015029353,0.00057979993,0.0002973415,0.00014032003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050001913,0.0004465873,0.0008250319,0.0013909467,0.0009504389,0.0046598357,0.0019894266,0.0011456978,0.0027274718],"category_scores_gemma":[0.007111321,0.00055096205,0.00044292517,0.0014466275,0.0017753561,0.00667394,0.002486887,0.0013733911,0.001312024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018628611,0.00016316657,0.0042584585,0.00061836385,0.00013494186,0.0013455794,0.0013418427,0.060396463,0.032235768,0.44637716,0.035525966,0.4157395],"study_design_scores_gemma":[0.00016289993,0.00024421967,0.0017260282,0.00013199425,0.0001246824,0.0012728742,0.00065122754,0.6178411,0.026100772,0.14971256,0.20189513,0.00013651814],"about_ca_topic_score_codex":0.0024944083,"about_ca_topic_score_gemma":0.0019816426,"teacher_disagreement_score":0.0050001913,"about_ca_system_score_codex":0.0010127564,"about_ca_system_score_gemma":0.0011425839,"threshold_uncertainty_score":0.02644384},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011892693,0.00030338374,0.9799033,0.000348457,0.00007075445,0.00013890977,0.000036247224,0.0018467315,0.005459498],"genre_scores_gemma":[0.33516458,0.0007584482,0.65278256,0.00015362239,0.00010551236,0.00030065584,0.0002751133,0.00013044753,0.01032906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930835,0.00016687307,0.000079313286,0.0001180852,0.00025346363,0.00007381751],"domain_scores_gemma":[0.99937916,0.00009028017,0.00007158899,0.00013701407,0.00022968832,0.00009220558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011919446,0.00031293696,0.0003089902,0.0006868895,0.001020061,0.0018276914,0.0014716331,0.0008864022,0.0012836251],"category_scores_gemma":[0.0016194336,0.00036355352,0.00037942815,0.00052798394,0.0006800872,0.0021076028,0.0019699016,0.0008047819,0.00047226655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029539404,0.00024826208,0.0034520824,0.0004608297,0.00013809025,0.00094233523,0.0019834929,0.21257406,0.06364974,0.32432407,0.0147891035,0.37714252],"study_design_scores_gemma":[0.00004983057,0.00023317587,0.00095713936,0.00007937299,0.00010411118,0.00058431865,0.00024443545,0.8316594,0.013313358,0.051932056,0.100763015,0.000079882164],"about_ca_topic_score_codex":0.0029196383,"about_ca_topic_score_gemma":0.0038498058,"teacher_disagreement_score":0.0029196383,"about_ca_system_score_codex":0.00092749717,"about_ca_system_score_gemma":0.0011099153,"threshold_uncertainty_score":0.0067294836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6678515,0.00042322912,0.31642044,0.0006188511,0.00016274533,0.00014915648,0.00021211362,0.007119771,0.007042275],"genre_scores_gemma":[0.95036054,0.0001456828,0.048608262,0.000038248767,0.000011142209,0.000041910494,0.0001833353,0.00010397608,0.00050701183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851686,0.0006547639,0.00006501526,0.0001461991,0.00048466303,0.00013244353],"domain_scores_gemma":[0.99661404,0.0013296201,0.00032128868,0.00094859017,0.000664586,0.000121961035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017544415,0.0007121755,0.0004968238,0.000703951,0.00062072073,0.00083735766,0.0011949645,0.00056378066,0.00065064256],"category_scores_gemma":[0.009532412,0.0001850231,0.00025719174,0.00092932524,0.00067741855,0.0011204568,0.0010877568,0.00048885634,0.0002872186],"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.0005492258,0.00017430047,0.007908933,0.00011724813,0.00011006724,0.0002886121,0.0003253282,0.8788426,0.05181938,0.00999616,0.002031189,0.047836814],"study_design_scores_gemma":[0.000053580497,0.00019875605,0.0011270348,0.000010287524,0.000025475174,0.00016870668,0.00007920308,0.966649,0.027570104,0.0011972215,0.002891051,0.000029596962],"about_ca_topic_score_codex":0.0053101396,"about_ca_topic_score_gemma":0.0033259303,"teacher_disagreement_score":0.0053101396,"about_ca_system_score_codex":0.0009872984,"about_ca_system_score_gemma":0.00062659325,"threshold_uncertainty_score":0.010558486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9216092,0.00024082742,0.076100275,0.00019439294,0.000013021254,0.000043739055,0.000041998264,0.00037803449,0.0013784424],"genre_scores_gemma":[0.99377257,0.000041778432,0.0060540233,0.0000119186,0.000004279429,0.00000935152,0.000014520982,0.0000064733963,0.00008503607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991375,0.00042496817,0.000018369474,0.00015314532,0.00014194092,0.0001239958],"domain_scores_gemma":[0.99736494,0.0014711019,0.00033216778,0.0003087287,0.00028431197,0.00023876576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095281,0.0003415496,0.00060249964,0.0006417145,0.0010287076,0.0006426041,0.0012891969,0.0007508046,0.00033398648],"category_scores_gemma":[0.0049413815,0.0002617969,0.00022945987,0.00044556422,0.0011037041,0.00209584,0.0012344999,0.00067268644,0.00007778064],"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.0004326823,0.00058904284,0.032205716,0.00017758796,0.00014743255,0.0011551677,0.001082328,0.86057705,0.030576076,0.03113026,0.00182385,0.04010284],"study_design_scores_gemma":[0.000008938022,0.00007354689,0.0017987853,0.0000030584072,0.0000089605455,0.00010151057,0.00019695105,0.99125355,0.0024994568,0.0037668773,0.0002746534,0.000013667956],"about_ca_topic_score_codex":0.002977199,"about_ca_topic_score_gemma":0.0023515844,"teacher_disagreement_score":0.002977199,"about_ca_system_score_codex":0.0006019644,"about_ca_system_score_gemma":0.00058534014,"threshold_uncertainty_score":0.0063966513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026634242,0.00024606363,0.9683952,0.00013542917,0.00004601844,0.00014951182,0.00003794648,0.0010196194,0.0033359292],"genre_scores_gemma":[0.4677038,0.0004017778,0.526789,0.00014092762,0.00008585453,0.00027240717,0.00015690399,0.000088978275,0.004360292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963176,0.000054351458,0.0000166689,0.00004080574,0.00022803001,0.00002825838],"domain_scores_gemma":[0.99947745,0.0001433081,0.000040911847,0.00008893757,0.00021730844,0.00003214538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043336063,0.00035156426,0.00039570848,0.00035641974,0.0004055618,0.0005089903,0.000975277,0.0005248862,0.0010720902],"category_scores_gemma":[0.0012640107,0.00020655576,0.0002512977,0.00037954262,0.0004794823,0.0010308867,0.0007056742,0.00073939364,0.0003354587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026859884,0.00019736437,0.0016040339,0.00033452193,0.00007463125,0.0008440867,0.0003882121,0.15627831,0.37476304,0.06707813,0.0043010013,0.39386806],"study_design_scores_gemma":[0.000030468833,0.0001602527,0.00040482674,0.000020850313,0.000023750685,0.0004976805,0.000033357843,0.8975657,0.08503408,0.00817071,0.008021244,0.000037007598],"about_ca_topic_score_codex":0.0018508929,"about_ca_topic_score_gemma":0.001754435,"teacher_disagreement_score":0.0018508929,"about_ca_system_score_codex":0.0004715257,"about_ca_system_score_gemma":0.0005843897,"threshold_uncertainty_score":0.0036802888},"labels":[],"label_agreement":null},{"id":"W1974835369","doi":"10.1007/s12083-009-0031-0","title":"DAg-stream: Distributed video adaptation for overlay streaming to heterogeneous devices","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Adaptation (eye); Metadata; Content adaptation; Overlay network; Distributed computing; Server; Scalability; Computer network; Mobile device; Multimedia; Ubiquitous computing; The Internet; World Wide Web; Operating system","score_opus":0.02397491502197232,"score_gpt":0.2813579684451634,"score_spread":0.2573830534231911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974835369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018987618,0.00042304563,0.89805615,0.00022139301,0.00047864922,0.00035902084,0.0009276191,0.07754573,0.003000727],"genre_scores_gemma":[0.3910135,0.00066077325,0.58414567,0.00032085567,0.0002597494,0.00049436674,0.0044168937,0.004331841,0.014356354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995567,0.0000765399,0.000038438484,0.00009009217,0.00017879398,0.000059422713],"domain_scores_gemma":[0.99912065,0.00023348872,0.00004539354,0.00024442797,0.00021389137,0.00014212557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013086095,0.0010286415,0.0012231242,0.00096248573,0.0005760331,0.0011035332,0.002767759,0.00084326207,0.0049008876],"category_scores_gemma":[0.0031479911,0.00043085395,0.00046141777,0.00087035005,0.000502752,0.0012099423,0.0018478737,0.0011547743,0.001446792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003970334,0.00076902617,0.0032857705,0.0007280654,0.00036997313,0.00073177036,0.00041681458,0.12275996,0.08508792,0.014397585,0.10620481,0.661278],"study_design_scores_gemma":[0.0004950983,0.00019788028,0.0007044988,0.00002009254,0.00007788087,0.00028168506,0.000049040777,0.93277377,0.034048416,0.007630852,0.023661947,0.000058838046],"about_ca_topic_score_codex":0.003749932,"about_ca_topic_score_gemma":0.004457425,"teacher_disagreement_score":0.0049008876,"about_ca_system_score_codex":0.0007042767,"about_ca_system_score_gemma":0.0009097244,"threshold_uncertainty_score":0.016395152},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026993014,0.00038550585,0.9671748,0.00024043367,0.000031208558,0.00006198341,0.00002713899,0.0003550686,0.004730884],"genre_scores_gemma":[0.66562694,0.0005711259,0.33112586,0.00012072283,0.000062909494,0.00019260659,0.00006755069,0.00005853713,0.002173762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998691,0.000650533,0.000043457567,0.00007294339,0.0004344779,0.00010762192],"domain_scores_gemma":[0.9966709,0.002136027,0.00020196589,0.00048807304,0.00043695417,0.000065999535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688457,0.0003954798,0.0003546753,0.00078221125,0.00061863824,0.00088867114,0.00084784924,0.00072660035,0.00074381946],"category_scores_gemma":[0.006872055,0.00022746937,0.00024643575,0.001101749,0.0011694295,0.0019604007,0.0013127557,0.00093919365,0.00015569021],"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.00016378178,0.000067919165,0.0006422141,0.000117875825,0.000020617445,0.00016547204,0.00028318647,0.6735118,0.010278092,0.2248954,0.0016682169,0.088185385],"study_design_scores_gemma":[0.000011795177,0.000036770733,0.00007689514,0.000013514664,0.000005871664,0.000056661574,0.000022465756,0.9414737,0.0029302868,0.05360977,0.0017538858,0.000008368908],"about_ca_topic_score_codex":0.0021039916,"about_ca_topic_score_gemma":0.0018056682,"teacher_disagreement_score":0.0021039916,"about_ca_system_score_codex":0.0011255741,"about_ca_system_score_gemma":0.0011105684,"threshold_uncertainty_score":0.008929491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913195,0.00016503586,0.005619456,0.00016035767,0.000014830792,0.00006381137,0.00027334393,0.00015987435,0.0022239382],"genre_scores_gemma":[0.99924386,0.000038989798,0.0004891653,0.000023774033,0.000006837994,0.000012463564,0.00010745478,0.000008382753,0.000069054244],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978211,0.0006577079,0.00014450302,0.0002383161,0.0007405892,0.0003978492],"domain_scores_gemma":[0.99001604,0.004793512,0.001329688,0.0009697516,0.0021431402,0.000747881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014962294,0.0004563827,0.000397312,0.0012276652,0.00083361706,0.0010694874,0.00089440047,0.0008736082,0.0005807838],"category_scores_gemma":[0.008972564,0.00022893432,0.00023286305,0.0027769965,0.00061553845,0.0016481362,0.0006562099,0.0011759956,0.00026278794],"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.0019487392,0.0027276634,0.69411033,0.00040085698,0.00037723637,0.0014599211,0.0034096704,0.15657677,0.05498216,0.00726791,0.0064128772,0.07032596],"study_design_scores_gemma":[0.00006429113,0.0014797032,0.29207405,0.0000517818,0.000089359986,0.0012427217,0.0020883775,0.668628,0.02869399,0.0024539668,0.003023256,0.00011046562],"about_ca_topic_score_codex":0.012967908,"about_ca_topic_score_gemma":0.0060848854,"teacher_disagreement_score":0.012967908,"about_ca_system_score_codex":0.001399329,"about_ca_system_score_gemma":0.0007176067,"threshold_uncertainty_score":0.02578485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123344315,0.00018191419,0.9745018,0.001285184,0.00013387353,0.00009260475,0.00008856554,0.0019450834,0.009436513],"genre_scores_gemma":[0.33392903,0.00032732543,0.6545049,0.000581645,0.00020072244,0.00032070768,0.00017181755,0.0011251012,0.008838744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945358,0.0028046893,0.0003874641,0.00076283625,0.0011189667,0.00039027684],"domain_scores_gemma":[0.9877456,0.0066390913,0.0011974733,0.0023806049,0.0014586861,0.00057856255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071468586,0.0008043568,0.000689284,0.0009777634,0.0014842079,0.0038913796,0.0029191205,0.0014689722,0.00735496],"category_scores_gemma":[0.01934781,0.0009227616,0.0010162629,0.00095901656,0.0040184436,0.009815367,0.0036233964,0.004463216,0.00094707886],"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.00035966665,0.00017096006,0.0017878585,0.00023873456,0.000058546953,0.00026508272,0.0018641403,0.053466424,0.002789347,0.83519614,0.0077240015,0.09607918],"study_design_scores_gemma":[0.00013934392,0.00013686239,0.00032143237,0.00012916292,0.0000907943,0.00028957802,0.0003923474,0.3976272,0.007880621,0.544153,0.04876433,0.00007531542],"about_ca_topic_score_codex":0.004846978,"about_ca_topic_score_gemma":0.0046060355,"teacher_disagreement_score":0.00735496,"about_ca_system_score_codex":0.001582984,"about_ca_system_score_gemma":0.0021639739,"threshold_uncertainty_score":0.037796676},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017476073,0.008452162,0.050773293,0.016358573,0.02989608,0.005020139,0.023820192,0.041455913,0.8224761],"genre_scores_gemma":[0.013604813,0.0035772994,0.00850944,0.0023078122,0.0033074706,0.0014315755,0.01262695,0.0038459736,0.9507887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9918652,0.0019033132,0.0004430853,0.0019973866,0.0026154716,0.0011755773],"domain_scores_gemma":[0.9797233,0.004701608,0.00076030445,0.005936889,0.005167911,0.0037100127],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005668618,0.0040738527,0.005119011,0.0029670268,0.004850968,0.0083034085,0.006906045,0.004066936,0.8474148],"category_scores_gemma":[0.026823102,0.0024164452,0.0016102568,0.003964817,0.0034040262,0.011084218,0.011617521,0.005678132,0.8847575],"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.00031446444,0.00018275584,0.00011775312,0.001123073,0.00006972371,0.0002278504,0.00010899371,0.0002159148,0.006864589,0.0028257368,0.8838964,0.10405279],"study_design_scores_gemma":[0.00009527686,0.000063739455,0.00024200948,0.00021301405,0.000019672596,0.00015856755,0.000050782157,0.00068566017,0.0008387203,0.0034162204,0.99418503,0.00003134406],"about_ca_topic_score_codex":0.0025990782,"about_ca_topic_score_gemma":0.0028785204,"teacher_disagreement_score":0.8474148,"about_ca_system_score_codex":0.0019476884,"about_ca_system_score_gemma":0.002923073,"threshold_uncertainty_score":0.21764427},"labels":[],"label_agreement":null},{"id":"W1978322408","doi":"10.1007/s12083-010-0083-1","title":"Optimizing BitTorrent-like peer-to-peer systems in the presence of network address translation devices","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Southeast University; British Columbia Knowledge Development Fund; University of Victoria","keywords":"BitTorrent; Computer science; Network address translation; Computer network; The Internet; NAT traversal; Peer-to-peer; Distributed computing; File sharing; Cover (algebra); World Wide Web; Internet Protocol","score_opus":0.03020005677212293,"score_gpt":0.2839757314842452,"score_spread":0.25377567471212226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978322408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911754,0.0011078069,0.393721,0.00085529574,0.0001918512,0.00035180085,0.00018260485,0.0035583342,0.008855933],"genre_scores_gemma":[0.94813156,0.00015098708,0.04965425,0.000055150533,0.000029806688,0.00006089989,0.000111404275,0.00012580828,0.0016801591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984201,0.000631149,0.00009471783,0.00023397544,0.0003888958,0.00023120853],"domain_scores_gemma":[0.9943316,0.003298204,0.00034000308,0.00048034787,0.0012345751,0.00031537467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021741302,0.0010605166,0.0019021445,0.00047403298,0.0012844469,0.001667099,0.002139401,0.00135493,0.0019201457],"category_scores_gemma":[0.008682259,0.0006126054,0.00026375006,0.0007800474,0.0007235831,0.0029448392,0.0013347905,0.0007620989,0.0005608762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006146436,0.00022301481,0.0010715195,0.00012400717,0.000051312774,0.00015712585,0.00010590864,0.93682164,0.015302206,0.005170988,0.0025958808,0.037761707],"study_design_scores_gemma":[0.000023468581,0.000064657535,0.000107929845,0.0000016989417,0.0000119955785,0.000031076946,0.00003407843,0.99523383,0.002743495,0.0015560116,0.0001844219,0.0000073074857],"about_ca_topic_score_codex":0.003454101,"about_ca_topic_score_gemma":0.0058725467,"teacher_disagreement_score":0.003454101,"about_ca_system_score_codex":0.0012612598,"about_ca_system_score_gemma":0.0015685658,"threshold_uncertainty_score":0.011498034},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027265033,0.0012937833,0.96419144,0.0006228615,0.00007702569,0.00016644991,0.000041858497,0.0002260069,0.0061155655],"genre_scores_gemma":[0.7827993,0.0021837167,0.20977041,0.00021197628,0.00016649622,0.0006184808,0.000080627724,0.00008361989,0.004085453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797016,0.0008598901,0.00010884629,0.0002879631,0.0006268261,0.00014624104],"domain_scores_gemma":[0.99673563,0.0018199404,0.0003341412,0.000348355,0.00057983637,0.00018206729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025988866,0.0006451701,0.00088724936,0.0005929492,0.0008614464,0.0019220611,0.0016795236,0.001347762,0.001994239],"category_scores_gemma":[0.009012209,0.00062534335,0.0004806517,0.00067919306,0.0015405428,0.0032152934,0.0018602845,0.0008724931,0.0005222622],"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.00013106085,0.00007833363,0.00091865554,0.00044138986,0.00008892878,0.00039421304,0.00048578175,0.6163661,0.011201173,0.33294222,0.0020284571,0.03492375],"study_design_scores_gemma":[0.000056522924,0.000117171854,0.00014938305,0.000035222627,0.00003245216,0.00016003034,0.000084639774,0.89869124,0.0013553399,0.09112259,0.008175569,0.000019801564],"about_ca_topic_score_codex":0.00071286503,"about_ca_topic_score_gemma":0.0005193791,"teacher_disagreement_score":0.0025988866,"about_ca_system_score_codex":0.0010584752,"about_ca_system_score_gemma":0.0008425624,"threshold_uncertainty_score":0.013744354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610599,0.0019319016,0.31610516,0.0016620958,0.00019598007,0.00010855599,0.000579044,0.0009220996,0.017435178],"genre_scores_gemma":[0.9941766,0.00024187822,0.003966258,0.00002707837,0.000056622535,0.00003973235,0.00014229896,0.00005361466,0.001295816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985973,0.00037983726,0.000057953708,0.00028787323,0.00042250112,0.00025448494],"domain_scores_gemma":[0.99019086,0.005357818,0.001043526,0.0010027196,0.0017952254,0.0006098925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018589594,0.0004436213,0.0013784728,0.0014158909,0.0016178248,0.0028327277,0.001231085,0.0010147024,0.003019598],"category_scores_gemma":[0.01585975,0.0003300042,0.00033263917,0.0014338891,0.0016407813,0.003557316,0.002016074,0.000929408,0.00053798687],"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.0013858469,0.0001700636,0.012841509,0.00032754056,0.0002003818,0.0005914325,0.001285683,0.56204075,0.01788568,0.29393166,0.0094593745,0.09988014],"study_design_scores_gemma":[0.000058609345,0.00013729416,0.0035824664,0.00002287876,0.000050485785,0.00022498757,0.0003948459,0.82922935,0.0034273493,0.16010843,0.0027268007,0.000036474168],"about_ca_topic_score_codex":0.0012913063,"about_ca_topic_score_gemma":0.0006546664,"teacher_disagreement_score":0.003019598,"about_ca_system_score_codex":0.0010086106,"about_ca_system_score_gemma":0.00087211735,"threshold_uncertainty_score":0.010101557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004752905,0.0004681925,0.9895336,0.0011955801,0.00019155642,0.00019370427,0.0003659558,0.00081956264,0.0067565804],"genre_scores_gemma":[0.018610166,0.0010996336,0.97414905,0.0005017088,0.00017520605,0.00051250093,0.0014787826,0.00019463376,0.0032783083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956748,0.0013298559,0.00080374035,0.00046019597,0.0014756947,0.00025562735],"domain_scores_gemma":[0.99706984,0.0008298686,0.00029353812,0.00090854254,0.00058496394,0.0003132368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007161982,0.0010043144,0.0012627653,0.0044342536,0.004799545,0.007091283,0.004273844,0.002589575,0.0029917234],"category_scores_gemma":[0.0075198393,0.0010670912,0.0037126162,0.0058396123,0.0033171189,0.011022373,0.00696397,0.0049000736,0.0022035942],"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.000011639922,0.00003277849,0.00020288742,0.0001436299,0.000035113873,0.00024505847,0.0005987515,0.0055433153,0.0007335532,0.95691407,0.006961375,0.02857794],"study_design_scores_gemma":[0.000019886838,0.000020099891,0.00023981622,0.00030383628,0.00006640747,0.00045759275,0.00051914074,0.055896427,0.0010104288,0.62175345,0.3196396,0.0000733414],"about_ca_topic_score_codex":0.016305605,"about_ca_topic_score_gemma":0.019966487,"teacher_disagreement_score":0.016305605,"about_ca_system_score_codex":0.0029868975,"about_ca_system_score_gemma":0.006949608,"threshold_uncertainty_score":0.037876606},"labels":[],"label_agreement":null},{"id":"W1979833825","doi":"10.1007/s12083-011-0109-3","title":"Towards an effective integration of cellular users to the structured Peer-to-Peer network","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Chord (peer-to-peer); Computer network; Computer science; Upload; Cellular network; Base station; The Internet; Peer-to-peer; Distributed computing; Network topology; World Wide Web","score_opus":0.018456046687856296,"score_gpt":0.27691235525684055,"score_spread":0.25845630856898427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979833825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05027742,0.00054954685,0.9381127,0.00062819006,0.00015225151,0.0002895358,0.000025887286,0.0010065155,0.008958074],"genre_scores_gemma":[0.5578301,0.0008989476,0.42812502,0.0003726455,0.0002715257,0.00031973902,0.00013937539,0.00016114829,0.011881456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980659,0.00074221665,0.000073439485,0.00025410537,0.0007064577,0.00015788658],"domain_scores_gemma":[0.99737597,0.0006040434,0.000113021364,0.00069892796,0.00096033985,0.00024761964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017337434,0.0004567489,0.0007551361,0.000444938,0.0009110394,0.0024876653,0.0018077458,0.0014616102,0.0021762673],"category_scores_gemma":[0.0051421085,0.00036861934,0.00032449525,0.0005730625,0.00095796183,0.0032327273,0.0037919022,0.0012722561,0.0014188827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008920678,0.0010610186,0.0044816355,0.00051650614,0.00019265908,0.0010196108,0.002257179,0.103837416,0.11266485,0.23425475,0.011719066,0.52710325],"study_design_scores_gemma":[0.0001218658,0.00086727424,0.001018576,0.0001048596,0.00014603353,0.00062322884,0.0010434139,0.79009134,0.025102858,0.118208215,0.06260522,0.00006716105],"about_ca_topic_score_codex":0.0010398469,"about_ca_topic_score_gemma":0.0011491866,"teacher_disagreement_score":0.0024876653,"about_ca_system_score_codex":0.00045018038,"about_ca_system_score_gemma":0.0013079335,"threshold_uncertainty_score":0.009169042},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81844693,0.0014599599,0.16057505,0.0047117383,0.00017995435,0.00025811634,0.00057360367,0.00094110385,0.012853481],"genre_scores_gemma":[0.99641633,0.00022785451,0.0020445932,0.00007977048,0.000038378643,0.00003411879,0.00006500371,0.00005548636,0.0010385131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626476,0.0015282322,0.00016367769,0.00053118577,0.0008530727,0.0006591437],"domain_scores_gemma":[0.94048786,0.045939803,0.0033866374,0.0031832997,0.0055197384,0.0014826847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070520956,0.00056561496,0.0012717987,0.0015480055,0.0015417314,0.0031896494,0.002569235,0.0018812125,0.0027767508],"category_scores_gemma":[0.06423538,0.00072196685,0.0006373901,0.0015702874,0.0021594833,0.0064251707,0.0019070739,0.0023152758,0.00049238716],"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.0026444795,0.0011753399,0.07902631,0.0006586837,0.00019816618,0.00094707275,0.0037545455,0.49979565,0.014999735,0.28865865,0.0094788475,0.09866251],"study_design_scores_gemma":[0.00010623002,0.00027678045,0.00618284,0.00005492441,0.00009117141,0.00025058142,0.0009955472,0.9413929,0.003182248,0.045829125,0.0015692528,0.000068385634],"about_ca_topic_score_codex":0.011920749,"about_ca_topic_score_gemma":0.0074619497,"teacher_disagreement_score":0.011920749,"about_ca_system_score_codex":0.0040345965,"about_ca_system_score_gemma":0.0017677231,"threshold_uncertainty_score":0.03729546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02777,0.0023818843,0.7799735,0.0010735395,0.0017218888,0.0017866417,0.0030876992,0.1574779,0.024726924],"genre_scores_gemma":[0.41629335,0.0033368883,0.46483496,0.0010724788,0.0022241105,0.0015362126,0.009099992,0.007874834,0.09372708],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987186,0.00022929102,0.00012358215,0.0001806277,0.0006509717,0.00009694711],"domain_scores_gemma":[0.996822,0.0007399412,0.00035857892,0.0009837395,0.00070129015,0.00039438283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024225356,0.00089677225,0.0010543413,0.0021825659,0.0009876451,0.0023921998,0.0026780714,0.0015162497,0.014679455],"category_scores_gemma":[0.0058407527,0.00065168267,0.0005098816,0.0013276505,0.0006684637,0.0038622736,0.0026285206,0.001378738,0.008296324],"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.0018041169,0.00049688667,0.0022822374,0.0012864493,0.0001887578,0.0010729018,0.00041204668,0.0065053534,0.1020862,0.023389544,0.16166106,0.6988144],"study_design_scores_gemma":[0.0017546039,0.0017393522,0.0040855566,0.00013420102,0.0002543627,0.0036338042,0.00027213115,0.31839114,0.098356366,0.020937141,0.5500183,0.0004230852],"about_ca_topic_score_codex":0.0014034222,"about_ca_topic_score_gemma":0.0013887804,"teacher_disagreement_score":0.014679455,"about_ca_system_score_codex":0.00053062965,"about_ca_system_score_gemma":0.0015018128,"threshold_uncertainty_score":0.04910767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43951687,0.0013797092,0.51105493,0.0034905165,0.0003421608,0.00067588774,0.00065320946,0.012437754,0.030448984],"genre_scores_gemma":[0.88854986,0.00026581818,0.09635716,0.00022708332,0.000096157164,0.00021579294,0.0006366111,0.00010393727,0.0135475835],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998031,0.000027278873,0.000015228005,0.000047488167,0.00008042273,0.000026389838],"domain_scores_gemma":[0.9996959,0.00006516954,0.000021079872,0.00006306734,0.000087995206,0.000066790366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029586485,0.00026535854,0.00058449333,0.00039647822,0.0010440561,0.0010896174,0.0011304516,0.0008212207,0.004997981],"category_scores_gemma":[0.0007368262,0.00022239768,0.00022729853,0.00067902217,0.00032557175,0.0012916477,0.0011064922,0.00040349946,0.0011680311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00216392,0.000923919,0.0076937526,0.0007645684,0.00018450293,0.0044093183,0.0015797613,0.14244793,0.3819359,0.04873877,0.05728161,0.35187602],"study_design_scores_gemma":[0.00027704472,0.00038623455,0.0020013913,0.000026897755,0.00007620372,0.00066822587,0.00037414915,0.91869915,0.03789142,0.010149872,0.029403765,0.000045714492],"about_ca_topic_score_codex":0.002423384,"about_ca_topic_score_gemma":0.002845708,"teacher_disagreement_score":0.004997981,"about_ca_system_score_codex":0.00069595204,"about_ca_system_score_gemma":0.00068730174,"threshold_uncertainty_score":0.016719878},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32948515,0.35483426,0.13285184,0.0029533866,0.0013415865,0.0007948648,0.001981569,0.0018763917,0.17388105],"genre_scores_gemma":[0.43950906,0.44140393,0.06803686,0.0007638104,0.0016248114,0.00027863972,0.0045969137,0.00021038286,0.04357561],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962234,0.000044765125,0.000032715376,0.0000498994,0.00019412232,0.00005608682],"domain_scores_gemma":[0.9993863,0.00020489923,0.00004253548,0.00004506958,0.000260353,0.000060880473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000453988,0.00036402536,0.00054876396,0.001406509,0.00037915676,0.00080615235,0.00047945467,0.00044467425,0.0028488839],"category_scores_gemma":[0.0010294174,0.00019025852,0.00019150652,0.0027712858,0.00011454027,0.0015084688,0.00030393363,0.00028617636,0.0010638929],"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.00011301797,0.00010677574,0.0038507623,0.0010461353,0.000019789612,0.00014940953,0.00010739164,0.0015384331,0.007361409,0.0044979434,0.014966538,0.9662425],"study_design_scores_gemma":[0.00005670515,0.0009947658,0.04271759,0.0010725365,0.00020942716,0.004494476,0.0012629966,0.056268733,0.023620075,0.0064922143,0.86271656,0.00009387365],"about_ca_topic_score_codex":0.0020419504,"about_ca_topic_score_gemma":0.0021570944,"teacher_disagreement_score":0.0028488839,"about_ca_system_score_codex":0.00030499572,"about_ca_system_score_gemma":0.00041924365,"threshold_uncertainty_score":0.009530485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010642351,0.0005959482,0.9726307,0.0022652303,0.0001979158,0.00024354948,0.00029402005,0.0002457902,0.022462593],"genre_scores_gemma":[0.12612472,0.0014082774,0.8584407,0.0007158527,0.00022209289,0.0024699757,0.00039065618,0.00021593586,0.010011891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189174,0.0047005406,0.00046202636,0.00069534144,0.0018291551,0.00042132358],"domain_scores_gemma":[0.98955464,0.0054389127,0.00078887766,0.0014565851,0.002336147,0.00042490574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01402278,0.0012219523,0.0012802515,0.0026039716,0.003431397,0.0065032775,0.006128401,0.004841748,0.009140422],"category_scores_gemma":[0.023792695,0.0008792572,0.0020946965,0.0029830416,0.0075737596,0.009691584,0.0046051657,0.0038305232,0.0017993605],"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.000005146065,0.000005819433,0.000027270444,0.00005445105,0.000003111243,0.00003180327,0.00020742371,0.0041656364,0.00008101384,0.99100596,0.00087825843,0.0035340304],"study_design_scores_gemma":[0.000023332119,0.000028426111,0.000053427615,0.00014905856,0.000011627434,0.000087970395,0.00025811343,0.028737826,0.00042443458,0.90495646,0.06523229,0.00003711115],"about_ca_topic_score_codex":0.009905834,"about_ca_topic_score_gemma":0.0059669884,"teacher_disagreement_score":0.01402278,"about_ca_system_score_codex":0.0068543158,"about_ca_system_score_gemma":0.007874032,"threshold_uncertainty_score":0.07416046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093784034,0.00033574784,0.86311483,0.00012755326,0.00008124947,0.0005413698,0.00035872188,0.022233007,0.019423503],"genre_scores_gemma":[0.5483225,0.00025937808,0.4364977,0.00006136599,0.00003490079,0.0003074858,0.0007262571,0.0013331416,0.012457281],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936706,0.00015114705,0.000022552384,0.0001164427,0.00022096017,0.00012190517],"domain_scores_gemma":[0.9995048,0.00017640226,0.000017714581,0.00013693619,0.00005767568,0.00010648736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000833571,0.001206118,0.00074016134,0.0004989238,0.00050935696,0.0011752264,0.0016665331,0.00048322452,0.010463239],"category_scores_gemma":[0.0010252105,0.00047972184,0.0007409726,0.00034712418,0.0004324659,0.0010596263,0.0026311572,0.0007601,0.0012429908],"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.0049775704,0.0009541572,0.0038402916,0.0006208393,0.000350216,0.0027931414,0.0027939165,0.06383576,0.25415364,0.03107451,0.029882435,0.60472363],"study_design_scores_gemma":[0.0015309447,0.0013768672,0.013964372,0.00016096586,0.00018906762,0.0031047096,0.0008930999,0.75525546,0.09950986,0.023846786,0.09996292,0.00020491687],"about_ca_topic_score_codex":0.0037806705,"about_ca_topic_score_gemma":0.0049570375,"teacher_disagreement_score":0.010463239,"about_ca_system_score_codex":0.00045277248,"about_ca_system_score_gemma":0.00051364256,"threshold_uncertainty_score":0.035003006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3096967,0.0031908168,0.6363606,0.0022727123,0.00019856048,0.00024661623,0.00017370726,0.0007668045,0.047093462],"genre_scores_gemma":[0.93327296,0.0006345537,0.06378147,0.00006273667,0.00006907777,0.00008784091,0.00012178173,0.000035869114,0.0019338708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902844,0.00029912754,0.000028038954,0.000118601114,0.00045716672,0.00006866116],"domain_scores_gemma":[0.996099,0.0023611614,0.0002049923,0.00034713687,0.0007664325,0.0002213593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001242283,0.00031498465,0.00034230942,0.00040856976,0.00064146373,0.0011181745,0.00086826883,0.00094162405,0.0023868494],"category_scores_gemma":[0.005783445,0.00029000375,0.0001835275,0.00027898475,0.00044958215,0.0031037678,0.0011324331,0.00070403086,0.00035824263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00404766,0.0005308592,0.013313141,0.0008120423,0.00013566615,0.0026337986,0.0006470123,0.22306374,0.20314205,0.1799599,0.0067863273,0.3649279],"study_design_scores_gemma":[0.00009790561,0.00044675622,0.0018509533,0.00003771089,0.00003360631,0.0010317966,0.00021409692,0.92973363,0.038105603,0.022109753,0.0063085817,0.00002959186],"about_ca_topic_score_codex":0.0005746361,"about_ca_topic_score_gemma":0.00058507966,"teacher_disagreement_score":0.0023868494,"about_ca_system_score_codex":0.0003267054,"about_ca_system_score_gemma":0.00052603515,"threshold_uncertainty_score":0.007984757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115240894,0.001477675,0.8655179,0.0011437692,0.00025969208,0.00016366459,0.000051157476,0.0013597559,0.014785519],"genre_scores_gemma":[0.67932963,0.0010595409,0.2872252,0.000246889,0.00023296378,0.00026670969,0.00010831539,0.00016861643,0.031362142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904186,0.000255014,0.000043394175,0.00026720448,0.00031138476,0.00008114231],"domain_scores_gemma":[0.9984237,0.0005342645,0.0002663125,0.00036806476,0.0002079798,0.00019965832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010914812,0.00070025655,0.00082825474,0.00075223984,0.0014640166,0.0024920662,0.0012289124,0.0017942616,0.0039655683],"category_scores_gemma":[0.0032050444,0.00045349883,0.0005508736,0.00056102214,0.0017689866,0.003225247,0.0020013275,0.0010407467,0.0015360775],"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.00081847433,0.00030551877,0.004133371,0.0004930223,0.0002979284,0.0031472421,0.0031786594,0.19009036,0.098851524,0.41596925,0.006551601,0.27616307],"study_design_scores_gemma":[0.00028619583,0.0010248896,0.0019268973,0.00009477843,0.00019759606,0.0025000803,0.0014267769,0.7038153,0.04915755,0.09534184,0.14401579,0.00021231173],"about_ca_topic_score_codex":0.0012575057,"about_ca_topic_score_gemma":0.0011309728,"teacher_disagreement_score":0.0039655683,"about_ca_system_score_codex":0.0005277022,"about_ca_system_score_gemma":0.0005598982,"threshold_uncertainty_score":0.013266087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26706472,0.00046289025,0.71216875,0.0012154726,0.000104525985,0.00031518453,0.0001609303,0.009772546,0.008734952],"genre_scores_gemma":[0.8273878,0.00023215085,0.16867456,0.00018509032,0.000059636,0.00026777235,0.00014612067,0.00049598253,0.002550847],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792683,0.0011151287,0.00008943053,0.0002753533,0.00041335303,0.00017981326],"domain_scores_gemma":[0.9872158,0.009543598,0.0005371879,0.0013567518,0.0009137617,0.00043286424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003306581,0.0009673145,0.0004864418,0.00068008556,0.00080791616,0.0033798234,0.001347601,0.0013009853,0.0032548958],"category_scores_gemma":[0.015480192,0.00042269318,0.00044693972,0.00031041217,0.0013977888,0.0035934013,0.0029355686,0.001138379,0.00035523114],"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.0026927423,0.0010589712,0.025939284,0.0020865605,0.0003015456,0.0024115818,0.1008863,0.052586365,0.3754993,0.048692275,0.017106198,0.37073886],"study_design_scores_gemma":[0.00072182965,0.0017463831,0.02903141,0.000562803,0.00045076443,0.002010021,0.015464493,0.5046039,0.18699501,0.0745135,0.18325496,0.00064487854],"about_ca_topic_score_codex":0.0019065592,"about_ca_topic_score_gemma":0.0014525614,"teacher_disagreement_score":0.0033798234,"about_ca_system_score_codex":0.0004998182,"about_ca_system_score_gemma":0.0006200135,"threshold_uncertainty_score":0.017487109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025058057,0.00038135817,0.86387384,0.0020139236,0.0003932584,0.0011266612,0.0009149755,0.02510913,0.08112878],"genre_scores_gemma":[0.49166325,0.0015802174,0.42067444,0.0015109229,0.00044358673,0.0023650064,0.0053224876,0.0046098283,0.07183032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954732,0.0015652763,0.00039424095,0.0006369869,0.001379447,0.0005508306],"domain_scores_gemma":[0.9963259,0.0009167809,0.00024996226,0.0012554785,0.00061036943,0.00064142223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055456418,0.0012725142,0.00083996233,0.0024193388,0.0021774098,0.0065869284,0.0017583501,0.0022437794,0.018073773],"category_scores_gemma":[0.007757967,0.0008172741,0.0016472545,0.0024825365,0.0023311067,0.011067029,0.011968577,0.002452763,0.008238478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045756614,0.00051559124,0.004894696,0.00051177625,0.00017669259,0.0018423962,0.0035448626,0.0067892186,0.013235407,0.77582294,0.043403804,0.14880505],"study_design_scores_gemma":[0.00022225847,0.00019721998,0.00155983,0.00021336833,0.00013383866,0.001221458,0.0017326412,0.07514708,0.015209305,0.36297578,0.54123235,0.00015491422],"about_ca_topic_score_codex":0.0033739689,"about_ca_topic_score_gemma":0.0029223396,"teacher_disagreement_score":0.018073773,"about_ca_system_score_codex":0.0013072167,"about_ca_system_score_gemma":0.002007034,"threshold_uncertainty_score":0.060462773},"labels":[],"label_agreement":null},{"id":"W1991277203","doi":"10.1007/s12083-009-0032-z","title":"Improving robustness of P2P applications in mobile environments","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Redundancy (engineering); Distributed computing; Robustness (evolution); Exploit; Computer network; Computer security; Operating system","score_opus":0.011373719621234525,"score_gpt":0.2512774903335184,"score_spread":0.23990377071228391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991277203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40104753,0.00346901,0.57771975,0.0011974117,0.00041490528,0.00017562893,0.0002728542,0.00810607,0.007596952],"genre_scores_gemma":[0.97814137,0.00038687928,0.019796794,0.00009042687,0.00012847422,0.000034244807,0.0001451369,0.0002506514,0.0010260215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776995,0.0005585951,0.00014831946,0.00033687256,0.000881118,0.0003051391],"domain_scores_gemma":[0.9871349,0.0076948768,0.0008008967,0.0021991706,0.0018414749,0.00032866822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018466603,0.001317075,0.00095811195,0.0010804604,0.00090828846,0.0016504326,0.0014988867,0.0019700853,0.0023644408],"category_scores_gemma":[0.019336576,0.00048629806,0.00045737388,0.00069436996,0.00077661965,0.0029735127,0.0016577952,0.0012641612,0.0008764751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024552802,0.00036297264,0.0050658467,0.00052115804,0.00022729904,0.0010129351,0.00036207377,0.5296194,0.2612076,0.0073513924,0.004539376,0.18727462],"study_design_scores_gemma":[0.000053917418,0.0004110283,0.0016747834,0.00002032891,0.0001065427,0.00030802205,0.00010913182,0.9197415,0.07052716,0.005304568,0.0017051994,0.0000378466],"about_ca_topic_score_codex":0.0017109914,"about_ca_topic_score_gemma":0.0007034433,"teacher_disagreement_score":0.0023644408,"about_ca_system_score_codex":0.0006919242,"about_ca_system_score_gemma":0.0005021306,"threshold_uncertainty_score":0.009766161},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07544131,0.0007072034,0.9177699,0.00048882875,0.000047256977,0.00007867653,0.000034291672,0.0011972612,0.004235353],"genre_scores_gemma":[0.8631222,0.0006698883,0.13364722,0.00006182566,0.00008849042,0.00009161628,0.00006226506,0.00007646911,0.0021800522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.0001599206,0.00002522558,0.00004262949,0.0002433452,0.00005776886],"domain_scores_gemma":[0.99913317,0.0003542192,0.00012318083,0.00022724259,0.00011620891,0.000045964083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087126024,0.00028871378,0.00033839195,0.000397429,0.0008357876,0.00082200556,0.00081152486,0.0006619908,0.00052491896],"category_scores_gemma":[0.0026276258,0.00022010694,0.00024111483,0.00048454414,0.0006478519,0.0017839074,0.0010739829,0.0005966955,0.00022097876],"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.00030637722,0.00013834622,0.0028313897,0.00056787656,0.00006260601,0.001733283,0.0007856609,0.41381788,0.10027916,0.16053665,0.005797038,0.3131438],"study_design_scores_gemma":[0.000027181575,0.00022488795,0.0010611216,0.000028804441,0.000039342027,0.00069431413,0.0002256076,0.8804121,0.020541048,0.08550395,0.011212546,0.000029069693],"about_ca_topic_score_codex":0.00072149193,"about_ca_topic_score_gemma":0.0009837332,"teacher_disagreement_score":0.00087126024,"about_ca_system_score_codex":0.00045498856,"about_ca_system_score_gemma":0.00046527784,"threshold_uncertainty_score":0.0046076775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71481824,0.0002868556,0.27454528,0.00042918386,0.00014802167,0.00009150994,0.00021857565,0.002553261,0.0069091134],"genre_scores_gemma":[0.9719582,0.000050931983,0.026173135,0.000033556415,0.000019231018,0.000013676896,0.00005721049,0.000040776646,0.0016532602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996412,0.00011923529,0.000021435259,0.00008115058,0.00007275574,0.00006416999],"domain_scores_gemma":[0.9981029,0.00074411574,0.00008983493,0.00038970416,0.00052036694,0.00015304658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063680456,0.0002648139,0.00064928626,0.0004803421,0.00086571614,0.0008151881,0.000876268,0.0004900304,0.0019148636],"category_scores_gemma":[0.0017044126,0.0001845738,0.00017482448,0.0007192156,0.0004908646,0.0009643877,0.0006112765,0.00042608113,0.00030285126],"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.008747576,0.0012425772,0.015656738,0.00023182914,0.00015995013,0.0047989893,0.0010342972,0.39028984,0.1877632,0.029455436,0.0146168,0.34600273],"study_design_scores_gemma":[0.00009073992,0.00015714993,0.00084597495,0.0000048299203,0.000020431411,0.00028180119,0.00012917089,0.97796303,0.014567478,0.0048948694,0.0010280106,0.00001644995],"about_ca_topic_score_codex":0.008270999,"about_ca_topic_score_gemma":0.007148168,"teacher_disagreement_score":0.008270999,"about_ca_system_score_codex":0.0007041577,"about_ca_system_score_gemma":0.00047117774,"threshold_uncertainty_score":0.016445756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051466636,0.00059795374,0.9184111,0.0009985394,0.00038880119,0.00039886992,0.0003462277,0.00540848,0.021983476],"genre_scores_gemma":[0.5443485,0.0006848638,0.42539385,0.00023282168,0.00018586236,0.00026754953,0.00047001857,0.00049906335,0.02791751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988348,0.00023638006,0.000092261755,0.00021495018,0.00046213513,0.0001594706],"domain_scores_gemma":[0.9982857,0.00037124922,0.00006818729,0.0007876544,0.0002441678,0.00024295185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012977213,0.00040088748,0.0011033304,0.000639803,0.002140516,0.003105989,0.0024626965,0.0011431936,0.0070827836],"category_scores_gemma":[0.003570626,0.00038730033,0.00049551117,0.0011863167,0.0012358074,0.0053488696,0.0038900874,0.0015001491,0.0019420007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013979974,0.0001956677,0.000737696,0.0004045002,0.00009344265,0.0003760015,0.0010182065,0.041625597,0.023135357,0.70153654,0.013762769,0.21571617],"study_design_scores_gemma":[0.00037501616,0.0005368043,0.00030868704,0.000096781136,0.00017834574,0.0006633021,0.00060082035,0.41361898,0.029738879,0.42529306,0.12844023,0.00014910514],"about_ca_topic_score_codex":0.0023759818,"about_ca_topic_score_gemma":0.0026868838,"teacher_disagreement_score":0.0070827836,"about_ca_system_score_codex":0.00085917563,"about_ca_system_score_gemma":0.0012454665,"threshold_uncertainty_score":0.023694277},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012242357,0.0011239126,0.14884341,0.0017180667,0.0015448494,0.00084707135,0.012811448,0.12594801,0.6949209],"genre_scores_gemma":[0.12603617,0.0019362886,0.10159324,0.001960148,0.00059773104,0.000941573,0.060132712,0.021225143,0.68557703],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921167,0.000085064494,0.000048759157,0.00015295569,0.00034489355,0.00015669214],"domain_scores_gemma":[0.9987112,0.00013122977,0.000052003827,0.00048651686,0.00038770534,0.00023121596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082628557,0.0010481322,0.00066475227,0.0008505649,0.0010955596,0.0025489246,0.0022658643,0.0012735601,0.24999887],"category_scores_gemma":[0.0023440085,0.00059769984,0.00055157155,0.001039363,0.0004978971,0.0047165267,0.004019322,0.00161769,0.1574992],"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.00075108046,0.00018592937,0.0015168292,0.00057544786,0.00004934265,0.000406386,0.00031080673,0.0031724595,0.015492135,0.05389907,0.69217104,0.2314694],"study_design_scores_gemma":[0.00007141118,0.00011248137,0.0007953075,0.00005341176,0.0000128819365,0.0002789229,0.00006206944,0.0063780276,0.004922806,0.006737131,0.9805489,0.000026622485],"about_ca_topic_score_codex":0.0017501835,"about_ca_topic_score_gemma":0.0018949946,"teacher_disagreement_score":0.75000113,"about_ca_system_score_codex":0.0006307037,"about_ca_system_score_gemma":0.0011866246,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02761065,0.0004985247,0.9699931,0.0002035805,0.000031554733,0.000041793657,0.000019229165,0.00018873636,0.001412806],"genre_scores_gemma":[0.8286044,0.000461912,0.16837084,0.00006830697,0.00006251472,0.0001493207,0.00004536161,0.000075638854,0.0021616095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986563,0.00064030057,0.00005246402,0.00020396532,0.00035017583,0.00009681134],"domain_scores_gemma":[0.99861443,0.00085285114,0.000101801685,0.00012922115,0.0002433315,0.00005834194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00234339,0.00063245086,0.0010925533,0.0003515594,0.0004953456,0.0009700148,0.0011542635,0.0008580262,0.0005892321],"category_scores_gemma":[0.004324836,0.00048906886,0.0002958643,0.00056493504,0.0008418017,0.0016675252,0.0011152187,0.0007883909,0.00018294885],"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.00011035851,0.000051585223,0.00027802,0.000047080906,0.00002443329,0.0000498654,0.000053406056,0.93806136,0.0039160596,0.01585974,0.0005446446,0.041003447],"study_design_scores_gemma":[0.000014640215,0.000018114737,0.0000450882,0.0000018018294,0.000003305694,0.000013560869,0.0000064539163,0.99278533,0.00062924705,0.0062148627,0.0002635974,0.000004008692],"about_ca_topic_score_codex":0.0018366982,"about_ca_topic_score_gemma":0.0011691544,"teacher_disagreement_score":0.00234339,"about_ca_system_score_codex":0.0008569664,"about_ca_system_score_gemma":0.00090845546,"threshold_uncertainty_score":0.012393177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09061329,0.007804062,0.8015678,0.0038850915,0.0023950217,0.0012746787,0.0004471813,0.020807166,0.071205765],"genre_scores_gemma":[0.4558238,0.0058973255,0.5117679,0.0012868608,0.001504754,0.00036811613,0.00072716066,0.0009971326,0.02162694],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861765,0.0003144305,0.00009068588,0.00014736807,0.00071507937,0.00011467455],"domain_scores_gemma":[0.9983961,0.00029503703,0.000053888394,0.00050505006,0.0005483883,0.00020140626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010676103,0.0005386945,0.00068522553,0.0009390066,0.0006502381,0.0015218477,0.0018206943,0.0011549053,0.0037652063],"category_scores_gemma":[0.0037434658,0.00042726737,0.0006149228,0.00077968667,0.0004672982,0.003500367,0.0027036988,0.0017762748,0.002077937],"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.0007853307,0.00046106862,0.0022611874,0.0011198969,0.00020246045,0.0014033819,0.00055627216,0.020966828,0.10106259,0.057711575,0.018611936,0.7948575],"study_design_scores_gemma":[0.00014562531,0.0012298308,0.0032430168,0.00040922605,0.0004485956,0.005884434,0.0003324111,0.43810597,0.10215992,0.06422341,0.38339746,0.00042000026],"about_ca_topic_score_codex":0.0012289971,"about_ca_topic_score_gemma":0.001200711,"teacher_disagreement_score":0.0037652063,"about_ca_system_score_codex":0.0004209841,"about_ca_system_score_gemma":0.0005204637,"threshold_uncertainty_score":0.012595832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6193348,0.00042341245,0.36489448,0.0001776392,0.0004953066,0.0005185569,0.00066727086,0.00364489,0.009843625],"genre_scores_gemma":[0.9511012,0.000114290924,0.044736262,0.00008889568,0.000026013458,0.0002810657,0.00041327163,0.0002096434,0.003029435],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99792874,0.00044541768,0.00016450016,0.0002845283,0.00095848704,0.00021827196],"domain_scores_gemma":[0.99447894,0.0024648185,0.00054231624,0.0009546058,0.0012638357,0.00029531683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012721724,0.00067015085,0.00036951425,0.00071694946,0.0006081087,0.0008887262,0.00086356257,0.00080990634,0.008221851],"category_scores_gemma":[0.009890856,0.00029177926,0.00025061506,0.0005630017,0.0005247654,0.0017439763,0.0015966175,0.0007267887,0.0013822615],"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.008269148,0.0015016292,0.02136659,0.0010981247,0.0001797508,0.0010873836,0.0025812986,0.05623862,0.62359494,0.011582995,0.0045380946,0.26796138],"study_design_scores_gemma":[0.0007049237,0.016314264,0.040598158,0.00012806861,0.00015294674,0.0020579104,0.00089833594,0.15814443,0.73844707,0.0059149093,0.03625933,0.0003797382],"about_ca_topic_score_codex":0.0011671842,"about_ca_topic_score_gemma":0.0013388264,"teacher_disagreement_score":0.008221851,"about_ca_system_score_codex":0.0004551061,"about_ca_system_score_gemma":0.00063736923,"threshold_uncertainty_score":0.027504861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3457463,0.00039532277,0.6449494,0.00028192828,0.00014766597,0.0004308994,0.00016391714,0.0029735237,0.004911094],"genre_scores_gemma":[0.84375846,0.00019261488,0.15472248,0.000025584834,0.0000175895,0.00025071838,0.00012229776,0.00009950961,0.00081068726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992199,0.00042760192,0.000040606974,0.00006823867,0.0002002775,0.00004336744],"domain_scores_gemma":[0.997174,0.0018723374,0.00010128693,0.00020381433,0.0005071568,0.00014136574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598295,0.00055082946,0.00073343026,0.0004549961,0.00074292126,0.0005532804,0.001097755,0.00069287146,0.0011543131],"category_scores_gemma":[0.005320506,0.00036027547,0.0003838798,0.00048311675,0.0004314939,0.0010068018,0.000684369,0.00090165203,0.00021776545],"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.000102833736,0.0001288581,0.0014475123,0.000051902753,0.000029370369,0.000056747842,0.00010635108,0.9775198,0.0056031276,0.0034802621,0.00040324221,0.011069854],"study_design_scores_gemma":[0.000009915548,0.000022016091,0.000051713614,0.0000015643809,0.000003704933,0.0000035387732,0.000006463059,0.9982285,0.0011203048,0.00035405863,0.00019529604,0.0000029780508],"about_ca_topic_score_codex":0.007854975,"about_ca_topic_score_gemma":0.004412639,"teacher_disagreement_score":0.007854975,"about_ca_system_score_codex":0.00068431546,"about_ca_system_score_gemma":0.0013292409,"threshold_uncertainty_score":0.015618503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059958197,0.00090200343,0.9338943,0.0006979052,0.00016224073,0.00018126398,0.000041481235,0.00063197664,0.0035306728],"genre_scores_gemma":[0.8839696,0.0007613534,0.110049,0.00015854934,0.00018465157,0.00021586535,0.00006512874,0.00013031396,0.004465531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983816,0.0005276899,0.00010365398,0.00027492893,0.00056652963,0.00014555597],"domain_scores_gemma":[0.9960717,0.002281182,0.00022920473,0.00045163892,0.00070504413,0.00026124477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023663638,0.0006377037,0.0015275744,0.001269902,0.002902886,0.002642476,0.0029569846,0.0015192407,0.0016384162],"category_scores_gemma":[0.0077375695,0.00073740963,0.0005247726,0.001223626,0.0014206094,0.003068432,0.0022990631,0.0012495297,0.00042893013],"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.00073311036,0.0003164585,0.002160471,0.0005838603,0.00025094952,0.00054878055,0.0014260726,0.67881376,0.043480664,0.15892588,0.0051261364,0.10763388],"study_design_scores_gemma":[0.000054380813,0.00008259827,0.0002072524,0.000014252639,0.000044380053,0.00009912151,0.00010564722,0.96827143,0.0026344953,0.026271109,0.002187662,0.000027631806],"about_ca_topic_score_codex":0.002742414,"about_ca_topic_score_gemma":0.0032097402,"teacher_disagreement_score":0.0029569846,"about_ca_system_score_codex":0.0015118093,"about_ca_system_score_gemma":0.001314063,"threshold_uncertainty_score":0.012514651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071216,0.00019372816,0.913313,0.0003865156,0.000107640204,0.00020986961,0.0007881106,0.0020349226,0.011750236],"genre_scores_gemma":[0.7087338,0.0003453695,0.28279653,0.00014285935,0.000037392543,0.0006042718,0.0011590179,0.00025393633,0.0059268503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948823,0.00016460143,0.000041798743,0.000066574474,0.00017531693,0.00006347282],"domain_scores_gemma":[0.9985499,0.0008547152,0.00008872819,0.00018870804,0.0001916516,0.000126341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010755393,0.0003867574,0.000692888,0.0004490369,0.0007191878,0.0010919367,0.0018596204,0.001004347,0.0031404153],"category_scores_gemma":[0.003147737,0.00032506435,0.0007206873,0.00048409123,0.00089441065,0.0010533234,0.001299579,0.0011769655,0.0003744772],"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.000028512988,0.0000384129,0.0009546775,0.000044033175,0.000016515889,0.000106813175,0.00009672367,0.94552225,0.0014286812,0.046387266,0.0006538219,0.004722361],"study_design_scores_gemma":[0.000013439224,0.000010338002,0.00006188803,0.0000035642574,0.0000029905111,0.000017405106,0.000012488051,0.99189526,0.0007714308,0.0052600284,0.0019459184,0.000005270274],"about_ca_topic_score_codex":0.00837182,"about_ca_topic_score_gemma":0.004915681,"teacher_disagreement_score":0.00837182,"about_ca_system_score_codex":0.0009600624,"about_ca_system_score_gemma":0.0014511007,"threshold_uncertainty_score":0.016646206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9374591,0.0001402801,0.060716633,0.00004152386,0.000009753456,0.000035570054,0.0001282462,0.00044303312,0.0010259564],"genre_scores_gemma":[0.99845123,0.000020560548,0.0013928264,0.0000028639004,0.0000037693544,0.000005036008,0.000041448966,0.0000065759464,0.00007565978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919885,0.00022939779,0.000050071525,0.00012894238,0.00030424108,0.000088556684],"domain_scores_gemma":[0.9971745,0.001492164,0.00035037744,0.00021151087,0.00062013255,0.00015124537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009629563,0.00031611757,0.0006258171,0.00093810435,0.00023352161,0.0007189922,0.00048229474,0.0003792873,0.00034511846],"category_scores_gemma":[0.005239048,0.00013897562,0.00013380311,0.0011065681,0.00025071352,0.001011432,0.00058370305,0.00030437816,0.00009406092],"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.0041121407,0.0006015211,0.21535757,0.0002670269,0.0003159498,0.0010545669,0.00087476755,0.401598,0.09463893,0.0035778556,0.001566289,0.27603537],"study_design_scores_gemma":[0.000022028182,0.00028688015,0.028054325,0.0000055916885,0.000041835883,0.00020569988,0.00015493229,0.9595767,0.010281072,0.0010454823,0.0003098854,0.000015516862],"about_ca_topic_score_codex":0.0019606003,"about_ca_topic_score_gemma":0.0010328827,"teacher_disagreement_score":0.0019606003,"about_ca_system_score_codex":0.0005905404,"about_ca_system_score_gemma":0.00020523103,"threshold_uncertainty_score":0.0050926805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889921,0.0009370684,0.0043158745,0.00022220783,0.000023252152,0.000022431645,0.00012131164,0.00013668447,0.0052291383],"genre_scores_gemma":[0.9993007,0.00010864023,0.00041623568,0.000010898917,0.000007277998,0.000002422461,0.000016626444,0.000006200512,0.0001309467],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.00018807844,0.00002295479,0.00008403507,0.00024932748,0.00009989771],"domain_scores_gemma":[0.99529713,0.0032778494,0.00050244876,0.00026878042,0.0004117697,0.00024209841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056558585,0.00032073952,0.00026304813,0.0002623636,0.0003714042,0.0006392584,0.00033555497,0.0004025238,0.0011412199],"category_scores_gemma":[0.005529522,0.000104971026,0.000107834334,0.00045773486,0.00045349923,0.0008358534,0.00034068534,0.0005404843,0.00011319983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00717513,0.0019286448,0.09658373,0.00093370856,0.0002802296,0.004138337,0.0012066999,0.34233195,0.3441646,0.012965924,0.0045513413,0.1837398],"study_design_scores_gemma":[0.00014775433,0.0024284918,0.13767971,0.000074506774,0.00019232866,0.0012904118,0.0016212534,0.7239657,0.12158902,0.006962525,0.003932662,0.00011563554],"about_ca_topic_score_codex":0.005074509,"about_ca_topic_score_gemma":0.0033923052,"teacher_disagreement_score":0.005074509,"about_ca_system_score_codex":0.0004007841,"about_ca_system_score_gemma":0.0003243536,"threshold_uncertainty_score":0.010089934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41056037,0.002833983,0.43551388,0.0043030754,0.0011279683,0.0014373389,0.00379265,0.036368202,0.1040625],"genre_scores_gemma":[0.9030114,0.0009849562,0.08182087,0.0003005428,0.00027056242,0.0004277626,0.0025772168,0.0012091361,0.009397598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99321836,0.0013921412,0.00025797865,0.0005222875,0.004006567,0.00060261035],"domain_scores_gemma":[0.99027354,0.003712617,0.00041601667,0.0015921668,0.0035359208,0.00046970247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051857065,0.0009998864,0.0010117091,0.0017288679,0.0012472603,0.004728798,0.0031588404,0.0018837855,0.007738858],"category_scores_gemma":[0.02041782,0.00041457886,0.0005964638,0.0019924631,0.00089736545,0.004580851,0.0011347715,0.0018595364,0.002345894],"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.0037264174,0.002424003,0.015658583,0.00084102625,0.0002914457,0.00024829447,0.00041451494,0.6036956,0.017326612,0.062819764,0.04235848,0.2501953],"study_design_scores_gemma":[0.00014070458,0.00053870544,0.0018709102,0.00004699154,0.00007255372,0.00009730014,0.00011995454,0.9778798,0.006769154,0.006676428,0.005743562,0.00004387719],"about_ca_topic_score_codex":0.010204175,"about_ca_topic_score_gemma":0.0060259034,"teacher_disagreement_score":0.010204175,"about_ca_system_score_codex":0.0026944242,"about_ca_system_score_gemma":0.0031265942,"threshold_uncertainty_score":0.027424991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16203302,0.0010295149,0.80136335,0.00091695547,0.00052325684,0.0008384258,0.0003028049,0.016411956,0.016580675],"genre_scores_gemma":[0.86614794,0.00052104297,0.12345837,0.00023872837,0.0006567269,0.0003966595,0.00065842044,0.0004720276,0.007450106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718297,0.00058199867,0.0002778951,0.0004097239,0.0013150986,0.00023233246],"domain_scores_gemma":[0.994974,0.0014813625,0.00034049054,0.0015816172,0.001323602,0.00029896092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002503512,0.0008269468,0.0011213324,0.0014526788,0.002196608,0.0034635817,0.0033683844,0.0013309169,0.0026919984],"category_scores_gemma":[0.0062515745,0.0005174458,0.00037708643,0.0017918148,0.0007209133,0.003264706,0.0025630058,0.0009794561,0.0016500964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013714468,0.0015677037,0.006869625,0.00076593965,0.00033401136,0.0010663348,0.001144532,0.21436131,0.19216472,0.049556572,0.02211278,0.50868505],"study_design_scores_gemma":[0.0002618806,0.00021077163,0.0013740542,0.000018491712,0.00011318282,0.00040207116,0.00025880145,0.8895505,0.053909805,0.026981283,0.026842805,0.00007640343],"about_ca_topic_score_codex":0.0009950195,"about_ca_topic_score_gemma":0.001032985,"teacher_disagreement_score":0.0034635817,"about_ca_system_score_codex":0.0010183889,"about_ca_system_score_gemma":0.0011292816,"threshold_uncertainty_score":0.01323998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011764394,0.001674825,0.96482164,0.0014971228,0.0011552726,0.0004098171,0.00015693188,0.0027295225,0.015790606],"genre_scores_gemma":[0.19321437,0.0026792767,0.7738563,0.0010011621,0.00087786996,0.00058326387,0.0005723041,0.0002586035,0.026956845],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778455,0.00042825576,0.00011597395,0.00072488,0.0008266959,0.00011971448],"domain_scores_gemma":[0.9987412,0.00026071278,0.00007773887,0.0003118416,0.0004151982,0.00019338385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120625,0.00054794806,0.00096752966,0.00087455515,0.001518576,0.0026235774,0.0032481365,0.0016650066,0.0041583856],"category_scores_gemma":[0.0027430735,0.00037652478,0.00049546274,0.0010373322,0.0008412043,0.0066361665,0.0025097535,0.001344619,0.0023227106],"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.0005295133,0.0003683206,0.0018797744,0.0011859128,0.00023647337,0.0017471773,0.0008624343,0.089080416,0.03714201,0.2862613,0.053662248,0.52704453],"study_design_scores_gemma":[0.00014991668,0.00041264537,0.0005209332,0.00010947657,0.00015208233,0.002140768,0.0003371688,0.4532966,0.013687195,0.12028527,0.40873644,0.00017146693],"about_ca_topic_score_codex":0.0011554874,"about_ca_topic_score_gemma":0.001428345,"teacher_disagreement_score":0.0041583856,"about_ca_system_score_codex":0.00074688473,"about_ca_system_score_gemma":0.0012004881,"threshold_uncertainty_score":0.013911188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16989404,0.0010336958,0.8089721,0.0022276922,0.00015971182,0.00072509446,0.00012841016,0.0038142386,0.013045007],"genre_scores_gemma":[0.95970106,0.00010776262,0.037697136,0.00013619977,0.000053467887,0.000108187895,0.00003479116,0.000053696513,0.0021078384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9897424,0.0041056103,0.0006721782,0.0012904359,0.0032241873,0.0009651465],"domain_scores_gemma":[0.9716123,0.014556673,0.0036228066,0.0060181604,0.0030214568,0.0011686998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007873629,0.0011628701,0.0017303202,0.0015615196,0.0027172354,0.0035690472,0.0031086905,0.0030934203,0.001672345],"category_scores_gemma":[0.0336851,0.0010000827,0.000527881,0.0010204085,0.004276263,0.006368496,0.005759763,0.002371339,0.0006829339],"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.0022090054,0.0015247123,0.018852847,0.00062646857,0.000272627,0.0026116404,0.0027459878,0.39145184,0.024420172,0.24401802,0.011015745,0.3002509],"study_design_scores_gemma":[0.00006249089,0.00023615865,0.0008521359,0.00002427009,0.000032493266,0.00048804295,0.00025775342,0.90300506,0.0044371523,0.08845457,0.0021134843,0.000036393227],"about_ca_topic_score_codex":0.0028609897,"about_ca_topic_score_gemma":0.0020437215,"teacher_disagreement_score":0.007873629,"about_ca_system_score_codex":0.0014551682,"about_ca_system_score_gemma":0.0026849154,"threshold_uncertainty_score":0.041640222},"labels":[],"label_agreement":null},{"id":"W2003261281","doi":"10.1007/s12083-013-0223-5","title":"Peer startup process and initial offset placement in peer-to-peer (P2P) live streaming systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Offset (computer science); Computer science; Joins; Buffer (optical fiber); Peer-to-peer; Computer network; Scheme (mathematics); Real-time computing; Distributed computing; Operating system; Telecommunications; Mathematics","score_opus":0.0196219231650188,"score_gpt":0.28327910681683477,"score_spread":0.26365718365181595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003261281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1077601,0.0009281607,0.883386,0.0002977915,0.00019398502,0.0004457672,0.0001454117,0.002109801,0.0047329306],"genre_scores_gemma":[0.8808842,0.00040568918,0.111991085,0.00005820445,0.00010981195,0.00014671455,0.00019008212,0.0002266263,0.0059875553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977597,0.0003972793,0.00014882248,0.0004486346,0.0009490423,0.00029647112],"domain_scores_gemma":[0.9941796,0.0028158866,0.0004407332,0.00089845364,0.0011989366,0.00046646915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002409573,0.0007177424,0.0014629541,0.00084044837,0.0018213487,0.0022308498,0.0019577353,0.0012981471,0.0028145274],"category_scores_gemma":[0.012251685,0.00067534996,0.00029240779,0.00093538983,0.0010133894,0.003127898,0.0020347463,0.0016031106,0.00081507815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003908359,0.0011644622,0.010886252,0.00046985323,0.00010836594,0.0016459294,0.0020856285,0.29942757,0.083812,0.10043145,0.007737584,0.48832256],"study_design_scores_gemma":[0.00015484133,0.00048368794,0.0026937765,0.000036353656,0.00007759004,0.0005567698,0.00047696714,0.9208531,0.04399112,0.02531829,0.0052521285,0.00010532267],"about_ca_topic_score_codex":0.0043293186,"about_ca_topic_score_gemma":0.004785374,"teacher_disagreement_score":0.0043293186,"about_ca_system_score_codex":0.0009876776,"about_ca_system_score_gemma":0.0023857527,"threshold_uncertainty_score":0.012743235},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052463873,0.00004126176,0.986631,0.0001810429,0.00005581789,0.00008158943,0.000052383675,0.003442455,0.0042682244],"genre_scores_gemma":[0.14949411,0.00019006638,0.8375497,0.00027442345,0.00004801805,0.0004043373,0.00017933191,0.0022685453,0.009591478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985991,0.0004638178,0.00010947086,0.0002191499,0.00041591626,0.00019243872],"domain_scores_gemma":[0.9978351,0.0011321912,0.0002140793,0.0003874258,0.00027940437,0.00015179368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024724056,0.0010274838,0.00043923265,0.00040805753,0.0008970726,0.0020128358,0.0020471048,0.00084578444,0.01048827],"category_scores_gemma":[0.0069590984,0.0007234335,0.00092525664,0.00033997188,0.0015168166,0.0048146327,0.0027371047,0.0026828886,0.0016614738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006834866,0.00022794859,0.0019982248,0.00043968152,0.00006691318,0.00037867742,0.0018111422,0.16050036,0.014847579,0.604568,0.016454484,0.19802357],"study_design_scores_gemma":[0.0001477737,0.00016973371,0.00019290423,0.00012922072,0.000052801,0.00022654515,0.0002129289,0.71694887,0.0171387,0.1817604,0.08295548,0.000064603],"about_ca_topic_score_codex":0.0035031107,"about_ca_topic_score_gemma":0.0058064037,"teacher_disagreement_score":0.01048827,"about_ca_system_score_codex":0.0010066183,"about_ca_system_score_gemma":0.0019848938,"threshold_uncertainty_score":0.03508675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046183456,0.0007063582,0.7381983,0.0011772879,0.0006116831,0.0020132985,0.0009804951,0.1933303,0.016798753],"genre_scores_gemma":[0.5797475,0.0006986732,0.3807031,0.0017541508,0.00025345688,0.0012399205,0.0035724405,0.008086338,0.023944467],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99855655,0.00024792313,0.00016891402,0.00030720764,0.00046410155,0.00025527301],"domain_scores_gemma":[0.99719775,0.00071236736,0.00024948217,0.000753307,0.0004307267,0.00065638276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017636679,0.0010197748,0.00070751726,0.0010188974,0.0010767238,0.00219801,0.0040621394,0.0011695509,0.007162219],"category_scores_gemma":[0.006392432,0.00067739666,0.0006033737,0.00063672103,0.0007296122,0.0032356048,0.00378665,0.0022099642,0.0019450289],"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.0046700127,0.002337592,0.017450968,0.0024779364,0.0005934243,0.0019546833,0.003281308,0.042328697,0.17424925,0.0466788,0.15204719,0.5519302],"study_design_scores_gemma":[0.00089690083,0.00095586333,0.00819727,0.00021439481,0.0002999299,0.00081284187,0.000852861,0.61168236,0.075835325,0.013957122,0.28585622,0.00043894403],"about_ca_topic_score_codex":0.009500491,"about_ca_topic_score_gemma":0.007930176,"teacher_disagreement_score":0.009500491,"about_ca_system_score_codex":0.0016734918,"about_ca_system_score_gemma":0.0025480448,"threshold_uncertainty_score":0.023959994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016830625,0.00044800586,0.91665864,0.0014984417,0.00056526414,0.00027936048,0.00022932455,0.0047494546,0.05874077],"genre_scores_gemma":[0.56904364,0.0007793246,0.385316,0.0007583052,0.0004700012,0.0008041674,0.00059450674,0.0010202292,0.041213814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948002,0.0016508385,0.00034393356,0.001081602,0.0016632674,0.00046020435],"domain_scores_gemma":[0.99500847,0.0018128918,0.00037371178,0.0015826889,0.0007863244,0.00043585087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036293454,0.0005054378,0.0006601674,0.0006651468,0.0016713598,0.0044095167,0.0020606706,0.0014048785,0.009465618],"category_scores_gemma":[0.00852273,0.00043341742,0.00062513124,0.00094647857,0.0021277121,0.004735798,0.005703752,0.0019435133,0.0027459462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002444215,0.0000887124,0.00094007264,0.00021227912,0.00006200605,0.0007393617,0.002521597,0.013140209,0.011391609,0.899971,0.011955121,0.058733482],"study_design_scores_gemma":[0.00023298657,0.00022837977,0.0005523037,0.00010612996,0.00009374551,0.000825622,0.00068970677,0.102320686,0.022204762,0.52153367,0.3510956,0.00011642532],"about_ca_topic_score_codex":0.0017102682,"about_ca_topic_score_gemma":0.0011295258,"teacher_disagreement_score":0.009465618,"about_ca_system_score_codex":0.0008982153,"about_ca_system_score_gemma":0.0019360359,"threshold_uncertainty_score":0.031665623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1594588,0.0007216822,0.83690953,0.00019900296,0.000059138467,0.00007656847,0.000031805237,0.00024849476,0.002294871],"genre_scores_gemma":[0.9593141,0.00021620431,0.039622977,0.000027924762,0.000028233486,0.00004684838,0.000021342203,0.000022883698,0.0006994433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915636,0.00034379962,0.000034889257,0.00015178739,0.00020670149,0.00010645694],"domain_scores_gemma":[0.9983368,0.0009591616,0.00022908994,0.000108904766,0.0002514811,0.0001145258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015220831,0.000621095,0.001011603,0.00065259665,0.00085286045,0.00068229967,0.0012827654,0.00054239173,0.0004985912],"category_scores_gemma":[0.0031092893,0.0004252418,0.00030742577,0.00067523634,0.0007033036,0.001157841,0.000729512,0.00040773107,0.00012611943],"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.00025543605,0.00008391652,0.00045583717,0.00007260708,0.000031617117,0.00013323192,0.00015269594,0.94595504,0.0068770344,0.012080027,0.00069070427,0.033211842],"study_design_scores_gemma":[0.000012536839,0.000040148312,0.00007533985,0.0000017027359,0.000006294787,0.000016296726,0.000019862899,0.9958824,0.0008472308,0.0029274682,0.00016574017,0.0000050397643],"about_ca_topic_score_codex":0.0037516032,"about_ca_topic_score_gemma":0.002925868,"teacher_disagreement_score":0.0037516032,"about_ca_system_score_codex":0.0011800965,"about_ca_system_score_gemma":0.0010297338,"threshold_uncertainty_score":0.008562267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05132407,0.0011288747,0.9379454,0.0006129455,0.00022663678,0.00030514217,0.00016677332,0.0040091113,0.004280964],"genre_scores_gemma":[0.7472673,0.00078618573,0.24505351,0.0003515259,0.000228732,0.00036551757,0.00045809028,0.00023167179,0.0052574556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753773,0.0006049116,0.00023148672,0.0003746232,0.0010363667,0.00021488921],"domain_scores_gemma":[0.99413,0.0022285234,0.0006941548,0.0018698646,0.0007739313,0.00030356296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026350992,0.0006472018,0.0014755243,0.000972865,0.0015466309,0.0021411332,0.0026419857,0.0011518729,0.0022707733],"category_scores_gemma":[0.007991956,0.0008079296,0.0004465005,0.0013081932,0.0011333812,0.0027212622,0.002609512,0.0011294569,0.0012185564],"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.0008124843,0.00032242262,0.0033453717,0.0006309858,0.00021752904,0.0009062215,0.0012795407,0.63818604,0.03472371,0.10264222,0.0112994425,0.2056341],"study_design_scores_gemma":[0.00022741599,0.00028395164,0.0006611758,0.00002907279,0.00008338615,0.00051535433,0.0002315023,0.8935908,0.013724236,0.06607333,0.024508294,0.00007139316],"about_ca_topic_score_codex":0.00091676775,"about_ca_topic_score_gemma":0.00086561433,"teacher_disagreement_score":0.0026419857,"about_ca_system_score_codex":0.0007929251,"about_ca_system_score_gemma":0.000918082,"threshold_uncertainty_score":0.013935924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12026336,0.00030146659,0.8749192,0.00029132777,0.000045562636,0.00009719222,0.000041629355,0.00058996887,0.0034503376],"genre_scores_gemma":[0.94438154,0.00020292425,0.05401833,0.000055495027,0.000027486629,0.00009331102,0.00004114188,0.000026886697,0.0011529413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996216,0.00012688953,0.000018183879,0.00007605668,0.000099550685,0.00005767439],"domain_scores_gemma":[0.99922943,0.00032529462,0.000109245135,0.00011150631,0.00014628853,0.00007827064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049741636,0.0003746415,0.0003973144,0.00062233396,0.00066244707,0.00068434153,0.0007541792,0.0005542646,0.000879294],"category_scores_gemma":[0.0020477634,0.00019203148,0.00018303747,0.0006261566,0.00058361824,0.0012379722,0.0010262732,0.00044219318,0.00022141194],"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.00031477588,0.00014904424,0.0037917565,0.00020470886,0.000061386665,0.00048690947,0.00031346007,0.7610535,0.06998929,0.04433279,0.0029209557,0.116381384],"study_design_scores_gemma":[0.000022140635,0.00008966565,0.00041805772,0.000007632607,0.00001337157,0.00016126463,0.00006869039,0.9806583,0.005448363,0.010766161,0.0023354432,0.0000108780405],"about_ca_topic_score_codex":0.0008443732,"about_ca_topic_score_gemma":0.0008419332,"teacher_disagreement_score":0.000879294,"about_ca_system_score_codex":0.00055633456,"about_ca_system_score_gemma":0.0004329502,"threshold_uncertainty_score":0.004036486},"labels":[],"label_agreement":null},{"id":"W2005930142","doi":"10.1007/s12083-008-0025-3","title":"XCube: Processing XPath queries in a hypercube overlay network","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bit array; Information retrieval; XPath; Identifier; XML; Node (physics); Matching (statistics); Data mining; Database; XML database; World Wide Web; Computer network","score_opus":0.013718367285484636,"score_gpt":0.26826220524935623,"score_spread":0.2545438379638716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005930142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20287286,0.0010370163,0.65364623,0.00070282497,0.00034670447,0.00078577205,0.0031269493,0.118764065,0.018717637],"genre_scores_gemma":[0.47786406,0.00095197745,0.47531408,0.00028002475,0.00011082605,0.00047818423,0.009879581,0.004229165,0.030892039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993352,0.00009508705,0.000046807792,0.00009764629,0.00034917562,0.000076005825],"domain_scores_gemma":[0.9991037,0.00031596422,0.00004299353,0.00020111336,0.00024216094,0.0000940587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085466646,0.00075767486,0.00088362786,0.0010113906,0.00086386956,0.0014588604,0.0019322516,0.0007056729,0.009110641],"category_scores_gemma":[0.001985699,0.0004859123,0.0003352395,0.0012549021,0.0005756445,0.0022796255,0.0018449867,0.0007170957,0.0015696954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005460155,0.0006138353,0.008421117,0.0011872988,0.0003817869,0.0019107688,0.0016690341,0.064587146,0.12614386,0.020131882,0.11853711,0.6509561],"study_design_scores_gemma":[0.00047062844,0.00046664677,0.002783988,0.000054288652,0.00009411995,0.000673427,0.0008829087,0.83714104,0.105346456,0.009535582,0.042463474,0.00008742992],"about_ca_topic_score_codex":0.0094708195,"about_ca_topic_score_gemma":0.011930632,"teacher_disagreement_score":0.0094708195,"about_ca_system_score_codex":0.0006764328,"about_ca_system_score_gemma":0.0008596527,"threshold_uncertainty_score":0.03047812},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024066644,0.00088075496,0.98193365,0.0012475922,0.00014107152,0.000080121834,0.000118065414,0.00014119467,0.013050872],"genre_scores_gemma":[0.55079514,0.0090013575,0.38879812,0.0012081247,0.0012187922,0.0018449886,0.00042585834,0.00026538322,0.046442326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994999,0.00012963878,0.000026051785,0.00006524108,0.00022895256,0.000050114322],"domain_scores_gemma":[0.9994143,0.00028232855,0.000086019914,0.00003885046,0.00015108645,0.000027383241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777035,0.00096167775,0.000827372,0.0009380793,0.00071941473,0.0014372714,0.002382123,0.0019997852,0.0027638962],"category_scores_gemma":[0.0026987894,0.00053964625,0.0008749098,0.0009930634,0.0010649713,0.0018992978,0.0011083273,0.0019191689,0.0007742429],"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.00000982181,0.000044361,0.00018332424,0.0001005572,0.000026182826,0.00016976288,0.00016296258,0.59728485,0.0020783425,0.38907802,0.0025085048,0.008353377],"study_design_scores_gemma":[0.0000053001863,0.00001649342,0.000041781495,0.000012287627,0.000007696216,0.000048969207,0.000021128044,0.9405762,0.00016140503,0.05275575,0.006343496,0.000009602506],"about_ca_topic_score_codex":0.0059379274,"about_ca_topic_score_gemma":0.003011056,"teacher_disagreement_score":0.0059379274,"about_ca_system_score_codex":0.001915166,"about_ca_system_score_gemma":0.0015011401,"threshold_uncertainty_score":0.013895631},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046269774,0.16366005,0.5998955,0.07247923,0.0023861348,0.00040708316,0.00021219696,0.0011860558,0.11350405],"genre_scores_gemma":[0.6677512,0.12833183,0.17985876,0.0024683406,0.0073551456,0.00056951813,0.00022891085,0.00024700395,0.013189374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945589,0.0018186496,0.00020483998,0.0004863402,0.0025408682,0.00039039907],"domain_scores_gemma":[0.99039817,0.0069588674,0.00037281713,0.0005148403,0.0013013317,0.00045397313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058669574,0.0004813011,0.0013240308,0.0013314106,0.0028169106,0.0056946077,0.0028106023,0.0041882,0.002818021],"category_scores_gemma":[0.01313846,0.0008108929,0.0003970632,0.0019606946,0.0033211003,0.01342242,0.0029259278,0.0029990645,0.0012962247],"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.00019489144,0.000147613,0.0023536484,0.0014496866,0.000040226394,0.0011142984,0.0021128815,0.020084431,0.0035561167,0.5769468,0.020844972,0.3711544],"study_design_scores_gemma":[0.000052764088,0.00023096264,0.0010594879,0.00048936263,0.000055578028,0.0021821284,0.0031595435,0.111936755,0.0025537857,0.6226488,0.25551033,0.00012048771],"about_ca_topic_score_codex":0.0013560156,"about_ca_topic_score_gemma":0.0012530138,"teacher_disagreement_score":0.0058669574,"about_ca_system_score_codex":0.001336719,"about_ca_system_score_gemma":0.0017604219,"threshold_uncertainty_score":0.031027794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5977174,0.004089901,0.37569782,0.0009048398,0.00023273293,0.00013383821,0.0009904265,0.001074116,0.019158948],"genre_scores_gemma":[0.99479103,0.0002974764,0.0039541307,0.000018316146,0.000030765266,0.000016520627,0.00008637916,0.000026518837,0.0007789263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992725,0.00014219043,0.000022225448,0.00012441755,0.00021143744,0.00022713865],"domain_scores_gemma":[0.9953772,0.0029675588,0.00026211736,0.00022400425,0.0010124326,0.00015676122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009881514,0.00058591034,0.0007281261,0.0012195418,0.0006683226,0.0011977649,0.0011925526,0.0007248983,0.0024618884],"category_scores_gemma":[0.006047198,0.0002535854,0.0003544203,0.0012012419,0.0007178399,0.0016382773,0.00058831373,0.000579472,0.00026133927],"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.00036713778,0.000072894356,0.0014045679,0.00018915403,0.000041420033,0.0002706206,0.0001279037,0.92843276,0.014960512,0.040630408,0.0021277799,0.011374885],"study_design_scores_gemma":[0.0000024087826,0.000021385098,0.00016087721,0.000003553783,0.000007437227,0.00003496674,0.000026303116,0.99622583,0.0011983719,0.0021636148,0.00014930236,0.0000059678187],"about_ca_topic_score_codex":0.009987817,"about_ca_topic_score_gemma":0.0040751644,"teacher_disagreement_score":0.009987817,"about_ca_system_score_codex":0.0026569762,"about_ca_system_score_gemma":0.0013333795,"threshold_uncertainty_score":0.019859374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076070495,0.014611415,0.8608486,0.007948688,0.0013464446,0.00051372463,0.0003552472,0.0017545444,0.036550872],"genre_scores_gemma":[0.9154392,0.0031457671,0.07063309,0.00072354503,0.0007184901,0.0001399685,0.00022627231,0.00006531008,0.008908414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982728,0.0007776045,0.00009214497,0.00032090675,0.00040697563,0.00012966075],"domain_scores_gemma":[0.99675,0.0017960208,0.00032942076,0.0005044949,0.0004338984,0.00018614743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002241604,0.00042162734,0.00061781594,0.0007172614,0.0008517482,0.0016965171,0.0011669352,0.0021940104,0.004040406],"category_scores_gemma":[0.007876259,0.0003169514,0.00024315887,0.0010928466,0.0010121024,0.003391027,0.0026936517,0.0010598414,0.001439178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023485145,0.00052333146,0.0071004066,0.0018078627,0.00016089578,0.0022365134,0.0018392542,0.10758625,0.060723744,0.20866306,0.042273033,0.56473714],"study_design_scores_gemma":[0.00024324987,0.0009888452,0.0054540834,0.00032020305,0.00010827213,0.0028572257,0.001411971,0.69506687,0.025606615,0.14205855,0.12574013,0.00014391134],"about_ca_topic_score_codex":0.00074158894,"about_ca_topic_score_gemma":0.00072026293,"teacher_disagreement_score":0.004040406,"about_ca_system_score_codex":0.00065277424,"about_ca_system_score_gemma":0.0005367221,"threshold_uncertainty_score":0.013516545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06517215,0.0013434209,0.92512184,0.000619089,0.00010401055,0.00011178611,0.00005646985,0.00042318273,0.007048003],"genre_scores_gemma":[0.9296627,0.0009560111,0.06707421,0.0000705915,0.000051620882,0.00009523244,0.0000493022,0.000046753677,0.0019934638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.00051449967,0.00004003205,0.00013300427,0.00031676583,0.00009788468],"domain_scores_gemma":[0.9965688,0.002427491,0.0002790985,0.0002366761,0.0003631109,0.00012488547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019322525,0.0005123856,0.0008167093,0.00073021726,0.0008598382,0.0014115672,0.0012855602,0.0009938626,0.0011175739],"category_scores_gemma":[0.0076092496,0.00036962872,0.0002943739,0.00095409155,0.0018413478,0.0022977183,0.0010106185,0.0007316637,0.00014602218],"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.0000657723,0.000027475324,0.00042835847,0.000069847854,0.000021979504,0.00011671775,0.00007605638,0.92146975,0.0020008234,0.059085418,0.0007739586,0.01586389],"study_design_scores_gemma":[0.000011794405,0.000036931426,0.000114016264,0.0000052453684,0.0000072885723,0.000051357838,0.00003284147,0.96604574,0.0005564003,0.03233866,0.00079277094,0.0000069778707],"about_ca_topic_score_codex":0.0035667247,"about_ca_topic_score_gemma":0.0019291817,"teacher_disagreement_score":0.0035667247,"about_ca_system_score_codex":0.0010452728,"about_ca_system_score_gemma":0.0008621653,"threshold_uncertainty_score":0.010218799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01568801,0.007862713,0.9339787,0.0028723576,0.0012875001,0.0002600084,0.00023418538,0.0062822867,0.031534277],"genre_scores_gemma":[0.6173996,0.0064975484,0.35189682,0.0013542603,0.0011175226,0.0004631516,0.0006223447,0.0007989289,0.019849863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976311,0.0005131337,0.00018580661,0.0004846168,0.0009104125,0.00027502974],"domain_scores_gemma":[0.9963612,0.0010090239,0.00016934905,0.0013773949,0.0006324049,0.00045066344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023571914,0.0006722817,0.00090561516,0.0008746418,0.0010409332,0.0029913066,0.002346115,0.0010688961,0.006368496],"category_scores_gemma":[0.008119239,0.00045000896,0.00044304508,0.0020292636,0.0020058278,0.0037646159,0.0033921716,0.0022580244,0.002023295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092781015,0.0001461321,0.0010553456,0.0007093396,0.00008959546,0.00042030108,0.0006130012,0.08881808,0.0129567515,0.4801961,0.04016179,0.3739058],"study_design_scores_gemma":[0.00019446043,0.00024552114,0.00048654186,0.00015560676,0.000065644075,0.00063183287,0.00021951397,0.40881813,0.008801246,0.37612215,0.20418571,0.000073541014],"about_ca_topic_score_codex":0.0011255683,"about_ca_topic_score_gemma":0.00093146024,"teacher_disagreement_score":0.006368496,"about_ca_system_score_codex":0.0013381304,"about_ca_system_score_gemma":0.001364182,"threshold_uncertainty_score":0.021304727},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043951357,0.0050556115,0.049125433,0.049776673,0.03843031,0.00060347194,0.0049438584,0.0070555275,0.84061396],"genre_scores_gemma":[0.027111886,0.0033094564,0.023951925,0.010664961,0.005236458,0.0005539382,0.010983328,0.0023657428,0.91582227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980654,0.0003126007,0.00007874861,0.00038036625,0.000775152,0.0003877455],"domain_scores_gemma":[0.9972128,0.000259117,0.00008820166,0.0004166254,0.00094820384,0.0010750954],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023788852,0.0011826747,0.0006200481,0.0009955087,0.0024433355,0.004958769,0.0027476938,0.002960251,0.28217503],"category_scores_gemma":[0.0048275567,0.00038514094,0.0006942972,0.0007313333,0.0007351057,0.0046641505,0.0065950584,0.0027961738,0.17034428],"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.00011143626,0.000055079792,0.00038346075,0.00017082144,0.000012563795,0.00016491262,0.00014674952,0.00042593628,0.0010768658,0.029671198,0.8227131,0.14506795],"study_design_scores_gemma":[0.0000073404362,0.000020778365,0.00012383457,0.000030027955,0.0000024198296,0.00008537999,0.00006672892,0.00021151367,0.00020759519,0.0035179972,0.99572045,0.0000060112006],"about_ca_topic_score_codex":0.0026516267,"about_ca_topic_score_gemma":0.005227686,"teacher_disagreement_score":0.71782494,"about_ca_system_score_codex":0.0015197094,"about_ca_system_score_gemma":0.0030936352,"threshold_uncertainty_score":0.94396955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037744556,0.0013390582,0.9523736,0.00047519393,0.00007425882,0.00014919115,0.00013948728,0.00044049943,0.007264118],"genre_scores_gemma":[0.8643797,0.001969856,0.12892747,0.00012151148,0.00017260104,0.00044663946,0.00020113589,0.00012644308,0.0036546055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973943,0.0009556169,0.00014369201,0.00044033834,0.0007874105,0.00027851545],"domain_scores_gemma":[0.9885902,0.008746014,0.0008984915,0.0006830743,0.0006891621,0.0003930103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026789848,0.001225972,0.0013097049,0.00079301774,0.0009831659,0.0020558753,0.0024827325,0.0009983615,0.0021068528],"category_scores_gemma":[0.013440503,0.00052864186,0.0005154921,0.0010284132,0.0022084215,0.0037886759,0.0020753487,0.0012136451,0.00040682004],"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.00026856834,0.00010857685,0.0013627735,0.0005455298,0.00006209605,0.0007615364,0.0006742015,0.552592,0.025028814,0.3631945,0.0020555172,0.053345874],"study_design_scores_gemma":[0.00002774363,0.00018846802,0.00032599593,0.000040678453,0.00003093146,0.0003357458,0.00010140371,0.7938893,0.010209738,0.18913952,0.0056772153,0.00003331881],"about_ca_topic_score_codex":0.0009198853,"about_ca_topic_score_gemma":0.0004117541,"teacher_disagreement_score":0.0026789848,"about_ca_system_score_codex":0.0015028279,"about_ca_system_score_gemma":0.0008818834,"threshold_uncertainty_score":0.014168024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12533928,0.00042544602,0.84810686,0.0010086132,0.00011398025,0.0005606314,0.00019600558,0.02025601,0.0039931997],"genre_scores_gemma":[0.8448325,0.00015966034,0.15184763,0.0003202815,0.00006467295,0.00013084544,0.00022570557,0.0004053148,0.002013479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98586905,0.0038073426,0.0012198779,0.0017644145,0.006021799,0.0013173738],"domain_scores_gemma":[0.93991965,0.016226612,0.006204294,0.027539143,0.008791375,0.0013190381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00949919,0.00070876745,0.0010230386,0.0014163413,0.0014072969,0.0042246473,0.004618628,0.002237063,0.0020715778],"category_scores_gemma":[0.043770384,0.0009489852,0.00085023954,0.000939421,0.003084824,0.010096671,0.006660017,0.0040215594,0.0011707514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031065827,0.0010889973,0.036907874,0.0007400087,0.00026468516,0.001686622,0.0034914976,0.2078098,0.11864687,0.1293975,0.010658362,0.4862012],"study_design_scores_gemma":[0.00010150469,0.00021285133,0.0010898876,0.00005440439,0.000049731203,0.00030150803,0.00025670193,0.9220733,0.04786382,0.022438442,0.00549171,0.00006618353],"about_ca_topic_score_codex":0.0073662647,"about_ca_topic_score_gemma":0.0037858495,"teacher_disagreement_score":0.00949919,"about_ca_system_score_codex":0.0024119834,"about_ca_system_score_gemma":0.0052356366,"threshold_uncertainty_score":0.05023712},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013322412,0.68659186,0.23313542,0.004490197,0.002200901,0.0006106548,0.00062215753,0.0015954177,0.05743088],"genre_scores_gemma":[0.060017366,0.775614,0.13825849,0.0018470568,0.0032622765,0.00079312385,0.0014784375,0.00023522263,0.01849394],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983443,0.00028112833,0.00021587482,0.0001465338,0.00090086757,0.00011126823],"domain_scores_gemma":[0.9985007,0.0006969912,0.000121472025,0.00010694626,0.0005125843,0.00006134827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015814933,0.00091977534,0.000981994,0.0031594245,0.0011753154,0.0024067836,0.0017380442,0.0018767751,0.0034471487],"category_scores_gemma":[0.0034501054,0.00061334675,0.0005633445,0.0066185617,0.00043934197,0.0041392916,0.000932616,0.0016129968,0.0021155695],"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.00010501004,0.00014094697,0.0014000044,0.0039760773,0.000052850628,0.000287158,0.00035877983,0.0047897296,0.0047923913,0.05994544,0.027342118,0.8968095],"study_design_scores_gemma":[0.000025300804,0.00022766035,0.0017213081,0.0017234279,0.00011036066,0.0020599484,0.00031211312,0.02044903,0.0035258338,0.032324336,0.93745184,0.00006884585],"about_ca_topic_score_codex":0.0011380764,"about_ca_topic_score_gemma":0.00080911384,"teacher_disagreement_score":0.0034471487,"about_ca_system_score_codex":0.0008085623,"about_ca_system_score_gemma":0.0014788173,"threshold_uncertainty_score":0.01153183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024823697,0.0005064205,0.93806326,0.0003009369,0.00031516957,0.00036911527,0.00023164909,0.030039584,0.005350104],"genre_scores_gemma":[0.5860541,0.00066486216,0.39744338,0.0004884745,0.00024195315,0.0004181528,0.0010733631,0.0018320774,0.01178357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999209,0.00019055464,0.00007944347,0.000098473494,0.00030195832,0.00012056529],"domain_scores_gemma":[0.9992318,0.00018957781,0.00004659541,0.00019214717,0.00015974484,0.0001801439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020124374,0.00062686834,0.0010840658,0.00062748307,0.0010704007,0.002231975,0.0023507432,0.0013652282,0.00265442],"category_scores_gemma":[0.0017291147,0.00067410024,0.0006434648,0.00038957654,0.0007154615,0.0017401569,0.0018601667,0.0017257319,0.0013516388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004489139,0.0014633335,0.003928884,0.00089099724,0.00055401894,0.0024860231,0.0013942521,0.17275959,0.1328592,0.14926395,0.06688873,0.46302187],"study_design_scores_gemma":[0.00015003729,0.00025929857,0.0007703181,0.00006299862,0.00013239494,0.00046096861,0.00010130889,0.9087007,0.031068947,0.020882102,0.037301846,0.000109015156],"about_ca_topic_score_codex":0.002266855,"about_ca_topic_score_gemma":0.0023165154,"teacher_disagreement_score":0.00265442,"about_ca_system_score_codex":0.0006384149,"about_ca_system_score_gemma":0.0011653062,"threshold_uncertainty_score":0.010642886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2066487,0.0022348538,0.7629622,0.002018976,0.00010487108,0.00014150381,0.0003098108,0.00041024046,0.02516886],"genre_scores_gemma":[0.98178333,0.00082201965,0.013027457,0.000109307424,0.000041809748,0.00009242952,0.00008225949,0.000061627434,0.003979801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948454,0.00013583252,0.000016133414,0.00008546401,0.00014769576,0.00013031073],"domain_scores_gemma":[0.99925524,0.00037770357,0.000098640005,0.000049638722,0.00014876694,0.00006995417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089716114,0.000694466,0.00090886327,0.00065487885,0.0006385241,0.0011929554,0.0021416447,0.0017633539,0.0011598704],"category_scores_gemma":[0.0025286423,0.00058493,0.0007310065,0.00060074765,0.0012490578,0.0018029422,0.0010405539,0.0012771088,0.00026696792],"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.00001569556,0.000025524194,0.0003709945,0.000019788702,0.000007179936,0.000052638734,0.00004753482,0.9833809,0.0008648083,0.01303155,0.00033370024,0.0018496156],"study_design_scores_gemma":[0.000001020456,0.0000028731138,0.000046197918,0.0000015714444,9.999574e-7,0.0000051226607,0.000006436124,0.998175,0.00004052194,0.0016219122,0.00009631558,0.000002057042],"about_ca_topic_score_codex":0.014734878,"about_ca_topic_score_gemma":0.0046472843,"teacher_disagreement_score":0.014734878,"about_ca_system_score_codex":0.0023333803,"about_ca_system_score_gemma":0.0009662027,"threshold_uncertainty_score":0.029298186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16405642,0.0033690012,0.7193567,0.0012235764,0.0006757472,0.0014458146,0.0011644234,0.090306826,0.018401474],"genre_scores_gemma":[0.77054256,0.0009821118,0.21383463,0.0005107272,0.00010068129,0.00041996888,0.0016729225,0.0011878092,0.010748569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928385,0.0001229236,0.00009485438,0.00017408746,0.00020836593,0.00011600707],"domain_scores_gemma":[0.9993168,0.0001333151,0.00008259357,0.000198958,0.00011909536,0.00014921004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072810176,0.00085641467,0.00064140843,0.0005987795,0.0007489392,0.0014440991,0.0019369692,0.00090632914,0.0023173322],"category_scores_gemma":[0.002003175,0.0006094446,0.0004380861,0.0003609374,0.0004544032,0.0021459903,0.002433987,0.0013809425,0.0006144462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003032723,0.001480944,0.02112164,0.0027260324,0.00076738757,0.002658583,0.002395612,0.10847279,0.21027647,0.03325664,0.050291996,0.56351924],"study_design_scores_gemma":[0.00042335555,0.00064869365,0.010001721,0.00017173958,0.00038464722,0.0017067012,0.00069460867,0.7023219,0.09583123,0.0115701165,0.17594247,0.00030278802],"about_ca_topic_score_codex":0.003281041,"about_ca_topic_score_gemma":0.003053328,"teacher_disagreement_score":0.003281041,"about_ca_system_score_codex":0.00054751296,"about_ca_system_score_gemma":0.0010061072,"threshold_uncertainty_score":0.0077522993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014042613,0.00014324747,0.97923696,0.00073644536,0.000058991955,0.00016453206,0.00003766343,0.00009307656,0.005486359],"genre_scores_gemma":[0.7668645,0.0004106023,0.22683363,0.0002800274,0.00018275289,0.0005057112,0.00006306039,0.00004507492,0.0048147114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99441385,0.0027324713,0.00029426464,0.00091851735,0.0012764677,0.00036445528],"domain_scores_gemma":[0.9929005,0.0042434833,0.0008117817,0.0009181789,0.00070708495,0.00041903128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006245057,0.0009133496,0.0015256301,0.0011398542,0.0012072186,0.003253289,0.004295662,0.002784327,0.0023452223],"category_scores_gemma":[0.013011706,0.0005523383,0.0012460159,0.0010451851,0.0039181774,0.005012129,0.002603491,0.002595439,0.00036618055],"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.000112507114,0.00016931862,0.00036427184,0.0001367487,0.00013036115,0.00022204689,0.0002656647,0.41957676,0.0036739663,0.550079,0.0011110506,0.024158297],"study_design_scores_gemma":[0.000046282796,0.00008608004,0.000083537285,0.000013372365,0.000024319063,0.000085816275,0.000026086362,0.7764221,0.0007698433,0.22074173,0.0016708199,0.000029972123],"about_ca_topic_score_codex":0.0013469575,"about_ca_topic_score_gemma":0.0008886673,"teacher_disagreement_score":0.006245057,"about_ca_system_score_codex":0.0020791958,"about_ca_system_score_gemma":0.0022343316,"threshold_uncertainty_score":0.03302741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032354347,0.0005961422,0.96142685,0.00054716144,0.00009304081,0.00019977709,0.00010249658,0.0011127794,0.003567425],"genre_scores_gemma":[0.6074309,0.00085731054,0.3861037,0.00014678623,0.00010976348,0.00026970851,0.00021085051,0.00016674066,0.004704303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975738,0.0008197733,0.00017213987,0.0003899034,0.0008923599,0.00015194088],"domain_scores_gemma":[0.99372005,0.0028938996,0.0005598218,0.0017508202,0.00088049914,0.0001948134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024074777,0.00056791404,0.0006866032,0.0006052274,0.0020470377,0.0021244788,0.0021237491,0.0020131203,0.0015966753],"category_scores_gemma":[0.012955889,0.0006222136,0.0004227758,0.0011192226,0.0017410972,0.0033541739,0.0025700477,0.0009836128,0.0010356456],"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.0004292393,0.00011445187,0.0037641537,0.0005293175,0.00007927161,0.0017834284,0.001156129,0.5798458,0.01824276,0.2302814,0.008118326,0.1556558],"study_design_scores_gemma":[0.00010808048,0.0000938749,0.00031563174,0.000040776133,0.000039382376,0.00060924736,0.00017077128,0.7889622,0.007593237,0.19051255,0.011508982,0.000045308007],"about_ca_topic_score_codex":0.0023612564,"about_ca_topic_score_gemma":0.0013839746,"teacher_disagreement_score":0.0024074777,"about_ca_system_score_codex":0.0007896097,"about_ca_system_score_gemma":0.0011801572,"threshold_uncertainty_score":0.012732089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068645425,0.010330696,0.83958703,0.036415197,0.0005043544,0.00021393869,0.000102116974,0.0006222004,0.043579053],"genre_scores_gemma":[0.81215614,0.0037681446,0.16904509,0.0023899851,0.0009772793,0.000329988,0.0000898997,0.00041045825,0.010833096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9856441,0.0066444194,0.000737436,0.001600212,0.0039389734,0.0014348374],"domain_scores_gemma":[0.9471853,0.03867367,0.0019639584,0.008096324,0.0023958595,0.0016848636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015330688,0.0008856425,0.0032470496,0.0028282795,0.0028756384,0.009701566,0.0043215086,0.00686659,0.004534801],"category_scores_gemma":[0.06471469,0.00087848597,0.0016356526,0.004701446,0.009214401,0.020657223,0.011086961,0.006386372,0.0010650139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018632915,0.000052422147,0.0008119777,0.00024717912,0.00009299082,0.00034336638,0.0010411872,0.032854844,0.0014107978,0.8651793,0.0037507946,0.094028845],"study_design_scores_gemma":[0.00013710493,0.000058507077,0.00026663204,0.000085497166,0.000050945295,0.00045728107,0.00040593222,0.08361725,0.00095644046,0.89971036,0.014210903,0.00004308125],"about_ca_topic_score_codex":0.0016098301,"about_ca_topic_score_gemma":0.0013727458,"teacher_disagreement_score":0.015330688,"about_ca_system_score_codex":0.00324402,"about_ca_system_score_gemma":0.0028560734,"threshold_uncertainty_score":0.0810774},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15195812,0.001134809,0.81105405,0.0005648292,0.00051949965,0.00035263717,0.00015084299,0.02343974,0.010825485],"genre_scores_gemma":[0.8751157,0.0003113061,0.11437903,0.00023759516,0.00009747817,0.00019239227,0.0003063599,0.0008235219,0.008536688],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978016,0.00042250013,0.00017222254,0.00036759063,0.00084487983,0.00039118034],"domain_scores_gemma":[0.9957891,0.00074393966,0.00037999527,0.0019049078,0.0006381299,0.00054394495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016272623,0.00074249087,0.00071309233,0.0006736687,0.0010492046,0.0032725113,0.0047348114,0.0013897821,0.0036948535],"category_scores_gemma":[0.0069192927,0.0006131898,0.0003622772,0.0009495658,0.0010010841,0.005494768,0.004458722,0.001631131,0.0011549625],"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.0056030005,0.0014299706,0.021876719,0.0012020523,0.00032591,0.0014306329,0.0018761515,0.11483232,0.23276433,0.090460405,0.02627022,0.5019282],"study_design_scores_gemma":[0.00041918378,0.0012066732,0.00332731,0.00008460493,0.0001333697,0.0010354902,0.0005211891,0.80351543,0.12176323,0.020198064,0.047629267,0.00016625217],"about_ca_topic_score_codex":0.0011234896,"about_ca_topic_score_gemma":0.0008331819,"teacher_disagreement_score":0.0047348114,"about_ca_system_score_codex":0.0009995888,"about_ca_system_score_gemma":0.0011909476,"threshold_uncertainty_score":0.012360573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65623945,0.00052533374,0.33772573,0.00048385057,0.000022751054,0.00024314896,0.00015791261,0.0016681576,0.0029336624],"genre_scores_gemma":[0.93204165,0.00007717675,0.066438586,0.000055697637,0.000012375772,0.000049588514,0.0001479954,0.000044281867,0.0011326426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957371,0.0014530455,0.00020619873,0.0012462953,0.0009081106,0.00044935299],"domain_scores_gemma":[0.9938351,0.0030288815,0.0007133297,0.0012040321,0.0006884129,0.00053020474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043445574,0.0007554226,0.001168974,0.0010211432,0.0016078692,0.001219554,0.0019373347,0.00083674665,0.0011818919],"category_scores_gemma":[0.012432529,0.0005709412,0.00036166108,0.0012675823,0.0011312901,0.00336513,0.0026612342,0.0007005024,0.00031609315],"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.0010920402,0.0009180386,0.041834872,0.00030900046,0.00023317561,0.000821143,0.0022644803,0.576588,0.06045908,0.023735806,0.005021989,0.28672245],"study_design_scores_gemma":[0.00006641292,0.00036449873,0.0054658283,0.0000065591403,0.00005383485,0.00027127378,0.00060682447,0.9670049,0.0129327,0.010041568,0.0031493215,0.000036373513],"about_ca_topic_score_codex":0.0102142645,"about_ca_topic_score_gemma":0.010229837,"teacher_disagreement_score":0.0102142645,"about_ca_system_score_codex":0.0012710522,"about_ca_system_score_gemma":0.0021938558,"threshold_uncertainty_score":0.022976458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8822343,0.00061083096,0.10144285,0.00015681454,0.00007189983,0.00015727582,0.00017500167,0.0018943109,0.013256747],"genre_scores_gemma":[0.9719815,0.00021660725,0.02469179,0.000035834175,0.000023428032,0.000041029543,0.00009417874,0.000059720976,0.0028559717],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997689,0.000058353486,0.000014467778,0.000039249004,0.000082559105,0.00003643146],"domain_scores_gemma":[0.9992995,0.0003342001,0.00006586284,0.000079998244,0.0001406322,0.00007969799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020539097,0.00047800652,0.00041632878,0.0005144133,0.00019361777,0.00083554443,0.0004796713,0.0004228405,0.005118797],"category_scores_gemma":[0.0013951594,0.00015736753,0.00025201583,0.00031485135,0.00008818099,0.001013082,0.0006845849,0.00035915256,0.00054205477],"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.001893167,0.0029702291,0.019050237,0.00059744075,0.00016250194,0.00034676303,0.00066207175,0.007503454,0.3151929,0.0011061865,0.0021350791,0.64837986],"study_design_scores_gemma":[0.00042820044,0.0071848175,0.3364823,0.00020262184,0.001802107,0.0021664174,0.002536035,0.2858629,0.33773953,0.004105602,0.02120991,0.00027953068],"about_ca_topic_score_codex":0.00083520846,"about_ca_topic_score_gemma":0.0016939145,"teacher_disagreement_score":0.005118797,"about_ca_system_score_codex":0.00009635383,"about_ca_system_score_gemma":0.00016314394,"threshold_uncertainty_score":0.017124057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13479178,0.0005116065,0.8610938,0.00018478496,0.00004406567,0.00013250783,0.000082698025,0.0009123487,0.0022464127],"genre_scores_gemma":[0.88062656,0.00029364935,0.117856875,0.000047147005,0.000032324682,0.00007415788,0.00014721048,0.00011799578,0.00080403045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922895,0.00024763905,0.000042903812,0.0001302579,0.00023358711,0.000116651565],"domain_scores_gemma":[0.9985702,0.00078156556,0.0001733102,0.00013059852,0.00023122036,0.00011310393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012097833,0.000697215,0.000883686,0.00039957557,0.00066863257,0.00067083875,0.0014965009,0.0006023642,0.0010655462],"category_scores_gemma":[0.0035304856,0.00039543494,0.00034564495,0.0006292879,0.0005594981,0.0009863249,0.00058784435,0.00071046076,0.00017417061],"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.00011512526,0.00005042273,0.0003751694,0.000048881968,0.000015009786,0.00005102707,0.000075550895,0.9720025,0.0051571922,0.0030175392,0.00066534686,0.018426146],"study_design_scores_gemma":[0.000010873789,0.000034325796,0.0000832654,0.0000016585063,0.000004349028,0.00001206669,0.00001411132,0.9971698,0.0011078691,0.001339995,0.00021846256,0.0000032130722],"about_ca_topic_score_codex":0.0077557056,"about_ca_topic_score_gemma":0.0041181194,"teacher_disagreement_score":0.0077557056,"about_ca_system_score_codex":0.0012832577,"about_ca_system_score_gemma":0.0013353709,"threshold_uncertainty_score":0.0154210925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23898005,0.0005703783,0.7403653,0.00096387387,0.00006469736,0.0003844361,0.00024908132,0.00071047846,0.017711716],"genre_scores_gemma":[0.9708189,0.00020278861,0.026523052,0.000030037696,0.000021161104,0.00014215709,0.00008193213,0.000035312547,0.0021447227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.00030810374,0.00004526424,0.00013675253,0.00035534735,0.00009295781],"domain_scores_gemma":[0.9990119,0.00046146475,0.00011110927,0.00006062676,0.00029749642,0.000057377496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891504,0.00057747384,0.000779463,0.00052120985,0.00057918014,0.0014497918,0.0014290287,0.0010989431,0.001543154],"category_scores_gemma":[0.0030507557,0.0002826338,0.0003921395,0.00046858372,0.00070175435,0.0018679356,0.0008286451,0.0006213203,0.0002447433],"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.0000517194,0.00003609446,0.00048233787,0.000034491208,0.000010095142,0.00007872102,0.000034365556,0.98110723,0.003276874,0.010725056,0.0001964488,0.003966555],"study_design_scores_gemma":[0.0000032852727,0.0000125521055,0.00005197288,0.0000010958832,0.0000024277967,0.000005059968,0.0000058211995,0.9989416,0.0003079404,0.0005810847,0.00008495857,0.0000021585365],"about_ca_topic_score_codex":0.011514161,"about_ca_topic_score_gemma":0.0038378504,"teacher_disagreement_score":0.011514161,"about_ca_system_score_codex":0.0022151573,"about_ca_system_score_gemma":0.0015536678,"threshold_uncertainty_score":0.022894263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8717674,0.0016700015,0.10209678,0.0009756446,0.00038756127,0.0014238838,0.00051308656,0.007266782,0.013898933],"genre_scores_gemma":[0.9618351,0.00027242955,0.035790358,0.00010101085,0.000028546956,0.00009653121,0.0003023667,0.00011253271,0.001461202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997074,0.00069216645,0.00019272513,0.00032821312,0.0011875313,0.0005253599],"domain_scores_gemma":[0.99562365,0.0010453641,0.0003908172,0.00041643818,0.0018274008,0.0006962836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032652605,0.00091333315,0.0009190956,0.0010028511,0.0010836269,0.0018669001,0.0025348268,0.0007867834,0.0024909843],"category_scores_gemma":[0.0048345965,0.00030213027,0.0004044639,0.0013102563,0.00056353776,0.0015565227,0.00066892005,0.0006130306,0.0005534798],"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.011145187,0.0049210293,0.027393265,0.0013965685,0.0005147958,0.0016372915,0.00041622142,0.43647414,0.18210779,0.01509758,0.018616084,0.30028],"study_design_scores_gemma":[0.00037960886,0.0012900407,0.003703217,0.000013254186,0.000105417086,0.00016786139,0.00012890059,0.9412617,0.049322356,0.0005502252,0.0030443205,0.0000330873],"about_ca_topic_score_codex":0.018010316,"about_ca_topic_score_gemma":0.008868295,"teacher_disagreement_score":0.018010316,"about_ca_system_score_codex":0.0040737404,"about_ca_system_score_gemma":0.003030532,"threshold_uncertainty_score":0.035810947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23191051,0.0013858806,0.7575848,0.00035805377,0.000114147326,0.00010139189,0.00010351607,0.001015093,0.0074266037],"genre_scores_gemma":[0.97089976,0.00021214345,0.028165923,0.000047961912,0.000022226262,0.000035059315,0.000043368877,0.000041949217,0.00053159473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993771,0.00013971346,0.00003007756,0.00016345472,0.00014698185,0.00014277115],"domain_scores_gemma":[0.9977914,0.0013598545,0.0001380934,0.00017228123,0.00037731146,0.00016108349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001010299,0.0007944873,0.00090922276,0.00055443734,0.00071605184,0.00093139237,0.0013245152,0.0007398084,0.0010017349],"category_scores_gemma":[0.0032642593,0.0003462475,0.00046503125,0.0006889215,0.00075768126,0.0018583958,0.0015258691,0.000793585,0.00014952954],"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.00013565707,0.00012204905,0.001446214,0.00010157687,0.00005309307,0.00022030027,0.00008093095,0.932202,0.017050141,0.0048252214,0.0010961335,0.042666707],"study_design_scores_gemma":[0.00000846799,0.000030488269,0.0002099704,0.0000036264373,0.000009114724,0.00003537544,0.000025685451,0.99524117,0.002554075,0.0016156897,0.00025665972,0.000009818685],"about_ca_topic_score_codex":0.0035220408,"about_ca_topic_score_gemma":0.0029075576,"teacher_disagreement_score":0.0035220408,"about_ca_system_score_codex":0.00087913364,"about_ca_system_score_gemma":0.001035115,"threshold_uncertainty_score":0.007003069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26806575,0.051702265,0.45782134,0.05621232,0.00226078,0.00047890295,0.0005548329,0.00028448016,0.1626193],"genre_scores_gemma":[0.95967185,0.009493853,0.024452392,0.0008509022,0.001566955,0.000083263134,0.00015167386,0.000043342177,0.003685821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98738796,0.0068281377,0.00057485857,0.0011437656,0.00352832,0.00053698727],"domain_scores_gemma":[0.64641213,0.32099178,0.006298976,0.006111159,0.01805069,0.002135183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01936334,0.00047527702,0.0009894379,0.0040010875,0.0018356572,0.0053408137,0.0016948663,0.00245995,0.0054580397],"category_scores_gemma":[0.20193326,0.00045941537,0.0005668984,0.004665251,0.004686498,0.016616164,0.0020026737,0.0025483088,0.00045123367],"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.00061055407,0.00013736293,0.010914754,0.0010301868,0.00020791248,0.00056509604,0.0016219248,0.025033282,0.0011231077,0.7554859,0.011282919,0.19198695],"study_design_scores_gemma":[0.00007075765,0.000093536924,0.0062493486,0.00028179545,0.00025837237,0.00046370135,0.0007494295,0.06703558,0.00096794247,0.9087778,0.0150003955,0.00005151235],"about_ca_topic_score_codex":0.0025911224,"about_ca_topic_score_gemma":0.002177351,"teacher_disagreement_score":0.01936334,"about_ca_system_score_codex":0.003074035,"about_ca_system_score_gemma":0.0016561538,"threshold_uncertainty_score":0.102404356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03558556,0.0023642092,0.9432051,0.0020781106,0.00024287154,0.0002511759,0.0006967108,0.00037364117,0.015202559],"genre_scores_gemma":[0.82583725,0.0020601123,0.14703406,0.000461762,0.0003729103,0.000657392,0.0012034432,0.0002003091,0.022172699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763715,0.0010072563,0.0002362045,0.00028443107,0.0006227675,0.00021219019],"domain_scores_gemma":[0.9945581,0.00320512,0.0005304078,0.0006569512,0.0006609883,0.00038844527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029239268,0.0009584708,0.0010737481,0.00078472873,0.0009482454,0.0035006893,0.003175839,0.002287195,0.0056045703],"category_scores_gemma":[0.008527132,0.0006899754,0.00085198355,0.0015353259,0.0014811321,0.005231722,0.0017025353,0.0029276407,0.0010929565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102635255,0.00010111384,0.0008346046,0.00009320446,0.0000428912,0.00026643454,0.00040551674,0.35509583,0.0007606255,0.6307493,0.0028788627,0.008669006],"study_design_scores_gemma":[0.000026023314,0.000035082372,0.00009887802,0.000018096287,0.000012336736,0.00007582203,0.000084024075,0.7261714,0.00016876904,0.26834118,0.004956424,0.000012009539],"about_ca_topic_score_codex":0.006330373,"about_ca_topic_score_gemma":0.00536552,"teacher_disagreement_score":0.006330373,"about_ca_system_score_codex":0.0016098866,"about_ca_system_score_gemma":0.0011696155,"threshold_uncertainty_score":0.018749118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05582529,0.0005994464,0.9135649,0.00079433975,0.00033462988,0.00015191652,0.000067913286,0.0022457773,0.026415734],"genre_scores_gemma":[0.7443159,0.0004983862,0.2449676,0.00029293975,0.0001433277,0.00016227626,0.00019940248,0.00016439547,0.009255826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.00024265652,0.000049651073,0.00017969131,0.00025904193,0.00011020426],"domain_scores_gemma":[0.99891675,0.00029974914,0.00010194581,0.00034372506,0.00017022587,0.00016758403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087978016,0.00045025485,0.00042618552,0.00058857654,0.0013410443,0.0020525116,0.001710383,0.0009886078,0.0029547992],"category_scores_gemma":[0.0020800726,0.0003011433,0.0003310191,0.00047316978,0.0010700786,0.0026669102,0.0032814716,0.0010238474,0.000693388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005077231,0.00026881602,0.004387242,0.00028965104,0.00007716153,0.0010675318,0.0008871897,0.20516291,0.0471941,0.54346603,0.00944336,0.18724827],"study_design_scores_gemma":[0.00006653086,0.00039302785,0.0013105354,0.000074058626,0.00004492521,0.00089646026,0.00049072265,0.7639516,0.014858641,0.109924935,0.10791889,0.000069655485],"about_ca_topic_score_codex":0.0008535095,"about_ca_topic_score_gemma":0.0012785261,"teacher_disagreement_score":0.0029547992,"about_ca_system_score_codex":0.0009339805,"about_ca_system_score_gemma":0.00072332355,"threshold_uncertainty_score":0.009884834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016063625,0.0010511584,0.9514503,0.00090718287,0.00047077882,0.0002840337,0.00060056703,0.0056856885,0.023486692],"genre_scores_gemma":[0.5460861,0.0033064475,0.4044429,0.0012106951,0.0012287885,0.0008834267,0.00330635,0.0013580768,0.0381772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948152,0.00093320274,0.0006724585,0.00083831564,0.0024184543,0.00032247408],"domain_scores_gemma":[0.989976,0.0042137075,0.00060048763,0.0037631134,0.0010577973,0.0003890002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077099814,0.00044543002,0.0010893786,0.001848301,0.0014743332,0.0058628228,0.0027476128,0.0011839883,0.007235188],"category_scores_gemma":[0.015405497,0.0011137059,0.0006511897,0.0025661099,0.0019906396,0.00999552,0.0035356006,0.0018778051,0.002523105],"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.00032567885,0.00023257268,0.0027286708,0.0006287474,0.0001036522,0.0010893785,0.0011494736,0.029788826,0.006051275,0.76148176,0.0130759645,0.18334398],"study_design_scores_gemma":[0.00020725197,0.0001831551,0.0007909483,0.00014439668,0.00014751704,0.0012471377,0.00040642568,0.1950421,0.02222927,0.5572147,0.22224578,0.0001413813],"about_ca_topic_score_codex":0.0015497376,"about_ca_topic_score_gemma":0.0013203305,"teacher_disagreement_score":0.0077099814,"about_ca_system_score_codex":0.0010716125,"about_ca_system_score_gemma":0.0013801116,"threshold_uncertainty_score":0.040774763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11790011,0.0016381444,0.86069536,0.0004478461,0.00036006712,0.0013118198,0.00028683164,0.006422255,0.010937519],"genre_scores_gemma":[0.72971463,0.00093420554,0.2608913,0.00033108916,0.00018857357,0.00040116007,0.0006944585,0.0001548626,0.0066898065],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923074,0.00010755426,0.000072815885,0.00012312001,0.00037425914,0.00009149696],"domain_scores_gemma":[0.99912256,0.00008806853,0.000094622614,0.00020964854,0.00037518455,0.00011001997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007092002,0.0006942804,0.00077326037,0.0013326476,0.00067195663,0.0006221673,0.0016688624,0.0009911266,0.0013475547],"category_scores_gemma":[0.0015236543,0.00024991258,0.00057737145,0.0011942362,0.000568435,0.0011610752,0.00073905656,0.0010312265,0.00057771633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011465832,0.0005857675,0.0009828343,0.00047505661,0.00013725462,0.0015413575,0.00035030182,0.0424936,0.5403479,0.0231486,0.006512439,0.38227832],"study_design_scores_gemma":[0.00042182245,0.0015471132,0.002007474,0.000097657714,0.00019443629,0.0025613373,0.00012030081,0.75162536,0.21231006,0.0049187853,0.023902563,0.0002930387],"about_ca_topic_score_codex":0.0025265506,"about_ca_topic_score_gemma":0.0011631171,"teacher_disagreement_score":0.0025265506,"about_ca_system_score_codex":0.00081783073,"about_ca_system_score_gemma":0.0006852467,"threshold_uncertainty_score":0.005933821},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01905378,0.022088893,0.14257146,0.029434567,0.010126361,0.0010966925,0.008579178,0.027027408,0.7400216],"genre_scores_gemma":[0.085121274,0.016735863,0.14999476,0.008586554,0.003850811,0.001767662,0.03528403,0.007909112,0.69075],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589217,0.0013243794,0.00015982325,0.0006665071,0.0013772417,0.00057983905],"domain_scores_gemma":[0.9963883,0.00057686906,0.00019862049,0.00094430236,0.00049590314,0.0013960317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005429474,0.0010503443,0.0005375269,0.0019067426,0.0011630047,0.007612455,0.0021211223,0.0016451755,0.063551046],"category_scores_gemma":[0.0053494023,0.0003816552,0.0007265592,0.0017804904,0.001077129,0.00961628,0.008716254,0.0019543895,0.025651982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064296334,0.00018159983,0.0016570551,0.00045867375,0.00005675601,0.00042980557,0.00083380914,0.0013112967,0.003306578,0.18916371,0.4108627,0.39109504],"study_design_scores_gemma":[0.000054172506,0.000048341408,0.00028825193,0.0001099497,0.000010810999,0.0001535462,0.00015548602,0.00092628354,0.001026543,0.013885331,0.9833278,0.000013496181],"about_ca_topic_score_codex":0.0016371625,"about_ca_topic_score_gemma":0.0010694335,"teacher_disagreement_score":0.063551046,"about_ca_system_score_codex":0.0012223509,"about_ca_system_score_gemma":0.0031067953,"threshold_uncertainty_score":0.2125994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93024117,0.0012195209,0.059721462,0.0005883093,0.00006357489,0.000047600406,0.00005120931,0.00013216422,0.007935047],"genre_scores_gemma":[0.99725753,0.00019001769,0.0021227903,0.000017019345,0.000015851208,0.0000049187797,0.000015218595,0.000013714466,0.00036310707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.00023757528,0.000023569779,0.000094900104,0.0001810008,0.000098815166],"domain_scores_gemma":[0.99297535,0.0052431514,0.0004241543,0.00026165604,0.00074802566,0.00034769438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753712,0.00038757347,0.000560266,0.00038295158,0.00054219813,0.0012977899,0.00091890426,0.00095006125,0.0016505341],"category_scores_gemma":[0.0122834705,0.00029451426,0.00014628308,0.00035490567,0.00053525553,0.0031034846,0.00060165126,0.0007197469,0.00020591785],"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.0009821821,0.0012097475,0.027760377,0.00030869117,0.00014795606,0.0011212005,0.00090719556,0.6700997,0.116815805,0.06255212,0.0021250143,0.115970016],"study_design_scores_gemma":[0.000016810973,0.00016602661,0.0037975542,0.00000821272,0.000037420014,0.0001096826,0.00036142452,0.979166,0.004583865,0.011319868,0.00041737378,0.000015867703],"about_ca_topic_score_codex":0.0039187437,"about_ca_topic_score_gemma":0.0038537323,"teacher_disagreement_score":0.0039187437,"about_ca_system_score_codex":0.0006979161,"about_ca_system_score_gemma":0.00066960027,"threshold_uncertainty_score":0.007791877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8722909,0.0060076383,0.07850138,0.0008489795,0.0009635615,0.0006248459,0.0011631537,0.017755218,0.021844393],"genre_scores_gemma":[0.96077627,0.0010700272,0.031961832,0.00008953172,0.000101481564,0.00016981825,0.0017437979,0.00045369376,0.0036335986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938558,0.0015194524,0.0006254283,0.0007043322,0.0026984909,0.00059646746],"domain_scores_gemma":[0.9844935,0.007608174,0.0010838415,0.0014782872,0.004508302,0.00082797994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045141983,0.0013511382,0.0012009671,0.002522576,0.0007709504,0.002396415,0.0022528856,0.0014204476,0.0019233833],"category_scores_gemma":[0.016992621,0.00030484018,0.00060535065,0.0025628558,0.0005355245,0.0021505777,0.0012715493,0.00082015246,0.0009620489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016054118,0.0027550894,0.033489663,0.005429839,0.0007756692,0.0014737089,0.0023814132,0.20533,0.15061167,0.0108145345,0.01969214,0.55119216],"study_design_scores_gemma":[0.000673583,0.007806341,0.03133165,0.00024589803,0.000711592,0.0008649307,0.0019268058,0.7138001,0.21209672,0.004763012,0.025486814,0.0002925536],"about_ca_topic_score_codex":0.0021062894,"about_ca_topic_score_gemma":0.0009100946,"teacher_disagreement_score":0.0045141983,"about_ca_system_score_codex":0.0013945897,"about_ca_system_score_gemma":0.0008141797,"threshold_uncertainty_score":0.023873687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038832899,0.000035340494,0.9938047,0.00004785797,0.000011289049,0.00005471941,0.000060667488,0.0009164035,0.0011857441],"genre_scores_gemma":[0.27472946,0.00030134106,0.71783423,0.00005917409,0.000034416902,0.00049838825,0.00054746534,0.00079609035,0.005199457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989191,0.00023884745,0.000090328496,0.00013984894,0.00047892853,0.00013283445],"domain_scores_gemma":[0.9991166,0.00030039094,0.00006715303,0.00031685727,0.00014556313,0.000053476397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001367792,0.0009234819,0.00081935374,0.0007283002,0.0012263107,0.0023948015,0.002218733,0.0012541548,0.002462261],"category_scores_gemma":[0.0029444923,0.0006592259,0.0013973209,0.0006564595,0.0010033848,0.0028904304,0.002077913,0.0017555603,0.0009934594],"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.000061469895,0.000060665563,0.0006224595,0.00008687397,0.000035233064,0.00027104063,0.00025642372,0.78674906,0.008942699,0.16905004,0.0018093137,0.0320548],"study_design_scores_gemma":[0.000010273998,0.0000079045885,0.000034691646,0.0000062306444,0.0000072946364,0.000025991589,0.00001862971,0.96623737,0.0021560674,0.027463833,0.0040236297,0.000008076536],"about_ca_topic_score_codex":0.0054569403,"about_ca_topic_score_gemma":0.005241168,"teacher_disagreement_score":0.0054569403,"about_ca_system_score_codex":0.0012211918,"about_ca_system_score_gemma":0.0017231249,"threshold_uncertainty_score":0.01085037},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04225334,0.0028109471,0.9261282,0.001859064,0.00051415927,0.0001741173,0.000087289394,0.0016203807,0.024552481],"genre_scores_gemma":[0.6899633,0.0048503974,0.27955386,0.00054078724,0.0008674039,0.00027802188,0.00027972678,0.00049084146,0.023175694],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999718,0.00008060423,0.000011943765,0.000050586856,0.00010400904,0.00003485076],"domain_scores_gemma":[0.9992151,0.00043164438,0.000043232823,0.00009666158,0.00016351523,0.000049769453],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055186264,0.00040055875,0.0005938182,0.0003244198,0.0005976716,0.0006565427,0.0007250386,0.00071709807,0.0030614673],"category_scores_gemma":[0.001959481,0.000119272394,0.00015730661,0.0006852827,0.0004794514,0.0014647836,0.00063367473,0.00067743176,0.0015683434],"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.00030348214,0.00014785561,0.0010841747,0.00039876607,0.000026873402,0.0003290299,0.00016008972,0.34893903,0.034005273,0.050047945,0.033409577,0.53114796],"study_design_scores_gemma":[0.000032852968,0.00012374671,0.00031806054,0.000024488289,0.000009712513,0.0001350997,0.000051458388,0.9621913,0.0056588473,0.012748924,0.018685464,0.000019984203],"about_ca_topic_score_codex":0.002494553,"about_ca_topic_score_gemma":0.0019094852,"teacher_disagreement_score":0.9969385,"about_ca_system_score_codex":0.00048994744,"about_ca_system_score_gemma":0.00061813346,"threshold_uncertainty_score":0.010241628},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021724932,0.008796332,0.8908009,0.0023164786,0.0012882287,0.00073036004,0.00047252732,0.029736362,0.04413384],"genre_scores_gemma":[0.36407167,0.0073975683,0.5481591,0.0011133924,0.0007234778,0.00097654463,0.0029944542,0.003247964,0.07131583],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909663,0.00015272544,0.00007709088,0.00011858952,0.00041367838,0.00014141534],"domain_scores_gemma":[0.99862874,0.0002467635,0.00011393412,0.0003886461,0.00042547748,0.00019646027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010081922,0.0004552957,0.00048463582,0.0008502589,0.00071940786,0.0018581757,0.001570401,0.0011274451,0.007687731],"category_scores_gemma":[0.0041242074,0.00033589633,0.00044778,0.000884874,0.0004163232,0.0028336802,0.0014233042,0.0014009773,0.003604043],"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.00046934426,0.0002209705,0.0023697766,0.0010571793,0.00007999831,0.00080149935,0.0004907618,0.0055571687,0.11447808,0.121384844,0.060607992,0.69248235],"study_design_scores_gemma":[0.00012967367,0.0004236447,0.0027864815,0.00038874932,0.00012240406,0.001991138,0.0002051298,0.07153428,0.050478347,0.030692296,0.84112656,0.00012124054],"about_ca_topic_score_codex":0.0015455907,"about_ca_topic_score_gemma":0.0014447428,"teacher_disagreement_score":0.007687731,"about_ca_system_score_codex":0.00082906487,"about_ca_system_score_gemma":0.0012773674,"threshold_uncertainty_score":0.025717974},"labels":[],"label_agreement":null},{"id":"W2023093146","doi":"10.1007/s12083-014-0258-2","title":"A taxonomy of decentralized online social networks","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decentralization; Autonomy; Computer science; Architecture; Taxonomy (biology); Peer-to-peer; Cloud computing; Set (abstract data type); Control (management); Internet privacy; World Wide Web; Data science; Political science; Artificial intelligence","score_opus":0.027402669239488205,"score_gpt":0.27056741082156727,"score_spread":0.24316474158207907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023093146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04752061,0.013162806,0.78621656,0.005723,0.00044611655,0.0011876399,0.0015923965,0.0011337955,0.1430171],"genre_scores_gemma":[0.5272578,0.02357205,0.40334982,0.0008354905,0.00088897307,0.0023591095,0.0027718667,0.00017608491,0.038788907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963128,0.0010934467,0.00037625805,0.00060103735,0.0012965938,0.00031982435],"domain_scores_gemma":[0.99493563,0.002035836,0.0006749984,0.0009642239,0.00086518476,0.0005240904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020094125,0.0007082384,0.001105711,0.004804654,0.0036890374,0.007352495,0.0020914506,0.0028990915,0.004690888],"category_scores_gemma":[0.0068674264,0.0007342936,0.0009194967,0.007881727,0.003006592,0.010657769,0.003155683,0.00192983,0.0010526954],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008727475,0.000025622086,0.000647716,0.0001205809,0.000007929695,0.00011732598,0.000492568,0.0025951483,0.00020569959,0.97617763,0.002317547,0.01728351],"study_design_scores_gemma":[0.000020248512,0.00004357155,0.0008624181,0.0001590471,0.00001882156,0.0006062886,0.0006277128,0.038322337,0.00024313245,0.8412056,0.11786569,0.000025022133],"about_ca_topic_score_codex":0.0035231223,"about_ca_topic_score_gemma":0.0025553228,"teacher_disagreement_score":0.007352495,"about_ca_system_score_codex":0.0029355842,"about_ca_system_score_gemma":0.0025971124,"threshold_uncertainty_score":0.021299303},"labels":[],"label_agreement":null},{"id":"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009302539,0.6428959,0.25706244,0.004006178,0.002104418,0.0013162129,0.00015473212,0.0018654113,0.08129222],"genre_scores_gemma":[0.16628222,0.6130041,0.186971,0.0011907647,0.0023926955,0.0010437234,0.00053428346,0.00026081095,0.028320424],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983424,0.00028455124,0.00008716037,0.00015268511,0.0010309288,0.00010232597],"domain_scores_gemma":[0.9983542,0.0006468843,0.00013124241,0.00011399147,0.00065107504,0.000102601174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015327688,0.0007892682,0.0006691837,0.0018555922,0.00078822044,0.0015482325,0.0024049436,0.0011175392,0.0061524175],"category_scores_gemma":[0.0037717281,0.0005129331,0.00047606617,0.0022490849,0.0006608649,0.0041201944,0.0011084075,0.0018092014,0.0031569279],"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.000056058347,0.00015320012,0.0004766827,0.0044625937,0.000046199006,0.00017318508,0.00015092568,0.0039983056,0.004432092,0.048439138,0.024192715,0.913419],"study_design_scores_gemma":[0.000055342367,0.0005885703,0.0017025108,0.0017987938,0.0001205895,0.002068607,0.00035107438,0.024878053,0.0058587696,0.03439391,0.92808414,0.00009976429],"about_ca_topic_score_codex":0.0014775159,"about_ca_topic_score_gemma":0.0023352792,"teacher_disagreement_score":0.0061524175,"about_ca_system_score_codex":0.0010858213,"about_ca_system_score_gemma":0.0012400693,"threshold_uncertainty_score":0.020581901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03632384,0.002385808,0.93227774,0.0013345393,0.0010373191,0.00080873794,0.000278116,0.012481155,0.013072755],"genre_scores_gemma":[0.7393972,0.0012746264,0.2383435,0.0007449806,0.0009431639,0.0018161625,0.0004317052,0.0011183014,0.015930336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532676,0.0010436738,0.0005073099,0.00057210267,0.0021367727,0.00041331182],"domain_scores_gemma":[0.9902955,0.0023270324,0.0013007055,0.0035306602,0.0020502154,0.00049583905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004257032,0.00082178786,0.0011381541,0.0023649423,0.002297585,0.0040708804,0.0050743143,0.002142357,0.0043913526],"category_scores_gemma":[0.013863975,0.00080490345,0.0004884839,0.002036085,0.0014746189,0.004092854,0.0046067247,0.002037468,0.0030604983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001906638,0.00051846803,0.0044177505,0.002137746,0.0003422067,0.0025343422,0.0033604435,0.0898932,0.13902852,0.42482707,0.049050692,0.2819829],"study_design_scores_gemma":[0.00059649453,0.0014819893,0.0023866293,0.0003810927,0.0002665741,0.002597253,0.0006535586,0.50894713,0.08741655,0.15329288,0.24140324,0.0005765682],"about_ca_topic_score_codex":0.0006420032,"about_ca_topic_score_gemma":0.00040389042,"teacher_disagreement_score":0.0050743143,"about_ca_system_score_codex":0.001025122,"about_ca_system_score_gemma":0.0014984165,"threshold_uncertainty_score":0.022513628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028442234,0.0010708354,0.9148364,0.001498178,0.00036915168,0.0007548169,0.0002883992,0.011412096,0.041327912],"genre_scores_gemma":[0.40726617,0.0015634266,0.5293998,0.00080197846,0.00031477082,0.0011178071,0.0015906851,0.00068722904,0.05725817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793494,0.0003958092,0.00019594817,0.00025045572,0.0010054236,0.00021740182],"domain_scores_gemma":[0.99898225,0.00013262437,0.00007631389,0.00022465995,0.00043344378,0.00015063003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016828128,0.00041121079,0.0005981027,0.00080921827,0.0012371335,0.004668445,0.0020340811,0.0014869367,0.0048881327],"category_scores_gemma":[0.0025675786,0.00033871908,0.0005888015,0.0010711699,0.0011285611,0.003664081,0.0027034522,0.0010634754,0.0025792662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090821815,0.00034503284,0.0026657216,0.00055539573,0.00015889933,0.0019021906,0.0026442592,0.04989977,0.03100165,0.5664657,0.038434774,0.30501848],"study_design_scores_gemma":[0.00024954925,0.0003900037,0.0012726248,0.00015401006,0.00015060752,0.0011904875,0.0005393601,0.40165418,0.018602394,0.119319156,0.45628965,0.00018793561],"about_ca_topic_score_codex":0.006011614,"about_ca_topic_score_gemma":0.003550086,"teacher_disagreement_score":0.006011614,"about_ca_system_score_codex":0.0014377403,"about_ca_system_score_gemma":0.0025448909,"threshold_uncertainty_score":0.016352475},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01634511,0.00052108587,0.7523863,0.00061548885,0.000434198,0.00087317737,0.0031205306,0.17595533,0.049748816],"genre_scores_gemma":[0.34460518,0.0011382058,0.47465333,0.0010838835,0.0006527743,0.0016763711,0.019540368,0.013440726,0.14320923],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992336,0.00014514891,0.000047075468,0.00014985401,0.000329884,0.000094462885],"domain_scores_gemma":[0.99888796,0.00024623083,0.00004801701,0.00035911208,0.00019330088,0.00026541762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440259,0.0009939114,0.00097016094,0.0010248477,0.0012557996,0.002459503,0.0024827654,0.0018744798,0.030676851],"category_scores_gemma":[0.0026446746,0.00055380806,0.00043158545,0.0011465105,0.0003921496,0.0031282504,0.0037909048,0.0014233536,0.012403822],"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.0033357565,0.0008746628,0.0012260771,0.0009897351,0.00023230206,0.0025474573,0.0010553729,0.012659089,0.10048891,0.062328815,0.35163307,0.46262872],"study_design_scores_gemma":[0.0010890428,0.0006897487,0.0018943875,0.0001073263,0.00020733743,0.0025895133,0.00030925465,0.20907816,0.09794129,0.057940204,0.62785065,0.00030311078],"about_ca_topic_score_codex":0.0009017147,"about_ca_topic_score_gemma":0.00094261864,"teacher_disagreement_score":0.030676851,"about_ca_system_score_codex":0.00030183888,"about_ca_system_score_gemma":0.00072397594,"threshold_uncertainty_score":0.10262424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049129438,0.0015083943,0.9347582,0.0011157494,0.00019339804,0.0004562192,0.00031720495,0.004616906,0.007904465],"genre_scores_gemma":[0.6077729,0.0017653636,0.37291968,0.00036942624,0.00047741065,0.00043444612,0.0008980243,0.00083119405,0.014531584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99247146,0.0018556849,0.0008918176,0.0010183671,0.0031766095,0.0005860617],"domain_scores_gemma":[0.98208,0.0076250993,0.0013401355,0.0061520115,0.0019528205,0.000850025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008087982,0.0009421827,0.0018118807,0.0019639137,0.0031946688,0.007354569,0.0026977141,0.002440902,0.0034988355],"category_scores_gemma":[0.01407335,0.0013962121,0.00072725955,0.0033847017,0.0025138024,0.0085025225,0.0041661197,0.0020654455,0.0017813264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012326766,0.0005780966,0.0065664547,0.0012842241,0.00018678268,0.0014323168,0.0030342021,0.21056533,0.030550852,0.4106893,0.01485527,0.31902453],"study_design_scores_gemma":[0.000323049,0.00044085758,0.00089563173,0.000107530905,0.00019356894,0.000832669,0.0006478206,0.55640996,0.03093212,0.34856686,0.060498778,0.00015117216],"about_ca_topic_score_codex":0.002716623,"about_ca_topic_score_gemma":0.0021022293,"teacher_disagreement_score":0.008087982,"about_ca_system_score_codex":0.0021153914,"about_ca_system_score_gemma":0.0028186094,"threshold_uncertainty_score":0.042773843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14942224,0.0004895734,0.8381599,0.0004861991,0.00010132888,0.0001428357,0.000084994645,0.0014393349,0.00967349],"genre_scores_gemma":[0.859144,0.00043139432,0.13773383,0.000045922185,0.000054154625,0.00009200985,0.00012259645,0.000035132813,0.0023409796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965644,0.00010424423,0.000023650535,0.00006018172,0.00011363597,0.00004185133],"domain_scores_gemma":[0.99964476,0.00010811003,0.000046498342,0.00006830715,0.000090272646,0.000042050557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004276414,0.00023000309,0.0002971882,0.0005504901,0.00089193496,0.00071493327,0.0006010472,0.00044632368,0.0007177052],"category_scores_gemma":[0.0010747132,0.0001440089,0.00023659534,0.000798529,0.00029047334,0.0019896177,0.0010070077,0.00032052587,0.00018252281],"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.00026290977,0.00037273017,0.008663517,0.00030027342,0.00013396791,0.0023848987,0.0012112767,0.4721006,0.071646385,0.0760381,0.0066861645,0.3601992],"study_design_scores_gemma":[0.000038457576,0.00015919773,0.001774617,0.000015997291,0.00006219368,0.0004672589,0.0003694037,0.93764246,0.013226533,0.020488938,0.025714416,0.0000404135],"about_ca_topic_score_codex":0.003351347,"about_ca_topic_score_gemma":0.0030234521,"teacher_disagreement_score":0.003351347,"about_ca_system_score_codex":0.0003603225,"about_ca_system_score_gemma":0.00056786754,"threshold_uncertainty_score":0.00666368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047116946,0.00031652887,0.94786865,0.0001391789,0.00009043175,0.000089791356,0.00010799239,0.00150537,0.0027650825],"genre_scores_gemma":[0.7107672,0.00034920842,0.2850755,0.0000524837,0.00008696158,0.0001231008,0.0002452045,0.00015494229,0.0031455166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958116,0.00011764112,0.000032164146,0.00004339645,0.0001728525,0.00005268828],"domain_scores_gemma":[0.9979818,0.0010169446,0.00011860121,0.00037849083,0.00037585673,0.00012835716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008370294,0.0003403643,0.000734868,0.0008135425,0.0009773532,0.00065428024,0.0008814369,0.0005437889,0.0015662876],"category_scores_gemma":[0.0033499857,0.00022087597,0.00026272456,0.001021602,0.00041057664,0.0012004125,0.00086776883,0.0006322161,0.0003909071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011519277,0.00034361935,0.001211891,0.00041744098,0.00013020844,0.0005086129,0.0007837293,0.3214339,0.11394968,0.10722708,0.012518884,0.44032302],"study_design_scores_gemma":[0.000047403115,0.00010505282,0.00023453747,0.000007200402,0.000029401279,0.000095667376,0.000058033107,0.96484137,0.012151004,0.019112563,0.0032973422,0.000020397763],"about_ca_topic_score_codex":0.0017921124,"about_ca_topic_score_gemma":0.0032056328,"teacher_disagreement_score":0.0017921124,"about_ca_system_score_codex":0.0005152254,"about_ca_system_score_gemma":0.00061301515,"threshold_uncertainty_score":0.0052397847},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025544042,0.15284581,0.7876082,0.0038278576,0.00069294573,0.00039641527,0.00024493414,0.00046707687,0.028372634],"genre_scores_gemma":[0.36486766,0.22362812,0.395724,0.0008899811,0.0032657674,0.00048870343,0.00086982705,0.00021047427,0.010055344],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754155,0.0005378743,0.00019877111,0.000414836,0.0011393243,0.00016758635],"domain_scores_gemma":[0.996323,0.0022870712,0.0002290807,0.00047540513,0.0005882982,0.00009722744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028577254,0.0008593881,0.0018142883,0.0017467312,0.0010884778,0.002469385,0.0030892221,0.0020478072,0.0026053516],"category_scores_gemma":[0.008278379,0.0006145911,0.00059296703,0.0037772467,0.0011467153,0.0051549505,0.0012984711,0.0015645542,0.00079188426],"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.00021951334,0.00026973002,0.0013610962,0.0022894025,0.00008294153,0.00011838956,0.00016576487,0.068372965,0.0059978087,0.27116483,0.009080126,0.6408774],"study_design_scores_gemma":[0.00012762014,0.0007126773,0.0014789188,0.00087718514,0.00017962945,0.0020878098,0.00030929508,0.59562933,0.008354748,0.24942283,0.14070618,0.00011373969],"about_ca_topic_score_codex":0.00075522455,"about_ca_topic_score_gemma":0.0005777505,"teacher_disagreement_score":0.0030892221,"about_ca_system_score_codex":0.0016300629,"about_ca_system_score_gemma":0.001556036,"threshold_uncertainty_score":0.015113294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10432959,0.0021699741,0.82319635,0.0031579984,0.00034394406,0.00060451915,0.00048969843,0.010784606,0.05492328],"genre_scores_gemma":[0.7828045,0.0017130604,0.18490401,0.0005588694,0.00014928353,0.0002633712,0.0010965196,0.00026194003,0.028248455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744946,0.0006284846,0.00023048162,0.0003505698,0.0009964942,0.0003444416],"domain_scores_gemma":[0.9977984,0.0004725169,0.00022357517,0.0009625826,0.00035989055,0.00018293604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019973456,0.0003717487,0.00058877765,0.0014048343,0.0013404366,0.0037987514,0.0017863979,0.0017646991,0.00206019],"category_scores_gemma":[0.0035665042,0.00039007343,0.00041992625,0.0018669608,0.001453197,0.0047971993,0.0049652625,0.0013284746,0.001498567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017696047,0.00031885193,0.0040089088,0.00044701522,0.00013463527,0.00340943,0.0013594477,0.07178071,0.033720884,0.5238843,0.031152954,0.3280133],"study_design_scores_gemma":[0.00024467625,0.00022330215,0.0020786852,0.00013294251,0.00011435228,0.0015565628,0.00062600424,0.55356574,0.037307743,0.14560905,0.2583821,0.00015882919],"about_ca_topic_score_codex":0.0053642397,"about_ca_topic_score_gemma":0.003917932,"teacher_disagreement_score":0.0053642397,"about_ca_system_score_codex":0.0021707087,"about_ca_system_score_gemma":0.002185124,"threshold_uncertainty_score":0.015749693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104223555,0.00011443644,0.9825081,0.00016654312,0.00003552027,0.000099673605,0.000051393275,0.00510043,0.0015015048],"genre_scores_gemma":[0.20397878,0.0001999334,0.7926052,0.000080697624,0.000033844106,0.000099510085,0.00032196025,0.00029136075,0.0023887488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972855,0.00067448075,0.00018549689,0.0003958035,0.0012440805,0.00021461392],"domain_scores_gemma":[0.99424136,0.0013512037,0.0003188953,0.0024029887,0.0015381115,0.00014751666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021280462,0.0007491597,0.0007959552,0.0011430068,0.0010067088,0.0026211033,0.0019648587,0.0012106276,0.0017395266],"category_scores_gemma":[0.0076730354,0.0005885151,0.00054165116,0.000997292,0.0007698598,0.0028880578,0.0026895017,0.0013989267,0.001228277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019766786,0.00034283125,0.004873321,0.00026133485,0.00012052571,0.00022835034,0.00050020206,0.15734634,0.078034416,0.03265898,0.010267224,0.7151688],"study_design_scores_gemma":[0.000017330849,0.000036600155,0.0006537641,0.000019246392,0.00003634547,0.00011869844,0.00014353215,0.9295866,0.03330985,0.025741236,0.010318652,0.00001809135],"about_ca_topic_score_codex":0.0057689617,"about_ca_topic_score_gemma":0.008286017,"teacher_disagreement_score":0.0057689617,"about_ca_system_score_codex":0.00095847214,"about_ca_system_score_gemma":0.002147924,"threshold_uncertainty_score":0.011470735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058231764,0.0007838645,0.90220934,0.0010042487,0.00036157764,0.00033154752,0.0003175269,0.0037228768,0.03303731],"genre_scores_gemma":[0.8511945,0.00071767735,0.12281945,0.00019328,0.00017110551,0.000370506,0.0002849759,0.00012030341,0.024128146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957865,0.00007400123,0.000029201265,0.000118755415,0.00013887648,0.000060582013],"domain_scores_gemma":[0.99971694,0.000076495686,0.000026029373,0.000047206435,0.00007971691,0.000053610485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031658052,0.00056672335,0.00059438107,0.00058200094,0.0012122067,0.0016424162,0.001574553,0.0010537389,0.005609308],"category_scores_gemma":[0.0005217638,0.00026331263,0.00051794545,0.00050520804,0.00061498425,0.0025082475,0.0009547836,0.0007636233,0.0015439227],"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.0014235218,0.00060637953,0.0019051388,0.0005362748,0.00024695013,0.0039045936,0.0009898251,0.36695665,0.07130612,0.3602464,0.01976829,0.17210983],"study_design_scores_gemma":[0.00009315744,0.00020344526,0.0002991615,0.000020471272,0.000074582684,0.00042187207,0.000087400214,0.9466708,0.005579107,0.029790442,0.016714424,0.00004524803],"about_ca_topic_score_codex":0.003353288,"about_ca_topic_score_gemma":0.0029513666,"teacher_disagreement_score":0.005609308,"about_ca_system_score_codex":0.0005588465,"about_ca_system_score_gemma":0.00066598726,"threshold_uncertainty_score":0.018764973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8077635,0.0017860333,0.17948355,0.0012129301,0.00008172141,0.0001655827,0.00034744354,0.0005639293,0.00859526],"genre_scores_gemma":[0.99643433,0.00013603947,0.0031407808,0.00001903359,0.000017079083,0.000018375978,0.000051925756,0.000031604446,0.0001508887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99235535,0.003911583,0.00031911195,0.0010101852,0.0015065108,0.00089716946],"domain_scores_gemma":[0.7512171,0.21549839,0.016143633,0.0087877195,0.0068414323,0.001511684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074421815,0.0010758548,0.0009938276,0.0017235441,0.00095566816,0.0027516754,0.0014198195,0.0016033287,0.0015298562],"category_scores_gemma":[0.105507895,0.00064537086,0.00065908773,0.001388442,0.0019058343,0.005537522,0.0009978518,0.003076747,0.00022965511],"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.00081461336,0.00062087696,0.1036031,0.00041817967,0.00071996066,0.00067405263,0.00064359413,0.79621786,0.025863592,0.027646745,0.0012873074,0.041490097],"study_design_scores_gemma":[0.000039403152,0.00047814898,0.038018428,0.000044925673,0.00023009152,0.00054663746,0.0005745186,0.92991996,0.015064312,0.014184642,0.0007231859,0.00017578916],"about_ca_topic_score_codex":0.0022784001,"about_ca_topic_score_gemma":0.0019122233,"teacher_disagreement_score":0.0074421815,"about_ca_system_score_codex":0.0027744768,"about_ca_system_score_gemma":0.0009524131,"threshold_uncertainty_score":0.039358437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028074833,0.00020885331,0.96518254,0.00019493574,0.00010048883,0.0007008584,0.000035607107,0.0019651488,0.003536848],"genre_scores_gemma":[0.26984534,0.00029715546,0.7213824,0.00022118443,0.00007020219,0.0007371492,0.00014789273,0.0002827128,0.0070159426],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934965,0.00013576887,0.00006432452,0.00010051321,0.0002852842,0.00006435201],"domain_scores_gemma":[0.99932075,0.00012478766,0.00006396834,0.00007200994,0.00033509475,0.000083347746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011367584,0.00041258193,0.00043292606,0.000363687,0.000589758,0.0009920293,0.0014193287,0.0011478805,0.0009547226],"category_scores_gemma":[0.0010250913,0.00044161692,0.0003964512,0.0001752805,0.0003486779,0.0007073679,0.00053674786,0.0010181522,0.0005648125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006391037,0.00044053645,0.002924047,0.00059956015,0.00016648526,0.0015701618,0.0008154403,0.041643366,0.71629363,0.03793678,0.004353328,0.19261749],"study_design_scores_gemma":[0.00021639366,0.0012431861,0.0018023093,0.000060557315,0.00031747003,0.0018109765,0.00014649582,0.5136371,0.41195968,0.004067534,0.06461967,0.00011860143],"about_ca_topic_score_codex":0.0006790044,"about_ca_topic_score_gemma":0.0006323077,"teacher_disagreement_score":0.0014193287,"about_ca_system_score_codex":0.00042056738,"about_ca_system_score_gemma":0.0007439425,"threshold_uncertainty_score":0.0060118437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38604575,0.008833187,0.5638885,0.0050671613,0.00047735043,0.00043326494,0.0008165526,0.0015855369,0.032852683],"genre_scores_gemma":[0.94425887,0.0015226793,0.049625818,0.00017561526,0.00030644436,0.0001469997,0.00026073458,0.00031401266,0.0033888665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9850412,0.006500884,0.00073605357,0.0013613603,0.0043961885,0.0019642625],"domain_scores_gemma":[0.78696585,0.17850687,0.0035807043,0.020576917,0.008729878,0.0016397886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013660657,0.0013889855,0.004251576,0.0032238169,0.002680955,0.0051518385,0.006650673,0.003317882,0.0058854944],"category_scores_gemma":[0.10761724,0.0009929413,0.0007837412,0.005497525,0.0040180925,0.013856532,0.0047065136,0.0020306846,0.0014180358],"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.0037860023,0.0006092045,0.0055680736,0.00047501238,0.00024687295,0.00034736015,0.00068142905,0.60901207,0.010588043,0.194147,0.011375191,0.16316372],"study_design_scores_gemma":[0.000119669385,0.00017447928,0.0008658506,0.000039316645,0.00009461194,0.00025842054,0.00019570743,0.9147954,0.004780835,0.07694401,0.0016796152,0.000052076157],"about_ca_topic_score_codex":0.0034742267,"about_ca_topic_score_gemma":0.0023963877,"teacher_disagreement_score":0.013660657,"about_ca_system_score_codex":0.00352095,"about_ca_system_score_gemma":0.003291975,"threshold_uncertainty_score":0.0722453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577516,0.00040640295,0.036221515,0.000098943325,0.000049903083,0.00023246351,0.00010749183,0.0023038003,0.0028279277],"genre_scores_gemma":[0.9936959,0.00006154037,0.0058520073,0.000013459782,0.0000075982157,0.000030553838,0.00008298238,0.000017343991,0.00023863724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810815,0.0005475033,0.00015124469,0.00021701033,0.00075313664,0.00022288934],"domain_scores_gemma":[0.9959473,0.0011061362,0.00029192667,0.00065196597,0.0014867347,0.0005159596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014867597,0.00061103655,0.0009389284,0.0010230512,0.00065561006,0.0006936177,0.0011341836,0.00079106895,0.0011781119],"category_scores_gemma":[0.004478365,0.00021536114,0.00026312366,0.0009435819,0.00049328984,0.0014239283,0.0006282823,0.00055347296,0.00032788486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004100984,0.001984016,0.025053654,0.00073486695,0.00038417144,0.0014192265,0.00085645355,0.22473194,0.59289265,0.003935816,0.0031466822,0.14075962],"study_design_scores_gemma":[0.00011345973,0.0019542896,0.009574969,0.000015893602,0.000115155824,0.00034345963,0.0002565944,0.8509932,0.13518764,0.0003432846,0.0010375549,0.00006440821],"about_ca_topic_score_codex":0.0029203964,"about_ca_topic_score_gemma":0.00096817146,"teacher_disagreement_score":0.0029203964,"about_ca_system_score_codex":0.0010615956,"about_ca_system_score_gemma":0.00054800056,"threshold_uncertainty_score":0.007862866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04423268,0.0012981162,0.9445524,0.00072101475,0.00016523933,0.0002156821,0.00061369094,0.0011387756,0.0070624077],"genre_scores_gemma":[0.6553369,0.0013806291,0.33754736,0.00020378384,0.00020094999,0.0002413077,0.0011541415,0.00018986504,0.0037450988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989492,0.00026412413,0.00006971454,0.0002089928,0.00035064018,0.00015741009],"domain_scores_gemma":[0.99820626,0.00081676076,0.00021214588,0.00034901657,0.0002968936,0.0001189537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088352,0.0007364728,0.0009896241,0.00073662336,0.0013032586,0.0011624714,0.0018714863,0.0010266472,0.0016255721],"category_scores_gemma":[0.0053824564,0.00030005514,0.00053711486,0.0011556844,0.00046501067,0.002569846,0.0017873292,0.0008701862,0.00040414577],"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.00049791054,0.00020752051,0.0020747688,0.0008942638,0.00014733846,0.00039068033,0.00047306262,0.58831984,0.023423642,0.10717442,0.020088552,0.256308],"study_design_scores_gemma":[0.00005865418,0.00014236127,0.00062224217,0.00004308236,0.00005739635,0.00036349168,0.00018747672,0.88161194,0.009711756,0.08839141,0.018785628,0.000024516521],"about_ca_topic_score_codex":0.0014029585,"about_ca_topic_score_gemma":0.0016903469,"teacher_disagreement_score":0.0018714863,"about_ca_system_score_codex":0.0011130499,"about_ca_system_score_gemma":0.0011532678,"threshold_uncertainty_score":0.008075833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11911776,0.001627152,0.8640113,0.00060379255,0.0001182568,0.00037808414,0.00069451233,0.001276102,0.0121730985],"genre_scores_gemma":[0.6987844,0.00089471426,0.29437524,0.00009018782,0.000057283145,0.00025368255,0.0016441082,0.00023183464,0.0036684717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985221,0.0004641404,0.000118772296,0.0002114008,0.0004980231,0.00018553714],"domain_scores_gemma":[0.9983279,0.0005360346,0.00008972657,0.00043154933,0.0004969916,0.00011783531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010198777,0.0003851973,0.0011391954,0.0016719532,0.0014261629,0.0021359243,0.001480014,0.0008835437,0.0020514054],"category_scores_gemma":[0.00454103,0.00032130297,0.00057776726,0.0023290773,0.00078544207,0.003830658,0.0016969563,0.000617366,0.0005384604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010296985,0.00046358004,0.003751305,0.0010524638,0.0001589977,0.00042237833,0.0016760489,0.24437058,0.041407414,0.31537384,0.014009523,0.3762841],"study_design_scores_gemma":[0.00005949581,0.00016333138,0.0013834318,0.00008209364,0.00010472166,0.00037593042,0.0009581834,0.75920314,0.015543413,0.20143567,0.020642446,0.00004810312],"about_ca_topic_score_codex":0.002235766,"about_ca_topic_score_gemma":0.0030673933,"teacher_disagreement_score":0.002235766,"about_ca_system_score_codex":0.0008816541,"about_ca_system_score_gemma":0.0016853284,"threshold_uncertainty_score":0.0068626404},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1279979,0.0019625735,0.499933,0.0018943833,0.0014368439,0.0020674833,0.011589644,0.23644927,0.11666882],"genre_scores_gemma":[0.5883423,0.0018904341,0.29720715,0.0027804202,0.00024047149,0.0020810487,0.02626232,0.01595829,0.06523741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922884,0.00022296005,0.000055021585,0.000101301855,0.0002691557,0.0001226136],"domain_scores_gemma":[0.99830735,0.00051913783,0.00009753014,0.0003681288,0.00053865626,0.00016918185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012165508,0.0010856377,0.0007612167,0.00088919414,0.00067268865,0.0012165218,0.0021667401,0.0014169882,0.015910229],"category_scores_gemma":[0.004329376,0.0005485307,0.0006254903,0.00052216684,0.00051468477,0.0019164445,0.0012350249,0.0017006358,0.0077561745],"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.0022691214,0.0013095784,0.01631102,0.0014103006,0.00048356748,0.00067287416,0.0005473356,0.3316811,0.033646375,0.07361055,0.32495263,0.21310548],"study_design_scores_gemma":[0.0004901047,0.0003982405,0.0015202129,0.00008152411,0.00013214258,0.00033939612,0.00006354974,0.6871832,0.039686494,0.011803535,0.25821295,0.00008866677],"about_ca_topic_score_codex":0.0024511255,"about_ca_topic_score_gemma":0.0020826864,"teacher_disagreement_score":0.015910229,"about_ca_system_score_codex":0.0007920107,"about_ca_system_score_gemma":0.0012278102,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2992806,0.0017462495,0.6524994,0.0030132728,0.00015164654,0.00017790588,0.0005510902,0.0008136547,0.041766256],"genre_scores_gemma":[0.963709,0.0017121853,0.028852671,0.00016029442,0.00008039053,0.000054482534,0.00013996042,0.00012166248,0.0051694275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994431,0.00018242297,0.000020468344,0.00005898755,0.00024021849,0.000054728822],"domain_scores_gemma":[0.99696463,0.001985055,0.0003571966,0.00021662902,0.00039341292,0.00008304678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093709765,0.00088793685,0.0006419044,0.0008590398,0.00054998166,0.0011373232,0.0010979673,0.0011077389,0.0024375871],"category_scores_gemma":[0.0078048036,0.00047679307,0.0005284474,0.0004846028,0.0006680924,0.0031693517,0.000615454,0.001528101,0.00033860913],"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.000054321703,0.00010418538,0.0011314827,0.00010169499,0.000021018395,0.00021837163,0.0002499375,0.8816932,0.0060591926,0.09980921,0.0011236205,0.009433731],"study_design_scores_gemma":[0.0000037299383,0.000021518073,0.00024954058,0.000009313928,0.000007298262,0.0000784311,0.000033504075,0.9877664,0.00075700646,0.010300076,0.0007646322,0.000008617927],"about_ca_topic_score_codex":0.0070643937,"about_ca_topic_score_gemma":0.0045755124,"teacher_disagreement_score":0.0070643937,"about_ca_system_score_codex":0.0015901633,"about_ca_system_score_gemma":0.0010183763,"threshold_uncertainty_score":0.01404655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022488914,0.0024209765,0.93351567,0.0009145701,0.0006595243,0.00037573383,0.0057815565,0.027461283,0.006381867],"genre_scores_gemma":[0.29487285,0.0022523715,0.6670195,0.0009901007,0.00066771975,0.00066300074,0.018993879,0.0023901637,0.012150408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.00013709832,0.00013651045,0.00014213617,0.00057864573,0.000107856096],"domain_scores_gemma":[0.99734277,0.00063976855,0.00018048883,0.0010049698,0.0005764067,0.00025566542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001112637,0.0006081513,0.0013834639,0.0019675153,0.0012323733,0.0021592467,0.003029505,0.0010460254,0.004611629],"category_scores_gemma":[0.0044468297,0.0005575056,0.00056610355,0.003479039,0.0007108357,0.004692959,0.0036170857,0.0012471563,0.0018806752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001799436,0.0004451182,0.004716108,0.0013647663,0.00030087688,0.0005652967,0.0009026251,0.037592176,0.047169056,0.071375184,0.19367352,0.6400959],"study_design_scores_gemma":[0.00058606104,0.0006575777,0.0027344592,0.00016623361,0.00029167955,0.0012246661,0.0005462546,0.6017909,0.048750855,0.08645501,0.25646105,0.00033526262],"about_ca_topic_score_codex":0.0041190814,"about_ca_topic_score_gemma":0.0049949586,"teacher_disagreement_score":0.004611629,"about_ca_system_score_codex":0.00079842896,"about_ca_system_score_gemma":0.0014438336,"threshold_uncertainty_score":0.01542747},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21837923,0.00072237715,0.7774743,0.00028896518,0.00003624563,0.00021394031,0.000013133972,0.0016062948,0.0012655307],"genre_scores_gemma":[0.96586365,0.00010909787,0.033446454,0.000030736424,0.00002422674,0.00003128966,0.00001143548,0.000016855987,0.00046623574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675226,0.00112764,0.000213258,0.0004542684,0.0011794079,0.00027315787],"domain_scores_gemma":[0.9922315,0.0040852213,0.0010311047,0.0009021726,0.0013036479,0.0004463636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550079,0.0008411959,0.0013157737,0.00080999127,0.0010806647,0.0010419377,0.0011347191,0.0015082533,0.00034755762],"category_scores_gemma":[0.010345157,0.0005001291,0.0003904609,0.00041708173,0.0011535464,0.0030646387,0.0019032955,0.0009356354,0.00018402375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030165347,0.0009880367,0.020693693,0.00048054845,0.00037546016,0.0033713758,0.0022287345,0.3510491,0.17884143,0.015837055,0.0019063096,0.42121175],"study_design_scores_gemma":[0.00004385317,0.00042793158,0.0013763194,0.000013001726,0.00006910959,0.0008081722,0.00015575689,0.95945156,0.033336528,0.0034726087,0.000806032,0.000039002665],"about_ca_topic_score_codex":0.0011159069,"about_ca_topic_score_gemma":0.00075337326,"teacher_disagreement_score":0.002550079,"about_ca_system_score_codex":0.0005270653,"about_ca_system_score_gemma":0.0006555295,"threshold_uncertainty_score":0.013486266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027511327,0.00012434431,0.95504826,0.00026156704,0.00012683717,0.00083747914,0.00009204389,0.0058541405,0.010144096],"genre_scores_gemma":[0.23040004,0.00015793128,0.75624955,0.00021086734,0.000028430028,0.0009451247,0.00026942027,0.000715637,0.011022906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877125,0.00027503728,0.00009546022,0.00021489573,0.00042222583,0.00022106168],"domain_scores_gemma":[0.9982004,0.00043198583,0.00014745185,0.00039733332,0.0006030312,0.00021968124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016436458,0.00047836747,0.00046848322,0.00069384015,0.000977343,0.002208475,0.002072197,0.001347916,0.0053594057],"category_scores_gemma":[0.0043858415,0.0005326868,0.00049020204,0.000338757,0.0009174699,0.0011265611,0.0021947038,0.0011202152,0.0018494267],"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.0013956205,0.0010038398,0.013085298,0.001217297,0.0003254254,0.000660745,0.0021506897,0.11395772,0.09276253,0.14618969,0.010160447,0.6170907],"study_design_scores_gemma":[0.00025928975,0.0008095316,0.0032209563,0.0002546561,0.00020921168,0.00032247993,0.00049067783,0.7153539,0.0800948,0.027214296,0.17165029,0.00011995537],"about_ca_topic_score_codex":0.003145991,"about_ca_topic_score_gemma":0.0033663441,"teacher_disagreement_score":0.0053594057,"about_ca_system_score_codex":0.0006243304,"about_ca_system_score_gemma":0.002198599,"threshold_uncertainty_score":0.017929018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1395378,0.00088148145,0.8397567,0.00032113274,0.00007779696,0.00041672756,0.0001429597,0.0142572215,0.00460821],"genre_scores_gemma":[0.68123055,0.00026465533,0.31455648,0.00007834276,0.000059903185,0.000241443,0.00035742615,0.0004243381,0.0027868769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991972,0.00017513506,0.000045203906,0.00012401195,0.00036495677,0.000093495466],"domain_scores_gemma":[0.9964281,0.001021372,0.000290312,0.0012686657,0.0006417358,0.00034976425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013237454,0.00043080648,0.00062343705,0.0010870182,0.0010933888,0.0008390796,0.0012863189,0.00054760295,0.0029547403],"category_scores_gemma":[0.0041983766,0.0003662268,0.00024770596,0.0012378956,0.00060794555,0.0027900245,0.0015837174,0.00076244137,0.0011144987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010095736,0.000723133,0.0055222055,0.00030475348,0.000078679856,0.00055799057,0.00075041805,0.08678149,0.22335418,0.018876357,0.014325769,0.6477155],"study_design_scores_gemma":[0.0002018428,0.0005150458,0.0032692894,0.000033644767,0.00005172325,0.00085348054,0.00017205079,0.8682817,0.07982397,0.018654186,0.028026793,0.00011623035],"about_ca_topic_score_codex":0.0023815902,"about_ca_topic_score_gemma":0.002455455,"teacher_disagreement_score":0.0029547403,"about_ca_system_score_codex":0.000827626,"about_ca_system_score_gemma":0.00080038334,"threshold_uncertainty_score":0.0098846555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87429786,0.0010203996,0.115566336,0.000693771,0.00017106625,0.00023696487,0.00005623097,0.0020003668,0.005957018],"genre_scores_gemma":[0.97108424,0.00012826086,0.027725099,0.000094805444,0.0000333679,0.000046267138,0.00003554414,0.00015628643,0.0006961485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99041265,0.003486508,0.00072047,0.0010838406,0.003637214,0.00065933424],"domain_scores_gemma":[0.8841633,0.08813718,0.0121952165,0.007313345,0.0061733224,0.0020175842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069795023,0.0013845189,0.0012475847,0.0014500597,0.0011862128,0.0032137427,0.0029639334,0.0020178526,0.00265867],"category_scores_gemma":[0.127627,0.0007403077,0.000515633,0.0007030603,0.0016251683,0.0052636624,0.0040344913,0.0019939647,0.0005028985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045911204,0.0025768958,0.090861626,0.002329915,0.0005161903,0.0024470517,0.012221207,0.10695154,0.07655681,0.018217519,0.004260869,0.6784693],"study_design_scores_gemma":[0.0007539881,0.009078073,0.120674826,0.0007452863,0.0011540633,0.0046083266,0.008871049,0.6479821,0.11601808,0.0750059,0.014491544,0.0006168719],"about_ca_topic_score_codex":0.0013741866,"about_ca_topic_score_gemma":0.0017064031,"teacher_disagreement_score":0.0069795023,"about_ca_system_score_codex":0.00078969775,"about_ca_system_score_gemma":0.0010388859,"threshold_uncertainty_score":0.036911547},"labels":[],"label_agreement":null},{"id":"W2037186450","doi":"10.1007/s12083-009-0040-z","title":"Editorial: Special issue on mobile P2P networking and computing","year":2009,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Server; Distributed computing; Mobile computing; Multicast; Scalability; Overlay network; Shared resource; The Internet; World Wide Web; Operating system","score_opus":0.008716586641333486,"score_gpt":0.2768795556822618,"score_spread":0.2681629690409283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037186450","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044112985,0.0031968553,0.00014375996,0.011110339,0.9837736,0.000020493499,0.000037546648,0.000053820855,0.0016194211],"genre_scores_gemma":[0.0005780993,0.0033155067,0.00015966741,0.007251401,0.9733041,0.000025899346,0.000049845607,0.000048180475,0.015267339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962554,0.00042713215,0.00039457332,0.0005034834,0.0020669706,0.00035247914],"domain_scores_gemma":[0.9879986,0.0029159344,0.0010629781,0.00035012455,0.0052417764,0.002430608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004639705,0.0048912205,0.00533562,0.0042282175,0.0028395902,0.0077005825,0.0030555222,0.012873251,0.022635803],"category_scores_gemma":[0.01216786,0.0013272561,0.0029946421,0.001773925,0.0019266604,0.0032357739,0.0015561277,0.0131560685,0.01670913],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051878338,0.000018240733,0.000025291225,0.00016320829,0.000023367258,0.0001548838,0.0000044432645,0.00003413529,0.00010349247,0.00015801408,0.9933943,0.0058686887],"study_design_scores_gemma":[0.00009917164,0.00005340147,0.0003905404,0.00021100015,0.00008337093,0.00036193975,0.000023990451,0.0002888153,0.00023429496,0.0007380371,0.99749595,0.000019538802],"about_ca_topic_score_codex":0.000915841,"about_ca_topic_score_gemma":0.0032764252,"teacher_disagreement_score":0.022635803,"about_ca_system_score_codex":0.0021844723,"about_ca_system_score_gemma":0.0019263643,"threshold_uncertainty_score":0.075724244},"labels":[],"label_agreement":null},{"id":"W2037491203","doi":"10.1007/s12083-010-0076-0","title":"Measurement and enhancement of BitTorrent-based video file swarming","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"BitTorrent; Computer science; Swarm behaviour; BitTorrent tracker; Upload; File sharing; The Internet; Computer network; Peer-to-peer; World Wide Web; Artificial intelligence","score_opus":0.019606248683532314,"score_gpt":0.2570765666461239,"score_spread":0.23747031796259158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037491203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98386866,0.00015239252,0.01449037,0.00003927332,0.000028405972,0.000047589838,0.00013210817,0.00032005552,0.0009211373],"genre_scores_gemma":[0.99523854,0.00004290394,0.0044266977,0.0000069426865,0.000007418783,0.000013423307,0.00009601283,0.000010549366,0.00015743691],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897647,0.00018096475,0.000051521165,0.00017043763,0.00054219854,0.00007834252],"domain_scores_gemma":[0.99703777,0.00079978374,0.00022033753,0.0003639269,0.0013654056,0.00021273238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009193417,0.00030468212,0.00054724136,0.0010601332,0.00039651754,0.0004945233,0.00063565274,0.0005927605,0.0002984392],"category_scores_gemma":[0.0036283883,0.00018914124,0.00015723403,0.0007679189,0.00037008923,0.0009975049,0.00046785598,0.0004104352,0.00011936478],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015873577,0.000783579,0.06602578,0.00024933377,0.00012057153,0.00033584944,0.0005578692,0.046055105,0.7860922,0.0010510226,0.0007821146,0.096359156],"study_design_scores_gemma":[0.000044025397,0.0011475515,0.08510832,0.000013360515,0.00008290106,0.0006600979,0.00023565366,0.580329,0.3310547,0.0002813752,0.0009850872,0.00005787813],"about_ca_topic_score_codex":0.002055886,"about_ca_topic_score_gemma":0.0015315127,"teacher_disagreement_score":0.002055886,"about_ca_system_score_codex":0.00053935085,"about_ca_system_score_gemma":0.00025955017,"threshold_uncertainty_score":0.0048620105},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025765646,0.09828555,0.3158885,0.022657517,0.0022895948,0.00011284934,0.00066183985,0.0002713825,0.5340671],"genre_scores_gemma":[0.7368709,0.08689031,0.050470285,0.0027111373,0.005681823,0.00020763185,0.0004527301,0.00026160287,0.116453685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973744,0.00005930335,0.000012221935,0.00004816769,0.000109587076,0.00003317916],"domain_scores_gemma":[0.9997366,0.00012297928,0.000018055687,0.000024072837,0.00008084084,0.000017416973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024582376,0.0006997475,0.0004246214,0.0007867504,0.0005762571,0.0015531702,0.0009768673,0.0012377417,0.007810321],"category_scores_gemma":[0.0006390035,0.0002451567,0.00032799962,0.0010111141,0.0011575078,0.0026899967,0.0007793739,0.0012396678,0.0013907294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028913939,0.000032934204,0.00024642466,0.00024141604,0.000013190181,0.00026052762,0.00011988678,0.018258197,0.0032297568,0.9443628,0.005524185,0.027681619],"study_design_scores_gemma":[0.000009912611,0.00009591652,0.0007734872,0.00015147749,0.000017697415,0.00053569773,0.0002888543,0.08375756,0.0021208997,0.7641068,0.14811334,0.000028426592],"about_ca_topic_score_codex":0.0014054239,"about_ca_topic_score_gemma":0.0010446197,"teacher_disagreement_score":0.007810321,"about_ca_system_score_codex":0.00096321467,"about_ca_system_score_gemma":0.00030331357,"threshold_uncertainty_score":0.026128113},"labels":[],"label_agreement":null},{"id":"W2039305010","doi":"10.1007/s12083-010-0077-z","title":"Sparse structures for searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Flooding (psychology); Scalability; Broadcasting (networking); Gossip; Network topology; Computer network; Graph; Theoretical computer science; Distributed computing; Algorithm","score_opus":0.025124280857080246,"score_gpt":0.2963310891151496,"score_spread":0.27120680825806937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039305010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03765664,0.0014389281,0.9533011,0.0020181073,0.00016813293,0.0001317157,0.00023126506,0.0004486137,0.004605586],"genre_scores_gemma":[0.5968472,0.003972569,0.38306415,0.00065711275,0.0010262963,0.0007526955,0.0011908566,0.00035675633,0.012132451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807787,0.0006639706,0.00011837373,0.00024908918,0.00071780017,0.00017282329],"domain_scores_gemma":[0.97924507,0.016689615,0.0011425354,0.0011908258,0.0012931784,0.0004387926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021477614,0.0008735121,0.0018374335,0.0030427696,0.001727199,0.002656836,0.002928629,0.0023576173,0.004024037],"category_scores_gemma":[0.030762212,0.00091654906,0.0009216457,0.0044186763,0.0026527203,0.006677374,0.0025046912,0.003377054,0.0005440517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017456985,0.00012494723,0.00069223874,0.0003082527,0.000051126957,0.00008415715,0.00033326438,0.27870977,0.0013237109,0.6561434,0.0071674353,0.054887135],"study_design_scores_gemma":[0.000033913955,0.000027702476,0.00012248881,0.000016764146,0.000015535012,0.0000378265,0.00004597713,0.5537715,0.00030368892,0.44426122,0.0013502223,0.000013113869],"about_ca_topic_score_codex":0.0037420096,"about_ca_topic_score_gemma":0.005025449,"teacher_disagreement_score":0.004024037,"about_ca_system_score_codex":0.002361227,"about_ca_system_score_gemma":0.0016175538,"threshold_uncertainty_score":0.017131925},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44900697,0.018771546,0.45890585,0.016562657,0.0014813243,0.00041334066,0.000416513,0.0048761666,0.049565714],"genre_scores_gemma":[0.94191253,0.0053969114,0.04373628,0.001360116,0.00069490256,0.00006346144,0.00024272519,0.00024985353,0.0063432218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981893,0.0007412487,0.000058226848,0.0002010299,0.00067270506,0.0001376037],"domain_scores_gemma":[0.9960251,0.0027280492,0.00021639555,0.00040956246,0.00046354102,0.0001572812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009879,0.00062581594,0.0007212521,0.0013415753,0.0011178895,0.0018260238,0.0011225947,0.0024622257,0.0009729244],"category_scores_gemma":[0.008517003,0.000371326,0.0005051348,0.00078429107,0.0016205444,0.0048622764,0.0016689411,0.0023759175,0.00020311242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023921016,0.0011322874,0.03543562,0.0014605517,0.0007327657,0.008224438,0.0058237356,0.24399233,0.06441869,0.16508299,0.047747944,0.42355657],"study_design_scores_gemma":[0.00007601316,0.0012370135,0.0076891496,0.0002789875,0.00014220412,0.0055152117,0.001932548,0.80233246,0.043756384,0.058664355,0.07819191,0.00018377062],"about_ca_topic_score_codex":0.0012594566,"about_ca_topic_score_gemma":0.0010989011,"teacher_disagreement_score":0.0024622257,"about_ca_system_score_codex":0.00078611786,"about_ca_system_score_gemma":0.0002551448,"threshold_uncertainty_score":0.0106294155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048678674,0.0011468452,0.9207949,0.0017582979,0.0004112321,0.0010857418,0.00041794634,0.0059365486,0.019769786],"genre_scores_gemma":[0.6789363,0.0009624713,0.28848055,0.0005394556,0.00019100544,0.00081384013,0.0008492864,0.0002502088,0.028976828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986047,0.00038451367,0.00008713174,0.00038377946,0.0004321849,0.00010771335],"domain_scores_gemma":[0.9986179,0.00033522793,0.00012443666,0.0003711235,0.00035739472,0.00019401718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017695432,0.00068331254,0.00079892174,0.0008126546,0.0021628293,0.0022060385,0.0026108974,0.001292908,0.0036851922],"category_scores_gemma":[0.0038444134,0.0004549651,0.0005964115,0.00092830573,0.001065533,0.0045150253,0.00405938,0.0011488075,0.0012859275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013838338,0.0007955166,0.005090675,0.0009717215,0.00038606196,0.0015596194,0.0019763517,0.17642091,0.041842867,0.3186366,0.045662686,0.40527326],"study_design_scores_gemma":[0.00011036855,0.0003909052,0.0010351267,0.000057517318,0.00010504037,0.0007983574,0.00039676751,0.7891644,0.008667171,0.09607961,0.10308634,0.00010835902],"about_ca_topic_score_codex":0.0045983796,"about_ca_topic_score_gemma":0.0047293273,"teacher_disagreement_score":0.0045983796,"about_ca_system_score_codex":0.0009762434,"about_ca_system_score_gemma":0.0021422755,"threshold_uncertainty_score":0.012328267},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013844916,0.00007397222,0.8044742,0.00011391782,0.000095937925,0.00013077816,0.0017486165,0.1849832,0.0069948295],"genre_scores_gemma":[0.04855777,0.0005717131,0.8036075,0.00070835266,0.00020902712,0.0018632747,0.011641276,0.0804364,0.05240463],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999265,0.00010310321,0.00007571776,0.00012855137,0.0003564717,0.00007103535],"domain_scores_gemma":[0.9988457,0.00037616526,0.00014501413,0.00016126537,0.00034269545,0.00012909182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090697093,0.0014043428,0.0007081692,0.0009611474,0.00038288752,0.0009803912,0.003088661,0.0009565176,0.07734941],"category_scores_gemma":[0.0028377548,0.0007733356,0.00075594755,0.0004952729,0.00049554114,0.0015821628,0.0016786715,0.0017719622,0.034554627],"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.00092938956,0.000333893,0.0017606954,0.001554381,0.0001449268,0.00097435754,0.00083472586,0.027268346,0.08144862,0.026572488,0.42548704,0.4326912],"study_design_scores_gemma":[0.00031956282,0.00023614737,0.0018771526,0.00023919797,0.00005964372,0.0009753866,0.000077496414,0.13552533,0.09463021,0.01105872,0.75481635,0.00018469266],"about_ca_topic_score_codex":0.0008174583,"about_ca_topic_score_gemma":0.0013904129,"teacher_disagreement_score":0.07734941,"about_ca_system_score_codex":0.0003931391,"about_ca_system_score_gemma":0.0008225055,"threshold_uncertainty_score":0.25875956},"labels":[],"label_agreement":null},{"id":"W2041088506","doi":"10.1007/s12083-008-0010-x","title":"SUPNET: An end-to-end solution to scalable unstructured P2P networking","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scalability; Computer science; Distributed computing; Protocol (science); Network topology; Computer network; Network dynamics; Network management; End-to-end principle","score_opus":0.02725076734480817,"score_gpt":0.2660315590182152,"score_spread":0.23878079167340702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041088506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023048136,0.0006250323,0.927143,0.0011597628,0.0009768943,0.000550046,0.0010791802,0.028013848,0.01740415],"genre_scores_gemma":[0.34914413,0.0011423036,0.60175925,0.0013460434,0.0006432368,0.0005667911,0.0075437673,0.0015051578,0.036349233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935573,0.000106617896,0.000053508382,0.00009123731,0.00032509692,0.000067856214],"domain_scores_gemma":[0.9988927,0.00021333905,0.00005372852,0.0002951686,0.00039492198,0.00015015215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012307703,0.00093342457,0.00082352816,0.0008257688,0.0007784706,0.0017070635,0.0021774324,0.0009457191,0.0059533603],"category_scores_gemma":[0.0023195138,0.00042372942,0.00032721378,0.00083428225,0.0005011095,0.0022039623,0.0021682386,0.001222114,0.0023915751],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023746248,0.00086356944,0.0032011336,0.0009152751,0.00022979584,0.0010225199,0.00046772376,0.050487272,0.07803886,0.07956969,0.20078187,0.58204764],"study_design_scores_gemma":[0.00029174978,0.00053039845,0.00091194594,0.00007160578,0.000114091614,0.00061944907,0.00018125688,0.7835819,0.043105736,0.052302532,0.11820145,0.000087821376],"about_ca_topic_score_codex":0.0010758861,"about_ca_topic_score_gemma":0.0018235589,"teacher_disagreement_score":0.0059533603,"about_ca_system_score_codex":0.00045679553,"about_ca_system_score_gemma":0.0008774661,"threshold_uncertainty_score":0.019915998},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007441917,0.008489488,0.09941358,0.0091573605,0.003442867,0.00024590574,0.0009933545,0.016809385,0.8540062],"genre_scores_gemma":[0.17725474,0.013315549,0.06551957,0.007982746,0.0036139055,0.00038936717,0.0028969867,0.0036118433,0.72541535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988236,0.00024259549,0.000057000754,0.00024217709,0.0004279511,0.00020671937],"domain_scores_gemma":[0.9970656,0.00045033052,0.00015364391,0.001177388,0.0008258513,0.0003271051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001686009,0.0008614287,0.0007293938,0.0016921302,0.0026595148,0.007642242,0.0023975302,0.0021500753,0.12394879],"category_scores_gemma":[0.0044333274,0.0005141525,0.0005023528,0.0018077012,0.0011549185,0.015010779,0.00506872,0.0028661527,0.06270668],"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.00039022145,0.00017625962,0.0013185533,0.00063156674,0.00007786824,0.0007041884,0.0015963514,0.0017556794,0.006800396,0.2773653,0.3017767,0.40740696],"study_design_scores_gemma":[0.000017198608,0.000060940998,0.00018434398,0.00015843868,0.000030412828,0.0002541466,0.00027614835,0.0016401024,0.0017378265,0.022369394,0.9732459,0.000025096195],"about_ca_topic_score_codex":0.0033916493,"about_ca_topic_score_gemma":0.0028830802,"teacher_disagreement_score":0.12394879,"about_ca_system_score_codex":0.001130387,"about_ca_system_score_gemma":0.0014289308,"threshold_uncertainty_score":0.41464996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030672034,0.0010689779,0.96219033,0.00040504715,0.00008726486,0.00032072025,0.00007254546,0.0007204351,0.004462657],"genre_scores_gemma":[0.58272296,0.0015511567,0.40922606,0.00016933936,0.00020834919,0.00071406603,0.00025621156,0.00008781592,0.0050640684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985827,0.00053561945,0.00006341193,0.00022065328,0.0005253263,0.000072301795],"domain_scores_gemma":[0.9953117,0.002791122,0.00051696657,0.0005976598,0.00056443224,0.00021818008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016617458,0.00046649572,0.0007651614,0.0013915402,0.0018658646,0.001535518,0.0027106262,0.0013660971,0.0014458968],"category_scores_gemma":[0.007242768,0.00044028633,0.0004874794,0.0019489196,0.0008777497,0.003169713,0.0013278105,0.00079628214,0.0007053078],"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.00025632558,0.00036702486,0.0027363307,0.00061843585,0.00015626286,0.00088210293,0.001261943,0.6121888,0.013408063,0.12661472,0.007415623,0.23409437],"study_design_scores_gemma":[0.00005453243,0.00013447314,0.00048644264,0.000030099185,0.000047810612,0.0004271626,0.00016286713,0.9383282,0.003412904,0.041572303,0.015296423,0.0000468043],"about_ca_topic_score_codex":0.002309695,"about_ca_topic_score_gemma":0.0026402462,"teacher_disagreement_score":0.0027106262,"about_ca_system_score_codex":0.0009652761,"about_ca_system_score_gemma":0.0010529993,"threshold_uncertainty_score":0.008788288},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20510405,0.001299085,0.78405523,0.00040946956,0.00025298772,0.00016048613,0.00024963982,0.0021187179,0.00635032],"genre_scores_gemma":[0.8878618,0.00031466607,0.10910662,0.000050066923,0.00007156983,0.00003783732,0.00013387184,0.00003497135,0.002388606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962986,0.0000812859,0.000022639282,0.000046097448,0.00015335645,0.00006678035],"domain_scores_gemma":[0.9987301,0.0003615934,0.00006170514,0.00037495562,0.0004039082,0.00006765618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059967046,0.00031522708,0.000672456,0.0006712692,0.0008688403,0.00043580582,0.00068957085,0.0005007624,0.0009447293],"category_scores_gemma":[0.002111154,0.00013931077,0.00019218717,0.0005185985,0.0002558288,0.00086673594,0.0007157186,0.0006323617,0.00019405397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018377836,0.00042709542,0.0017653612,0.00030834047,0.00013277333,0.0011327413,0.0005275119,0.15733814,0.21325234,0.039035354,0.010700408,0.57354206],"study_design_scores_gemma":[0.00007668127,0.00033320833,0.0013062577,0.0000215739,0.00009499861,0.0008082872,0.000102676466,0.9197929,0.058804132,0.0129791135,0.0056307074,0.000049423903],"about_ca_topic_score_codex":0.0020108148,"about_ca_topic_score_gemma":0.0027400453,"teacher_disagreement_score":0.0020108148,"about_ca_system_score_codex":0.00050703617,"about_ca_system_score_gemma":0.0005488717,"threshold_uncertainty_score":0.00399822},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11712226,0.00046879562,0.83931935,0.00063448644,0.00022156895,0.0011436265,0.000239204,0.029305736,0.011544983],"genre_scores_gemma":[0.87057555,0.00013683696,0.1223096,0.00021877621,0.00005052371,0.0006463995,0.00026551264,0.0005626293,0.0052342936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987595,0.00032176237,0.000088734974,0.0002285738,0.00041083846,0.00019058392],"domain_scores_gemma":[0.9960722,0.001373696,0.00033983384,0.0014285452,0.00029915964,0.000486647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021149938,0.0009120765,0.00086854893,0.00052815507,0.0009625674,0.0013885703,0.0032611114,0.0011918207,0.0063056606],"category_scores_gemma":[0.007560496,0.0005869763,0.00053501636,0.00023424612,0.0013461162,0.003874563,0.005961173,0.0021075327,0.00091133465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005443749,0.002077083,0.008205238,0.0014187568,0.00048114802,0.002439255,0.0025882442,0.116302274,0.26135865,0.21974643,0.029891927,0.35004738],"study_design_scores_gemma":[0.0007148446,0.0008857393,0.0011725301,0.00007638575,0.00008404605,0.00038498998,0.00022854627,0.88557255,0.041096743,0.04531109,0.024384832,0.00008780442],"about_ca_topic_score_codex":0.0010311966,"about_ca_topic_score_gemma":0.0011053797,"teacher_disagreement_score":0.0063056606,"about_ca_system_score_codex":0.00071348494,"about_ca_system_score_gemma":0.0009262992,"threshold_uncertainty_score":0.02109456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109652296,0.00019941684,0.8876786,0.00022911995,0.000017139202,0.000035162495,0.000059518945,0.0003567083,0.0017720332],"genre_scores_gemma":[0.927968,0.00016932597,0.07113054,0.000033939687,0.000026833808,0.000035240537,0.000049634127,0.000035996683,0.00055051025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940705,0.00021801569,0.000019472413,0.00009128003,0.00017975998,0.000084407824],"domain_scores_gemma":[0.9976393,0.0015182925,0.00025677102,0.00022131839,0.00027741943,0.00008691022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841102,0.00037346402,0.0005598977,0.0005136416,0.00047908668,0.0006315206,0.00091118575,0.0005272444,0.0005993567],"category_scores_gemma":[0.0049596746,0.00030262035,0.00025249398,0.0008120891,0.0006194964,0.0016793462,0.0006553905,0.000496544,0.00016104228],"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.00009307854,0.00004131679,0.001032477,0.000048382044,0.000018734963,0.00009198968,0.00007089874,0.95013815,0.009151694,0.013503095,0.0006762777,0.025134008],"study_design_scores_gemma":[0.000005545934,0.000017539292,0.00010854835,0.0000017643836,0.0000042376737,0.000019226733,0.000010303564,0.99354,0.0024566634,0.0035663259,0.0002663017,0.0000037339394],"about_ca_topic_score_codex":0.003047784,"about_ca_topic_score_gemma":0.0028580872,"teacher_disagreement_score":0.003047784,"about_ca_system_score_codex":0.0010563864,"about_ca_system_score_gemma":0.0007569506,"threshold_uncertainty_score":0.0076646805},"labels":[],"label_agreement":null},{"id":"W2044832800","doi":"10.1007/s12083-014-0252-8","title":"Peer-to-peer as an infrastructure service","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; Computer science; Cloud computing; The Internet; File sharing; BitTorrent tracker; Software deployment; Botnet; Peer-to-peer; Service (business); Internet privacy; Service provider; Computer security; World Wide Web; Process (computing); Business","score_opus":0.012793356846929418,"score_gpt":0.2694839227346214,"score_spread":0.256690565887692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044832800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025590027,0.0041052965,0.69933563,0.0045302124,0.0054180822,0.0030048315,0.0024396698,0.06407369,0.1915026],"genre_scores_gemma":[0.6322263,0.0052055744,0.20024167,0.0016983299,0.0029348554,0.000937504,0.0053979224,0.0024062165,0.14895162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979876,0.00033879577,0.00012329718,0.0003660858,0.0009378001,0.0002464196],"domain_scores_gemma":[0.9968104,0.00038308403,0.00022196083,0.0010624978,0.0010154652,0.000506582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014745264,0.0009422217,0.0013684618,0.0011324444,0.0015345949,0.004554775,0.0033398578,0.0022696878,0.019307693],"category_scores_gemma":[0.0051248325,0.00037353465,0.0005204503,0.0016505804,0.00080592046,0.004012503,0.0031400763,0.0013717258,0.017933965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009565419,0.00053465687,0.0016995486,0.0016113622,0.00033837164,0.0017146213,0.0007330726,0.011772378,0.061252587,0.14336337,0.29342866,0.48259482],"study_design_scores_gemma":[0.000268235,0.00049226335,0.0016524051,0.00019771974,0.0002294042,0.002098671,0.0006549187,0.13986903,0.03339468,0.081244275,0.739673,0.00022536653],"about_ca_topic_score_codex":0.0018256571,"about_ca_topic_score_gemma":0.0014669047,"teacher_disagreement_score":0.019307693,"about_ca_system_score_codex":0.0008225396,"about_ca_system_score_gemma":0.0023904808,"threshold_uncertainty_score":0.06459069},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89433116,0.0018333835,0.092908174,0.0012133555,0.00022134883,0.00017493192,0.00015319379,0.00086264865,0.00830186],"genre_scores_gemma":[0.9859213,0.0003720157,0.0129080685,0.000056940058,0.00005620074,0.000039614104,0.000053681768,0.00008606183,0.00050604576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470717,0.0022518777,0.00025142566,0.00041110965,0.0016453813,0.0007330842],"domain_scores_gemma":[0.9182106,0.0698637,0.0041635544,0.004324181,0.0026173228,0.0008206914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042281146,0.0011786378,0.0007809578,0.00081596366,0.0016382094,0.0017126863,0.0011824314,0.0011698852,0.0012187974],"category_scores_gemma":[0.0446167,0.00050883315,0.00043987733,0.0011674672,0.0025430927,0.0048976704,0.0016084595,0.0015931497,0.00021182679],"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.0015284972,0.0003653156,0.0062011625,0.0003402454,0.00010950781,0.00050374365,0.00049918366,0.8836455,0.04077653,0.029096775,0.0010665056,0.03586706],"study_design_scores_gemma":[0.00008374859,0.00072434184,0.0033435302,0.000052025436,0.00017708691,0.00039079448,0.00035914622,0.9077095,0.06858488,0.01672246,0.0017734289,0.00007908834],"about_ca_topic_score_codex":0.002545771,"about_ca_topic_score_gemma":0.0019301992,"teacher_disagreement_score":0.0042281146,"about_ca_system_score_codex":0.0019987442,"about_ca_system_score_gemma":0.001091516,"threshold_uncertainty_score":0.022360682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6274231,0.0026897436,0.357666,0.00081466115,0.000095539835,0.00010801929,0.00012136922,0.0014756611,0.009605951],"genre_scores_gemma":[0.9829336,0.00036265,0.014815506,0.000049594215,0.00003746575,0.000048236347,0.000034080695,0.000062559535,0.0016562849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987985,0.00034743725,0.00008574199,0.00010684459,0.00049143966,0.0001701244],"domain_scores_gemma":[0.9940519,0.0035759865,0.00055588025,0.0010028476,0.0006179166,0.00019551865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017031927,0.0003106579,0.00050739635,0.0006040979,0.0008592887,0.0012195574,0.0012542653,0.00090838707,0.0014767416],"category_scores_gemma":[0.007164277,0.00053911185,0.00030055302,0.00046659782,0.0014867181,0.0045029046,0.0016438358,0.00061298505,0.00021431256],"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.001071207,0.00028675064,0.007790042,0.00073335116,0.000121246136,0.0007494333,0.0017452121,0.6617197,0.050722245,0.16457333,0.0037499997,0.1067374],"study_design_scores_gemma":[0.00013292437,0.00034792873,0.0018727389,0.000050209856,0.00006736703,0.00043365473,0.00025088486,0.8924981,0.020102583,0.078507155,0.0056862948,0.000050075814],"about_ca_topic_score_codex":0.001615402,"about_ca_topic_score_gemma":0.001312127,"teacher_disagreement_score":0.0017031927,"about_ca_system_score_codex":0.0007216291,"about_ca_system_score_gemma":0.00068715366,"threshold_uncertainty_score":0.009007454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57285196,0.00057886343,0.4007018,0.0010770848,0.00019904124,0.00066281465,0.00022931026,0.008494395,0.015204737],"genre_scores_gemma":[0.94572467,0.00013953488,0.052474402,0.00011755765,0.000044409837,0.000101007085,0.00016596318,0.0001157672,0.0011167326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890673,0.00018461629,0.00007923394,0.00024619602,0.00030820793,0.00027507826],"domain_scores_gemma":[0.9975926,0.00052032317,0.00017569125,0.000619821,0.0005833621,0.0005082016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011110081,0.0009034309,0.0009536049,0.0006767729,0.0010257389,0.0017783483,0.0031118295,0.00068852404,0.0016686925],"category_scores_gemma":[0.0035218182,0.00041365786,0.00041696028,0.0010097976,0.0006945192,0.0031448235,0.002390067,0.0011679977,0.00072471943],"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.002591427,0.0035068628,0.021226907,0.00024885754,0.00023881404,0.0011101083,0.00067172764,0.51935965,0.09713189,0.025129938,0.01785371,0.3109302],"study_design_scores_gemma":[0.000079599864,0.0001148664,0.0013472165,0.0000056982394,0.000022337847,0.00009578885,0.00012273567,0.9843241,0.006842392,0.0051108343,0.0019130112,0.00002140702],"about_ca_topic_score_codex":0.012810149,"about_ca_topic_score_gemma":0.007880803,"teacher_disagreement_score":0.012810149,"about_ca_system_score_codex":0.0013677496,"about_ca_system_score_gemma":0.0011880621,"threshold_uncertainty_score":0.02547115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020525727,0.0013157481,0.9624068,0.00047449622,0.00023676203,0.0005021688,0.0005142799,0.004602668,0.009421377],"genre_scores_gemma":[0.35719422,0.0012997915,0.6232554,0.00066993927,0.00020196916,0.0009172374,0.0019136443,0.0004019873,0.014145935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920803,0.00013854989,0.000081281985,0.00018434346,0.0002937715,0.00009412667],"domain_scores_gemma":[0.99888057,0.0001835126,0.00011177043,0.0002888485,0.00043050127,0.000104845414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411356,0.0006418359,0.0007294779,0.0014449992,0.0014039329,0.0014103458,0.0017880831,0.00092715566,0.0059151165],"category_scores_gemma":[0.0016354658,0.00043930302,0.0005465663,0.0017942223,0.0007397393,0.002502092,0.0015933758,0.0013227995,0.0028244709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011556606,0.00054503715,0.0022331148,0.0008743073,0.00017938825,0.0010880287,0.0011260957,0.10966956,0.12909794,0.08290679,0.057111107,0.614013],"study_design_scores_gemma":[0.00020656617,0.0011427136,0.0011815712,0.00011766811,0.0001034593,0.0013718915,0.00040816568,0.80689394,0.059136774,0.037545383,0.091683894,0.00020789682],"about_ca_topic_score_codex":0.0028461842,"about_ca_topic_score_gemma":0.0032483945,"teacher_disagreement_score":0.0059151165,"about_ca_system_score_codex":0.00091443065,"about_ca_system_score_gemma":0.0010177555,"threshold_uncertainty_score":0.019788027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033601895,0.00030355577,0.95323074,0.0005305982,0.00020460608,0.00021319538,0.0003826342,0.0058282847,0.0057044714],"genre_scores_gemma":[0.7006759,0.00039501835,0.28653494,0.00034042096,0.0002371287,0.00020618747,0.0011649632,0.0003896766,0.010055764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737275,0.00042786452,0.00018672079,0.00060662394,0.0011420335,0.00026407823],"domain_scores_gemma":[0.993962,0.0027013195,0.00032188426,0.0021111248,0.00068609795,0.00021752814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028919436,0.0006822402,0.001765762,0.0014175464,0.0010872694,0.0025786993,0.003415123,0.001616957,0.0052991547],"category_scores_gemma":[0.011186404,0.0007182741,0.0010839176,0.0022162315,0.0008182294,0.0042879884,0.0017011005,0.001949045,0.0012977713],"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.00049892825,0.00044560223,0.0043850834,0.0001548374,0.00013675903,0.00030465066,0.00021896214,0.50912535,0.0073139872,0.0572275,0.012550169,0.40763822],"study_design_scores_gemma":[0.00001892823,0.00002058737,0.00017678409,0.000003390584,0.000014406841,0.00006268559,0.000013815631,0.9721315,0.0027716842,0.02243147,0.002342935,0.000011746125],"about_ca_topic_score_codex":0.005890103,"about_ca_topic_score_gemma":0.0054423795,"teacher_disagreement_score":0.005890103,"about_ca_system_score_codex":0.0013749178,"about_ca_system_score_gemma":0.002307785,"threshold_uncertainty_score":0.017727435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021387856,0.0007806567,0.9718929,0.0003477386,0.00007516101,0.000129918,0.00003888403,0.00023746936,0.005109341],"genre_scores_gemma":[0.7922472,0.00070237106,0.20335822,0.00010750182,0.00016415709,0.0002532088,0.00008448092,0.000030108586,0.0030528104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989428,0.000557149,0.000030467478,0.00010993536,0.00028350824,0.00007607124],"domain_scores_gemma":[0.99842155,0.00088802155,0.00018852101,0.00017606914,0.00021541213,0.000110405614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014971893,0.00038671357,0.0005699364,0.0005589888,0.0007156204,0.0008408893,0.0015681986,0.0007730007,0.0014880019],"category_scores_gemma":[0.0039610923,0.00023645573,0.00024687225,0.0006792555,0.00047771083,0.0013311862,0.0009441197,0.00058787066,0.00024721096],"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.00021382135,0.00015244106,0.001092862,0.00021819022,0.00009450057,0.00042589646,0.00027025104,0.6814377,0.01181122,0.16462235,0.0073122396,0.13234854],"study_design_scores_gemma":[0.000015341293,0.000039576298,0.00015009477,0.000006335385,0.000011591076,0.000088489134,0.000025087085,0.97638375,0.00073686294,0.019220455,0.0033141398,0.000008203047],"about_ca_topic_score_codex":0.00085248624,"about_ca_topic_score_gemma":0.0013634982,"teacher_disagreement_score":0.0015681986,"about_ca_system_score_codex":0.0007524933,"about_ca_system_score_gemma":0.00068713346,"threshold_uncertainty_score":0.007918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030798262,0.00017612014,0.95952237,0.00033687538,0.00005714398,0.0003055981,0.00025217724,0.001137923,0.007413485],"genre_scores_gemma":[0.5470448,0.00027268476,0.44536948,0.00020374665,0.000091165806,0.00026511657,0.0006343282,0.00013636805,0.005982325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957451,0.0016955155,0.00023859722,0.0009559794,0.00092461705,0.0004402089],"domain_scores_gemma":[0.99325174,0.0023275793,0.000821655,0.0025198716,0.00083895447,0.00024031749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045215413,0.0011437002,0.0018742933,0.0012320676,0.0015201675,0.0019402195,0.0032558027,0.0028253696,0.0039843926],"category_scores_gemma":[0.01733376,0.0007153862,0.0009042757,0.0027333603,0.00087649445,0.0059345113,0.0028533617,0.0011566095,0.0014192598],"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.0004398175,0.00040547244,0.0049469895,0.0002503913,0.00015462992,0.00027426405,0.0003141078,0.57296354,0.005325085,0.1349109,0.011463059,0.26855174],"study_design_scores_gemma":[0.00007359393,0.00011549179,0.0005522436,0.000017345681,0.000048557755,0.00024816903,0.00010205391,0.9093084,0.005208099,0.07667253,0.0076232,0.000030395504],"about_ca_topic_score_codex":0.0029069576,"about_ca_topic_score_gemma":0.0025493016,"teacher_disagreement_score":0.0045215413,"about_ca_system_score_codex":0.001120317,"about_ca_system_score_gemma":0.0026641164,"threshold_uncertainty_score":0.02391243},"labels":[],"label_agreement":null},{"id":"W2052721903","doi":"10.1007/s12083-012-0167-1","title":"Modelling and performance analysis of content sharing and distribution in community networks with infrastructure support","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Community network; Provisioning; The Internet; Content distribution; Download; Cache; Peer-to-peer; File sharing; Computer network; World Wide Web","score_opus":0.03170153117310551,"score_gpt":0.25251367484783216,"score_spread":0.22081214367472665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052721903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6675788,0.0011456914,0.31817397,0.0013717951,0.00011282943,0.00019475294,0.00027397845,0.00045334653,0.010694825],"genre_scores_gemma":[0.98971283,0.00026280995,0.0076450733,0.000021126909,0.000033811386,0.000051862055,0.00007399334,0.00004648574,0.0021520623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901545,0.00033824268,0.00003521841,0.00012861786,0.00025260108,0.00022983037],"domain_scores_gemma":[0.9932272,0.0052239704,0.00041609438,0.00018314763,0.00072509283,0.00022459372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019621993,0.00082282885,0.00114613,0.0012289006,0.00094635907,0.0019012106,0.0022632256,0.0021792764,0.0018538604],"category_scores_gemma":[0.010827904,0.0005618243,0.0007231595,0.0013920631,0.0014475611,0.0023246815,0.00092159864,0.00092122826,0.00022601396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031808264,0.000036144716,0.00047172926,0.00002122048,0.000007701734,0.000030414216,0.00003068417,0.992182,0.00082562765,0.0045523443,0.00016897601,0.0016414392],"study_design_scores_gemma":[0.0000016624346,0.000005259267,0.00005847561,6.976276e-7,0.0000017938247,0.000004732458,0.0000057632333,0.9991542,0.000106714695,0.00063011376,0.000028868346,0.0000017123244],"about_ca_topic_score_codex":0.028753737,"about_ca_topic_score_gemma":0.0076501225,"teacher_disagreement_score":0.028753737,"about_ca_system_score_codex":0.0031690684,"about_ca_system_score_gemma":0.0018444107,"threshold_uncertainty_score":0.057172716},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8945905,0.000455997,0.09853299,0.0005089455,0.000024214216,0.00009842464,0.00057447806,0.00031075944,0.004903781],"genre_scores_gemma":[0.9777949,0.0002743538,0.020876298,0.000025127008,0.000015378431,0.000040039926,0.0005067856,0.000027182277,0.0004398958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996252,0.00015051167,0.000011261825,0.00007996641,0.0000874379,0.000045454985],"domain_scores_gemma":[0.9970354,0.0020569884,0.00026658695,0.0001819724,0.00029106325,0.00016797385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069558405,0.0003734113,0.00031536684,0.001321296,0.00075524225,0.0008278677,0.00095949863,0.000713511,0.0006796939],"category_scores_gemma":[0.0052128956,0.00023448723,0.00026286463,0.0011794543,0.0006802872,0.002473216,0.00067457167,0.0005533875,0.00014467588],"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.00015935647,0.00018134508,0.026085367,0.00026603023,0.0000922098,0.001349336,0.0015712013,0.89168495,0.012076363,0.030220384,0.0026609127,0.03365254],"study_design_scores_gemma":[0.000011139122,0.000045826804,0.005370273,0.0000134450875,0.000010629826,0.00021468628,0.0011166313,0.97344005,0.001596582,0.016652727,0.0015121188,0.0000157915],"about_ca_topic_score_codex":0.003243641,"about_ca_topic_score_gemma":0.00332278,"teacher_disagreement_score":0.003243641,"about_ca_system_score_codex":0.000674036,"about_ca_system_score_gemma":0.00037948837,"threshold_uncertainty_score":0.0064495206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5205066,0.0015539611,0.4715275,0.00039926797,0.000046436522,0.000097512544,0.00010455964,0.00051245315,0.005251721],"genre_scores_gemma":[0.99411535,0.000092892034,0.005511589,0.000021423539,0.0000076785755,0.000017819848,0.000014041073,0.000013426072,0.00020578399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988545,0.00034387773,0.000055193337,0.00020645822,0.00020826371,0.00033159077],"domain_scores_gemma":[0.9963291,0.0024888776,0.0002980628,0.00033852432,0.00028227933,0.00026309668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015365654,0.00067919365,0.001420662,0.00067442923,0.0010320963,0.0017822736,0.0012063627,0.00071751437,0.0005565343],"category_scores_gemma":[0.0055270414,0.0005339096,0.00025365892,0.00077625044,0.0008975827,0.0020228685,0.0015654563,0.00052998617,0.0001111504],"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.00048501615,0.00011883077,0.0057936064,0.00011828953,0.000071266884,0.0004273661,0.00025195326,0.92746085,0.012466799,0.011166052,0.0006938487,0.04094603],"study_design_scores_gemma":[0.000011289857,0.00005165776,0.00084455294,0.000005224483,0.000015686092,0.00006435507,0.000120569464,0.99293786,0.0016469028,0.00396172,0.00032788125,0.00001227197],"about_ca_topic_score_codex":0.0036142408,"about_ca_topic_score_gemma":0.0031619167,"teacher_disagreement_score":0.0036142408,"about_ca_system_score_codex":0.0011323182,"about_ca_system_score_gemma":0.00095404923,"threshold_uncertainty_score":0.008215606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031557694,0.00041739547,0.94538754,0.00028033322,0.00012043835,0.0005681601,0.00023410034,0.016253691,0.0051806145],"genre_scores_gemma":[0.44643468,0.0004474716,0.5401115,0.00033841736,0.0000885674,0.00051147986,0.00095492246,0.0013057067,0.009807277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999371,0.00009833723,0.00006526079,0.000102443315,0.0002543377,0.00010863731],"domain_scores_gemma":[0.99926287,0.00009011689,0.00004926601,0.00026344546,0.00016477947,0.00016954965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010686213,0.00052290026,0.0006929193,0.0006102133,0.0009290967,0.0017375554,0.0030073938,0.00096890604,0.0024329373],"category_scores_gemma":[0.0014185862,0.00044404247,0.00093650183,0.00065198523,0.00049596146,0.0020533996,0.0021745088,0.0011877946,0.00085063506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029462157,0.0020385818,0.010999822,0.0011675205,0.00059592776,0.0046383464,0.0019506697,0.09779732,0.17843923,0.13238627,0.05028145,0.51675856],"study_design_scores_gemma":[0.00029680197,0.0003298364,0.0026993102,0.00006759338,0.00017853563,0.001090416,0.00020566028,0.8815428,0.034314774,0.0136241065,0.06548338,0.00016676143],"about_ca_topic_score_codex":0.009605328,"about_ca_topic_score_gemma":0.008952323,"teacher_disagreement_score":0.009605328,"about_ca_system_score_codex":0.0007872941,"about_ca_system_score_gemma":0.0017406316,"threshold_uncertainty_score":0.019098818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04789229,0.002001365,0.93016094,0.0007625343,0.00034763254,0.00038902232,0.00028457138,0.0020978926,0.016063869],"genre_scores_gemma":[0.69537485,0.0016596611,0.2869538,0.00018159188,0.00029768588,0.00043837688,0.0004676022,0.00013892892,0.014487475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946016,0.00014523609,0.000038533497,0.000047021615,0.00025130878,0.000057834375],"domain_scores_gemma":[0.9994338,0.00014412226,0.000034718993,0.00018396637,0.00015069354,0.000052698153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075865234,0.00033292026,0.0005475273,0.000595137,0.001209869,0.0008124746,0.001056254,0.0006415124,0.002358342],"category_scores_gemma":[0.0021782294,0.00015311966,0.00029061546,0.001115189,0.0004790186,0.0015118524,0.0013422519,0.0007656318,0.00053248426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008797231,0.00023077395,0.0009328882,0.00051062607,0.00009822344,0.00067780964,0.0007625595,0.08031995,0.0556895,0.31175187,0.024818381,0.52332765],"study_design_scores_gemma":[0.00018937215,0.00047374092,0.0009811319,0.00006721991,0.00012920403,0.00074569794,0.00017127236,0.7236902,0.016247552,0.13696423,0.12025652,0.00008382247],"about_ca_topic_score_codex":0.0015816258,"about_ca_topic_score_gemma":0.0017586766,"teacher_disagreement_score":0.002358342,"about_ca_system_score_codex":0.0007531806,"about_ca_system_score_gemma":0.000684187,"threshold_uncertainty_score":0.00788945},"labels":[],"label_agreement":null},{"id":"W2055355018","doi":"10.1007/s12083-008-0026-2","title":"A contribution-based service differentiation scheme for peer-to-peer systems","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upload; Reputation; Peer-to-peer; Computer science; Incentive; Service (business); Reputation system; Free rider problem; Internet privacy; Scheme (mathematics); Computer security; File sharing; World Wide Web; Business; Marketing; The Internet","score_opus":0.019710691259394574,"score_gpt":0.2762502087912448,"score_spread":0.2565395175318502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055355018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04060902,0.0011935406,0.94777215,0.0009424937,0.00073929114,0.00050551764,0.00013866251,0.002354892,0.0057444284],"genre_scores_gemma":[0.676701,0.00059524755,0.31086546,0.00033254744,0.000467646,0.00026626917,0.0002734459,0.00017640235,0.010321916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967709,0.0007821293,0.00025554662,0.00042915877,0.0014248911,0.00033719675],"domain_scores_gemma":[0.99327177,0.001786872,0.0002908938,0.0015941724,0.0022300156,0.00082627556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045394464,0.0008767132,0.0019990013,0.0013522975,0.0029965008,0.0022953781,0.0041950806,0.001913558,0.0026243536],"category_scores_gemma":[0.009395869,0.00043578405,0.00057595345,0.0017672578,0.0012187916,0.0028636272,0.004088425,0.0024548103,0.0016175882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027263702,0.00085428794,0.001630137,0.000751977,0.00019209896,0.00093512295,0.0014163606,0.09865259,0.1116176,0.18694092,0.018084418,0.5761981],"study_design_scores_gemma":[0.0002995882,0.0005523835,0.0005220137,0.00005286072,0.00016428695,0.00088678027,0.00018817672,0.8869247,0.0286577,0.058564454,0.023007413,0.00017969584],"about_ca_topic_score_codex":0.0016962199,"about_ca_topic_score_gemma":0.0018168549,"teacher_disagreement_score":0.0045394464,"about_ca_system_score_codex":0.001479082,"about_ca_system_score_gemma":0.0021378684,"threshold_uncertainty_score":0.024007142},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042640854,0.00012679101,0.94748527,0.00015222977,0.00007118411,0.00024308206,0.000029350123,0.006814909,0.0024362397],"genre_scores_gemma":[0.5595355,0.00015667136,0.43771195,0.00006730837,0.000029999168,0.00016416183,0.000116683266,0.00030957098,0.0019082013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998789,0.00038257395,0.00010559901,0.00013420063,0.00047571454,0.000113003305],"domain_scores_gemma":[0.9983493,0.0006285542,0.00013090465,0.00048817956,0.00029494922,0.00010818287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013931307,0.00033578151,0.0005248854,0.0004049481,0.0007808819,0.000999196,0.0013949715,0.00078026,0.0010232175],"category_scores_gemma":[0.0041160216,0.00037879948,0.0003005086,0.00033915785,0.0006089421,0.0013894665,0.0011149277,0.0010131694,0.0003867847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001008114,0.00079465355,0.00892144,0.0006003144,0.00028106748,0.002363991,0.0015302732,0.15499274,0.16545054,0.06302935,0.010793099,0.5902344],"study_design_scores_gemma":[0.00015319047,0.0003592529,0.0016354864,0.00004997901,0.00006697083,0.00094523345,0.00019365756,0.8616515,0.0985863,0.013798495,0.022478152,0.000081836566],"about_ca_topic_score_codex":0.001260137,"about_ca_topic_score_gemma":0.0010584102,"teacher_disagreement_score":0.0013949715,"about_ca_system_score_codex":0.0003284546,"about_ca_system_score_gemma":0.000539035,"threshold_uncertainty_score":0.007367611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7313754,0.0038999594,0.25812227,0.00054239266,0.00009917727,0.0002030035,0.00021187257,0.0009439019,0.004601957],"genre_scores_gemma":[0.9759828,0.00066558865,0.022396741,0.000046791192,0.000054473145,0.000047586647,0.0001435224,0.000074377465,0.00058820116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383175,0.0015769798,0.00035904866,0.0013674435,0.0024315391,0.0004331323],"domain_scores_gemma":[0.9529255,0.03252997,0.004686039,0.0031663962,0.005789345,0.0009027774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043729534,0.0009478673,0.0009505208,0.001400451,0.0010476266,0.0014399023,0.00174562,0.001426406,0.0007711422],"category_scores_gemma":[0.038222026,0.00056817714,0.00040662196,0.0023056066,0.0010253912,0.005139979,0.00074727915,0.0014083481,0.00019904113],"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.0014272728,0.0011593376,0.14932378,0.0017570093,0.0004907834,0.0017960034,0.004914022,0.47511566,0.120904274,0.04512506,0.0035268655,0.19445997],"study_design_scores_gemma":[0.000044446013,0.001094315,0.028575558,0.000091160444,0.00017504481,0.0010262213,0.0009920591,0.8927738,0.065322354,0.005446845,0.004347995,0.000110160225],"about_ca_topic_score_codex":0.0041547404,"about_ca_topic_score_gemma":0.0018208761,"teacher_disagreement_score":0.0043729534,"about_ca_system_score_codex":0.0017604656,"about_ca_system_score_gemma":0.0011395833,"threshold_uncertainty_score":0.023126662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02480918,0.001617473,0.9538489,0.00232023,0.0005346602,0.00018004833,0.00007376066,0.0029026505,0.013712995],"genre_scores_gemma":[0.5411126,0.0028000276,0.3883162,0.001501561,0.00081184256,0.00049459684,0.00043670772,0.0006588646,0.06386757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810827,0.00033320373,0.000072252486,0.0005467619,0.0007572022,0.0001823055],"domain_scores_gemma":[0.99789774,0.000591018,0.00011560258,0.00031563675,0.0007711809,0.00030875872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022399588,0.0010632667,0.00087835913,0.0007005672,0.000991453,0.005475404,0.0019407397,0.0028193519,0.007414498],"category_scores_gemma":[0.004368446,0.0006233604,0.00068639446,0.0004509713,0.0016036686,0.005234594,0.0022152732,0.0036131556,0.00207431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021059897,0.00067781267,0.0031847842,0.00079333247,0.00018488374,0.0020327272,0.0029039413,0.054558046,0.19660157,0.23062763,0.021374522,0.48495477],"study_design_scores_gemma":[0.00037291602,0.0011148292,0.0032073923,0.0003229031,0.0001197413,0.0015534131,0.0009845364,0.6630906,0.09316621,0.043671772,0.19222513,0.00017061718],"about_ca_topic_score_codex":0.013283447,"about_ca_topic_score_gemma":0.0064805862,"teacher_disagreement_score":0.013283447,"about_ca_system_score_codex":0.0015262556,"about_ca_system_score_gemma":0.001301613,"threshold_uncertainty_score":0.026412308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04445876,0.0002277578,0.9174122,0.00026218238,0.0001669517,0.0011704679,0.00011194409,0.01097215,0.02521754],"genre_scores_gemma":[0.43244433,0.00026350282,0.5263844,0.0002809851,0.00008767555,0.0012168912,0.00026762357,0.00091416674,0.03814043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.00023756955,0.000058585854,0.00016124228,0.00031820135,0.00011016047],"domain_scores_gemma":[0.99904317,0.0003574532,0.000096752,0.00017629995,0.0001766271,0.00014973829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011823497,0.0011101955,0.00052133034,0.0003340833,0.0007862546,0.0017647621,0.0024231293,0.0008736848,0.012307021],"category_scores_gemma":[0.0024898895,0.00032849502,0.00045742685,0.00017417641,0.0012208272,0.0020509856,0.0023058853,0.0014340715,0.0012449304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044221273,0.0017184099,0.0042044916,0.0014012331,0.00037153246,0.0012374523,0.0042737504,0.06886704,0.30726364,0.18682708,0.021101477,0.3983118],"study_design_scores_gemma":[0.0007183931,0.002465383,0.002555786,0.00027050776,0.00028884254,0.0009716461,0.0005537738,0.6224475,0.15949944,0.028838426,0.18120444,0.00018586851],"about_ca_topic_score_codex":0.001881739,"about_ca_topic_score_gemma":0.002286203,"teacher_disagreement_score":0.012307021,"about_ca_system_score_codex":0.00073624507,"about_ca_system_score_gemma":0.0006939632,"threshold_uncertainty_score":0.041171074},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011424187,0.00009192837,0.9798726,0.00017771953,0.000040051757,0.00013402774,0.00003060618,0.0001384844,0.008090465],"genre_scores_gemma":[0.5823054,0.00032306652,0.40320402,0.0001254595,0.00011654598,0.00031766648,0.00008676124,0.00010060968,0.01342052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909604,0.00032112515,0.000035076642,0.00011022677,0.00034872902,0.00008877596],"domain_scores_gemma":[0.9991978,0.00036460024,0.00006132229,0.0001288878,0.00016607084,0.000081300066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016355701,0.00051795406,0.00063082186,0.0004864309,0.000798022,0.0012580197,0.0025073374,0.00079614215,0.0035319787],"category_scores_gemma":[0.0026216628,0.00025461067,0.0006162487,0.00053393375,0.00078862166,0.001691953,0.0010168323,0.0010594805,0.00047157088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021297245,0.00026351132,0.0003187487,0.00019498641,0.00006961736,0.00040645013,0.00025549042,0.36498043,0.015012215,0.5003694,0.004264298,0.1136519],"study_design_scores_gemma":[0.00006120659,0.00010114297,0.00009496774,0.000006083081,0.00001991496,0.00014103053,0.00002754286,0.9218902,0.002112927,0.07142954,0.004095658,0.000019818352],"about_ca_topic_score_codex":0.0016030326,"about_ca_topic_score_gemma":0.0018280745,"teacher_disagreement_score":0.0035319787,"about_ca_system_score_codex":0.00093988114,"about_ca_system_score_gemma":0.0012691644,"threshold_uncertainty_score":0.011815667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86233926,0.0016933826,0.124764726,0.0014973386,0.00042017212,0.00012536577,0.0001845179,0.00035177075,0.008623466],"genre_scores_gemma":[0.9946518,0.000119743316,0.0044897823,0.000049095153,0.00007683873,0.000014263272,0.000024632503,0.000024096476,0.00054981373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951309,0.0023310801,0.0002222514,0.00051284966,0.00106955,0.00073337124],"domain_scores_gemma":[0.9387925,0.04847791,0.0018912248,0.0038746372,0.0057805507,0.0011831822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01047944,0.00069538254,0.0015364204,0.0010330023,0.001968804,0.0023496677,0.0017109758,0.0012683837,0.0013972756],"category_scores_gemma":[0.041941136,0.0004554874,0.0003507195,0.0009025679,0.0023843946,0.003271771,0.001981106,0.0014753775,0.00022336269],"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.0033093803,0.00035592171,0.0072610136,0.00015380392,0.0001334382,0.00024477358,0.0005018561,0.87664276,0.012241837,0.068207465,0.0029170816,0.028030677],"study_design_scores_gemma":[0.00003970263,0.00014488756,0.0006524141,0.0000064660026,0.000025447176,0.000058272777,0.00008065321,0.9886262,0.0019882892,0.0081596775,0.00019834173,0.000019606752],"about_ca_topic_score_codex":0.005219101,"about_ca_topic_score_gemma":0.0037195948,"teacher_disagreement_score":0.01047944,"about_ca_system_score_codex":0.0022220248,"about_ca_system_score_gemma":0.0020113075,"threshold_uncertainty_score":0.055421233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026515936,0.00005114577,0.9961726,0.00006290665,0.000019977597,0.000041833384,0.000010130682,0.00028709977,0.0007027646],"genre_scores_gemma":[0.2639075,0.00020156516,0.7337333,0.00006903139,0.00004825708,0.0002669561,0.000071479415,0.00018227287,0.0015196019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798393,0.00092463556,0.00010830883,0.00023273693,0.00064789876,0.000102520295],"domain_scores_gemma":[0.9969285,0.0014582276,0.00025212124,0.0007016391,0.00042040332,0.00023917439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023361072,0.0006088852,0.0006778041,0.0008239834,0.001175368,0.001950242,0.0027965433,0.0012547517,0.0015567776],"category_scores_gemma":[0.008342332,0.0006739895,0.000867721,0.00057998806,0.0013501091,0.0023169508,0.003009877,0.002006033,0.00035902503],"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.00019558168,0.000116189476,0.0013926652,0.00014104237,0.0000994522,0.00014726495,0.0007805694,0.7018142,0.013183294,0.21512951,0.001320053,0.065680206],"study_design_scores_gemma":[0.000029901372,0.000044415712,0.00008123493,0.00001307629,0.00001718677,0.000039360686,0.000048182414,0.95952785,0.0042063706,0.029475741,0.006493034,0.000023647368],"about_ca_topic_score_codex":0.002719588,"about_ca_topic_score_gemma":0.0034196398,"teacher_disagreement_score":0.0027965433,"about_ca_system_score_codex":0.0009946347,"about_ca_system_score_gemma":0.0015435206,"threshold_uncertainty_score":0.012354612},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21627285,0.001502965,0.77735704,0.00060621527,0.00012440504,0.00015319033,0.00003774816,0.00064199016,0.0033036137],"genre_scores_gemma":[0.96643984,0.0003172338,0.032218877,0.00007462108,0.000082689905,0.000049952472,0.000019756108,0.000020562953,0.0007765164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.0002866447,0.000029770667,0.0001440862,0.0002571457,0.00010902252],"domain_scores_gemma":[0.9982546,0.0010071432,0.00016146964,0.00015265813,0.00026724252,0.00015684406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015517422,0.0004605646,0.0008303081,0.00042225642,0.0011184163,0.000745534,0.001240809,0.0010389359,0.0005690793],"category_scores_gemma":[0.0029800718,0.0002482384,0.00027731038,0.00041004425,0.00076337415,0.0018186676,0.0012101802,0.00071654,0.00008633105],"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.00048416108,0.00029116787,0.0032707844,0.00041691287,0.00010564668,0.0020450177,0.0010561711,0.74399394,0.056130752,0.030577768,0.0030003102,0.15862744],"study_design_scores_gemma":[0.000028610797,0.00016419859,0.0006085279,0.000012934213,0.000028541846,0.00032260965,0.00020232263,0.98090035,0.0069044176,0.008972218,0.0018270275,0.000028233144],"about_ca_topic_score_codex":0.001980924,"about_ca_topic_score_gemma":0.002056647,"teacher_disagreement_score":0.001980924,"about_ca_system_score_codex":0.00068385294,"about_ca_system_score_gemma":0.0006359927,"threshold_uncertainty_score":0.008206546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051475592,0.0015206679,0.7076139,0.0022598477,0.0013428893,0.0009794845,0.0018750471,0.15732224,0.07561043],"genre_scores_gemma":[0.6455165,0.00073565356,0.27694717,0.000777993,0.0006538126,0.0005056331,0.0048296256,0.0038716933,0.06616195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976937,0.00048543475,0.00021563214,0.00044058816,0.0009431259,0.00022147637],"domain_scores_gemma":[0.9946319,0.000958926,0.00050118146,0.0018766696,0.0012436094,0.0007877235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035239407,0.0006654597,0.00093870657,0.0019950648,0.0018304486,0.0030138975,0.0026198558,0.0015182919,0.011522521],"category_scores_gemma":[0.012357376,0.0005679151,0.00055225304,0.0008397587,0.0007747355,0.008076778,0.0047378168,0.0013984911,0.0055026268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002475667,0.00060871674,0.010207522,0.00068137876,0.00021511645,0.0012672998,0.0022087938,0.009000657,0.018764867,0.07729828,0.17823297,0.6990387],"study_design_scores_gemma":[0.00044007058,0.0007034857,0.007909555,0.00018154281,0.00033252218,0.0020558431,0.00042622891,0.38658747,0.026804574,0.052065957,0.52200735,0.00048547733],"about_ca_topic_score_codex":0.0065389676,"about_ca_topic_score_gemma":0.0076493407,"teacher_disagreement_score":0.011522521,"about_ca_system_score_codex":0.0012306209,"about_ca_system_score_gemma":0.0013198503,"threshold_uncertainty_score":0.03854668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52142,0.0067956797,0.4334355,0.00079068134,0.0009268021,0.0006069613,0.0012727849,0.023647329,0.011104196],"genre_scores_gemma":[0.89961386,0.00059042376,0.09741914,0.00006459148,0.000092730166,0.000063889696,0.0006904208,0.00017716041,0.001287704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998147,0.00032791085,0.00014875636,0.0003058932,0.0008054095,0.0002650857],"domain_scores_gemma":[0.9969553,0.0007610899,0.0001805633,0.0007384838,0.0011137265,0.00025088582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015802544,0.0007989987,0.0012439425,0.0011879128,0.00083293504,0.0012453491,0.002535098,0.00082103565,0.0016897161],"category_scores_gemma":[0.0059914514,0.00025466262,0.00031245314,0.0014002629,0.0004851352,0.0031238329,0.0015320844,0.0008471495,0.00085310265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006874375,0.000835102,0.0075008343,0.0010708247,0.00026271283,0.0015254726,0.0007163594,0.30157784,0.18315324,0.01405543,0.022736467,0.45969138],"study_design_scores_gemma":[0.00038779623,0.00192893,0.0019083447,0.000026559645,0.00008560331,0.0010160353,0.0001862068,0.92443967,0.058894705,0.0034188204,0.007581137,0.00012611836],"about_ca_topic_score_codex":0.004249033,"about_ca_topic_score_gemma":0.00300204,"teacher_disagreement_score":0.004249033,"about_ca_system_score_codex":0.0009709233,"about_ca_system_score_gemma":0.0014334884,"threshold_uncertainty_score":0.008448601},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062364724,0.11032471,0.60215026,0.0052408,0.0017167843,0.0004512639,0.0003343306,0.0032275408,0.21418957],"genre_scores_gemma":[0.562876,0.18292932,0.1987652,0.0010332321,0.0037933064,0.00024343676,0.0010447019,0.00052791106,0.04878688],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906296,0.0001282668,0.00003056947,0.00012127586,0.0005790395,0.00007791164],"domain_scores_gemma":[0.99895287,0.00046789975,0.00006238904,0.00019064009,0.00026682368,0.000059259408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064832444,0.00062086806,0.0007766744,0.00092916266,0.0008453183,0.003241531,0.001544352,0.0014030273,0.0062362985],"category_scores_gemma":[0.001996405,0.00039311865,0.00030242943,0.0018713145,0.0009317575,0.0044135754,0.0012372861,0.0012430168,0.0023045165],"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.00021666968,0.00019205356,0.0008565416,0.0016266368,0.000036172554,0.00028766386,0.00030424242,0.0097783,0.032032616,0.08824711,0.017178424,0.84924376],"study_design_scores_gemma":[0.00006361959,0.00070009095,0.0025542872,0.0006481047,0.00011550086,0.002550186,0.00064820296,0.24659543,0.06483094,0.097624525,0.5835052,0.00016389716],"about_ca_topic_score_codex":0.0014613124,"about_ca_topic_score_gemma":0.0008931946,"teacher_disagreement_score":0.0062362985,"about_ca_system_score_codex":0.0006572126,"about_ca_system_score_gemma":0.0007056836,"threshold_uncertainty_score":0.02086246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045200426,0.00019213198,0.9460348,0.00031808316,0.00007311881,0.00011405709,0.000029603081,0.0042137946,0.0038239774],"genre_scores_gemma":[0.37813032,0.000230596,0.61157954,0.00009991422,0.000056596273,0.00014135952,0.00015005597,0.00047005143,0.009141557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989442,0.0002244681,0.00008121465,0.00031460475,0.00030657195,0.00012899931],"domain_scores_gemma":[0.99885154,0.00028211094,0.00014365486,0.00033305906,0.00023491384,0.00015472622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012905508,0.0007586805,0.00079347653,0.0009053322,0.002425918,0.0019503772,0.0016863438,0.0013924754,0.004845265],"category_scores_gemma":[0.0027782063,0.0007263494,0.0004981654,0.00078261504,0.00093610265,0.0022467545,0.0020414423,0.001184108,0.0023198086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009820685,0.00046328752,0.0038022792,0.00032459202,0.00007641623,0.0016920465,0.001532708,0.3781654,0.10645383,0.07897003,0.0063939984,0.4211434],"study_design_scores_gemma":[0.00016005557,0.00032796263,0.00097198813,0.000051958472,0.00010777027,0.0008184723,0.0005942622,0.87072194,0.051755134,0.037357572,0.03704342,0.000089555055],"about_ca_topic_score_codex":0.0039751763,"about_ca_topic_score_gemma":0.004759424,"teacher_disagreement_score":0.004845265,"about_ca_system_score_codex":0.0012894707,"about_ca_system_score_gemma":0.0018867286,"threshold_uncertainty_score":0.016209006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146124065,0.0003377125,0.9814818,0.00018295458,0.00015160917,0.00023113846,0.0003075092,0.00093831134,0.0017566119],"genre_scores_gemma":[0.21505554,0.0008063773,0.7786054,0.00014331016,0.00010385478,0.00035207192,0.0014120048,0.00013558865,0.0033858346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947196,0.0001416676,0.0000770193,0.00008766302,0.0002018717,0.000019890056],"domain_scores_gemma":[0.99869376,0.00033374308,0.00015888432,0.00041181597,0.00031919417,0.00008260823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085845427,0.00038874257,0.0004144737,0.0007172908,0.00053201424,0.00079328596,0.0007364584,0.00039813793,0.0012656944],"category_scores_gemma":[0.003058388,0.00025218216,0.00033220084,0.00097300136,0.00033593766,0.0012841264,0.0009702718,0.00043031704,0.00037348003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005161976,0.0001282102,0.002141377,0.0006885392,0.000094347226,0.000919733,0.00046147202,0.23789373,0.093902096,0.13692896,0.018418137,0.5079072],"study_design_scores_gemma":[0.00010792622,0.00046604365,0.00078528596,0.000072856805,0.00007793394,0.0007606028,0.00023966112,0.844722,0.03243713,0.03764796,0.08261358,0.00006906626],"about_ca_topic_score_codex":0.0008601951,"about_ca_topic_score_gemma":0.0014929035,"teacher_disagreement_score":0.0012656944,"about_ca_system_score_codex":0.00036887804,"about_ca_system_score_gemma":0.00077455165,"threshold_uncertainty_score":0.004540026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48438072,0.0018486612,0.4938926,0.0018099924,0.00011135613,0.00033011232,0.00076029985,0.0006966319,0.016169637],"genre_scores_gemma":[0.9875058,0.00047890772,0.009578026,0.00006299552,0.0000489494,0.00008102976,0.00018759197,0.000048240403,0.0020084975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999278,0.00018154389,0.000027840606,0.0001250307,0.00024465116,0.00014288367],"domain_scores_gemma":[0.99749184,0.0016199552,0.00022615922,0.00008087707,0.00044754427,0.00013355706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009341296,0.0008449523,0.00090444763,0.0007055837,0.00062874507,0.00080755784,0.0010411682,0.001102877,0.0016845947],"category_scores_gemma":[0.004897547,0.0003783678,0.0005697987,0.0006667976,0.0007124171,0.0012617199,0.0007098185,0.0007891321,0.00017790841],"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.000030159044,0.000024094901,0.00092963385,0.000047914506,0.000026427311,0.0001583449,0.00004420372,0.98706335,0.0020425222,0.0061882013,0.00046674456,0.002978472],"study_design_scores_gemma":[0.000001335266,0.0000047318395,0.00017056812,0.0000012231515,0.0000016641284,0.000008427254,0.000011207246,0.9987197,0.00010248264,0.00090383826,0.000072682575,0.000002222113],"about_ca_topic_score_codex":0.015545319,"about_ca_topic_score_gemma":0.00434158,"teacher_disagreement_score":0.015545319,"about_ca_system_score_codex":0.0018000038,"about_ca_system_score_gemma":0.0011013283,"threshold_uncertainty_score":0.030909657},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9696424,0.00091604877,0.017049095,0.0010797796,0.000044902874,0.000035019453,0.0010712697,0.00039849558,0.009763036],"genre_scores_gemma":[0.99844235,0.00009468931,0.0006721759,0.000035977355,0.00001691614,0.0000075932517,0.0003062304,0.000027670689,0.00039650628],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99721754,0.00083672866,0.00021554215,0.000623394,0.0007118229,0.0003950109],"domain_scores_gemma":[0.7888054,0.18161266,0.010812612,0.00898601,0.006538799,0.0032445323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068661836,0.00023708805,0.00051169813,0.0014685421,0.000628612,0.001587667,0.0010319203,0.0011414209,0.0053685973],"category_scores_gemma":[0.09924795,0.00030841216,0.00023360422,0.0017344897,0.0009076768,0.0027241183,0.0005983605,0.0019764889,0.000985587],"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.004670787,0.0017258344,0.68321323,0.00082264194,0.00030889112,0.0011646472,0.0070605516,0.070053995,0.03228085,0.07302657,0.017330602,0.1083414],"study_design_scores_gemma":[0.00019728635,0.000852201,0.6568588,0.00026466584,0.00017355307,0.0032827293,0.0040346296,0.24133335,0.021185584,0.06251639,0.00909992,0.00020088952],"about_ca_topic_score_codex":0.002743053,"about_ca_topic_score_gemma":0.0015795572,"teacher_disagreement_score":0.0068661836,"about_ca_system_score_codex":0.00096306234,"about_ca_system_score_gemma":0.00086571,"threshold_uncertainty_score":0.036312282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022388507,0.0006536634,0.94519067,0.0003676569,0.00020976347,0.00042009848,0.00011990401,0.024612807,0.0060369554],"genre_scores_gemma":[0.3100031,0.0010181948,0.6099053,0.000986953,0.00047802684,0.0011410508,0.0009232896,0.007604924,0.067939214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944701,0.0011044235,0.0004169315,0.001175947,0.0023695738,0.0004629977],"domain_scores_gemma":[0.99138665,0.0016153825,0.00032921994,0.0036605925,0.0023506144,0.00065747264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058877943,0.0017288242,0.0020857092,0.0017961868,0.002598181,0.005152567,0.005436902,0.002584711,0.007933572],"category_scores_gemma":[0.008176367,0.0016631933,0.0014025831,0.0011005171,0.0017691642,0.0059415875,0.005575038,0.0040359627,0.0049190503],"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.0035462107,0.0011833588,0.008403655,0.0011798419,0.0004605548,0.0019668064,0.006598251,0.02861681,0.16755098,0.11152708,0.028567374,0.64039904],"study_design_scores_gemma":[0.00072990195,0.0011923591,0.0037717568,0.0003534756,0.0005105046,0.0025044396,0.0012182151,0.44497782,0.22542301,0.037052248,0.28177786,0.0004883516],"about_ca_topic_score_codex":0.0052307737,"about_ca_topic_score_gemma":0.0040984945,"teacher_disagreement_score":0.007933572,"about_ca_system_score_codex":0.0018096425,"about_ca_system_score_gemma":0.00185589,"threshold_uncertainty_score":0.031138003},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97130585,0.00013537261,0.026370145,0.00057356706,0.000011936369,0.000016183209,0.00024470093,0.00006472833,0.0012776671],"genre_scores_gemma":[0.99889046,0.000044553155,0.0008710785,0.000016814303,0.000008901814,0.0000049317987,0.000084002284,0.000006859058,0.00007245304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999574,0.00011508272,0.00003185824,0.00009216746,0.000113749775,0.00007312647],"domain_scores_gemma":[0.9971493,0.0017991812,0.00050697784,0.00018278322,0.00023300959,0.0001287631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526127,0.00033830325,0.0004718308,0.0006680552,0.00031847437,0.0011270102,0.0007084919,0.00081808056,0.00030800138],"category_scores_gemma":[0.007246726,0.0003459575,0.00021767638,0.00071336963,0.00041557598,0.0015415356,0.0006769648,0.00077556283,0.00008344024],"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.00023806968,0.00013585723,0.13713723,0.00006323554,0.00007199102,0.00038086044,0.0005726304,0.8176315,0.007371016,0.016221177,0.001083898,0.01909246],"study_design_scores_gemma":[0.000003535137,0.0000121151625,0.015940983,0.0000024778424,0.0000034168863,0.00002806651,0.00012021276,0.9789873,0.00036635823,0.004342644,0.00018400721,0.000008911547],"about_ca_topic_score_codex":0.008266362,"about_ca_topic_score_gemma":0.0036818096,"teacher_disagreement_score":0.008266362,"about_ca_system_score_codex":0.0010378422,"about_ca_system_score_gemma":0.00034332127,"threshold_uncertainty_score":0.016436517},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010339454,0.00009390162,0.98344654,0.00010919404,0.00005184657,0.0000804198,0.000043562326,0.0033250293,0.0025100217],"genre_scores_gemma":[0.42221388,0.00023093459,0.5718672,0.00008457034,0.00004589563,0.00032632877,0.0002449002,0.00030200256,0.0046842145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993318,0.00026533988,0.000046997913,0.00007009497,0.0002432932,0.00004242022],"domain_scores_gemma":[0.9990558,0.00022315672,0.000048356484,0.00037048792,0.00016953264,0.00013271256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010544795,0.00035251438,0.00041439076,0.0005671359,0.00094366336,0.0015647471,0.002125049,0.00096309575,0.0035734943],"category_scores_gemma":[0.00204752,0.00033994383,0.0004535401,0.00043246924,0.0007540506,0.00183052,0.001970344,0.0012697938,0.0011361879],"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.00065675937,0.00024049713,0.0030146032,0.00020017369,0.00016466263,0.0003443297,0.00094990956,0.52475286,0.051015273,0.2776346,0.0070305117,0.13399586],"study_design_scores_gemma":[0.00002944917,0.000080549995,0.00023220894,0.0000117920945,0.0000204459,0.000098095305,0.000044979624,0.94896805,0.008418783,0.025554862,0.016505891,0.000034983765],"about_ca_topic_score_codex":0.0021222166,"about_ca_topic_score_gemma":0.0022226379,"teacher_disagreement_score":0.0035734943,"about_ca_system_score_codex":0.0006619822,"about_ca_system_score_gemma":0.00079919165,"threshold_uncertainty_score":0.011954546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4426662,0.0015682897,0.52461,0.0017584275,0.0014420165,0.00030338197,0.0004512634,0.0074299565,0.019770514],"genre_scores_gemma":[0.9636688,0.00022777743,0.03273308,0.00010975632,0.00016883774,0.000038414943,0.00013426687,0.000073103154,0.002845926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995067,0.00013126343,0.000054114156,0.00007243263,0.00018974683,0.00004578082],"domain_scores_gemma":[0.99810094,0.00090996525,0.00014748244,0.00028221178,0.00040709987,0.00015237808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013974813,0.00023970354,0.0006006071,0.0005300276,0.0005371044,0.0011596599,0.00066532684,0.0006578872,0.0025249298],"category_scores_gemma":[0.004197326,0.00021582592,0.00018968576,0.00053945807,0.00025267026,0.0016351194,0.0006641456,0.0006400409,0.0005407301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029972983,0.0016749358,0.0133972075,0.00055746257,0.00023723925,0.0012602078,0.0014424798,0.07011472,0.14103131,0.016842447,0.015429067,0.73501575],"study_design_scores_gemma":[0.00036076232,0.0006118092,0.013094119,0.00003891992,0.0002670045,0.00083496736,0.0007823677,0.88594395,0.06306545,0.013543091,0.02134104,0.0001165491],"about_ca_topic_score_codex":0.001407451,"about_ca_topic_score_gemma":0.0022506316,"teacher_disagreement_score":0.0025249298,"about_ca_system_score_codex":0.00020763231,"about_ca_system_score_gemma":0.00040202524,"threshold_uncertainty_score":0.008446753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91452724,0.0019539879,0.04120622,0.0012495705,0.00067271385,0.0013579427,0.004995235,0.0071713594,0.026865749],"genre_scores_gemma":[0.90147537,0.00097230537,0.08165177,0.00039996408,0.00019170858,0.0006670093,0.008952395,0.00073762686,0.0049517914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98962045,0.0028836008,0.0007325422,0.0013636184,0.0044425256,0.00095730124],"domain_scores_gemma":[0.9708307,0.014995718,0.0013141939,0.006461651,0.0049415273,0.0014562798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061403294,0.0015029107,0.0012181376,0.0012310101,0.001991105,0.0017728801,0.002683519,0.0012869169,0.0038784775],"category_scores_gemma":[0.018000187,0.0004322366,0.0008903841,0.0027898175,0.0013269136,0.0034061184,0.0018379346,0.0015608134,0.0014581999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01708068,0.044201173,0.03907175,0.006520758,0.0014942328,0.0028723779,0.0036797372,0.17178561,0.118924804,0.022277486,0.11471297,0.45737836],"study_design_scores_gemma":[0.0042576934,0.023641732,0.04781671,0.0003668139,0.0007286149,0.0034113217,0.0067424793,0.5866539,0.1984737,0.033993058,0.09344043,0.00047359368],"about_ca_topic_score_codex":0.0040928423,"about_ca_topic_score_gemma":0.00337492,"teacher_disagreement_score":0.0061403294,"about_ca_system_score_codex":0.0009683869,"about_ca_system_score_gemma":0.0014117695,"threshold_uncertainty_score":0.032473564},"labels":[],"label_agreement":null},{"id":"W2066292413","doi":"10.1007/s12083-012-0190-2","title":"The performance and locality tradeoff in bittorrent-like file sharing systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"University of Hong Kong; Yale University","keywords":"BitTorrent; Computer science; Locality; Distributed computing; Peer-to-peer; Computer network; Selection (genetic algorithm); File sharing; The Internet; Matching (statistics); Pareto principle; Download; Mathematical optimization","score_opus":0.015682504293287103,"score_gpt":0.2372985244764094,"score_spread":0.2216160201831223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066292413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8413777,0.0043378067,0.14060576,0.0026655756,0.00013213746,0.00008388153,0.00019709014,0.0006775876,0.009922472],"genre_scores_gemma":[0.9946154,0.00025301467,0.004146272,0.00004947005,0.000082116385,0.000016821436,0.000030115847,0.000038628816,0.0007680472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960169,0.0014979634,0.00017027858,0.00044481433,0.0012153958,0.00065461936],"domain_scores_gemma":[0.97788805,0.015004494,0.0012706108,0.0022657125,0.0027193842,0.0008516801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047366475,0.0004463328,0.001766374,0.00090967194,0.0025294262,0.0029340617,0.0024061713,0.0021849484,0.0017265067],"category_scores_gemma":[0.025590865,0.00077925954,0.00025408444,0.0015878613,0.0021027215,0.00804531,0.002481174,0.0012418365,0.00048045223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003716065,0.0009538904,0.0140225,0.0005672708,0.00016224482,0.0008924767,0.001610365,0.5874225,0.0653138,0.20952955,0.00883167,0.106977776],"study_design_scores_gemma":[0.000063971136,0.0003192882,0.0021995448,0.00001932405,0.000047379814,0.00046505762,0.00045779187,0.9370127,0.009044312,0.049389597,0.0009161009,0.00006501027],"about_ca_topic_score_codex":0.002403245,"about_ca_topic_score_gemma":0.0032143996,"teacher_disagreement_score":0.0047366475,"about_ca_system_score_codex":0.0021931662,"about_ca_system_score_gemma":0.0014323941,"threshold_uncertainty_score":0.025050104},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04260052,0.0011807006,0.94838417,0.00046631746,0.00019041472,0.0006790003,0.00011443219,0.001429441,0.0049549635],"genre_scores_gemma":[0.5551767,0.0011197545,0.4356799,0.00022191353,0.00014376582,0.00083805464,0.00036769843,0.00014634516,0.006305877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994985,0.0001267126,0.00006447899,0.00005250236,0.00022833188,0.00002959373],"domain_scores_gemma":[0.999009,0.0004211953,0.000112242975,0.00021004275,0.00017085363,0.00007663918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089493574,0.00037773242,0.00060902856,0.00059764856,0.00095652306,0.00081966916,0.0011359558,0.00061451056,0.001988692],"category_scores_gemma":[0.0025068116,0.0003087331,0.0003205124,0.0005780937,0.0004882635,0.0013775823,0.0022889737,0.000931269,0.00032853978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086915656,0.00024190532,0.0022074054,0.00089991174,0.00018823809,0.0026770863,0.0015629348,0.08046738,0.18427764,0.12753615,0.014659411,0.5844128],"study_design_scores_gemma":[0.00020540909,0.0012772369,0.0013156472,0.000107584936,0.00017345282,0.0032262316,0.0004637336,0.81905204,0.06970444,0.027445048,0.07682436,0.00020481914],"about_ca_topic_score_codex":0.0005982096,"about_ca_topic_score_gemma":0.00078024,"teacher_disagreement_score":0.001988692,"about_ca_system_score_codex":0.00031996472,"about_ca_system_score_gemma":0.00051519275,"threshold_uncertainty_score":0.0066527724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24614774,0.0004998641,0.74348074,0.00038345903,0.000057796624,0.00016130832,0.00007184302,0.0015649664,0.007632204],"genre_scores_gemma":[0.94947577,0.00012313732,0.049415216,0.0000275037,0.0000221687,0.00004131666,0.00003600512,0.00001618556,0.00084264204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968123,0.000107134394,0.00001322949,0.00005004928,0.0000877796,0.000060508595],"domain_scores_gemma":[0.9996748,0.00012582786,0.000029045394,0.000052014202,0.00008454477,0.000033762306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039913165,0.00033493826,0.00043175166,0.000491337,0.00096423755,0.0005237093,0.00066375046,0.0005392046,0.0007872855],"category_scores_gemma":[0.0007039862,0.00013611834,0.00022707043,0.00060343643,0.0002418968,0.0006033217,0.0005783756,0.00030487712,0.00017651072],"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.0006490333,0.00033838174,0.0056103836,0.00023236238,0.00010252254,0.0013277669,0.0003996159,0.61391026,0.105486095,0.024867026,0.0061235013,0.24095301],"study_design_scores_gemma":[0.00001705069,0.000085930384,0.00034579786,0.000002533518,0.000015430362,0.00009189806,0.000053513515,0.9886615,0.0063833627,0.0029523904,0.0013815132,0.00000918078],"about_ca_topic_score_codex":0.003881,"about_ca_topic_score_gemma":0.004210237,"teacher_disagreement_score":0.003881,"about_ca_system_score_codex":0.0004967149,"about_ca_system_score_gemma":0.00046585608,"threshold_uncertainty_score":0.0077168345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14116618,0.0015639396,0.8092258,0.0005952752,0.00029226195,0.0005359273,0.00013759053,0.011015912,0.035467144],"genre_scores_gemma":[0.86741805,0.0005802538,0.11673307,0.00022358449,0.00013793255,0.00019700013,0.00024569867,0.00031608096,0.014148337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994123,0.00017728735,0.000023420294,0.00009515589,0.00022086987,0.00007093797],"domain_scores_gemma":[0.9989411,0.0003498711,0.000061986735,0.00032547192,0.00023224633,0.00008934454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006888165,0.0004253912,0.00049657526,0.00033698944,0.0007116473,0.0010256823,0.001236293,0.0009561322,0.005140923],"category_scores_gemma":[0.0023479282,0.0001770133,0.00023624774,0.00045914022,0.00036101122,0.0015584269,0.0011155115,0.00094617467,0.0014574836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010456585,0.0009025417,0.002397379,0.00035017022,0.00007118171,0.0009502941,0.0006556069,0.04987937,0.15968063,0.03344498,0.015901286,0.734721],"study_design_scores_gemma":[0.00011475625,0.00042623558,0.0034025481,0.000047310277,0.00006469793,0.0010042497,0.00037724516,0.83981425,0.0671293,0.030655779,0.056866117,0.00009759291],"about_ca_topic_score_codex":0.001749862,"about_ca_topic_score_gemma":0.0011461551,"teacher_disagreement_score":0.005140923,"about_ca_system_score_codex":0.00043689233,"about_ca_system_score_gemma":0.00040787237,"threshold_uncertainty_score":0.017198145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008382853,0.00014142794,0.99245995,0.00048281226,0.00011821288,0.0004248075,0.000787498,0.003730562,0.0010164833],"genre_scores_gemma":[0.013678076,0.00038094592,0.97712225,0.00038189694,0.00013935387,0.0010524967,0.0044394885,0.0006426382,0.0021628344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97937334,0.005482078,0.0054139486,0.0027522773,0.0062353937,0.00074298354],"domain_scores_gemma":[0.9762842,0.0047991984,0.0016276723,0.011953723,0.003879181,0.0014560184],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.02676657,0.0013116278,0.0018311659,0.006172954,0.0030940895,0.010943648,0.007659957,0.0035530408,0.0029023008],"category_scores_gemma":[0.021770127,0.0019307092,0.00396342,0.007192347,0.0030819012,0.022858012,0.010511951,0.006229629,0.0022277716],"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.00029777104,0.00036545322,0.0026811894,0.0011515399,0.00029615872,0.0009354519,0.0018675737,0.019217717,0.010719942,0.7347445,0.034001075,0.19372167],"study_design_scores_gemma":[0.00019666296,0.00028939112,0.0009987741,0.00053354836,0.00020588335,0.0016614032,0.0006373019,0.13216142,0.015026223,0.22021455,0.62764066,0.00043413925],"about_ca_topic_score_codex":0.0068384004,"about_ca_topic_score_gemma":0.0065071015,"teacher_disagreement_score":0.99234,"about_ca_system_score_codex":0.0031190785,"about_ca_system_score_gemma":0.008479288,"threshold_uncertainty_score":0.14155686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017590284,0.0002552982,0.9771953,0.00033702477,0.00014627945,0.00028017664,0.00013936454,0.0016196949,0.0024365638],"genre_scores_gemma":[0.53604674,0.000288295,0.45160317,0.00040108987,0.00049699197,0.0007795726,0.00047416452,0.00030613926,0.0096038515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963463,0.0010123834,0.0002722294,0.0005723911,0.0014452487,0.00035153356],"domain_scores_gemma":[0.9924936,0.0013922536,0.0005594251,0.0042956527,0.000713733,0.00054528867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00465384,0.0006579323,0.0013603248,0.0016340237,0.0031905973,0.0026450446,0.005143709,0.0016604207,0.005578648],"category_scores_gemma":[0.0074547986,0.000718936,0.00066995295,0.001965751,0.0021960093,0.006073566,0.007598753,0.0016312615,0.0023563704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028032754,0.00044415213,0.0027122279,0.0004452875,0.00021741257,0.00041939414,0.0016989077,0.10102825,0.058110803,0.3946633,0.018527867,0.41892916],"study_design_scores_gemma":[0.0011519335,0.0007934946,0.0011128194,0.00006988252,0.00018243188,0.00087273127,0.00027926575,0.65410775,0.03413329,0.24620034,0.060868084,0.00022798094],"about_ca_topic_score_codex":0.00050945044,"about_ca_topic_score_gemma":0.0005924569,"teacher_disagreement_score":0.005578648,"about_ca_system_score_codex":0.0015870264,"about_ca_system_score_gemma":0.001256986,"threshold_uncertainty_score":0.024612188},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.774906,0.002492826,0.19372892,0.0010396998,0.00012689494,0.000079410114,0.00039344898,0.0006342321,0.026598526],"genre_scores_gemma":[0.99711215,0.00017065645,0.0021889412,0.000021211443,0.000012753384,0.000017240029,0.000039872666,0.000016109845,0.00042096683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992932,0.00019335495,0.000026702544,0.00011209742,0.00019296203,0.000181631],"domain_scores_gemma":[0.99479717,0.003982212,0.00024586593,0.00025506297,0.0004984883,0.00022136852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011521374,0.00036151632,0.0007290339,0.00060119154,0.000664334,0.000944135,0.0009145718,0.00081745634,0.0018668],"category_scores_gemma":[0.0059800777,0.0003201795,0.0003673916,0.0007829559,0.00083564705,0.0022284214,0.001052905,0.0005906198,0.00018227464],"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.00012268711,0.000043345233,0.0010798604,0.00008748859,0.000029533803,0.00019096983,0.00007834973,0.9730059,0.0041616224,0.012309943,0.000760877,0.00812943],"study_design_scores_gemma":[0.000008966525,0.000025244053,0.00043594418,0.000006283484,0.0000073120136,0.00004123693,0.000032956024,0.99285865,0.0012124069,0.005139832,0.00022083962,0.000010333534],"about_ca_topic_score_codex":0.0044464245,"about_ca_topic_score_gemma":0.0015399884,"teacher_disagreement_score":0.0044464245,"about_ca_system_score_codex":0.0011855407,"about_ca_system_score_gemma":0.00070181687,"threshold_uncertainty_score":0.008841097},"labels":[],"label_agreement":null},{"id":"W2069737692","doi":"10.1007/s12083-009-0038-6","title":"Subscriber mobility management for a P2P publish/subscribe overlay in mobile tactical networks","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Overlay; Computer network; Handover; Reliability (semiconductor); Publication; Mobility management; Scheme (mathematics); Overlay network; Distributed computing; Mobile device; World Wide Web; The Internet","score_opus":0.016292047550373966,"score_gpt":0.2836304494832623,"score_spread":0.2673384019328884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069737692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23490447,0.0009938095,0.74845195,0.0013728869,0.00030646715,0.00034440932,0.000228292,0.0033314037,0.010066363],"genre_scores_gemma":[0.9341532,0.00027522005,0.06184803,0.000055140314,0.000111236186,0.00007996127,0.00015708794,0.00007383813,0.0032462408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992716,0.00017830543,0.000093462746,0.00010271328,0.0002583926,0.0000955268],"domain_scores_gemma":[0.99846786,0.00056669203,0.00012754092,0.00033705484,0.00034786292,0.00015286326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022855622,0.00034204306,0.00072284223,0.0007896244,0.0018737628,0.0019789115,0.0011228465,0.000806306,0.0011635143],"category_scores_gemma":[0.003726944,0.00028997334,0.00025669544,0.0007183484,0.00064149464,0.002223883,0.0013829627,0.00075858476,0.00042231174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020841477,0.00087863,0.010627085,0.00035976293,0.00022568162,0.0015421568,0.0021981394,0.2488987,0.09059221,0.14906624,0.016827598,0.47669968],"study_design_scores_gemma":[0.000083958905,0.00018575208,0.0009811949,0.000012259591,0.00009540903,0.00022859797,0.0003361171,0.9569938,0.014321827,0.018508418,0.008210863,0.000041862495],"about_ca_topic_score_codex":0.003365186,"about_ca_topic_score_gemma":0.003579964,"teacher_disagreement_score":0.003365186,"about_ca_system_score_codex":0.0007405674,"about_ca_system_score_gemma":0.0007716593,"threshold_uncertainty_score":0.0120872855},"labels":[],"label_agreement":null},{"id":"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14432588,0.0011072456,0.6486893,0.000989138,0.00056499854,0.0016830902,0.0018701974,0.16403902,0.03673109],"genre_scores_gemma":[0.66776437,0.000729212,0.27925757,0.00066062534,0.00012427695,0.0008884668,0.0040881517,0.00461602,0.041871317],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995413,0.0000681884,0.00005390279,0.000099386736,0.00014561307,0.000091648544],"domain_scores_gemma":[0.99937433,0.00009576376,0.000049944716,0.00013681415,0.00008328332,0.0002599083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006096183,0.0008739034,0.00051219563,0.0006130382,0.0005414023,0.0014742834,0.0024115718,0.00060121185,0.0060608992],"category_scores_gemma":[0.0019196174,0.00060301926,0.0005115053,0.0002940802,0.0004937737,0.002432759,0.0037472788,0.0010276115,0.0019514915],"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.006183804,0.0020407226,0.01727276,0.0020484051,0.001031376,0.0027999312,0.004967886,0.064372234,0.23755658,0.062037162,0.13318004,0.4665091],"study_design_scores_gemma":[0.0008315572,0.0020176715,0.009411296,0.0001599937,0.00029268957,0.0020786235,0.0010981801,0.4270965,0.08050638,0.026320541,0.44972518,0.0004613871],"about_ca_topic_score_codex":0.0015745807,"about_ca_topic_score_gemma":0.001927949,"teacher_disagreement_score":0.0060608992,"about_ca_system_score_codex":0.00047928098,"about_ca_system_score_gemma":0.0008400196,"threshold_uncertainty_score":0.020275712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014239229,0.00027739635,0.97724915,0.0002652365,0.00017858786,0.00021833557,0.00030094068,0.004093597,0.0031776046],"genre_scores_gemma":[0.26278582,0.00021861815,0.7223888,0.00010857191,0.00022996294,0.00023106273,0.00072700845,0.00045485375,0.012855185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983038,0.0003417066,0.00013060938,0.00033430866,0.0007928552,0.000096767755],"domain_scores_gemma":[0.9961533,0.0010017649,0.000510827,0.00075012125,0.0013415787,0.00024239543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013960566,0.00070484413,0.0008985483,0.0022444404,0.0007967557,0.0017477035,0.0012479775,0.0010575192,0.004901876],"category_scores_gemma":[0.006833592,0.00035553557,0.0005062063,0.0017529491,0.0005508119,0.0016304222,0.00071115076,0.0007531712,0.0033308815],"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.00060291047,0.00024577338,0.009035025,0.00022403778,0.00015984742,0.00031128948,0.0002701855,0.027005143,0.052327953,0.0120264385,0.021704163,0.8760873],"study_design_scores_gemma":[0.000065207394,0.00017477068,0.0056723966,0.000029711762,0.000054421904,0.00057371816,0.00007702847,0.94164735,0.031989254,0.0055557583,0.014042242,0.000118103046],"about_ca_topic_score_codex":0.005619906,"about_ca_topic_score_gemma":0.0077243093,"teacher_disagreement_score":0.005619906,"about_ca_system_score_codex":0.0009917193,"about_ca_system_score_gemma":0.00093733106,"threshold_uncertainty_score":0.01639843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7366105,0.0058273347,0.22446948,0.0045895437,0.00028605261,0.00024345226,0.00063041114,0.0006274571,0.026715726],"genre_scores_gemma":[0.9956108,0.0007702626,0.0021174436,0.00010032575,0.00004370957,0.000030152021,0.00005487032,0.00004133724,0.0012311767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861324,0.00042304004,0.0000570804,0.00019956753,0.0003873273,0.0003197226],"domain_scores_gemma":[0.9855016,0.009891449,0.0019368583,0.00055535865,0.001553584,0.0005612148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022366843,0.00062002364,0.0007195587,0.0010469261,0.0011515674,0.0014952851,0.0013703012,0.0013300964,0.0019902654],"category_scores_gemma":[0.023604294,0.00053805765,0.0005709814,0.0006964842,0.0015754924,0.0034044485,0.0014526437,0.0017953969,0.0003385362],"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.0001836481,0.00015167746,0.013794174,0.00027468018,0.00006318897,0.0008309199,0.0008928883,0.8913769,0.0082583735,0.06624833,0.002928913,0.014996364],"study_design_scores_gemma":[0.000008049434,0.00007287167,0.002089983,0.00002681096,0.000018804196,0.00013664925,0.0002305001,0.98808694,0.0008004346,0.007599032,0.00090527604,0.00002466314],"about_ca_topic_score_codex":0.013820253,"about_ca_topic_score_gemma":0.0074551404,"teacher_disagreement_score":0.013820253,"about_ca_system_score_codex":0.002388602,"about_ca_system_score_gemma":0.0011407601,"threshold_uncertainty_score":0.027479649},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098528564,0.0010431978,0.8135363,0.001118681,0.00041826905,0.00049182575,0.0010669817,0.03326367,0.05053252],"genre_scores_gemma":[0.6680382,0.00043165337,0.30495483,0.0002984143,0.00016214488,0.0002554802,0.0010917243,0.00054572657,0.024221899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996025,0.00008099011,0.000026115405,0.000077169054,0.00013973098,0.00007354316],"domain_scores_gemma":[0.99951077,0.00006842826,0.000024843082,0.00017808858,0.00016055885,0.000057178637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048154115,0.00034431528,0.00042026784,0.0009653382,0.0012560736,0.002272298,0.0017889232,0.00080043095,0.009856109],"category_scores_gemma":[0.0010420037,0.000279261,0.00024477762,0.0014828368,0.00046953114,0.0018255902,0.0018492523,0.0005284703,0.0021959299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00175791,0.0003043861,0.0057283677,0.00045835876,0.00016442793,0.00081506046,0.0011069609,0.084411256,0.07658801,0.07914002,0.06914402,0.68038124],"study_design_scores_gemma":[0.00019703779,0.00029515394,0.002783065,0.0000634497,0.000112765796,0.00043962421,0.0005607398,0.73786247,0.033387043,0.029482746,0.19468778,0.00012809358],"about_ca_topic_score_codex":0.012575223,"about_ca_topic_score_gemma":0.016667588,"teacher_disagreement_score":0.012575223,"about_ca_system_score_codex":0.0010209422,"about_ca_system_score_gemma":0.0013040651,"threshold_uncertainty_score":0.03297198},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03347689,0.0020397366,0.71973354,0.0010825606,0.0015058431,0.001993409,0.0049621244,0.20913179,0.026074216],"genre_scores_gemma":[0.49639764,0.0032741625,0.39028335,0.0011953253,0.00186401,0.0012533874,0.016376588,0.015735721,0.07361973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986355,0.00018896014,0.00007863265,0.00015524801,0.00079535844,0.00014626264],"domain_scores_gemma":[0.99723154,0.0007467273,0.00015335575,0.0006143767,0.0006511875,0.00060284015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018974862,0.0010132693,0.0021732026,0.001817854,0.0017575584,0.0026069728,0.0030068834,0.0014997384,0.011289783],"category_scores_gemma":[0.006134446,0.00076127757,0.0006378605,0.0013412507,0.00080617773,0.002604711,0.0029680014,0.002194406,0.003536125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065841726,0.0010817145,0.0036170494,0.0017759777,0.0005633793,0.00092441746,0.0015647596,0.019363996,0.12516539,0.05077401,0.30158857,0.4869966],"study_design_scores_gemma":[0.001996713,0.0007624044,0.0035306045,0.00016354358,0.0004170548,0.0011182448,0.00035292495,0.49460292,0.11325282,0.04946677,0.33387837,0.00045762112],"about_ca_topic_score_codex":0.005050101,"about_ca_topic_score_gemma":0.0065760235,"teacher_disagreement_score":0.011289783,"about_ca_system_score_codex":0.0012800803,"about_ca_system_score_gemma":0.00214598,"threshold_uncertainty_score":0.037768066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018093068,0.000551866,0.97340506,0.0012373944,0.00008853743,0.00023317989,0.000060494986,0.00042226847,0.0059082354],"genre_scores_gemma":[0.53688407,0.0015085131,0.45006704,0.0006836004,0.0004479846,0.0011854963,0.00019235247,0.00034514058,0.008685811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99271846,0.0030265949,0.0003331003,0.001264566,0.002231384,0.00042581954],"domain_scores_gemma":[0.97748667,0.013161549,0.0021421395,0.004190143,0.0022007872,0.0008187388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010622386,0.0009537793,0.0012966057,0.0023666304,0.0031201434,0.0046526254,0.0040041367,0.0023490374,0.002897861],"category_scores_gemma":[0.0233766,0.0009410904,0.0011950566,0.0021916325,0.004381365,0.008928372,0.0034145068,0.0031592832,0.00067116524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013261863,0.00021578764,0.0013771893,0.00029316294,0.00007263083,0.000080903854,0.00082625326,0.17646727,0.003412466,0.7558761,0.002713474,0.058532108],"study_design_scores_gemma":[0.00008814142,0.00015956059,0.00037519474,0.000081253755,0.00007891157,0.000113911505,0.00015659592,0.61096543,0.0030942087,0.36956695,0.015245744,0.000074113166],"about_ca_topic_score_codex":0.0032396105,"about_ca_topic_score_gemma":0.0035421534,"teacher_disagreement_score":0.010622386,"about_ca_system_score_codex":0.0030666701,"about_ca_system_score_gemma":0.0036395888,"threshold_uncertainty_score":0.0561772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03291843,0.00034473056,0.95734036,0.0030614308,0.00007253338,0.000300031,0.00011581166,0.0014708439,0.004375829],"genre_scores_gemma":[0.5345937,0.0004186614,0.4585407,0.00047396505,0.00020038457,0.00022081523,0.00048572797,0.00030618662,0.004759851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99296933,0.002328727,0.00042484724,0.0010258381,0.0027997554,0.00045149145],"domain_scores_gemma":[0.972851,0.0066829845,0.0031975866,0.007908177,0.0073476876,0.002012601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011993579,0.0005284167,0.0011429584,0.0019857802,0.0034373933,0.006977999,0.004051058,0.003314131,0.0015499967],"category_scores_gemma":[0.02692025,0.00057262735,0.0006661234,0.0017292992,0.0026427058,0.01175388,0.009253152,0.0035128838,0.0009304982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005428797,0.00089397386,0.01290943,0.00060164125,0.00032098033,0.001032783,0.008912193,0.24818002,0.033376705,0.29263148,0.019397156,0.3812007],"study_design_scores_gemma":[0.00008486452,0.00016840428,0.0012968532,0.000081803635,0.00008542261,0.0003269796,0.0016597074,0.7229757,0.021005565,0.2065673,0.045635432,0.00011198347],"about_ca_topic_score_codex":0.0035603938,"about_ca_topic_score_gemma":0.0029535454,"teacher_disagreement_score":0.011993579,"about_ca_system_score_codex":0.0016089856,"about_ca_system_score_gemma":0.003278812,"threshold_uncertainty_score":0.06342882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056114838,0.0008393314,0.9298168,0.0012754552,0.00013037377,0.00018195866,0.00042249076,0.0004114162,0.010807365],"genre_scores_gemma":[0.9416148,0.0011044149,0.03630567,0.00035933594,0.00017149067,0.00033187142,0.0003339081,0.00015106311,0.019627374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980313,0.0004817589,0.000053821565,0.0003370071,0.00052381266,0.0005723225],"domain_scores_gemma":[0.9912776,0.0056576594,0.000845515,0.0002431813,0.0015315256,0.0004446579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032338134,0.001257407,0.001889295,0.0010399166,0.0010994273,0.0018090577,0.0032648244,0.002385376,0.008343405],"category_scores_gemma":[0.010201781,0.0007796806,0.0011085268,0.0010499746,0.002053991,0.0027261116,0.0018029792,0.0023685463,0.0007099001],"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.00012538639,0.000044334643,0.00053929683,0.00010161762,0.000027990001,0.00023967125,0.00017081552,0.92009336,0.0026959302,0.06998313,0.0018167342,0.004161801],"study_design_scores_gemma":[0.0000073309375,0.000011131504,0.000048071382,0.000003221983,0.0000049460236,0.000022395794,0.000016676426,0.9967961,0.00010913449,0.0028297899,0.00014444381,0.000006826189],"about_ca_topic_score_codex":0.017686218,"about_ca_topic_score_gemma":0.007382272,"teacher_disagreement_score":0.017686218,"about_ca_system_score_codex":0.0039690956,"about_ca_system_score_gemma":0.0022353076,"threshold_uncertainty_score":0.03516656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06771178,0.0026409887,0.87675464,0.016047658,0.00047509154,0.0003630286,0.000058645222,0.0014649216,0.034483228],"genre_scores_gemma":[0.67596847,0.002650892,0.30511957,0.00073895225,0.00020008883,0.00046460418,0.00017667464,0.00022479286,0.01445601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99707913,0.0012781526,0.00019543446,0.00034697054,0.00074927905,0.0003510873],"domain_scores_gemma":[0.9978403,0.0005201368,0.0001494756,0.00047498805,0.0004642904,0.0005508313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034778656,0.00065700244,0.0005547728,0.00053870503,0.0029163796,0.0068362826,0.0033137233,0.0025441453,0.0029780723],"category_scores_gemma":[0.005635973,0.0008125691,0.00066033326,0.00057844335,0.002533748,0.008444709,0.005666033,0.0027857134,0.0010813768],"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.00014193749,0.00019603256,0.001774585,0.00034293803,0.00007785703,0.00033109647,0.002843402,0.09090972,0.0060941326,0.81537324,0.008608551,0.07330654],"study_design_scores_gemma":[0.000055695913,0.00015935408,0.00050057913,0.00012947638,0.000049678663,0.0003456843,0.003229537,0.3525534,0.003279058,0.50880784,0.13082626,0.0000634293],"about_ca_topic_score_codex":0.0029233678,"about_ca_topic_score_gemma":0.003905536,"teacher_disagreement_score":0.0068362826,"about_ca_system_score_codex":0.0015989229,"about_ca_system_score_gemma":0.0026514009,"threshold_uncertainty_score":0.01839298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043639835,0.00058256456,0.95177287,0.00019698575,0.00009860392,0.000053513835,0.00003114432,0.0010761814,0.002548451],"genre_scores_gemma":[0.8000361,0.000398769,0.1962868,0.000084155465,0.000034603632,0.00005398188,0.000060325758,0.00012271317,0.0029226027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999666,0.00007989985,0.000021789681,0.000074586584,0.00012621337,0.000031565927],"domain_scores_gemma":[0.99911445,0.00032915745,0.00012295129,0.00015704773,0.00021793398,0.00005841626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048698063,0.00066609296,0.00077771203,0.00055279076,0.000584226,0.0010006479,0.001721454,0.00077162514,0.000782016],"category_scores_gemma":[0.0022370736,0.00045305805,0.00048196843,0.0006188308,0.0006121155,0.0016338745,0.00089072686,0.000851954,0.00031472556],"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.00016945391,0.000096889424,0.0025316782,0.00011500364,0.00008073188,0.000216728,0.0002226132,0.8342561,0.010042612,0.008625496,0.0016813063,0.1419613],"study_design_scores_gemma":[0.000012227295,0.000019523608,0.00016166858,0.0000055836463,0.000008499361,0.000048604852,0.000014896456,0.9953667,0.0017459408,0.001807028,0.00079943764,0.00000998794],"about_ca_topic_score_codex":0.010770659,"about_ca_topic_score_gemma":0.008479637,"teacher_disagreement_score":0.010770659,"about_ca_system_score_codex":0.0004984321,"about_ca_system_score_gemma":0.0007306196,"threshold_uncertainty_score":0.02141589},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18325351,0.0016574211,0.80467147,0.0003363006,0.00007548396,0.00016703799,0.00005651153,0.003274469,0.006507876],"genre_scores_gemma":[0.9466029,0.00032667277,0.05154009,0.00007894738,0.000038072325,0.000067451,0.000049900773,0.000116248375,0.0011798481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.0004303126,0.000065557004,0.0002610309,0.00040114476,0.00021529495],"domain_scores_gemma":[0.9941585,0.002582257,0.00091176777,0.0010222559,0.00087847316,0.00044683827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020294085,0.00079970056,0.0009876098,0.0006222472,0.0011789415,0.0011398868,0.0026119146,0.0008735005,0.00091227517],"category_scores_gemma":[0.0062803184,0.00034357634,0.00041890112,0.0006509756,0.00095684483,0.002123251,0.0019863304,0.0011399855,0.0005534695],"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.00063401787,0.00073052465,0.012113357,0.00046903142,0.00016100532,0.0004600306,0.0010524679,0.62774724,0.10621383,0.03373926,0.005639451,0.21103974],"study_design_scores_gemma":[0.000042605778,0.00022118527,0.0010498958,0.000021880476,0.00006150053,0.00042809529,0.00015582347,0.9687895,0.018382533,0.0072893132,0.003524552,0.00003307507],"about_ca_topic_score_codex":0.0027172226,"about_ca_topic_score_gemma":0.002622991,"teacher_disagreement_score":0.0027172226,"about_ca_system_score_codex":0.00093034795,"about_ca_system_score_gemma":0.0018311866,"threshold_uncertainty_score":0.010732651},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015754314,0.026488459,0.015409231,0.66270214,0.023790486,0.000046116136,0.0003434671,0.004166663,0.25129917],"genre_scores_gemma":[0.22579814,0.026261436,0.021902848,0.129902,0.015521031,0.00014792776,0.0008617057,0.003183646,0.5764212],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974841,0.0006485291,0.00009220767,0.0003156732,0.0009867128,0.00047284513],"domain_scores_gemma":[0.99549377,0.00044486678,0.0002665746,0.0006091709,0.0008328261,0.00235279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030320482,0.0005515529,0.00034685474,0.00096347305,0.0030256247,0.01186073,0.0013629515,0.004941034,0.08051639],"category_scores_gemma":[0.010024804,0.00029377,0.0005012335,0.00077834143,0.00347931,0.022194786,0.005401828,0.0038495902,0.049593158],"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.00024398483,0.00009174114,0.0011789197,0.000194561,0.000018891582,0.0003650105,0.001102667,0.00008887872,0.0010475978,0.14988227,0.66007257,0.18571301],"study_design_scores_gemma":[0.000018304894,0.00006984669,0.00041366086,0.0001733824,0.000005774559,0.0002808226,0.0011285087,0.00010430437,0.00018296493,0.016843999,0.9807531,0.000025343737],"about_ca_topic_score_codex":0.0023608822,"about_ca_topic_score_gemma":0.0030057987,"teacher_disagreement_score":0.08051639,"about_ca_system_score_codex":0.0009937913,"about_ca_system_score_gemma":0.0023626967,"threshold_uncertainty_score":0.26935416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054978556,0.000060155413,0.98895234,0.0016775613,0.000044399538,0.0001591081,0.000076623466,0.00039758574,0.003134338],"genre_scores_gemma":[0.15154909,0.0001903333,0.8426995,0.0003131941,0.00010311163,0.0005784769,0.00032880847,0.00016421094,0.0040732953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99320215,0.002341537,0.0007765513,0.0009413151,0.002354335,0.00038407466],"domain_scores_gemma":[0.98908,0.0036402494,0.0010126415,0.0027901763,0.0025803007,0.0008967305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010631159,0.00068060495,0.00067353033,0.0023222982,0.0033238113,0.009366131,0.0045124907,0.0027180458,0.0030060331],"category_scores_gemma":[0.01584635,0.00092399766,0.0016465472,0.0023985386,0.006291947,0.01598626,0.008714028,0.0038425731,0.0012097919],"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.000012036482,0.000042785177,0.0003192266,0.000057043235,0.000009825745,0.00014682148,0.00078429555,0.009168448,0.0008911442,0.9773791,0.0011735278,0.010015897],"study_design_scores_gemma":[0.000049452756,0.000039337978,0.00010766149,0.0000908932,0.000023313582,0.00018099818,0.0005708901,0.19802831,0.0021951876,0.75966656,0.038999468,0.000047935053],"about_ca_topic_score_codex":0.005530292,"about_ca_topic_score_gemma":0.0042818342,"teacher_disagreement_score":0.010631159,"about_ca_system_score_codex":0.003250521,"about_ca_system_score_gemma":0.006079109,"threshold_uncertainty_score":0.05622363},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032060203,0.0002602363,0.9919551,0.0002844573,0.000083284314,0.0005112359,0.00008708524,0.003395933,0.0031021691],"genre_scores_gemma":[0.006055902,0.0005870774,0.98875463,0.000103191895,0.00006159219,0.0012228389,0.00029772014,0.00032262987,0.0025944775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960692,0.0010727672,0.0005685192,0.00040711105,0.0016114367,0.0002709745],"domain_scores_gemma":[0.99766636,0.0006502977,0.00019230518,0.0006539925,0.00040855966,0.00042851202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073863645,0.0022863073,0.0016785142,0.002236978,0.0025980906,0.0056922217,0.008143098,0.0037237087,0.0073347986],"category_scores_gemma":[0.0061495434,0.0019428687,0.0036300356,0.002008793,0.0038038276,0.005346344,0.0043639042,0.006084468,0.0070860577],"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.00007138434,0.00022103157,0.00041630276,0.00097068667,0.00015204569,0.00090024667,0.0010403579,0.042919327,0.007485946,0.82395464,0.020256307,0.10161179],"study_design_scores_gemma":[0.00026960723,0.00024716445,0.00031528802,0.0007831108,0.00015585242,0.0013128947,0.0002145257,0.1507872,0.0064787143,0.34306738,0.49616346,0.00020476716],"about_ca_topic_score_codex":0.005714733,"about_ca_topic_score_gemma":0.0060210014,"teacher_disagreement_score":0.008143098,"about_ca_system_score_codex":0.0020850315,"about_ca_system_score_gemma":0.0062215044,"threshold_uncertainty_score":0.039063334},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04120744,0.00031627866,0.9561001,0.000094790164,0.00003053592,0.00008847978,0.000021370022,0.00069384667,0.0014472071],"genre_scores_gemma":[0.733509,0.00019804192,0.2647948,0.000043736367,0.00003461719,0.00012605514,0.000069042944,0.00009625292,0.0011285181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908924,0.00037496098,0.000055991623,0.00014303403,0.00022604104,0.00011073619],"domain_scores_gemma":[0.9988617,0.0004447828,0.00015890693,0.00026782134,0.0001731536,0.00009359697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009105986,0.00049400487,0.00046961597,0.00074155995,0.00096248946,0.0011426809,0.0013728262,0.0004720377,0.0022535406],"category_scores_gemma":[0.0035942104,0.00022502938,0.00028276452,0.0007408702,0.0007062299,0.002060492,0.0014428797,0.0005580497,0.00042011304],"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.0007842066,0.00023802859,0.0040684044,0.00031564984,0.00007989872,0.0001333275,0.0005596153,0.44085577,0.048592508,0.0696077,0.0035740556,0.43119082],"study_design_scores_gemma":[0.00003168424,0.00010476247,0.000900583,0.000009640597,0.000016205337,0.000078086574,0.0000989011,0.9759529,0.008826943,0.010884655,0.0030718797,0.00002378496],"about_ca_topic_score_codex":0.0020936322,"about_ca_topic_score_gemma":0.00361495,"teacher_disagreement_score":0.0022535406,"about_ca_system_score_codex":0.000689862,"about_ca_system_score_gemma":0.00067782926,"threshold_uncertainty_score":0.0075387955},"labels":[],"label_agreement":null},{"id":"W2077709959","doi":"10.1007/s12083-009-0052-8","title":"CliqueStream: Creating an efficient and resilient transport overlay for peer-to-peer live streaming using a clustered DHT","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Royal Society of Canada","keywords":"Overlay; Computer science; Computer network; Overlay network; Robustness (evolution); Distributed computing; Locality; Exploit; Redundancy (engineering); Fault tolerance; Peer-to-peer; Computer security; Operating system","score_opus":0.026118050683652198,"score_gpt":0.30730839674303867,"score_spread":0.2811903460593865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077709959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07415275,0.00048449426,0.86246127,0.00051384885,0.0005809419,0.0009714077,0.001051619,0.05422843,0.0055552656],"genre_scores_gemma":[0.42393616,0.00046372155,0.5581771,0.00018787413,0.00019300579,0.00030251406,0.00337484,0.0020207197,0.011344024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.00007424554,0.000040394247,0.00009097481,0.00033412897,0.000060795635],"domain_scores_gemma":[0.9988341,0.00024635848,0.000056572004,0.00035228077,0.00028529126,0.00022543935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094831904,0.0004674236,0.00076430436,0.0009788861,0.0008512476,0.0011667385,0.0024601233,0.00081671897,0.0032190522],"category_scores_gemma":[0.003079709,0.0005247889,0.0004379022,0.000910439,0.00052366685,0.0018431514,0.002328221,0.0011221305,0.00079027895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017755918,0.0011984307,0.004358973,0.0008278032,0.00034185903,0.00093311357,0.0009993193,0.109326534,0.179645,0.03199718,0.08094086,0.5876553],"study_design_scores_gemma":[0.00035661494,0.00039440635,0.0011710899,0.000024371437,0.00010233923,0.00035715915,0.00020514443,0.89282995,0.057034466,0.0068482705,0.04056134,0.000114819726],"about_ca_topic_score_codex":0.005240524,"about_ca_topic_score_gemma":0.007987719,"teacher_disagreement_score":0.005240524,"about_ca_system_score_codex":0.0008562906,"about_ca_system_score_gemma":0.0013070643,"threshold_uncertainty_score":0.010768771},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007082309,0.002756865,0.13203572,0.004992064,0.0065050754,0.0017559393,0.043915365,0.09957497,0.7013818],"genre_scores_gemma":[0.075360276,0.0021489058,0.033085085,0.002065816,0.0011986336,0.0009551539,0.047420375,0.0073193163,0.83044636],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991416,0.00012633944,0.000054419128,0.00020808488,0.00034639696,0.0001232023],"domain_scores_gemma":[0.9985203,0.00022694754,0.000053958458,0.0005233473,0.0004721745,0.00020324539],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010211174,0.00081258337,0.0010508252,0.0010079963,0.0009201316,0.0029648594,0.0024380046,0.0012750761,0.64522415],"category_scores_gemma":[0.0027132598,0.00040747153,0.0005096909,0.0012868324,0.0006564307,0.0027599707,0.0029055579,0.0014050297,0.42252675],"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.0007974713,0.00015860239,0.00036030737,0.0006637418,0.000047876714,0.00015676717,0.00005818175,0.0007903494,0.0070387614,0.021516418,0.69309413,0.2753174],"study_design_scores_gemma":[0.00027062566,0.00014613214,0.00048980385,0.00010781759,0.000034259636,0.0001920378,0.000036791276,0.004358947,0.007275006,0.009811925,0.9772424,0.000034281995],"about_ca_topic_score_codex":0.0009443891,"about_ca_topic_score_gemma":0.0008137162,"teacher_disagreement_score":0.35477585,"about_ca_system_score_codex":0.00092829374,"about_ca_system_score_gemma":0.0012023997,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290904,0.001709287,0.24962063,0.0011215896,0.00026375195,0.00027242606,0.00024446315,0.012776611,0.0049007214],"genre_scores_gemma":[0.9732911,0.0001185681,0.025556128,0.00010544951,0.000036802776,0.000025350324,0.00008350889,0.00013325937,0.0006498425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969754,0.0011550637,0.00025032638,0.00035204916,0.0009059051,0.0003612825],"domain_scores_gemma":[0.9804357,0.01104081,0.0010240418,0.003288363,0.002970055,0.0012409212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026973358,0.001406519,0.0016627032,0.0012995866,0.00082933705,0.0017446148,0.0017932942,0.0012251035,0.0013720219],"category_scores_gemma":[0.019592475,0.00061703566,0.0003807429,0.00096479384,0.00058241823,0.0032308656,0.0009240082,0.0018766669,0.0004984007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009606671,0.0035036276,0.06407114,0.00043868352,0.0003601368,0.0005085611,0.0007076371,0.18273161,0.10583491,0.006959813,0.008549555,0.61672765],"study_design_scores_gemma":[0.00008667042,0.00040783497,0.008603816,0.000028241646,0.00017603674,0.00018532465,0.00017686971,0.9561575,0.028393093,0.004631658,0.0010768198,0.00007599799],"about_ca_topic_score_codex":0.00399247,"about_ca_topic_score_gemma":0.0058397506,"teacher_disagreement_score":0.00399247,"about_ca_system_score_codex":0.00062796084,"about_ca_system_score_gemma":0.002010921,"threshold_uncertainty_score":0.01426506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09290534,0.0009378922,0.9009362,0.0003028786,0.0000803159,0.0001275215,0.00005523148,0.00046432967,0.004190231],"genre_scores_gemma":[0.9780253,0.00031004954,0.020207796,0.000055442644,0.0000511603,0.00010071693,0.000024156738,0.000021257685,0.0012041294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797195,0.00076062686,0.000061277315,0.0003712345,0.0005259426,0.00030900646],"domain_scores_gemma":[0.9956312,0.002884316,0.00028896434,0.00046530104,0.0005128895,0.00021734928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022325697,0.0008094161,0.0010993305,0.000784136,0.001343701,0.0013801733,0.0019538957,0.001079848,0.0009015645],"category_scores_gemma":[0.005441974,0.0005096404,0.00041929624,0.0012637145,0.0014438336,0.0019758784,0.0018645879,0.0006608136,0.00018308566],"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.00024402754,0.00011366119,0.0008861796,0.0001346691,0.000072912284,0.00065952376,0.0004101668,0.8888972,0.009004801,0.057930846,0.0020225048,0.039623555],"study_design_scores_gemma":[0.000013376298,0.000041371757,0.00010100662,0.0000039731754,0.000012840168,0.0001053092,0.0000429732,0.9857043,0.00085203466,0.012373054,0.00073385454,0.000015858499],"about_ca_topic_score_codex":0.0055341357,"about_ca_topic_score_gemma":0.0034093622,"teacher_disagreement_score":0.0055341357,"about_ca_system_score_codex":0.0011282886,"about_ca_system_score_gemma":0.0014765046,"threshold_uncertainty_score":0.011807084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009003891,0.00017069394,0.98299706,0.0005836655,0.00006118065,0.0001341279,0.000058069927,0.00006689394,0.006924395],"genre_scores_gemma":[0.72522986,0.0006012624,0.2625966,0.00031919908,0.00021619131,0.0004319134,0.00009723915,0.000079411984,0.010428384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715805,0.0015502698,0.000092468435,0.0003191821,0.0005724724,0.0003075525],"domain_scores_gemma":[0.99523467,0.003685509,0.00024353767,0.00017212369,0.0003591583,0.00030499106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040572523,0.0011246679,0.0019828565,0.0013989,0.0012884093,0.0032491633,0.0042117224,0.0025852164,0.004467608],"category_scores_gemma":[0.010382002,0.0009689637,0.0012114367,0.0013784085,0.00326762,0.003911062,0.0029084024,0.002311103,0.00038818803],"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.0000503222,0.00008181056,0.00031174583,0.00008734439,0.000060047074,0.00014272111,0.00024767517,0.64484245,0.000990438,0.34196085,0.0016574509,0.009567178],"study_design_scores_gemma":[0.000012069321,0.000020416503,0.00004118084,0.0000074084205,0.000014116939,0.000027117747,0.0000393164,0.92806727,0.00008063417,0.070947625,0.0007308328,0.000012007772],"about_ca_topic_score_codex":0.006863479,"about_ca_topic_score_gemma":0.006974224,"teacher_disagreement_score":0.006863479,"about_ca_system_score_codex":0.0034699305,"about_ca_system_score_gemma":0.003032952,"threshold_uncertainty_score":0.025176227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3036671,0.0011549457,0.679611,0.00062917394,0.00015546955,0.00041917656,0.0003410567,0.002627866,0.011394199],"genre_scores_gemma":[0.93881357,0.00037917114,0.058100887,0.000045320703,0.0000672629,0.00015839115,0.0001796079,0.000045937304,0.0022099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990507,0.00027692734,0.000057668556,0.00013515707,0.00036518383,0.00011444169],"domain_scores_gemma":[0.99739754,0.0012011649,0.00026971442,0.0005893229,0.0003940384,0.00014833354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172517,0.00041202796,0.0008841146,0.0007826989,0.0012447258,0.0009908122,0.0021168613,0.0009119752,0.0017491691],"category_scores_gemma":[0.004945793,0.00020940894,0.0003466607,0.0010939628,0.00071159477,0.0022781976,0.0014112674,0.00035977556,0.00046963434],"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.00095291407,0.00049657,0.004318229,0.00044115275,0.00023450816,0.0013028703,0.00072860176,0.673935,0.05213659,0.044372287,0.0096404515,0.2114408],"study_design_scores_gemma":[0.000101567784,0.0001656472,0.0005969493,0.000009740493,0.000035053854,0.00029220228,0.00009317665,0.9610691,0.010522949,0.020778865,0.0062938943,0.000040773775],"about_ca_topic_score_codex":0.0015565894,"about_ca_topic_score_gemma":0.0009567281,"teacher_disagreement_score":0.0021168613,"about_ca_system_score_codex":0.0005329232,"about_ca_system_score_gemma":0.00055746525,"threshold_uncertainty_score":0.0062009096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071927635,0.00007235501,0.9914511,0.000070110895,0.00003148267,0.000077626995,0.0000082838305,0.0003184966,0.0007778051],"genre_scores_gemma":[0.5454098,0.00018287807,0.45156762,0.00009951711,0.000053275293,0.00019956117,0.00006907049,0.00009703082,0.0023212584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986945,0.00025446818,0.0000965646,0.00035084007,0.0004137314,0.00018996818],"domain_scores_gemma":[0.99832016,0.0006881487,0.00022400355,0.00012724604,0.00050505594,0.0001353649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016337888,0.0010307977,0.000994474,0.0011302793,0.0009022407,0.0016937443,0.001890361,0.0008096583,0.0019311548],"category_scores_gemma":[0.0051387334,0.00038072455,0.00046610413,0.00068916444,0.0011804962,0.0014984987,0.0014067481,0.0014018307,0.00027090267],"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.00033251478,0.00019183224,0.001724333,0.00011921464,0.000064488726,0.0000937597,0.0003323623,0.65983427,0.012030175,0.047162656,0.0019839266,0.27613047],"study_design_scores_gemma":[0.000032309814,0.00006956872,0.00011157869,0.0000044693784,0.000009443707,0.000025314765,0.000015392696,0.9937151,0.0016633358,0.003750273,0.00059379596,0.000009439088],"about_ca_topic_score_codex":0.0080012,"about_ca_topic_score_gemma":0.0046424256,"teacher_disagreement_score":0.0080012,"about_ca_system_score_codex":0.0019178431,"about_ca_system_score_gemma":0.0018254728,"threshold_uncertainty_score":0.015909255},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010503344,0.0018542262,0.1646959,0.0015980604,0.0017549167,0.0013516556,0.08773687,0.53554904,0.19495602],"genre_scores_gemma":[0.075783335,0.003092782,0.1367953,0.0031039603,0.00053967553,0.0022711519,0.46123984,0.09269625,0.22447771],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986413,0.00021525293,0.00013363932,0.00027015663,0.0005664719,0.00017310267],"domain_scores_gemma":[0.9976197,0.00061565154,0.00007205814,0.0008155626,0.00067016645,0.00020688887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629106,0.0016670974,0.0008605906,0.0016297075,0.0011449138,0.0037800074,0.004575955,0.0016041084,0.14724907],"category_scores_gemma":[0.00548821,0.0010705211,0.0010741814,0.0017796567,0.0006118903,0.005358559,0.002970852,0.0025406398,0.11386414],"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.001368615,0.00032607777,0.0014544397,0.0014998704,0.00011978845,0.00034633488,0.00035754588,0.004362918,0.01279497,0.026025157,0.82010555,0.13123873],"study_design_scores_gemma":[0.00037157736,0.0002148741,0.0007292466,0.00015486235,0.000052084208,0.00021580522,0.00016040342,0.015575601,0.015736742,0.016403839,0.95030284,0.000082178965],"about_ca_topic_score_codex":0.0045171115,"about_ca_topic_score_gemma":0.004754243,"teacher_disagreement_score":0.14724907,"about_ca_system_score_codex":0.00089100667,"about_ca_system_score_gemma":0.0021072228,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003591592,0.0010165294,0.9896572,0.00043610486,0.00029069083,0.00031464794,0.000103609185,0.00028562432,0.004303938],"genre_scores_gemma":[0.2729502,0.0024869319,0.7126353,0.00048302358,0.00022609903,0.0015337513,0.0005596782,0.00009731301,0.009027757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979989,0.00079516607,0.00016941951,0.0002811407,0.00066803466,0.00008738302],"domain_scores_gemma":[0.9989316,0.00041583634,0.00010971052,0.00016196762,0.0002860899,0.00009484699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015880859,0.00064109,0.0009345035,0.0007648396,0.0013097379,0.0012397079,0.002491866,0.001303978,0.0013995663],"category_scores_gemma":[0.003300304,0.00027223505,0.0006236533,0.0012194047,0.00088158593,0.0016429487,0.0015119532,0.0014379512,0.0006405126],"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.00028915552,0.00014911275,0.00060306466,0.0012702766,0.000219498,0.001147248,0.0010393009,0.25078475,0.044084035,0.43498373,0.020799339,0.24463038],"study_design_scores_gemma":[0.00013999143,0.0005655354,0.0003945924,0.00010941082,0.00014807578,0.0015038318,0.00018197086,0.735844,0.014649517,0.09336771,0.15291691,0.00017841702],"about_ca_topic_score_codex":0.0010288145,"about_ca_topic_score_gemma":0.001589514,"teacher_disagreement_score":0.002491866,"about_ca_system_score_codex":0.0010904139,"about_ca_system_score_gemma":0.0014657108,"threshold_uncertainty_score":0.008398712},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030062122,0.0010118552,0.9604891,0.00047855717,0.00022502338,0.00025528125,0.0002155812,0.0020364183,0.0052260985],"genre_scores_gemma":[0.571544,0.0015354309,0.42107558,0.000121051584,0.00019160935,0.0002030606,0.00052949,0.00012796806,0.0046718307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994948,0.00013154256,0.000058757534,0.0000717131,0.00020407604,0.000039122595],"domain_scores_gemma":[0.99918765,0.00020749363,0.0000640985,0.00022965108,0.00021320612,0.00009787612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487187,0.00022614849,0.00054017326,0.00077223056,0.0009801451,0.0011209117,0.0011278238,0.00061575905,0.0009144991],"category_scores_gemma":[0.0030378758,0.00023897628,0.000291387,0.00091615,0.00056566263,0.0016721778,0.0014424332,0.0005942075,0.00037790445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004407631,0.00023114045,0.0027197534,0.00083731685,0.00012561557,0.0017988632,0.001286613,0.26251307,0.07049397,0.17774113,0.017021196,0.46479055],"study_design_scores_gemma":[0.000074507894,0.00025248903,0.00094187295,0.000040869803,0.00008917869,0.0007666492,0.00033381963,0.8944889,0.017060705,0.029582635,0.05628739,0.00008094251],"about_ca_topic_score_codex":0.0028518331,"about_ca_topic_score_gemma":0.0034143783,"teacher_disagreement_score":0.0028518331,"about_ca_system_score_codex":0.00065495033,"about_ca_system_score_gemma":0.0007911616,"threshold_uncertainty_score":0.005670488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019572455,0.0011857256,0.9689095,0.00040660627,0.00026927062,0.000670862,0.000664416,0.004914515,0.0034066942],"genre_scores_gemma":[0.4469866,0.0015235409,0.5405499,0.00026121922,0.0002383378,0.0007629698,0.0028610793,0.00038632215,0.0064300657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991148,0.00015766712,0.00007957709,0.0001181068,0.0004783308,0.0000515754],"domain_scores_gemma":[0.99870527,0.0003125536,0.00013097044,0.00043259974,0.00033730126,0.000081345745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011494615,0.00038438936,0.00064855587,0.0007676087,0.00081269647,0.0010221578,0.0016977369,0.0006419824,0.0018419834],"category_scores_gemma":[0.0032572483,0.0003212203,0.00038991802,0.0009807845,0.00062946905,0.0021390743,0.0014559596,0.000872068,0.0007143809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082303135,0.00028374538,0.0022367812,0.0013035476,0.00022880686,0.0012805498,0.0006002363,0.11333995,0.13587525,0.054888837,0.031651866,0.65748745],"study_design_scores_gemma":[0.00048331605,0.001095891,0.0019481224,0.00009242574,0.00022968778,0.002750002,0.00042704795,0.7089117,0.10538159,0.039538275,0.13892284,0.00021911673],"about_ca_topic_score_codex":0.0012583548,"about_ca_topic_score_gemma":0.0011943039,"teacher_disagreement_score":0.0018419834,"about_ca_system_score_codex":0.00069481716,"about_ca_system_score_gemma":0.0009009216,"threshold_uncertainty_score":0.006162107},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94080037,0.00021721964,0.035274494,0.0007065233,0.00018874602,0.00024289334,0.0005198797,0.0006438455,0.02140603],"genre_scores_gemma":[0.980859,0.00017837393,0.015635457,0.00009109259,0.000018330682,0.000099534016,0.0002953692,0.000050013918,0.0027728386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945384,0.00018235517,0.000032458156,0.000067675704,0.00013227206,0.00013152312],"domain_scores_gemma":[0.9980021,0.0011117987,0.00009459278,0.00023867779,0.00027992512,0.00027292874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072740513,0.00044585444,0.00074438885,0.0004536897,0.0010289846,0.0010395502,0.0016619761,0.001346429,0.0049441042],"category_scores_gemma":[0.002714256,0.0003188222,0.000621652,0.00066653296,0.00093033956,0.001968536,0.0013984093,0.0011303934,0.0003020309],"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.00030251447,0.00025193076,0.0033798448,0.00006896349,0.000052556,0.00025834132,0.0003420199,0.97009766,0.0037393959,0.015293362,0.0014555411,0.0047578597],"study_design_scores_gemma":[0.000054439533,0.0000895004,0.000488853,0.0000047483395,0.000010297979,0.000025710096,0.000081449856,0.99550843,0.00084465253,0.002009686,0.000871104,0.0000111883965],"about_ca_topic_score_codex":0.013174745,"about_ca_topic_score_gemma":0.009408806,"teacher_disagreement_score":0.013174745,"about_ca_system_score_codex":0.0011233306,"about_ca_system_score_gemma":0.0010979772,"threshold_uncertainty_score":0.026196122},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21435682,0.0002494492,0.77207565,0.0006020013,0.00013901533,0.0004532463,0.00004593504,0.00078584993,0.011292032],"genre_scores_gemma":[0.8689397,0.000103462466,0.1269342,0.00013860092,0.000030626703,0.00026046654,0.00003145758,0.000054978012,0.003506455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968267,0.0018733193,0.00018573029,0.0003590352,0.0004691465,0.0002860785],"domain_scores_gemma":[0.99148726,0.0060228226,0.0005052807,0.00097200356,0.0005486947,0.0004639335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029327269,0.00085165363,0.0008232543,0.00054702366,0.0012501368,0.0017180354,0.0021354558,0.0013398386,0.002195207],"category_scores_gemma":[0.01197709,0.0004668274,0.00085113244,0.00044469352,0.001752662,0.0025534178,0.0034055924,0.0014183093,0.00025750263],"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.0010211149,0.00082527165,0.005333972,0.000324427,0.00019041666,0.0015457494,0.0022957148,0.6139588,0.025557442,0.2500029,0.0015600353,0.09738419],"study_design_scores_gemma":[0.000077822355,0.00024006917,0.00025447272,0.0000122364345,0.000026802256,0.00017011247,0.00022817924,0.9299811,0.004632963,0.06127992,0.003069808,0.000026472522],"about_ca_topic_score_codex":0.0042535244,"about_ca_topic_score_gemma":0.0025748608,"teacher_disagreement_score":0.0042535244,"about_ca_system_score_codex":0.0014243922,"about_ca_system_score_gemma":0.0012240957,"threshold_uncertainty_score":0.015509903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09200734,0.0011193271,0.9020122,0.00016255165,0.000109012806,0.00011917897,0.000030562827,0.0022229708,0.0022168576],"genre_scores_gemma":[0.8482253,0.00046618268,0.14876416,0.00009904904,0.00014557669,0.0001026653,0.00008010258,0.000066001274,0.0020508987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942315,0.00014041986,0.00003227089,0.0001324586,0.00023129364,0.000040433053],"domain_scores_gemma":[0.99876934,0.0004297759,0.00012706168,0.00018261094,0.0003942123,0.00009695295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075469364,0.00046674637,0.00083411887,0.0004066,0.00058420707,0.0007443133,0.0017003136,0.0006191213,0.0005975748],"category_scores_gemma":[0.0017211075,0.00023991504,0.00024657068,0.0005160474,0.00050224597,0.0014075824,0.0007348011,0.0006436865,0.00024655068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009588191,0.00042536203,0.0032216208,0.00048704923,0.00033016867,0.0013552661,0.00075304124,0.30178577,0.22638078,0.027444862,0.0047030286,0.43215433],"study_design_scores_gemma":[0.00008233957,0.00028343897,0.0008235108,0.000008865001,0.000068865884,0.000398367,0.00008546811,0.9635456,0.020839851,0.008407745,0.005406784,0.000049195394],"about_ca_topic_score_codex":0.0014019541,"about_ca_topic_score_gemma":0.0014539113,"teacher_disagreement_score":0.0017003136,"about_ca_system_score_codex":0.0003502975,"about_ca_system_score_gemma":0.000369049,"threshold_uncertainty_score":0.003991306},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026743768,0.00017825658,0.98873293,0.00065808144,0.00006181327,0.00013965099,0.000050257473,0.00044038764,0.007064295],"genre_scores_gemma":[0.36546966,0.000557332,0.6081323,0.00019001693,0.00016556731,0.00067664287,0.00019008835,0.00017845503,0.024439996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979761,0.0005909725,0.00013629426,0.00020277091,0.0008598485,0.00023384619],"domain_scores_gemma":[0.99872017,0.00034511875,0.00013192963,0.00029203398,0.0003372741,0.00017352047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038694646,0.0005204389,0.0007602832,0.00082840666,0.0016451261,0.0040054643,0.0030612329,0.0015523185,0.005826292],"category_scores_gemma":[0.005526743,0.00052680436,0.000902196,0.001027776,0.0016631592,0.0041681775,0.0030521324,0.0021446978,0.0016200438],"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.000031140316,0.000050363502,0.00016595321,0.000035241766,0.000016123506,0.00017415364,0.00018120895,0.060071032,0.00061965245,0.9129461,0.0037042375,0.022004811],"study_design_scores_gemma":[0.000047009504,0.000036793746,0.000088375804,0.00003351272,0.000023676443,0.00015790443,0.000068384856,0.57490027,0.0011024412,0.3812034,0.042307798,0.000030258207],"about_ca_topic_score_codex":0.0036936058,"about_ca_topic_score_gemma":0.0043613324,"teacher_disagreement_score":0.005826292,"about_ca_system_score_codex":0.002693772,"about_ca_system_score_gemma":0.0038472684,"threshold_uncertainty_score":0.020463884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047035248,0.00005325696,0.99564517,0.000051467607,0.000023745184,0.000102699545,0.000022002589,0.0026502619,0.0009811317],"genre_scores_gemma":[0.060262363,0.0002757066,0.935653,0.00009420249,0.00005026227,0.00063685945,0.00026284286,0.00048431946,0.002280392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968098,0.00089252985,0.00033565875,0.00037626736,0.0013510591,0.0002345929],"domain_scores_gemma":[0.998321,0.00035293758,0.00016510811,0.0003640898,0.0006041028,0.00019280022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004239475,0.0015763006,0.0011028348,0.0018398514,0.00092141255,0.0029704464,0.004679186,0.0018062802,0.004092648],"category_scores_gemma":[0.0050688474,0.000824153,0.0015181184,0.00089124613,0.0015786882,0.003001465,0.0031711585,0.0026889239,0.0016284164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027916982,0.00028825324,0.002640824,0.00065578707,0.00014805644,0.00061879586,0.0013494443,0.29242942,0.025459738,0.39945215,0.013166336,0.263512],"study_design_scores_gemma":[0.00005311581,0.00014234036,0.00024145967,0.000095657895,0.00006352827,0.0002686635,0.0000884977,0.9052711,0.0086838575,0.019003535,0.06600518,0.00008301784],"about_ca_topic_score_codex":0.006085036,"about_ca_topic_score_gemma":0.003860623,"teacher_disagreement_score":0.006085036,"about_ca_system_score_codex":0.0014921901,"about_ca_system_score_gemma":0.0031674707,"threshold_uncertainty_score":0.022420704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92198455,0.0021629701,0.038339943,0.0014386951,0.00043834554,0.00040684998,0.0006883912,0.013071863,0.02146843],"genre_scores_gemma":[0.98847884,0.00030881076,0.0070208274,0.00031314392,0.000023041795,0.000055746128,0.0004130036,0.000180148,0.0032064894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853075,0.00034722174,0.00010607095,0.0001842062,0.00052065554,0.00031112516],"domain_scores_gemma":[0.995672,0.0014545005,0.00026742218,0.0018298533,0.00045170146,0.00032450425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014336066,0.0007421867,0.00085865636,0.00059441366,0.0012509563,0.0009957517,0.0009778608,0.0012686912,0.0022708662],"category_scores_gemma":[0.008550797,0.00041423793,0.00031310142,0.00050300226,0.0008064535,0.0042904075,0.003412711,0.0014419237,0.0010666162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012111484,0.0016050234,0.10654686,0.0019765215,0.001407557,0.008145791,0.007009258,0.06733291,0.16521923,0.035435814,0.11138446,0.48182523],"study_design_scores_gemma":[0.0002593986,0.002200413,0.029904168,0.00026555703,0.00040887276,0.013794211,0.0030249737,0.6852976,0.15419321,0.011415979,0.09896448,0.00027113812],"about_ca_topic_score_codex":0.004440468,"about_ca_topic_score_gemma":0.0039432505,"teacher_disagreement_score":0.004440468,"about_ca_system_score_codex":0.00038313505,"about_ca_system_score_gemma":0.0006250702,"threshold_uncertainty_score":0.008829236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019819837,0.0007313857,0.9469156,0.00049271266,0.0005291437,0.0011428578,0.00026705398,0.0050146338,0.025086666],"genre_scores_gemma":[0.36397967,0.001048782,0.58622533,0.00091799354,0.00042340692,0.0022545026,0.000872278,0.0011928611,0.04308524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968772,0.0009032026,0.0003943413,0.00044469952,0.0011538093,0.00022685017],"domain_scores_gemma":[0.9967468,0.0010198959,0.00027592434,0.0009043363,0.00082950643,0.00022361573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003645767,0.0011379415,0.00062786415,0.0009663671,0.0014602448,0.003609542,0.0029669504,0.0015235419,0.009105971],"category_scores_gemma":[0.0059423395,0.0009999846,0.0006244807,0.00087065314,0.000929473,0.0043990226,0.0018790844,0.0021424254,0.0036457272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019659519,0.0012707575,0.0030883413,0.002290102,0.00039420012,0.00095639145,0.0016474013,0.060756918,0.087420516,0.48397294,0.0280944,0.32814202],"study_design_scores_gemma":[0.00083224993,0.0013512197,0.0012475966,0.00019971178,0.00051900686,0.0015536943,0.00057030085,0.42026758,0.10775424,0.14244056,0.3229961,0.00026772782],"about_ca_topic_score_codex":0.0010941405,"about_ca_topic_score_gemma":0.0020645286,"teacher_disagreement_score":0.009105971,"about_ca_system_score_codex":0.0014700335,"about_ca_system_score_gemma":0.0010296671,"threshold_uncertainty_score":0.030462563},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5414576,0.0016340733,0.4487817,0.0011093752,0.00015578717,0.00029322237,0.00013946611,0.0012647689,0.005163964],"genre_scores_gemma":[0.9917258,0.00023938897,0.0072265337,0.00005416988,0.000033788037,0.00003812661,0.00003237946,0.000027048323,0.0006228512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969308,0.0012529718,0.00013088068,0.00044620605,0.0007390215,0.0005002535],"domain_scores_gemma":[0.99361825,0.0044333856,0.0005338606,0.00048071076,0.0004701895,0.00046354486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003120412,0.0010180945,0.0016691175,0.0006731886,0.0012196434,0.0020753953,0.0015660312,0.0014406143,0.00089131226],"category_scores_gemma":[0.007898393,0.0006122636,0.00047362735,0.0009151781,0.0016543863,0.0026057395,0.0011159148,0.00089247565,0.0001709453],"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.0003006599,0.00018377516,0.002710574,0.000093074654,0.00004979234,0.0002559913,0.00015701998,0.95923007,0.0053747636,0.01762897,0.0008928646,0.013122409],"study_design_scores_gemma":[0.000032623182,0.0001051325,0.0005749527,0.0000037129448,0.000011810949,0.000049724014,0.00006039947,0.9896464,0.0007418713,0.008487518,0.00027063637,0.000015138423],"about_ca_topic_score_codex":0.004681578,"about_ca_topic_score_gemma":0.0025801384,"teacher_disagreement_score":0.004681578,"about_ca_system_score_codex":0.0019431501,"about_ca_system_score_gemma":0.001316072,"threshold_uncertainty_score":0.0165025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00488314,0.000183098,0.987884,0.0008948215,0.00010699769,0.0002166977,0.000023958988,0.0005184663,0.0052888202],"genre_scores_gemma":[0.20322365,0.00036811567,0.78962797,0.00026686868,0.00016635314,0.00038330522,0.00009550534,0.00009379011,0.0057743746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704164,0.0009173595,0.0001800134,0.00052946614,0.0010563799,0.00027507413],"domain_scores_gemma":[0.9971374,0.00043803884,0.0002781449,0.00078170904,0.0006996457,0.0006649988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004550814,0.00047156637,0.00054865255,0.0011724409,0.0025245873,0.0032543577,0.0034779662,0.0022513042,0.0014628891],"category_scores_gemma":[0.004064405,0.0004277089,0.0008604493,0.0009963082,0.0040619583,0.004362216,0.0040273466,0.0025414121,0.00088437635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039624418,0.00009032984,0.0004588325,0.0000960897,0.000020748339,0.0003767223,0.00096361106,0.022973659,0.0045099393,0.93957126,0.0035231498,0.027376145],"study_design_scores_gemma":[0.00014401782,0.00031631792,0.00038358063,0.00016001803,0.000080391554,0.0009790717,0.0007969139,0.40867442,0.0077982065,0.37888673,0.20163988,0.00014053949],"about_ca_topic_score_codex":0.0035090763,"about_ca_topic_score_gemma":0.0029808613,"teacher_disagreement_score":0.004550814,"about_ca_system_score_codex":0.0018336332,"about_ca_system_score_gemma":0.0042584166,"threshold_uncertainty_score":0.024067283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071504906,0.00021780537,0.91134953,0.00070105196,0.00014163731,0.00055844936,0.00009337554,0.0017690023,0.013664298],"genre_scores_gemma":[0.9080492,0.00008917265,0.08550837,0.00014610255,0.00005322072,0.000192646,0.00004710654,0.00007606478,0.005837983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992819,0.003063198,0.0005196341,0.0010398824,0.0017536666,0.00080455106],"domain_scores_gemma":[0.9845828,0.0057777828,0.0016658463,0.0053364867,0.0017133483,0.000923645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005341064,0.00060993654,0.0013357729,0.0011510289,0.0019304005,0.0022059996,0.00301015,0.0019962273,0.0036927336],"category_scores_gemma":[0.023317333,0.00047706216,0.00074989686,0.001000727,0.0025144839,0.0050601354,0.0056553935,0.0021048589,0.0009198665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016491184,0.0004701664,0.0032548085,0.0002793641,0.00012952172,0.0008040737,0.0012528508,0.15648343,0.021887952,0.6237417,0.008694168,0.18135284],"study_design_scores_gemma":[0.00019249175,0.00029304528,0.00046954743,0.000042838998,0.00005684285,0.00049189426,0.00013815468,0.8453391,0.0073329858,0.13643596,0.00912711,0.00008000333],"about_ca_topic_score_codex":0.001620407,"about_ca_topic_score_gemma":0.0012460788,"teacher_disagreement_score":0.005341064,"about_ca_system_score_codex":0.0016321517,"about_ca_system_score_gemma":0.0024454729,"threshold_uncertainty_score":0.028246582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027139269,0.00069146033,0.9619072,0.00085011905,0.00019540174,0.00028416014,0.00015397859,0.00067693554,0.008101526],"genre_scores_gemma":[0.9022084,0.001064212,0.08666566,0.00022663132,0.00033468456,0.00057430076,0.00026207187,0.00010764838,0.00855642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988268,0.0002694441,0.00009035323,0.00024512305,0.00044215532,0.00012619887],"domain_scores_gemma":[0.9989506,0.00039554646,0.00014021272,0.00008476915,0.00032662955,0.00010226388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013163703,0.00080991175,0.0010908918,0.0010761454,0.0017406624,0.0017581786,0.0029766937,0.0016544485,0.0028854434],"category_scores_gemma":[0.0026493324,0.00035095547,0.00069148553,0.000973018,0.00096382876,0.0028297214,0.0014306151,0.0011171615,0.00080754556],"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.0003194121,0.00015041453,0.0010523549,0.00026021764,0.00007160819,0.0008736168,0.0006805552,0.79148245,0.0149530545,0.121846475,0.0062665283,0.062043313],"study_design_scores_gemma":[0.000008960434,0.000035385,0.00007436929,0.000006700855,0.000009228467,0.00006663979,0.000031683237,0.99018025,0.00038755877,0.0078078727,0.0013787221,0.000012707454],"about_ca_topic_score_codex":0.00459411,"about_ca_topic_score_gemma":0.0035691676,"teacher_disagreement_score":0.00459411,"about_ca_system_score_codex":0.0019618343,"about_ca_system_score_gemma":0.0010696608,"threshold_uncertainty_score":0.014234126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08010633,0.0017024766,0.8911617,0.00043177983,0.00034862943,0.0012070697,0.0005454743,0.011695328,0.012801239],"genre_scores_gemma":[0.7644485,0.0009118639,0.21888676,0.00015426501,0.00015666371,0.0008761882,0.00080324226,0.00018935947,0.013573057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994356,0.00014027278,0.000028867831,0.00010145548,0.00023610577,0.00005762639],"domain_scores_gemma":[0.999302,0.0001547138,0.00004808504,0.00014946134,0.00027062529,0.000075023476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006901135,0.00052290474,0.0010558567,0.0005673265,0.001204256,0.00063665677,0.0018411033,0.0008353198,0.00683795],"category_scores_gemma":[0.0014748443,0.00016748674,0.0003182264,0.00075511733,0.00039531864,0.0011232151,0.00083160313,0.00070323085,0.0026984236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015718483,0.0009717561,0.0029714783,0.0010375496,0.00023575015,0.0014519264,0.0010141408,0.16942844,0.12846835,0.058722384,0.05324618,0.58088034],"study_design_scores_gemma":[0.00028408534,0.0010502468,0.0014232635,0.000033814802,0.00010212063,0.0011041489,0.00015722803,0.88785666,0.030282194,0.016235271,0.061317846,0.00015315699],"about_ca_topic_score_codex":0.0030435536,"about_ca_topic_score_gemma":0.002352334,"teacher_disagreement_score":0.00683795,"about_ca_system_score_codex":0.000690029,"about_ca_system_score_gemma":0.0010732071,"threshold_uncertainty_score":0.02287525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14888826,0.00077992806,0.8369463,0.002062057,0.000101662874,0.00008540934,0.00014095042,0.00020110542,0.01079422],"genre_scores_gemma":[0.957521,0.00025014527,0.036228284,0.000100772166,0.000060003604,0.000044137516,0.000055744207,0.000054202854,0.005685627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981331,0.0009870139,0.0000745737,0.00030725164,0.00023546348,0.00026260485],"domain_scores_gemma":[0.9908717,0.0068694865,0.0006092906,0.0005515012,0.0005118321,0.00058622967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029999088,0.0008863701,0.0017262322,0.0006977179,0.0010075968,0.002818955,0.003169055,0.0031463292,0.0026864351],"category_scores_gemma":[0.015067122,0.00090114836,0.00094243407,0.0007808927,0.0027291598,0.0041440786,0.002498941,0.0020419415,0.0002683477],"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.00019427986,0.00009991404,0.0020093608,0.00008098527,0.00006468789,0.00048443215,0.00064222753,0.7470946,0.0007350875,0.23534785,0.0012234342,0.01202312],"study_design_scores_gemma":[0.000014747662,0.000015939322,0.00012855492,0.0000050328026,0.000009199458,0.000043935524,0.000059721773,0.94890976,0.00010019701,0.050325204,0.00037783606,0.0000099356275],"about_ca_topic_score_codex":0.021520434,"about_ca_topic_score_gemma":0.011388817,"teacher_disagreement_score":0.021520434,"about_ca_system_score_codex":0.0015273084,"about_ca_system_score_gemma":0.0011999758,"threshold_uncertainty_score":0.042790353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16819237,0.00340238,0.7032518,0.0077911713,0.0016186021,0.0005627309,0.00035454897,0.003347967,0.11147849],"genre_scores_gemma":[0.9017194,0.0013081892,0.07167483,0.0017569255,0.0009988479,0.00032698948,0.00034329994,0.000519914,0.021351587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972082,0.00053021306,0.00016842246,0.00056730915,0.0011315381,0.00039425635],"domain_scores_gemma":[0.99333835,0.0030577674,0.00056203257,0.0012990654,0.0010681051,0.0006747102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022177736,0.0005494779,0.00077619345,0.00053941796,0.0013250326,0.004882748,0.0012725798,0.0023950383,0.008810418],"category_scores_gemma":[0.016309569,0.00057012524,0.0002887683,0.0005467539,0.0011952246,0.008292574,0.0038596292,0.0017757431,0.0020234683],"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.002076983,0.00033446986,0.013948872,0.0008537393,0.00015808486,0.0071197683,0.0037299811,0.04227942,0.09411506,0.5538738,0.03300858,0.24850127],"study_design_scores_gemma":[0.00027799772,0.00067366136,0.005135413,0.00022963494,0.00011279009,0.005624745,0.0033657446,0.3523576,0.040855218,0.4524874,0.13870282,0.00017691214],"about_ca_topic_score_codex":0.00090297085,"about_ca_topic_score_gemma":0.00069491484,"teacher_disagreement_score":0.008810418,"about_ca_system_score_codex":0.00075318303,"about_ca_system_score_gemma":0.0007856659,"threshold_uncertainty_score":0.029473841},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55282795,0.00071205257,0.28736126,0.0015028631,0.0009704925,0.004588781,0.008712058,0.06644702,0.07687756],"genre_scores_gemma":[0.76956856,0.0003648317,0.19321194,0.0002912756,0.000072585026,0.0014118769,0.010786822,0.0015802516,0.022711935],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905056,0.0002250182,0.00007748246,0.00018059093,0.0003365675,0.00012972951],"domain_scores_gemma":[0.99917054,0.00021004966,0.0000356344,0.00015290185,0.00013640145,0.00029457064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014867166,0.0005647449,0.00046735833,0.00045160565,0.0007594563,0.001169445,0.0018340538,0.0006337898,0.008240485],"category_scores_gemma":[0.0018237976,0.00035715054,0.0003189672,0.0004892838,0.0006119314,0.0020516298,0.0015567666,0.0012407498,0.0018938468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00854219,0.010403899,0.015518039,0.0023001318,0.00053216866,0.0032427674,0.002463336,0.106892034,0.42065606,0.10505306,0.1499901,0.17440625],"study_design_scores_gemma":[0.00208776,0.0045016166,0.00930306,0.00009621781,0.00012497242,0.000750464,0.0008259486,0.59243333,0.19361055,0.020529803,0.17552315,0.00021310324],"about_ca_topic_score_codex":0.00292771,"about_ca_topic_score_gemma":0.0034921684,"teacher_disagreement_score":0.008240485,"about_ca_system_score_codex":0.00078827864,"about_ca_system_score_gemma":0.0010710525,"threshold_uncertainty_score":0.027567208},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004402187,0.015416148,0.9095876,0.008449338,0.0018800442,0.00029680735,0.00011372846,0.004928822,0.054925263],"genre_scores_gemma":[0.2278247,0.03628516,0.69061816,0.0029045132,0.005393234,0.0009235918,0.0005075215,0.0010245444,0.03451859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99095154,0.0025824711,0.00084699434,0.00062714564,0.004672502,0.0003192771],"domain_scores_gemma":[0.9935616,0.002575093,0.0005995663,0.0020310127,0.0009162851,0.00031645436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006421513,0.0009680225,0.000850088,0.0019013472,0.0015827593,0.008046574,0.002031947,0.0027554163,0.004522919],"category_scores_gemma":[0.013511038,0.0010780504,0.0007614238,0.0026695747,0.002475139,0.01318145,0.002608822,0.003064675,0.0036646242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008251368,0.00016246119,0.0011500076,0.0016550113,0.00020978933,0.0012057511,0.0011369119,0.008876863,0.01594866,0.57177484,0.025486624,0.3723106],"study_design_scores_gemma":[0.000079342775,0.00016524566,0.00046206298,0.00026390323,0.0001295798,0.0026806719,0.00024653252,0.030626949,0.016239863,0.27851665,0.6704733,0.000115944415],"about_ca_topic_score_codex":0.0005180617,"about_ca_topic_score_gemma":0.00047406962,"teacher_disagreement_score":0.008046574,"about_ca_system_score_codex":0.0011509779,"about_ca_system_score_gemma":0.0016944903,"threshold_uncertainty_score":0.03396058},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124029666,0.004592767,0.8461264,0.0008534163,0.0010814768,0.001160461,0.0009666199,0.009762808,0.011426453],"genre_scores_gemma":[0.65147054,0.0016447281,0.33995658,0.00015489392,0.0003018068,0.00030318327,0.0010201252,0.00025656304,0.004891551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985329,0.000239528,0.00022157344,0.00022705906,0.0005847206,0.00019434805],"domain_scores_gemma":[0.99715686,0.00042977478,0.00021185537,0.0009384709,0.0010098306,0.00025328505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017501486,0.0006868499,0.0011251823,0.001279199,0.001578985,0.0013311951,0.0029074412,0.00093160005,0.0020830957],"category_scores_gemma":[0.0049217143,0.00030875372,0.0003867368,0.0015732147,0.0007240804,0.0039082393,0.002594848,0.0010454243,0.0011713393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029049017,0.00037351204,0.004900627,0.001392851,0.00022689468,0.0018165223,0.0012065978,0.06348723,0.17271507,0.041185714,0.027802333,0.6819877],"study_design_scores_gemma":[0.0011203284,0.0032811076,0.004806501,0.0001601933,0.00038324218,0.006231067,0.0009179546,0.6021992,0.1886859,0.034734517,0.15685646,0.0006234975],"about_ca_topic_score_codex":0.0026226367,"about_ca_topic_score_gemma":0.0023127387,"teacher_disagreement_score":0.0029074412,"about_ca_system_score_codex":0.0009780197,"about_ca_system_score_gemma":0.0017580027,"threshold_uncertainty_score":0.009255767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54098356,0.0067664613,0.41856545,0.003595241,0.00014929027,0.0002804877,0.0001801518,0.0010946671,0.02838476],"genre_scores_gemma":[0.9753758,0.0013509972,0.021788893,0.00013528712,0.00010406432,0.00016397086,0.000064835054,0.00009593878,0.0009202682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975591,0.0009600866,0.00008814549,0.00029568787,0.0008615983,0.0002355099],"domain_scores_gemma":[0.96868896,0.025528867,0.0017855365,0.0016756767,0.0016235787,0.0006974067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042614266,0.0006778202,0.0009000748,0.0014455554,0.0013223069,0.0019152627,0.0015315155,0.0016816821,0.0013913938],"category_scores_gemma":[0.04981523,0.00060158677,0.00035457913,0.0012212913,0.0028121823,0.0053108344,0.0012027955,0.0015980875,0.00024485556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024032641,0.00031006505,0.005863826,0.0003206923,0.00007401445,0.0008296663,0.001661262,0.44567224,0.011621618,0.48232916,0.0034215173,0.047655694],"study_design_scores_gemma":[0.000030978837,0.000113497255,0.001794192,0.000037189282,0.000022923543,0.00034531142,0.00038993297,0.82572365,0.0017330578,0.16801438,0.0017547259,0.0000401966],"about_ca_topic_score_codex":0.0013552849,"about_ca_topic_score_gemma":0.0006050383,"teacher_disagreement_score":0.0042614266,"about_ca_system_score_codex":0.0018610017,"about_ca_system_score_gemma":0.0006464078,"threshold_uncertainty_score":0.022536814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003756082,0.00017706436,0.9946802,0.00012512902,0.00005213249,0.000038785016,0.000014830946,0.00012708425,0.0010286934],"genre_scores_gemma":[0.4724854,0.00077832234,0.5129018,0.00021251035,0.00017870811,0.000825224,0.00021852074,0.00025644325,0.012143089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992198,0.0003871968,0.000026197258,0.000069014335,0.00021850326,0.000079327816],"domain_scores_gemma":[0.99858236,0.0009211322,0.000113314876,0.000047778252,0.0002651227,0.000070362694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018381167,0.0008829352,0.00096877257,0.0007915553,0.00055171375,0.0006256263,0.0018052291,0.0011018383,0.0027707694],"category_scores_gemma":[0.0036120466,0.0003261182,0.00054514076,0.00079029216,0.00062562537,0.0010377443,0.0009392214,0.0011488326,0.0005440315],"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.00006733688,0.00004480045,0.00029876496,0.000072668394,0.000028069679,0.00006782043,0.000040817624,0.93999296,0.0013445816,0.02186524,0.0016595515,0.03451739],"study_design_scores_gemma":[0.000004281032,0.000009266795,0.000021100754,0.0000021085011,0.0000017551534,0.0000064680253,0.0000026967423,0.99801385,0.00008270558,0.0014902523,0.00036331834,0.0000022114464],"about_ca_topic_score_codex":0.0037057737,"about_ca_topic_score_gemma":0.0024833633,"teacher_disagreement_score":0.0037057737,"about_ca_system_score_codex":0.0010166924,"about_ca_system_score_gemma":0.0011457059,"threshold_uncertainty_score":0.009721041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047203276,0.00038768764,0.94652224,0.000418725,0.00014760239,0.00010113451,0.000023061326,0.0010558335,0.0041404944],"genre_scores_gemma":[0.5366922,0.00022729993,0.45722818,0.00023289931,0.0000916727,0.00025031716,0.00010104347,0.0001047915,0.0050715874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982053,0.00003270445,0.000009926486,0.000035141406,0.00008170255,0.000020063148],"domain_scores_gemma":[0.9997743,0.0000706048,0.00002837844,0.000025661437,0.00007387912,0.000027147677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037540207,0.00043637538,0.0005379469,0.00045114892,0.00075536064,0.000623306,0.001272367,0.00093148684,0.0013261258],"category_scores_gemma":[0.00097294105,0.00017778123,0.00026116616,0.00039468642,0.00039569923,0.00076469197,0.0005774238,0.00043107744,0.0003647015],"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.00028484367,0.00024399639,0.0014080273,0.00015103686,0.000093617564,0.0002447069,0.000303626,0.5577206,0.062309116,0.023331176,0.0054377317,0.3484715],"study_design_scores_gemma":[0.00004153975,0.000046942627,0.00014464768,0.0000037886143,0.000008820847,0.00006575449,0.000017444372,0.99217904,0.002451126,0.0024274574,0.0026060506,0.0000074315262],"about_ca_topic_score_codex":0.0015524301,"about_ca_topic_score_gemma":0.0017400996,"teacher_disagreement_score":0.0015524301,"about_ca_system_score_codex":0.0004828732,"about_ca_system_score_gemma":0.00060143083,"threshold_uncertainty_score":0.004436314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17886458,0.00015799633,0.74029094,0.00063997885,0.00028636627,0.0006574284,0.0003011147,0.06915134,0.009650283],"genre_scores_gemma":[0.68561006,0.00017365816,0.30092922,0.00028837068,0.00015523448,0.00039951023,0.0007538765,0.0028441602,0.008845948],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989441,0.00016538693,0.00006775844,0.00022831168,0.0004347312,0.00015968012],"domain_scores_gemma":[0.99806553,0.00042128938,0.00013876059,0.00058864884,0.0004944989,0.00029135923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012993241,0.00076797814,0.0006153569,0.0006785199,0.00090646814,0.0015384986,0.0027266536,0.0007440704,0.0035666402],"category_scores_gemma":[0.0040887804,0.00067017134,0.0004366063,0.00066611957,0.0008554033,0.00223861,0.002785254,0.001223883,0.0012446548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033936081,0.0010386688,0.015788957,0.00062259746,0.0003365619,0.0018872723,0.0027602694,0.13322794,0.43488216,0.033372413,0.052464325,0.32022524],"study_design_scores_gemma":[0.00038230518,0.0003779132,0.0031363335,0.000047327867,0.0000949528,0.00022098733,0.0002971466,0.85026395,0.097070456,0.008262653,0.03970864,0.0001373143],"about_ca_topic_score_codex":0.0060595116,"about_ca_topic_score_gemma":0.0049435017,"teacher_disagreement_score":0.0060595116,"about_ca_system_score_codex":0.0011776161,"about_ca_system_score_gemma":0.0017964715,"threshold_uncertainty_score":0.012048483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1272903,0.0015231733,0.86347,0.0005457237,0.0003138555,0.00019468764,0.0000897406,0.0005444379,0.006028026],"genre_scores_gemma":[0.9603635,0.00027275254,0.037564725,0.00005315357,0.0001397596,0.00005747085,0.000032227403,0.000041710533,0.0014746609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983557,0.00050194457,0.000075681906,0.00032869956,0.00042754674,0.00031046363],"domain_scores_gemma":[0.9966678,0.0017194336,0.0003156445,0.0003164417,0.0005337141,0.0004469976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026682483,0.0006255034,0.0015395258,0.0005853262,0.0014558919,0.0011526281,0.0024565812,0.000930461,0.0012613438],"category_scores_gemma":[0.0060659857,0.00048849906,0.0003199357,0.0010515758,0.00086775987,0.001432894,0.0012621694,0.0006698163,0.0003145528],"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.00070226996,0.00017550237,0.000943878,0.00013272488,0.00006505601,0.00039018513,0.00041546283,0.88737124,0.0091027375,0.029861677,0.004031611,0.06680768],"study_design_scores_gemma":[0.000026949483,0.00007166004,0.00013671519,0.0000038011547,0.00001236707,0.00006656494,0.000057198005,0.9906031,0.00093750795,0.006972235,0.0010985835,0.000013357958],"about_ca_topic_score_codex":0.0076688933,"about_ca_topic_score_gemma":0.0061086663,"teacher_disagreement_score":0.0076688933,"about_ca_system_score_codex":0.0014887098,"about_ca_system_score_gemma":0.0019942445,"threshold_uncertainty_score":0.015248477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9781668,0.000039257087,0.020180525,0.000037863214,0.000003990849,0.00006923512,0.00017324442,0.00022003922,0.0011090969],"genre_scores_gemma":[0.99606824,0.000017384851,0.0033858933,0.000012467086,0.0000023487864,0.00003388421,0.00018558987,0.000013602611,0.0002805254],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985789,0.0005707689,0.00010681683,0.00026265476,0.00037368716,0.00010721485],"domain_scores_gemma":[0.9903312,0.0059110923,0.00090705097,0.00086977636,0.0013836905,0.00059716223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010922379,0.0004918168,0.00055492745,0.0010961666,0.000313254,0.0009079795,0.00050988793,0.00043905454,0.0006401068],"category_scores_gemma":[0.010140477,0.00018781301,0.00018491659,0.0006299588,0.00026653556,0.0008184551,0.0003669595,0.00044248308,0.0002497923],"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.0029708594,0.002196927,0.6703139,0.00046546658,0.0003198306,0.0013111165,0.006333776,0.046949405,0.10544134,0.0040859994,0.0018193991,0.15779194],"study_design_scores_gemma":[0.000024781011,0.0010399338,0.30822116,0.0000237159,0.000059422757,0.0010313538,0.0015466636,0.67035466,0.01440554,0.002046718,0.0011649721,0.00008109217],"about_ca_topic_score_codex":0.003401636,"about_ca_topic_score_gemma":0.003121523,"teacher_disagreement_score":0.003401636,"about_ca_system_score_codex":0.00036939222,"about_ca_system_score_gemma":0.0002810586,"threshold_uncertainty_score":0.0067636967},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5768066,0.0011127756,0.3257868,0.0026380501,0.00029029723,0.0019881416,0.0006279839,0.03323903,0.05751028],"genre_scores_gemma":[0.8828579,0.00045195615,0.103936724,0.00031429753,0.00009052882,0.00058899994,0.0008286269,0.0011790154,0.0097519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578285,0.0015942834,0.0002574438,0.0005336202,0.0011830247,0.0006487259],"domain_scores_gemma":[0.9923799,0.0024286192,0.00047535024,0.003152273,0.0009765961,0.00058735296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044729663,0.001090819,0.0007563784,0.00082527444,0.0018986487,0.0034034082,0.0025054622,0.0012985286,0.0036968163],"category_scores_gemma":[0.0140678,0.00089282484,0.0005852378,0.0009516136,0.0011212421,0.0057692765,0.0037341283,0.0011304128,0.0026517764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025350014,0.003413472,0.034850407,0.00091881293,0.0005644912,0.001945936,0.0039102505,0.29145846,0.07070645,0.10066361,0.062839404,0.42619365],"study_design_scores_gemma":[0.00035439158,0.0005450399,0.006187989,0.00009354282,0.00013548046,0.00041247768,0.001037881,0.82717156,0.02165131,0.075998306,0.066331804,0.000080329395],"about_ca_topic_score_codex":0.0044751517,"about_ca_topic_score_gemma":0.004954225,"teacher_disagreement_score":0.0044751517,"about_ca_system_score_codex":0.0011710554,"about_ca_system_score_gemma":0.001840538,"threshold_uncertainty_score":0.023655593},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008307512,0.0044594523,0.073685005,0.025278077,0.007384972,0.0006853613,0.0018711095,0.027623273,0.85070515],"genre_scores_gemma":[0.122379586,0.004692153,0.05679198,0.014851918,0.004025102,0.001007274,0.0034470034,0.0073699476,0.785435],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936885,0.00089273026,0.00027844982,0.001471027,0.0030682236,0.00060103816],"domain_scores_gemma":[0.98185915,0.0031495732,0.00094276574,0.007125629,0.004945938,0.0019768972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050314995,0.0006999012,0.00056701375,0.00262651,0.00491556,0.007828668,0.0033115805,0.0039756843,0.10295652],"category_scores_gemma":[0.019693987,0.00070954976,0.00079384254,0.0019111307,0.0031735317,0.01134724,0.007736343,0.0050508818,0.053455513],"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.0002590903,0.00014910022,0.0013671739,0.00047853836,0.000035720393,0.00066580676,0.001212015,0.0004530308,0.0037542267,0.18088026,0.5558308,0.25491428],"study_design_scores_gemma":[0.000022146452,0.00003358704,0.00024707225,0.000067797235,0.000009427856,0.0006804215,0.00010877905,0.0006117579,0.0008311917,0.010503251,0.9868657,0.000018821998],"about_ca_topic_score_codex":0.0025474885,"about_ca_topic_score_gemma":0.003684177,"teacher_disagreement_score":0.10295652,"about_ca_system_score_codex":0.0024988947,"about_ca_system_score_gemma":0.005065811,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010875435,0.00015367272,0.9854322,0.00015810359,0.000043485412,0.00017533098,0.000068284535,0.0012470044,0.0018465006],"genre_scores_gemma":[0.5102579,0.00025215631,0.48361722,0.00011137437,0.00013742082,0.00031321534,0.00038949822,0.00019545616,0.004725673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692565,0.0007715469,0.00020008121,0.00076472986,0.0010616311,0.00027625664],"domain_scores_gemma":[0.9963792,0.0016978243,0.00037103493,0.0006570911,0.0005584073,0.00033642066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034866552,0.0010507611,0.0018403296,0.0017449412,0.001456043,0.0031644667,0.0045681363,0.0017975818,0.0028505072],"category_scores_gemma":[0.0073712734,0.0008140097,0.00086898025,0.0019387114,0.0012277974,0.004437501,0.0026025863,0.0013288467,0.00072846893],"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.0008736187,0.00070344075,0.0020508615,0.0002499975,0.00024916374,0.00045214596,0.000589723,0.64050144,0.017462248,0.074611925,0.006666365,0.25558913],"study_design_scores_gemma":[0.000042841828,0.00004814242,0.00019291928,0.0000052248656,0.000031099953,0.00005115427,0.000058911683,0.9813949,0.0033686194,0.01202293,0.0027638248,0.000019611763],"about_ca_topic_score_codex":0.0061587184,"about_ca_topic_score_gemma":0.006383108,"teacher_disagreement_score":0.0061587184,"about_ca_system_score_codex":0.0014959673,"about_ca_system_score_gemma":0.0020689326,"threshold_uncertainty_score":0.018439353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08196729,0.00020194588,0.9137928,0.00031132848,0.000020578764,0.000067266476,0.0006241844,0.00051847793,0.0024961242],"genre_scores_gemma":[0.8558556,0.0002006116,0.14231104,0.00008002595,0.00003881726,0.00011221558,0.00048481245,0.00006492601,0.00085205096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998064,0.0009331985,0.00007271026,0.00027159828,0.00040349795,0.00025507848],"domain_scores_gemma":[0.9893993,0.007297546,0.0010498681,0.0012423077,0.0007518626,0.00025910453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002215272,0.00089334906,0.0011918298,0.00095554255,0.0006653763,0.001418655,0.001949109,0.0012185025,0.0009026694],"category_scores_gemma":[0.0158783,0.0007115595,0.00046994627,0.0023744497,0.0007324535,0.0033442113,0.0015505605,0.0014697383,0.00018259679],"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.00003692188,0.000018447416,0.00057674246,0.00002325088,0.000012343562,0.00007543839,0.000030106581,0.9844222,0.0004623859,0.009048592,0.00035922707,0.0049344054],"study_design_scores_gemma":[0.0000031862578,0.00000505419,0.000047745372,0.0000021453384,0.000003317598,0.00001115574,0.000005785971,0.993745,0.00028367073,0.005762488,0.00012749292,0.0000029591727],"about_ca_topic_score_codex":0.008912176,"about_ca_topic_score_gemma":0.010088681,"teacher_disagreement_score":0.008912176,"about_ca_system_score_codex":0.0016272671,"about_ca_system_score_gemma":0.0016303383,"threshold_uncertainty_score":0.01772058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94794416,0.00019020226,0.049347423,0.00011077261,0.0000114330505,0.0001111627,0.0007722751,0.00024920463,0.0012634613],"genre_scores_gemma":[0.9878654,0.00012080063,0.01101622,0.000011288022,0.000012277513,0.000052113464,0.00070118374,0.00001930237,0.00020150546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99942493,0.000120064404,0.000034611803,0.00014841055,0.00020246122,0.000069582835],"domain_scores_gemma":[0.9968606,0.0016752427,0.0004967399,0.00027990455,0.0005616206,0.00012586555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589054,0.0003770309,0.0004042115,0.0019458742,0.00049114216,0.000794015,0.00077444944,0.0006797182,0.0003080554],"category_scores_gemma":[0.00897286,0.00020413306,0.00019380139,0.0015059005,0.0005246416,0.0010320143,0.0005180099,0.0004970725,0.00011319432],"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.00022696386,0.0003829438,0.230396,0.00021433715,0.00015538893,0.000989689,0.0017269036,0.6364082,0.041043334,0.014118803,0.001729262,0.07260814],"study_design_scores_gemma":[0.000008576186,0.00004412788,0.03486384,0.000011681578,0.000012496127,0.00021469868,0.0003656584,0.95450413,0.00336442,0.0054827873,0.0011065404,0.000021025939],"about_ca_topic_score_codex":0.0065678884,"about_ca_topic_score_gemma":0.0033942647,"teacher_disagreement_score":0.0065678884,"about_ca_system_score_codex":0.0005743196,"about_ca_system_score_gemma":0.00046363703,"threshold_uncertainty_score":0.013059318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12621886,0.00041147086,0.85487175,0.00023041594,0.00014854711,0.00023381154,0.00007714023,0.013541754,0.0042662295],"genre_scores_gemma":[0.7710357,0.00019447952,0.22156852,0.00013186768,0.0001125368,0.0001168664,0.00017159566,0.00020202278,0.0064664767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961877,0.0000608193,0.000027331855,0.00008486112,0.00017148371,0.000036797977],"domain_scores_gemma":[0.9995648,0.00007527099,0.00003279252,0.00010373339,0.00012814862,0.0000952684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004870818,0.00039041476,0.0007277018,0.0005372405,0.0009529074,0.00088534626,0.001554683,0.00068344735,0.0019245021],"category_scores_gemma":[0.0010429169,0.00023410413,0.00019517216,0.00034693046,0.00033007655,0.0013579903,0.0014487609,0.0006728794,0.0005579027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012826881,0.00061364885,0.002586767,0.00023202715,0.00012293734,0.0013170926,0.00059129944,0.03761701,0.30604693,0.011659339,0.010824597,0.62710553],"study_design_scores_gemma":[0.00014323433,0.00055768056,0.0021411707,0.000020894571,0.0000976099,0.0011589247,0.00013607688,0.8813403,0.08671051,0.005734364,0.021850444,0.00010880338],"about_ca_topic_score_codex":0.0016848383,"about_ca_topic_score_gemma":0.0012235304,"teacher_disagreement_score":0.0019245021,"about_ca_system_score_codex":0.00045583336,"about_ca_system_score_gemma":0.0004398643,"threshold_uncertainty_score":0.006438136},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06461505,0.0064118137,0.44473317,0.041164037,0.0005693663,0.00044847562,0.00015414547,0.00040792755,0.441496],"genre_scores_gemma":[0.8070381,0.0042669633,0.13383219,0.0012607984,0.0006610722,0.00047845408,0.00008502399,0.00007422342,0.05230322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9976146,0.0012573746,0.00011662249,0.00020085805,0.0006620833,0.00014844083],"domain_scores_gemma":[0.9973571,0.0015078596,0.00024587457,0.00019003122,0.0003669615,0.00033223486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002728564,0.0003830547,0.00033869196,0.0045383843,0.004079072,0.009194671,0.001257019,0.002408621,0.00466753],"category_scores_gemma":[0.0030987791,0.00037737665,0.0005598064,0.0031046886,0.005901167,0.012288875,0.0035443339,0.0014279316,0.0006864272],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016564405,0.00009975743,0.00081268494,0.000101987534,0.000020504327,0.0003871592,0.0034060979,0.0032162857,0.00044931984,0.9449576,0.0030924464,0.043439522],"study_design_scores_gemma":[0.000027687607,0.000051546973,0.00090536714,0.00016382265,0.000032966193,0.00039428528,0.0072660795,0.03043913,0.00065304595,0.8296115,0.13041584,0.00003868972],"about_ca_topic_score_codex":0.005662448,"about_ca_topic_score_gemma":0.006962958,"teacher_disagreement_score":0.009194671,"about_ca_system_score_codex":0.003469314,"about_ca_system_score_gemma":0.0038040315,"threshold_uncertainty_score":0.025171757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011794184,0.00013638931,0.9854683,0.00026655057,0.000036760324,0.00010482973,0.000030411853,0.0013026957,0.00085982063],"genre_scores_gemma":[0.21504077,0.00030539802,0.7823527,0.00012777481,0.000046967056,0.00015952763,0.0001925278,0.00014707043,0.0016272422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801683,0.0007617877,0.00013927816,0.00020983975,0.00061513204,0.00025709858],"domain_scores_gemma":[0.9976393,0.00075915316,0.00021891901,0.0006874859,0.0004412053,0.00025391634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046168836,0.00055502955,0.0008180478,0.001000892,0.0012741515,0.0019265357,0.0018246709,0.0010979568,0.0008703542],"category_scores_gemma":[0.005709517,0.00037429397,0.00050916645,0.0012738779,0.0012721573,0.0036174722,0.003218044,0.00134528,0.00040635688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004977917,0.00026431048,0.0023388392,0.00038933652,0.00011005299,0.00040361617,0.0010943002,0.36572865,0.02644833,0.13679966,0.010363026,0.4555621],"study_design_scores_gemma":[0.000057100893,0.000114070004,0.00035040805,0.000027319813,0.000024097124,0.00021397616,0.00023869035,0.8931892,0.010480424,0.07616496,0.019112227,0.00002751524],"about_ca_topic_score_codex":0.0033866048,"about_ca_topic_score_gemma":0.0030192996,"teacher_disagreement_score":0.0046168836,"about_ca_system_score_codex":0.0011082329,"about_ca_system_score_gemma":0.0022887134,"threshold_uncertainty_score":0.024416745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008655525,0.00044661175,0.9867012,0.00033453314,0.0000750246,0.00011019145,0.00009122907,0.00071981794,0.0028657012],"genre_scores_gemma":[0.4523619,0.0009785086,0.53894407,0.0002958827,0.00020271067,0.00037626256,0.00053281046,0.0002447277,0.00606314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99085814,0.0030376154,0.00074358546,0.0013670943,0.0034726174,0.00052098674],"domain_scores_gemma":[0.988106,0.00656668,0.0008019435,0.0031195758,0.0011405108,0.00026532632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008958899,0.00060165697,0.0021259098,0.0016039335,0.0015333476,0.0042237886,0.0029883662,0.0025944381,0.003751004],"category_scores_gemma":[0.029365474,0.00095292914,0.0011276556,0.0035021703,0.0021880348,0.008653749,0.003698712,0.0018953129,0.0011310929],"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.00033729244,0.00015327067,0.0011390505,0.0002637804,0.00011970086,0.00034241783,0.0004299988,0.4269809,0.0024286804,0.4241622,0.003477004,0.1401656],"study_design_scores_gemma":[0.00004363599,0.00004999824,0.000115841576,0.000011254352,0.000031588304,0.00012316334,0.000053685057,0.6963709,0.0024484764,0.29405713,0.0066722296,0.000022153983],"about_ca_topic_score_codex":0.00390326,"about_ca_topic_score_gemma":0.0018501661,"teacher_disagreement_score":0.008958899,"about_ca_system_score_codex":0.0022807948,"about_ca_system_score_gemma":0.0022026498,"threshold_uncertainty_score":0.04737979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023325713,0.00020054505,0.96500665,0.00036631827,0.00008034921,0.000106124084,0.000045904977,0.00028749718,0.0105808955],"genre_scores_gemma":[0.80529886,0.00044094594,0.1726877,0.00023018294,0.00015918812,0.00038307632,0.00008902902,0.00010154002,0.020609558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991934,0.0001850386,0.00002285304,0.0001515065,0.00033760903,0.00010969438],"domain_scores_gemma":[0.99946874,0.00015315432,0.00006254717,0.00008272068,0.0001579938,0.00007480164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006269018,0.0005571693,0.00045571712,0.00051165203,0.0008869654,0.0017780259,0.0024667142,0.0011587224,0.003212617],"category_scores_gemma":[0.0013449327,0.00021839942,0.00030082307,0.00042226652,0.00096767436,0.0019142192,0.0011093714,0.00080653885,0.0007734402],"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.00009200751,0.00010186158,0.0003625655,0.000049068796,0.000020944884,0.0001470388,0.0002491634,0.7435749,0.007594089,0.22225195,0.0020811772,0.0234751],"study_design_scores_gemma":[0.00001092279,0.000029976822,0.000061487095,0.0000041242884,0.000005654695,0.000036651323,0.000028552111,0.97874177,0.00068821874,0.01709766,0.0032851559,0.000009807817],"about_ca_topic_score_codex":0.004725103,"about_ca_topic_score_gemma":0.004331722,"teacher_disagreement_score":0.004725103,"about_ca_system_score_codex":0.0014899855,"about_ca_system_score_gemma":0.0010581289,"threshold_uncertainty_score":0.010810614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4183091,0.0036938032,0.54322255,0.009096605,0.0002760914,0.00051682297,0.0019691428,0.0011318591,0.021784006],"genre_scores_gemma":[0.9086538,0.0022558516,0.08137456,0.00058983127,0.00033479484,0.0005563922,0.001149249,0.00031707715,0.004768445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957041,0.0017823018,0.0001962542,0.00067567534,0.0008543528,0.0007872713],"domain_scores_gemma":[0.9266304,0.06512058,0.003073048,0.0023191113,0.0013081296,0.0015486911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042174077,0.0014151643,0.0024467492,0.0015755781,0.0018772295,0.0036920954,0.0037087714,0.0029006107,0.004941194],"category_scores_gemma":[0.03486185,0.0010662738,0.00145395,0.0021069862,0.002995465,0.008931347,0.0036824762,0.0028314,0.0006168422],"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.0006626603,0.00015401225,0.0031151394,0.000305772,0.00015159659,0.00032993816,0.00034522495,0.8624751,0.0018342619,0.10672206,0.0062678177,0.01763647],"study_design_scores_gemma":[0.00006762311,0.000045713212,0.00037803824,0.000017823648,0.000034401324,0.0001076001,0.00007643325,0.9008505,0.00035356332,0.09734182,0.00070758234,0.000018907445],"about_ca_topic_score_codex":0.004783238,"about_ca_topic_score_gemma":0.0035304588,"teacher_disagreement_score":0.004941194,"about_ca_system_score_codex":0.004559718,"about_ca_system_score_gemma":0.0020572138,"threshold_uncertainty_score":0.0330832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038445123,0.0055546174,0.93356955,0.0073763146,0.00042488583,0.00016920581,0.000068238565,0.0006104898,0.013781632],"genre_scores_gemma":[0.6919895,0.014389009,0.28260314,0.0007741625,0.0013654607,0.0003093285,0.000118944066,0.00031668908,0.008133768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721766,0.0011229175,0.00020507912,0.00022669858,0.0010410894,0.00018649566],"domain_scores_gemma":[0.99313354,0.0042532478,0.00056679844,0.0010899538,0.0007611847,0.00019527115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003879406,0.00083895656,0.00082598964,0.0011168018,0.0016245169,0.0035204564,0.001558122,0.0015335302,0.0020360074],"category_scores_gemma":[0.013677418,0.0010885851,0.00064944004,0.0011597163,0.0034487038,0.014378369,0.0019771173,0.003021488,0.00069546106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011531804,0.000068635585,0.0019129505,0.00036488083,0.00006322946,0.00058665074,0.0019061614,0.13231939,0.00829553,0.7629288,0.002411184,0.089027256],"study_design_scores_gemma":[0.000035029072,0.00013444776,0.0007496306,0.00021827221,0.000102281294,0.00062752,0.0006933789,0.32392606,0.00889264,0.6110013,0.053490497,0.0001289836],"about_ca_topic_score_codex":0.0015835251,"about_ca_topic_score_gemma":0.0015176097,"teacher_disagreement_score":0.003879406,"about_ca_system_score_codex":0.0014881209,"about_ca_system_score_gemma":0.0010843632,"threshold_uncertainty_score":0.020516515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14400525,0.003681917,0.8249452,0.0062535694,0.00019344185,0.00014568194,0.00019601088,0.00023962815,0.020339344],"genre_scores_gemma":[0.9721314,0.0024444817,0.021225074,0.00027660024,0.00030548722,0.00013377146,0.00005226051,0.00006203805,0.003368932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990375,0.00034663366,0.00004694636,0.00015791855,0.00028890546,0.00012211312],"domain_scores_gemma":[0.99414635,0.004066517,0.0007528462,0.00023695028,0.000532695,0.00026459995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019287079,0.0007326085,0.0007811491,0.0008331461,0.00094374595,0.0018908206,0.0013939344,0.00192662,0.0016173181],"category_scores_gemma":[0.008145231,0.0006110674,0.00037496592,0.0006703796,0.002804148,0.0077485936,0.00169049,0.0015691477,0.00026633183],"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.000062684914,0.000076978205,0.001580646,0.0002935891,0.000028291435,0.0007744922,0.00118301,0.49591127,0.0058168103,0.48054743,0.0026686303,0.011056139],"study_design_scores_gemma":[0.0000081198295,0.000035979177,0.00052458997,0.000020843736,0.000008708714,0.00011234668,0.0003098764,0.8707624,0.00042334627,0.12580355,0.0019715445,0.00001874292],"about_ca_topic_score_codex":0.004033721,"about_ca_topic_score_gemma":0.0017060798,"teacher_disagreement_score":0.004033721,"about_ca_system_score_codex":0.001648271,"about_ca_system_score_gemma":0.000937282,"threshold_uncertainty_score":0.0119591355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18503006,0.00080818846,0.80631626,0.0005913456,0.00010833305,0.00022772567,0.00007556867,0.0014648162,0.0053776917],"genre_scores_gemma":[0.8844827,0.00034738836,0.113321535,0.00009198654,0.00009669238,0.00011955024,0.00009992075,0.00007006808,0.0013702955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929404,0.00020322159,0.000030303021,0.00010509648,0.00027493964,0.00009247141],"domain_scores_gemma":[0.99867636,0.0006140757,0.00011647659,0.00017985841,0.00027112782,0.00014222559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009508681,0.00061101036,0.0010011623,0.00047247324,0.0012098858,0.0012898983,0.002742728,0.0010184505,0.00082562957],"category_scores_gemma":[0.0028499556,0.0003611694,0.00026995284,0.0006209438,0.0005777651,0.0023764318,0.0014004289,0.00072525005,0.00030279148],"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.0004709691,0.00049494754,0.0020378304,0.00043386343,0.00012125966,0.0012455344,0.00047795504,0.7137346,0.06966805,0.0367432,0.0057294364,0.16884227],"study_design_scores_gemma":[0.000059715152,0.0001077644,0.00022034562,0.000005855811,0.000029383367,0.0001160157,0.000050869457,0.9825865,0.0061406847,0.0079546245,0.0027046893,0.000023717259],"about_ca_topic_score_codex":0.0032136554,"about_ca_topic_score_gemma":0.003529496,"teacher_disagreement_score":0.0032136554,"about_ca_system_score_codex":0.00064662535,"about_ca_system_score_gemma":0.00066604564,"threshold_uncertainty_score":0.0063898563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026865784,0.00017381778,0.967036,0.00024096815,0.000056949164,0.00033196618,0.00007892279,0.0021847477,0.0030308622],"genre_scores_gemma":[0.37681398,0.00019939388,0.6173508,0.0001066426,0.00004598142,0.00032543,0.00036342556,0.00021010979,0.0045842514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990133,0.00024210669,0.00006537844,0.00015762464,0.00040882535,0.00011274372],"domain_scores_gemma":[0.9986683,0.00036315442,0.00013020146,0.0004204145,0.0002547767,0.00016308026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012327262,0.00051903614,0.0007978851,0.0010681857,0.001882892,0.0012428032,0.0026982813,0.0011927465,0.0018886682],"category_scores_gemma":[0.004306874,0.0004300548,0.00048451504,0.00063368864,0.0008123879,0.0028420396,0.0034066995,0.0010041236,0.00075608114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006790233,0.0006696605,0.0049246936,0.00044566763,0.00015302144,0.0006348632,0.0022726872,0.22008495,0.05501482,0.12648433,0.014154815,0.57448155],"study_design_scores_gemma":[0.00010912215,0.00037458356,0.00072459027,0.000038077695,0.000060986767,0.00049380044,0.0003770057,0.9142279,0.027606564,0.03180335,0.024122508,0.00006155432],"about_ca_topic_score_codex":0.0023399377,"about_ca_topic_score_gemma":0.003321558,"teacher_disagreement_score":0.0026982813,"about_ca_system_score_codex":0.0008975676,"about_ca_system_score_gemma":0.0011630838,"threshold_uncertainty_score":0.006519377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081290485,0.00044625445,0.9921909,0.0005551857,0.0002100614,0.00025954636,0.00008810347,0.0015785933,0.0038583311],"genre_scores_gemma":[0.04395735,0.001410759,0.9412137,0.0004176303,0.0002385274,0.0010352357,0.0005508219,0.00028764433,0.010888265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644995,0.0012792875,0.0004175146,0.0006054812,0.0010131319,0.00023465182],"domain_scores_gemma":[0.99767345,0.00064379716,0.00018362378,0.00054690015,0.00037373006,0.00057856954],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006710582,0.00067349663,0.0009915546,0.001591895,0.0027211744,0.005553179,0.0037843913,0.002092445,0.0040334337],"category_scores_gemma":[0.0052689137,0.0006480187,0.0010173193,0.0018538719,0.0023899022,0.0068491763,0.0055234996,0.0022294724,0.002353487],"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.00015728753,0.00012246179,0.00053591485,0.00045564945,0.00006634736,0.0006911184,0.00060581625,0.02119261,0.0048987027,0.80150664,0.024045046,0.14572237],"study_design_scores_gemma":[0.0001137627,0.00014131505,0.00021843042,0.00018964935,0.000069659036,0.0009312714,0.00027569578,0.13558933,0.003927361,0.33466655,0.5237646,0.00011237815],"about_ca_topic_score_codex":0.0030355095,"about_ca_topic_score_gemma":0.003999264,"teacher_disagreement_score":0.9944468,"about_ca_system_score_codex":0.0020560776,"about_ca_system_score_gemma":0.0046991236,"threshold_uncertainty_score":0.03548944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01381518,0.000039221664,0.98145354,0.00017212151,0.00005059514,0.0002144323,0.00004200577,0.0023426425,0.0018703091],"genre_scores_gemma":[0.42680478,0.000079392674,0.5659818,0.000118235075,0.000049578255,0.0003566099,0.00016737479,0.0003874923,0.006054773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980603,0.00042086435,0.00018867382,0.00038844656,0.00069050945,0.00025118544],"domain_scores_gemma":[0.99584407,0.0017924667,0.00036029314,0.0009380867,0.00083809096,0.00022692821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018012715,0.0006713274,0.0008881163,0.0013553178,0.00176562,0.0016712538,0.0019129288,0.0013897425,0.0040474506],"category_scores_gemma":[0.010608784,0.0003393524,0.0011043213,0.0007261439,0.0013635708,0.0019135826,0.0023242137,0.002063047,0.0008575329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007484331,0.0004918902,0.0023340918,0.00036094524,0.00014311245,0.0012592892,0.0016872974,0.23104256,0.038906377,0.26408705,0.007799161,0.45113966],"study_design_scores_gemma":[0.00006612655,0.00017836946,0.00037556,0.00003305358,0.00004529632,0.00032333855,0.00019511093,0.88922536,0.022425473,0.07976768,0.0073104594,0.000054152657],"about_ca_topic_score_codex":0.0023128616,"about_ca_topic_score_gemma":0.0013664158,"teacher_disagreement_score":0.0040474506,"about_ca_system_score_codex":0.0011873387,"about_ca_system_score_gemma":0.0014328901,"threshold_uncertainty_score":0.013540089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940935,0.00030483695,0.00056009577,0.00012151831,0.0000065089826,0.00005692218,0.0023905623,0.00006302814,0.0024030276],"genre_scores_gemma":[0.9906042,0.0011986556,0.0011722653,0.0001472978,0.000021804513,0.000082143226,0.0047232667,0.000027877019,0.0020225334],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990152,0.0002598481,0.00017865453,0.00012269826,0.00032177387,0.000101849146],"domain_scores_gemma":[0.9934277,0.0022606316,0.0013810875,0.0002488613,0.0021952447,0.00048638688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041777,0.00022019427,0.0002672623,0.0036753123,0.00039924507,0.0006332853,0.00026360727,0.0004248923,0.0017718188],"category_scores_gemma":[0.005243946,0.00014408116,0.00021215908,0.0032071949,0.0001820353,0.0012990017,0.00030137596,0.00032355243,0.000888242],"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.00016048444,0.00029861054,0.90437365,0.00044190756,0.0000528587,0.0002560624,0.004908394,0.00029503196,0.0028540515,0.00029830256,0.0055544307,0.08050622],"study_design_scores_gemma":[0.000002705808,0.00030467947,0.98688823,0.000082008606,0.00001639756,0.00064501754,0.0058359485,0.0007913327,0.0004977811,0.00006835328,0.004847672,0.000019844836],"about_ca_topic_score_codex":0.004776299,"about_ca_topic_score_gemma":0.006526301,"teacher_disagreement_score":0.004776299,"about_ca_system_score_codex":0.0003580936,"about_ca_system_score_gemma":0.0003010873,"threshold_uncertainty_score":0.009496987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05489473,0.0013514345,0.9318774,0.0002386322,0.00020182927,0.00037438824,0.0002829526,0.0037484646,0.007030185],"genre_scores_gemma":[0.47214037,0.00103763,0.52091026,0.00015476788,0.00012699573,0.0005772588,0.0005337613,0.00017000973,0.0043488718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922836,0.00020319136,0.000080156504,0.000090500136,0.00032659265,0.00007114881],"domain_scores_gemma":[0.99848276,0.00044896314,0.0001516366,0.00064178783,0.00019484735,0.000080040496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011612595,0.00036684965,0.0004502398,0.0008340986,0.0009473528,0.0012466926,0.0013521545,0.0005885005,0.0019387373],"category_scores_gemma":[0.0025177212,0.00038248842,0.00029379522,0.001077108,0.0008667781,0.0017233521,0.0013513912,0.0007118301,0.00063686824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079902716,0.0002747751,0.0077420706,0.0016026858,0.00019834333,0.0005076575,0.001130909,0.04612584,0.13921091,0.3587214,0.014973011,0.4287133],"study_design_scores_gemma":[0.0002712089,0.0011300263,0.0050811023,0.00015888494,0.00018750186,0.0015378655,0.0007106002,0.5187148,0.1281122,0.16800366,0.1759231,0.00016909989],"about_ca_topic_score_codex":0.0006647842,"about_ca_topic_score_gemma":0.0015922209,"teacher_disagreement_score":0.0019387373,"about_ca_system_score_codex":0.00056241715,"about_ca_system_score_gemma":0.0009225963,"threshold_uncertainty_score":0.0064857006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038806214,0.00034903936,0.9928894,0.00015706605,0.00010740853,0.000091708745,0.00002807611,0.000987418,0.0015092801],"genre_scores_gemma":[0.2373325,0.00046865345,0.752677,0.00024818437,0.00021960234,0.00042215566,0.0001520536,0.00017503198,0.008304767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998021,0.000472091,0.00017987534,0.0004457272,0.00074886763,0.00013252567],"domain_scores_gemma":[0.9966407,0.0008308582,0.00025428174,0.0014919435,0.0005775183,0.00020475747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023497015,0.00042557798,0.0010458222,0.001020793,0.001436728,0.0018760819,0.003377463,0.0015262332,0.0039130873],"category_scores_gemma":[0.0040578013,0.00077956583,0.00054245733,0.00088581076,0.0013432481,0.00512334,0.004848595,0.0011912085,0.0018838268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052654295,0.00018830046,0.0013618376,0.0008545344,0.00021726683,0.00060626084,0.001135648,0.04591661,0.06397425,0.39151856,0.01122306,0.4824772],"study_design_scores_gemma":[0.00054822746,0.0010917907,0.0011806192,0.00019338589,0.00027985196,0.0029520704,0.0006243868,0.46646604,0.05761968,0.21759643,0.25103444,0.0004130348],"about_ca_topic_score_codex":0.0005491807,"about_ca_topic_score_gemma":0.0005111105,"teacher_disagreement_score":0.0039130873,"about_ca_system_score_codex":0.0006053529,"about_ca_system_score_gemma":0.0012513871,"threshold_uncertainty_score":0.013090551},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004778994,0.006943803,0.9643427,0.0023909342,0.00067358464,0.0001334257,0.00024679565,0.0011120711,0.019377643],"genre_scores_gemma":[0.2542326,0.012329354,0.71288615,0.00061780604,0.0007344616,0.0005887104,0.0011513673,0.00021153885,0.017248003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987709,0.00042956776,0.000079260724,0.00014153503,0.00051536533,0.00006327948],"domain_scores_gemma":[0.9994568,0.00024100288,0.000039185372,0.00011761886,0.000109493645,0.000035835892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013524146,0.0004381949,0.0007504459,0.00094139396,0.0009835239,0.001813867,0.001197648,0.0011254804,0.002987288],"category_scores_gemma":[0.0026313998,0.00021451006,0.0004464422,0.0018871382,0.00092163164,0.003720475,0.0016059796,0.0012419157,0.0009136639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010971631,0.000038201502,0.00031475554,0.00044873692,0.00006077246,0.00038748933,0.00018804657,0.0545415,0.0036095474,0.7683475,0.017962527,0.15399116],"study_design_scores_gemma":[0.000040217175,0.000049365004,0.00019251353,0.00009829788,0.000043137887,0.00043363366,0.00014833975,0.32282504,0.0032423984,0.44293493,0.22994149,0.000050643055],"about_ca_topic_score_codex":0.0023996308,"about_ca_topic_score_gemma":0.002579195,"teacher_disagreement_score":0.002987288,"about_ca_system_score_codex":0.0014460606,"about_ca_system_score_gemma":0.0011522658,"threshold_uncertainty_score":0.010491908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057015643,0.0005876832,0.9359697,0.0005274347,0.00018253479,0.00021026122,0.00007132455,0.0020638555,0.0033715316],"genre_scores_gemma":[0.8320765,0.00045510678,0.16289626,0.00020549003,0.00012805856,0.00021804486,0.00015098772,0.000089732064,0.0037798625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943453,0.00011224807,0.000040665305,0.00010500566,0.00026212176,0.000045400182],"domain_scores_gemma":[0.9990758,0.00019554832,0.00009254004,0.00021699088,0.00030140395,0.00011764266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000820776,0.00042948575,0.00052489096,0.00071231835,0.0014650653,0.0008136584,0.0019577006,0.0007775416,0.0009799527],"category_scores_gemma":[0.002233138,0.0002658777,0.00027091222,0.0008380233,0.0005941223,0.0012047637,0.0014367137,0.00063554035,0.00039178284],"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.00077299343,0.00038409568,0.0025396363,0.00047151084,0.00018325218,0.00063638063,0.0013382254,0.37890527,0.17668197,0.10329052,0.013853183,0.32094294],"study_design_scores_gemma":[0.00014200968,0.00022410293,0.0005830507,0.000016941563,0.000058844736,0.0002991753,0.00009572673,0.9497673,0.016564187,0.015981937,0.016193042,0.00007360231],"about_ca_topic_score_codex":0.0021258288,"about_ca_topic_score_gemma":0.002104909,"teacher_disagreement_score":0.0021258288,"about_ca_system_score_codex":0.0009545398,"about_ca_system_score_gemma":0.00094014494,"threshold_uncertainty_score":0.006925702},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20012814,0.023949178,0.24088272,0.112486705,0.0063927644,0.0010386951,0.0013813962,0.048737697,0.3650027],"genre_scores_gemma":[0.6451654,0.014058594,0.22822556,0.01132093,0.0031019659,0.00089088053,0.0023210184,0.013379631,0.08153605],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.97620696,0.0069708293,0.0010216661,0.0015207733,0.012811851,0.0014678944],"domain_scores_gemma":[0.8763043,0.059011694,0.004144078,0.038743693,0.017208215,0.004587999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01667499,0.0013467611,0.0010508057,0.0023826396,0.0032190506,0.0084055625,0.0046478556,0.0032517323,0.016444713],"category_scores_gemma":[0.087138765,0.0014628815,0.0018084206,0.003936381,0.0025867561,0.015624467,0.004853786,0.007030902,0.012204401],"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.0017765125,0.000534525,0.0086818645,0.0019006622,0.0003975137,0.0014823895,0.0029311813,0.017409932,0.026479807,0.14556202,0.11922933,0.6736143],"study_design_scores_gemma":[0.00045864625,0.001223773,0.02471981,0.0018119011,0.0009086134,0.007723158,0.0037793454,0.06614746,0.020957788,0.13950151,0.73218155,0.00058642676],"about_ca_topic_score_codex":0.005191235,"about_ca_topic_score_gemma":0.0033317872,"teacher_disagreement_score":0.01667499,"about_ca_system_score_codex":0.002668784,"about_ca_system_score_gemma":0.0046917545,"threshold_uncertainty_score":0.08818686},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103945404,0.0022611788,0.7123433,0.0104797175,0.000976256,0.00013131904,0.0002194052,0.00091411604,0.16872923],"genre_scores_gemma":[0.9268285,0.0014798837,0.0431656,0.00042906203,0.00026080053,0.00007374325,0.00010277268,0.00007585662,0.027583703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995413,0.0001077752,0.000014235847,0.00010140633,0.00014483125,0.00009065383],"domain_scores_gemma":[0.9988802,0.00038023014,0.000107467116,0.0002158577,0.0002449485,0.00017127693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008313773,0.00031005254,0.00044538968,0.00034583628,0.0006590205,0.0023168714,0.0011424839,0.0015598298,0.004110884],"category_scores_gemma":[0.0046132053,0.00036105563,0.00020215796,0.00041414396,0.0020368584,0.0055885096,0.0010589482,0.0009962688,0.0011264441],"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.00007275444,0.000031545016,0.00028979414,0.00008757292,0.000014402034,0.0001281318,0.00025280128,0.02392518,0.0019386655,0.9456628,0.007552898,0.020043407],"study_design_scores_gemma":[0.000029016615,0.00004082274,0.00018442317,0.000032018004,0.000011131754,0.00019700668,0.00024177135,0.16205736,0.0012492437,0.8191679,0.016774636,0.00001468918],"about_ca_topic_score_codex":0.0007512204,"about_ca_topic_score_gemma":0.000732518,"teacher_disagreement_score":0.004110884,"about_ca_system_score_codex":0.00090346404,"about_ca_system_score_gemma":0.00082988496,"threshold_uncertainty_score":0.013752222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13957414,0.00019035759,0.8503988,0.00030527948,0.000094748924,0.00024354305,0.000048200443,0.0013885668,0.007756401],"genre_scores_gemma":[0.7481798,0.000106548716,0.24896525,0.000060719813,0.000047870937,0.00023487228,0.000116634925,0.00010768804,0.0021806643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977804,0.0009142164,0.00009372615,0.0003061958,0.0005993988,0.00030608426],"domain_scores_gemma":[0.9941659,0.0027147208,0.00034398757,0.0013685556,0.0005029553,0.00090377795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031053128,0.00067417446,0.0007150437,0.00033207895,0.0014142711,0.0022947842,0.0026796141,0.0010004219,0.0024258937],"category_scores_gemma":[0.0074231005,0.0003562382,0.00037282836,0.00029016583,0.0012852057,0.004023403,0.0056318087,0.0010183889,0.00051096483],"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.0011415193,0.0010097217,0.009321141,0.0007479483,0.00021893605,0.0031522354,0.005410034,0.37953594,0.09301087,0.25208822,0.0069705183,0.24739292],"study_design_scores_gemma":[0.00025060002,0.0006354026,0.0016718676,0.00007313345,0.00006524455,0.0009401942,0.0015725722,0.80240476,0.022814928,0.115218334,0.054245595,0.0001073693],"about_ca_topic_score_codex":0.0013739818,"about_ca_topic_score_gemma":0.0014397447,"teacher_disagreement_score":0.0031053128,"about_ca_system_score_codex":0.00043552887,"about_ca_system_score_gemma":0.00079473795,"threshold_uncertainty_score":0.01642263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030360643,0.0006845975,0.9540386,0.00052004645,0.00013503562,0.0002656458,0.00015252936,0.003008131,0.010834664],"genre_scores_gemma":[0.32103443,0.00075941696,0.6685175,0.00016236244,0.000101691156,0.00031409622,0.0005592257,0.00012198181,0.008429296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996785,0.000059187983,0.000018251492,0.00007136615,0.00014738107,0.000025264666],"domain_scores_gemma":[0.9995901,0.000044715594,0.000027882224,0.00012677319,0.00017181272,0.000038687864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038773162,0.0003811264,0.0003001235,0.000524971,0.00093360775,0.00071824196,0.0011882631,0.0006018356,0.0017003331],"category_scores_gemma":[0.0008214583,0.0002591012,0.00022654429,0.0009127202,0.00037965446,0.0012936594,0.0007133523,0.0006217699,0.0007823957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000321933,0.00024517076,0.0015966635,0.00056722434,0.00017650402,0.00055896747,0.00040137794,0.2505285,0.13163519,0.19044131,0.028706843,0.39482018],"study_design_scores_gemma":[0.00008668111,0.0003962407,0.0009861185,0.000031024636,0.00009533158,0.0005896558,0.00014227549,0.8313448,0.03758753,0.04729852,0.08137152,0.0000704046],"about_ca_topic_score_codex":0.0024291582,"about_ca_topic_score_gemma":0.004101008,"teacher_disagreement_score":0.0024291582,"about_ca_system_score_codex":0.0006177951,"about_ca_system_score_gemma":0.0010302514,"threshold_uncertainty_score":0.0056881905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11188999,0.000287755,0.8767451,0.00062346895,0.00004938623,0.00028569653,0.00025099827,0.0008334698,0.009033991],"genre_scores_gemma":[0.89968395,0.0002531956,0.09697115,0.00004901582,0.000040340048,0.00023812878,0.00019509657,0.00019894014,0.00237029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947292,0.0017493253,0.00027066088,0.0006221588,0.0017882027,0.0008404729],"domain_scores_gemma":[0.9897703,0.0070098853,0.0010410583,0.0011145347,0.00084134546,0.00022293054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042936984,0.0010295621,0.0010218055,0.0011362329,0.00078742125,0.002392167,0.0022859636,0.0011734655,0.0028688032],"category_scores_gemma":[0.01834709,0.00076347013,0.00081252726,0.0014042826,0.0012880818,0.0032927056,0.0011388112,0.0014549368,0.00039203805],"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.00011324668,0.00008194613,0.00071706885,0.000057166275,0.00002329534,0.000046507157,0.00007407629,0.94503653,0.0021376866,0.042119186,0.000540255,0.009053092],"study_design_scores_gemma":[0.000009823629,0.000023311912,0.00010859108,0.0000025020515,0.0000108777385,0.00001145863,0.000014995038,0.98547137,0.0013366279,0.012630757,0.0003749373,0.0000046355676],"about_ca_topic_score_codex":0.00509812,"about_ca_topic_score_gemma":0.0031248915,"teacher_disagreement_score":0.00509812,"about_ca_system_score_codex":0.0039526806,"about_ca_system_score_gemma":0.002538327,"threshold_uncertainty_score":0.028678834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012246209,0.0007303857,0.9806489,0.0001827385,0.000107879176,0.000116812844,0.00006675196,0.0022449028,0.0036554392],"genre_scores_gemma":[0.37392476,0.0013692535,0.61150587,0.00032585268,0.00049699587,0.00024336213,0.0005324071,0.000319909,0.011281603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988495,0.00020091403,0.00005612856,0.00014736857,0.0006909035,0.00005524214],"domain_scores_gemma":[0.9985916,0.00058877555,0.00009636295,0.00040995848,0.00024813905,0.00006526688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000738934,0.00029244542,0.00052165246,0.0011918753,0.0005379728,0.00067355344,0.00091059646,0.0006296932,0.0029201203],"category_scores_gemma":[0.0030213413,0.00023270657,0.00041447414,0.0014156839,0.00033467752,0.0014497394,0.0011224187,0.00083503104,0.0009489115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002715376,0.00012369784,0.00083879824,0.0003549118,0.00008335253,0.0003522881,0.00050427124,0.0090200165,0.1768277,0.026806036,0.0062812446,0.77853614],"study_design_scores_gemma":[0.0002811048,0.00094128324,0.0035687326,0.00009976019,0.0003179483,0.003324124,0.0002740462,0.49299195,0.30072385,0.018584678,0.17875578,0.0001367956],"about_ca_topic_score_codex":0.00096081465,"about_ca_topic_score_gemma":0.00076188974,"teacher_disagreement_score":0.0029201203,"about_ca_system_score_codex":0.00036406872,"about_ca_system_score_gemma":0.0004711261,"threshold_uncertainty_score":0.009768784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036341503,0.0013326477,0.9567488,0.00023373765,0.00016924611,0.00011935544,0.000034764475,0.0008558346,0.004164123],"genre_scores_gemma":[0.7459672,0.0013450291,0.2465419,0.0001703882,0.00027291678,0.00019315138,0.00016124878,0.00013338056,0.0052147964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994203,0.00013618438,0.000029639767,0.00014746826,0.00022093715,0.000045557015],"domain_scores_gemma":[0.9994541,0.000215081,0.00003907968,0.00014187505,0.000106270025,0.000043578206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826347,0.00040935687,0.00065610267,0.00038122883,0.00048780645,0.0008509451,0.0010613904,0.0007411802,0.0009143109],"category_scores_gemma":[0.0018751812,0.00019400938,0.00032525128,0.00052038435,0.00048072162,0.0012916711,0.000868141,0.00075985154,0.0003102787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006410616,0.00021992844,0.0023291972,0.00038015595,0.00020739576,0.0015560365,0.00051814364,0.22965367,0.16747314,0.06564793,0.006055068,0.5253182],"study_design_scores_gemma":[0.000063741114,0.0001640401,0.0011896258,0.000020574971,0.000057325637,0.00047689435,0.00011326461,0.93500596,0.024413116,0.025769368,0.012684865,0.000041122148],"about_ca_topic_score_codex":0.00095167477,"about_ca_topic_score_gemma":0.0006682258,"teacher_disagreement_score":0.0010613904,"about_ca_system_score_codex":0.0004512405,"about_ca_system_score_gemma":0.0003158025,"threshold_uncertainty_score":0.004370153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054272316,0.00048055858,0.9343459,0.0007410477,0.0002574284,0.00074197666,0.00018815354,0.0047814418,0.0041912743],"genre_scores_gemma":[0.6641787,0.00030364888,0.32884678,0.00027965964,0.00041152904,0.0005286244,0.00041644412,0.0001870746,0.0048474134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748755,0.0005670605,0.00029807258,0.00042276108,0.0010094235,0.00021514045],"domain_scores_gemma":[0.9954249,0.0008950795,0.00032305846,0.0020468303,0.0008560929,0.00045410718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003239997,0.00076747884,0.0014146712,0.0016286179,0.0030522037,0.00247397,0.0039119166,0.0015721396,0.0016868887],"category_scores_gemma":[0.007195927,0.0006264425,0.0004499618,0.0022045244,0.0013722569,0.004424694,0.0041975933,0.0014100429,0.0010665582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013699621,0.00065395393,0.004325871,0.00046170948,0.00023326754,0.0009154551,0.0017479965,0.13071634,0.11812604,0.08432508,0.022249723,0.6348746],"study_design_scores_gemma":[0.0005202537,0.0004943851,0.0014886252,0.000031119518,0.00013953984,0.0009138012,0.0002950736,0.89991695,0.031785455,0.031957824,0.0323056,0.00015151328],"about_ca_topic_score_codex":0.0015216903,"about_ca_topic_score_gemma":0.0014034583,"teacher_disagreement_score":0.0039119166,"about_ca_system_score_codex":0.0012670368,"about_ca_system_score_gemma":0.001216789,"threshold_uncertainty_score":0.017134964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020705994,0.00030171784,0.9681873,0.00022767059,0.00014154208,0.00047946363,0.00018761531,0.0026445678,0.007124128],"genre_scores_gemma":[0.666189,0.00065062416,0.32344094,0.00023942682,0.00020124148,0.0006121411,0.0007996642,0.00013843991,0.0077285054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986135,0.0001920964,0.00009723781,0.0002492823,0.0007510299,0.00009687702],"domain_scores_gemma":[0.99772877,0.00046750178,0.00018648077,0.0005478639,0.0009406664,0.00012870849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010013584,0.0004555753,0.000554791,0.0004668839,0.00056473236,0.0019884033,0.0017097417,0.00089360535,0.0026502197],"category_scores_gemma":[0.002953819,0.00015980203,0.00026074072,0.0004820668,0.00073609286,0.001196738,0.0010017916,0.0007957451,0.00096466613],"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.00068375753,0.0004421394,0.0021919063,0.00055686245,0.00014575693,0.0007497328,0.00053142925,0.3500286,0.11294242,0.16958337,0.019299062,0.342845],"study_design_scores_gemma":[0.00011809588,0.00024579893,0.00041982697,0.00002586411,0.00004065978,0.00017978849,0.00008424999,0.90451646,0.034032837,0.027569193,0.03272862,0.000038652837],"about_ca_topic_score_codex":0.0020098705,"about_ca_topic_score_gemma":0.0010233066,"teacher_disagreement_score":0.0026502197,"about_ca_system_score_codex":0.0005737454,"about_ca_system_score_gemma":0.0016087904,"threshold_uncertainty_score":0.008865893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018621575,0.0012223829,0.9422017,0.00071847235,0.0005046948,0.0012544596,0.00019495649,0.005322081,0.029959667],"genre_scores_gemma":[0.27786818,0.0014723454,0.6984257,0.0006485305,0.00042127242,0.0013491134,0.00067454355,0.00055698026,0.018583313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981194,0.000724074,0.00013014801,0.00026048312,0.0006026,0.00016333778],"domain_scores_gemma":[0.99863094,0.00034484183,0.000073207986,0.0003523329,0.00022526307,0.00037334772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012454581,0.0006764276,0.0008118694,0.0005480387,0.0018186624,0.0033284428,0.003233943,0.002191566,0.008654334],"category_scores_gemma":[0.0031069873,0.0003952152,0.0007170489,0.00076260266,0.0010588458,0.00377164,0.00499915,0.0016071483,0.0032929983],"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.0012903634,0.0017258262,0.0023775746,0.0018271756,0.00028603428,0.0030099088,0.0048284773,0.054371435,0.063060254,0.17866223,0.07640479,0.612156],"study_design_scores_gemma":[0.00053155265,0.0014051907,0.0019761135,0.0002886275,0.00019109888,0.0025631809,0.0014798846,0.2972393,0.012122828,0.108344406,0.5734537,0.0004041688],"about_ca_topic_score_codex":0.0012329614,"about_ca_topic_score_gemma":0.0013573315,"teacher_disagreement_score":0.008654334,"about_ca_system_score_codex":0.00035409137,"about_ca_system_score_gemma":0.0013129658,"threshold_uncertainty_score":0.028951585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12682468,0.0048320927,0.83792365,0.0018150848,0.00014526426,0.00014689055,0.00014666111,0.0004302872,0.027735459],"genre_scores_gemma":[0.9121713,0.0028311207,0.07817583,0.00035824557,0.00017571042,0.000245921,0.000106977925,0.0002303746,0.005704436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980933,0.00057271,0.000058273134,0.00024546284,0.000570595,0.00045952623],"domain_scores_gemma":[0.98090243,0.015667643,0.0008676537,0.0009463363,0.0011119271,0.00050404336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003944352,0.0012020154,0.0012935621,0.0012399111,0.0012400475,0.002213039,0.0024584678,0.0014314369,0.0041946783],"category_scores_gemma":[0.025457243,0.00065391057,0.00068908895,0.0012472972,0.0025227568,0.0052294643,0.002308638,0.0031888674,0.0005812977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008216972,0.00029517701,0.00074220274,0.00058229,0.00008779878,0.0001930573,0.00065806997,0.33989954,0.015893467,0.5734203,0.0042643584,0.0631421],"study_design_scores_gemma":[0.00007184361,0.00023838338,0.00028837982,0.00009717956,0.000040873187,0.00020060783,0.00016856084,0.84231067,0.005549876,0.1469162,0.004076725,0.00004070014],"about_ca_topic_score_codex":0.0018917314,"about_ca_topic_score_gemma":0.0010535095,"teacher_disagreement_score":0.0041946783,"about_ca_system_score_codex":0.0041733207,"about_ca_system_score_gemma":0.001266889,"threshold_uncertainty_score":0.030279696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0590824,0.00041154545,0.923048,0.00019248576,0.0001296625,0.00029888275,0.000081122926,0.0031630856,0.013592766],"genre_scores_gemma":[0.5858651,0.00042687444,0.40524912,0.00011279722,0.000067603534,0.00017369469,0.00039243847,0.00026119084,0.0074512763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987562,0.00026670322,0.000096550946,0.00023802086,0.00048618348,0.00015637832],"domain_scores_gemma":[0.99903476,0.00017213915,0.000084475105,0.000392027,0.00020882838,0.000107907515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009134145,0.00044755512,0.0005566425,0.0007277223,0.00091852085,0.0008456309,0.0010683496,0.00052124064,0.0016360912],"category_scores_gemma":[0.0023210812,0.00023355834,0.00048609878,0.0007007782,0.0005656508,0.0014768752,0.0016087199,0.0006232867,0.0006410225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003595968,0.00025319113,0.0042193374,0.000354632,0.00014000623,0.0011982662,0.0009613512,0.19591945,0.1300831,0.081647255,0.0058301697,0.5790336],"study_design_scores_gemma":[0.000029801524,0.00018128235,0.0013269902,0.000035229994,0.0000717913,0.0009769052,0.00041815176,0.8410819,0.061806988,0.03140071,0.06261674,0.00005349995],"about_ca_topic_score_codex":0.0024827467,"about_ca_topic_score_gemma":0.0032649592,"teacher_disagreement_score":0.0024827467,"about_ca_system_score_codex":0.0007038105,"about_ca_system_score_gemma":0.00095484767,"threshold_uncertainty_score":0.005473256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016171178,0.00020898457,0.98252237,0.000090680245,0.00001685649,0.00003328808,0.000020587635,0.00015515447,0.00078086805],"genre_scores_gemma":[0.39212796,0.0004821822,0.6052378,0.00008201792,0.00007653746,0.00012427817,0.00018337439,0.00013316987,0.0015526706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988795,0.00038245594,0.000058815014,0.00013476508,0.00044791648,0.000096461445],"domain_scores_gemma":[0.9976059,0.0015525325,0.00018021994,0.00025970783,0.00033114813,0.00007044664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712366,0.00032094907,0.00058308727,0.00064016716,0.00077621685,0.0007448306,0.001347805,0.0009188324,0.00088165444],"category_scores_gemma":[0.0057433234,0.00025307093,0.0004165326,0.00070027256,0.00059758476,0.0021327243,0.0012594105,0.00090992905,0.00019421798],"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.0002849297,0.00013016096,0.0017762152,0.0002749225,0.00005872591,0.00032508324,0.0004898124,0.56467444,0.0316144,0.11781351,0.0034581642,0.2790997],"study_design_scores_gemma":[0.000011412628,0.000039118622,0.00013972612,0.000009966067,0.000009308667,0.00008805175,0.00004084669,0.9681299,0.004865435,0.023938807,0.0027176754,0.000009790593],"about_ca_topic_score_codex":0.00075049914,"about_ca_topic_score_gemma":0.0007749744,"teacher_disagreement_score":0.001712366,"about_ca_system_score_codex":0.00075347524,"about_ca_system_score_gemma":0.0005211428,"threshold_uncertainty_score":0.009055972},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019756479,0.029187854,0.01007529,0.14772314,0.40486243,0.0007809041,0.00648183,0.002070001,0.39684287],"genre_scores_gemma":[0.011943849,0.024977503,0.005610061,0.04567576,0.09859406,0.00042506238,0.0058558863,0.00052065006,0.8063972],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850756,0.0001809759,0.00008816714,0.000315998,0.0006669609,0.00024035989],"domain_scores_gemma":[0.9947449,0.000515726,0.00020000903,0.00041206533,0.0021067152,0.0020205688],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018038282,0.0009101484,0.0007268639,0.0013514548,0.0018333757,0.004294938,0.0025640738,0.0051064105,0.33619368],"category_scores_gemma":[0.0069357543,0.00037104587,0.00081057847,0.0011929747,0.00060256314,0.0033176518,0.002180686,0.0035785271,0.23810223],"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.00008253109,0.000055567238,0.00021719527,0.0002250791,0.0000070677283,0.00017965861,0.000024001567,0.00006723701,0.0005780341,0.0044645146,0.9226805,0.07141862],"study_design_scores_gemma":[0.000014948306,0.000038390917,0.00018539751,0.00007805069,0.000007647906,0.00021498122,0.000036731664,0.000050678915,0.0003588035,0.0017422241,0.9972646,0.0000076012534],"about_ca_topic_score_codex":0.0012987921,"about_ca_topic_score_gemma":0.0023677836,"teacher_disagreement_score":0.6638063,"about_ca_system_score_codex":0.001491077,"about_ca_system_score_gemma":0.0030305479,"threshold_uncertainty_score":0.94683915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018657863,0.0021627375,0.9507329,0.0025439542,0.0009177199,0.0009927433,0.00032644137,0.0020037438,0.0384541],"genre_scores_gemma":[0.11369153,0.0069988575,0.8121497,0.001288139,0.0013678088,0.0021236718,0.0009248536,0.000496697,0.060958713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951363,0.00118115,0.00040394094,0.0007078663,0.0023674658,0.00020326074],"domain_scores_gemma":[0.99759775,0.00081478327,0.00022363747,0.0005457735,0.0006178286,0.0002001844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027702725,0.0009098216,0.0011044577,0.0014106547,0.0025995877,0.00476568,0.0046111387,0.0030356508,0.010913229],"category_scores_gemma":[0.006259284,0.0006340723,0.00090390444,0.00281574,0.001676837,0.006433748,0.0019723724,0.0028714412,0.008159231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009136516,0.00016417881,0.00035197625,0.00089487195,0.0000876068,0.0011394322,0.00063987536,0.028027488,0.0060171154,0.80325097,0.037515644,0.12181944],"study_design_scores_gemma":[0.00011570006,0.00032628304,0.00020551487,0.00016321319,0.00010441441,0.0020287265,0.00023465039,0.1573296,0.004032012,0.29352483,0.5418003,0.00013471261],"about_ca_topic_score_codex":0.002606378,"about_ca_topic_score_gemma":0.0028866397,"teacher_disagreement_score":0.010913229,"about_ca_system_score_codex":0.0017816246,"about_ca_system_score_gemma":0.0027713042,"threshold_uncertainty_score":0.03650838},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053971607,0.0013466977,0.93603677,0.00043222183,0.00023056922,0.00025336357,0.00023645561,0.00095205865,0.00654025],"genre_scores_gemma":[0.67041147,0.0007865931,0.31843847,0.00015330232,0.00016925558,0.0003269679,0.00044511267,0.00013575745,0.009133111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985133,0.00047112672,0.00011874804,0.00018281133,0.00053713843,0.00017676625],"domain_scores_gemma":[0.9954331,0.0029016044,0.00021843301,0.0007324042,0.0005505574,0.00016380203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019426543,0.0004466512,0.0016756711,0.00071260356,0.0016080077,0.0014166307,0.0020466433,0.001104897,0.003555204],"category_scores_gemma":[0.0070326333,0.0006103893,0.0003317818,0.0013534153,0.00083157455,0.0028621748,0.00231648,0.0009331133,0.00081171154],"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.0010661699,0.00035045017,0.0012189926,0.0006801177,0.000094653944,0.00027004106,0.00087270053,0.4200124,0.029667167,0.20141731,0.014102806,0.3302471],"study_design_scores_gemma":[0.00010344158,0.0001579474,0.00020902372,0.000029667786,0.000024798626,0.00010501566,0.00011589606,0.9047713,0.005163987,0.08486375,0.004426436,0.000028746343],"about_ca_topic_score_codex":0.0016955611,"about_ca_topic_score_gemma":0.0021689567,"teacher_disagreement_score":0.003555204,"about_ca_system_score_codex":0.0008473373,"about_ca_system_score_gemma":0.0011020094,"threshold_uncertainty_score":0.011893332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02995087,0.00021415493,0.9650079,0.00016728166,0.000044071017,0.00010834446,0.00005871164,0.0013424619,0.0031062663],"genre_scores_gemma":[0.51114047,0.00040458,0.48491582,0.0000550016,0.00005646531,0.00013183383,0.00019903769,0.00009694949,0.0029998086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943393,0.0001376022,0.000041550105,0.00010137233,0.00024419723,0.000041213985],"domain_scores_gemma":[0.9993693,0.00012231791,0.00008258004,0.00022421972,0.0001488692,0.000052626103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004924778,0.00027302292,0.00045898557,0.00065849064,0.0007333607,0.0008363788,0.0010153411,0.00048508,0.00075540127],"category_scores_gemma":[0.0014971422,0.00021511159,0.00030656558,0.0006693352,0.0005582314,0.0016884917,0.0014221938,0.0004573497,0.0003442217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024391469,0.00020752757,0.0032535426,0.0005161574,0.0001265546,0.0012631237,0.0010159096,0.2509711,0.23244195,0.13013186,0.0070129554,0.3728153],"study_design_scores_gemma":[0.000052886033,0.00040245798,0.0016787292,0.000037623002,0.00013611231,0.0020238017,0.00032775584,0.82390356,0.064962626,0.023696693,0.08267219,0.00010559856],"about_ca_topic_score_codex":0.0014287246,"about_ca_topic_score_gemma":0.0017584934,"teacher_disagreement_score":0.0014287246,"about_ca_system_score_codex":0.00055163336,"about_ca_system_score_gemma":0.00059507805,"threshold_uncertainty_score":0.0040023327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34768927,0.00087866775,0.6011851,0.0026735007,0.00046272145,0.0003960143,0.000272837,0.006263019,0.040178865],"genre_scores_gemma":[0.89209294,0.00030792714,0.10185169,0.00016738805,0.000057365844,0.0001529928,0.00024894523,0.0001366606,0.004984098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993468,0.00025869563,0.000028560471,0.00007578732,0.00017936985,0.0001107283],"domain_scores_gemma":[0.9991905,0.0001865532,0.000046105015,0.00027604186,0.0001578548,0.00014298361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007414455,0.0003006797,0.00036311639,0.0003603938,0.0011390327,0.0011909129,0.0012556931,0.00047208628,0.002166796],"category_scores_gemma":[0.001972118,0.00022204916,0.00032543522,0.0005934397,0.00080956414,0.0019985817,0.0016161428,0.0007360623,0.000589069],"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.0014232007,0.00043902366,0.008476095,0.0003081218,0.00011906294,0.0026056445,0.0009626139,0.4263205,0.02687627,0.3282217,0.045742776,0.15850495],"study_design_scores_gemma":[0.0001566816,0.00011827094,0.0011918446,0.00001876753,0.00002351539,0.00021818698,0.0001732712,0.88896275,0.008529549,0.069873415,0.03070142,0.00003245771],"about_ca_topic_score_codex":0.005291479,"about_ca_topic_score_gemma":0.0037507513,"teacher_disagreement_score":0.005291479,"about_ca_system_score_codex":0.00082900055,"about_ca_system_score_gemma":0.0010351682,"threshold_uncertainty_score":0.010521412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.256863,0.0014480982,0.73429394,0.00042309804,0.00007933395,0.0002764764,0.00015829602,0.0009575836,0.005500181],"genre_scores_gemma":[0.74893945,0.0007840128,0.24785729,0.00007763407,0.00006205794,0.00029825812,0.00025994872,0.000117677584,0.0016036745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862087,0.0004824731,0.00009151203,0.00016620084,0.0005072935,0.00013165186],"domain_scores_gemma":[0.9855542,0.011308974,0.0009412409,0.0006276672,0.0013519505,0.00021595712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002534694,0.0007377245,0.0011264221,0.0014189989,0.0008403094,0.0009349768,0.0011534909,0.0010403229,0.0011218992],"category_scores_gemma":[0.019626247,0.00028688824,0.00031868514,0.0017122714,0.00086407905,0.0031224075,0.0007849094,0.000538675,0.00031425155],"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.00021441595,0.00012774993,0.0019066541,0.0002127356,0.00007054066,0.00009564013,0.00013950383,0.92572165,0.0033531424,0.021351986,0.0016080983,0.04519793],"study_design_scores_gemma":[0.000038858412,0.000079311234,0.00024838132,0.000006482093,0.000012266432,0.00005815691,0.00004148201,0.9875425,0.0013919933,0.010107216,0.0004651954,0.000008083344],"about_ca_topic_score_codex":0.0017287666,"about_ca_topic_score_gemma":0.0013495525,"teacher_disagreement_score":0.002534694,"about_ca_system_score_codex":0.0007664381,"about_ca_system_score_gemma":0.0009958997,"threshold_uncertainty_score":0.013404846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190145,0.00064756605,0.07622242,0.0001635847,0.000072663344,0.000055031767,0.00031632738,0.0013792599,0.002128652],"genre_scores_gemma":[0.99151057,0.000077397766,0.00795688,0.000011565952,0.000007957848,0.0000084663525,0.00024498798,0.000026478492,0.00015583109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986393,0.00024607987,0.000099563214,0.00031092938,0.0005644418,0.00013978059],"domain_scores_gemma":[0.99351126,0.0027928445,0.0006236965,0.0011726528,0.0016673387,0.00023223874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012250801,0.00045905026,0.00046705702,0.0014168122,0.0005096863,0.0010963901,0.0008295189,0.0006129158,0.00034365954],"category_scores_gemma":[0.011009224,0.00026536867,0.00023485172,0.0012906595,0.00037888522,0.0016456518,0.0008073955,0.00063974026,0.00020717648],"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.0008904203,0.0003540539,0.18375821,0.000662273,0.00033015,0.0014523859,0.002100317,0.3799408,0.07991724,0.0039835544,0.004854398,0.34175625],"study_design_scores_gemma":[0.00001262731,0.00018740741,0.04435317,0.000020626861,0.00004324229,0.00032537655,0.0005445691,0.92816687,0.023628008,0.0012231102,0.0014548597,0.000040075272],"about_ca_topic_score_codex":0.0068079676,"about_ca_topic_score_gemma":0.004045216,"teacher_disagreement_score":0.0068079676,"about_ca_system_score_codex":0.00066903955,"about_ca_system_score_gemma":0.00043185084,"threshold_uncertainty_score":0.013536632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009630695,0.0005234208,0.98183227,0.0006548647,0.00019407619,0.00026376243,0.00019687804,0.003939952,0.002764106],"genre_scores_gemma":[0.20535602,0.001179428,0.78481746,0.00036872434,0.00050514244,0.00032156648,0.0011095254,0.0003468719,0.005995301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791807,0.00046927156,0.00017911955,0.00021792954,0.0010669677,0.00014862977],"domain_scores_gemma":[0.9972898,0.0007993072,0.00016559557,0.0006862064,0.00078795897,0.0002711281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004494,0.00037321614,0.00096271094,0.0009461093,0.0008083878,0.0029306782,0.0022357279,0.001079414,0.0020117748],"category_scores_gemma":[0.005416255,0.0005180141,0.0005032293,0.0016353779,0.00078258885,0.003120529,0.0021550653,0.0014472937,0.0012294374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083665125,0.00047699054,0.0030214528,0.0010822641,0.00023847741,0.0017625003,0.0010595256,0.09386779,0.1385565,0.19535676,0.03857514,0.52516603],"study_design_scores_gemma":[0.0003102756,0.00029203063,0.00068859255,0.000041080166,0.00013906643,0.000629057,0.00028367114,0.8134535,0.044094402,0.048579704,0.09140607,0.00008254372],"about_ca_topic_score_codex":0.001944904,"about_ca_topic_score_gemma":0.0013361431,"teacher_disagreement_score":0.004494,"about_ca_system_score_codex":0.000826623,"about_ca_system_score_gemma":0.0013830786,"threshold_uncertainty_score":0.023766816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059600733,0.0003667513,0.9706186,0.0017129297,0.0008129051,0.0010747348,0.00053853536,0.005641822,0.013273628],"genre_scores_gemma":[0.18446569,0.0016056192,0.7335602,0.0022473563,0.0008007324,0.003485329,0.0035947894,0.0018077459,0.06843253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9908732,0.0032025378,0.0017906504,0.00070202263,0.0029003017,0.0005312316],"domain_scores_gemma":[0.98565,0.004970674,0.0010183213,0.00500735,0.0025327152,0.0008209414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014046322,0.00075434137,0.0008797069,0.0020927826,0.0030574633,0.005518538,0.0034505217,0.0035917915,0.011063372],"category_scores_gemma":[0.016653229,0.0008534127,0.00085972395,0.0021854723,0.0028161365,0.010690943,0.0060858545,0.003745077,0.0056286585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073184527,0.0005217466,0.0014796642,0.00064605876,0.0001045997,0.00125319,0.002481998,0.0061225244,0.032174546,0.6869408,0.048359662,0.21918346],"study_design_scores_gemma":[0.00040389693,0.00089241436,0.0009213492,0.0002902252,0.00017371523,0.003072087,0.000989534,0.08711109,0.05979774,0.17794426,0.66801167,0.00039200572],"about_ca_topic_score_codex":0.0013760187,"about_ca_topic_score_gemma":0.0012277786,"teacher_disagreement_score":0.014046322,"about_ca_system_score_codex":0.0013765523,"about_ca_system_score_gemma":0.00264324,"threshold_uncertainty_score":0.07428497},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16798115,0.0007987905,0.8271355,0.00016894186,0.000059387596,0.000091941925,0.00006128082,0.0011445004,0.0025586148],"genre_scores_gemma":[0.87364787,0.00021957971,0.1240137,0.000059221395,0.000033947974,0.00007186985,0.0000587806,0.000050068084,0.0018449812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991604,0.00029669004,0.00007011945,0.00013787817,0.0002331191,0.00010180597],"domain_scores_gemma":[0.99855,0.0005827203,0.00013322958,0.0003382999,0.000274309,0.00012151706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009252857,0.00039546003,0.0006318339,0.0006345112,0.00069490814,0.0006654191,0.0010893631,0.00044474672,0.0010500837],"category_scores_gemma":[0.003310399,0.00023521454,0.00022674959,0.00072766753,0.0005959677,0.0018667697,0.001280535,0.0004715673,0.00024946884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010150161,0.0002018663,0.0041754358,0.00020413124,0.000102918435,0.00049471733,0.0007389531,0.33667517,0.08943842,0.029447075,0.0023917903,0.5351145],"study_design_scores_gemma":[0.000030330091,0.00012627829,0.0009862396,0.000011022041,0.00002839689,0.00021279579,0.000088445624,0.9635007,0.020861523,0.011397337,0.0027186866,0.000038243033],"about_ca_topic_score_codex":0.0022745423,"about_ca_topic_score_gemma":0.0021424314,"teacher_disagreement_score":0.0022745423,"about_ca_system_score_codex":0.0006839253,"about_ca_system_score_gemma":0.00038922444,"threshold_uncertainty_score":0.004962206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9586078,0.00022919783,0.038428467,0.00038130797,0.000021695532,0.000138676,0.00035357408,0.0005820468,0.0012572277],"genre_scores_gemma":[0.9912685,0.000084410574,0.008160656,0.000031823925,0.000008689637,0.000029947887,0.00027479278,0.000025499767,0.000115588125],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99849427,0.00033855083,0.00013005057,0.00033160174,0.0005585037,0.00014700304],"domain_scores_gemma":[0.9881832,0.0065335906,0.0017202896,0.00092966174,0.002204022,0.00042926925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023722844,0.0005480635,0.0005433295,0.0016519442,0.0007005899,0.00093722536,0.0013711837,0.0010057071,0.00031614894],"category_scores_gemma":[0.016905377,0.00032762834,0.00018608235,0.0016503879,0.0008996642,0.0020018735,0.00093265285,0.0010938712,0.0000932124],"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.0008405544,0.0007153678,0.4423126,0.0005422185,0.000332904,0.004434474,0.002192454,0.3848718,0.059493028,0.0064728395,0.003168363,0.09462341],"study_design_scores_gemma":[0.00002262434,0.00024428812,0.05469764,0.000022260883,0.000046163645,0.0008620109,0.0012649045,0.9256972,0.012672372,0.0033337362,0.00110127,0.00003555685],"about_ca_topic_score_codex":0.0052603036,"about_ca_topic_score_gemma":0.004658215,"teacher_disagreement_score":0.0052603036,"about_ca_system_score_codex":0.0011649904,"about_ca_system_score_gemma":0.000735392,"threshold_uncertainty_score":0.012545943},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19800928,0.0005040934,0.79763746,0.00032913007,0.000022164886,0.000048345846,0.000018568973,0.00015092129,0.0032800264],"genre_scores_gemma":[0.9609787,0.00020880312,0.038093388,0.000018744327,0.000028889051,0.00002370278,0.000012157207,0.000016654056,0.0006189299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991726,0.0004103142,0.00003857156,0.0000892449,0.00019523279,0.00009393914],"domain_scores_gemma":[0.9975286,0.0015779543,0.0002819179,0.00025373857,0.00024878196,0.000108973734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018722748,0.00033093424,0.0006103396,0.0004003076,0.0006227176,0.00077556097,0.000646352,0.00063334114,0.00035693083],"category_scores_gemma":[0.004795078,0.0002584555,0.00035648653,0.00041320067,0.0008158661,0.0014207953,0.0008018306,0.00052797515,0.000049986502],"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.0001652621,0.00006913706,0.0037270335,0.00012337361,0.00005381514,0.00060353614,0.0005422196,0.7881347,0.023645967,0.13624324,0.0005060537,0.046185665],"study_design_scores_gemma":[0.0000053931963,0.000032724354,0.00030448698,0.000003834655,0.000016988914,0.00007197886,0.00004760471,0.97787035,0.0015797821,0.019675199,0.00038557226,0.0000060465886],"about_ca_topic_score_codex":0.0014625548,"about_ca_topic_score_gemma":0.0009525796,"teacher_disagreement_score":0.0018722748,"about_ca_system_score_codex":0.0009339654,"about_ca_system_score_gemma":0.00074487715,"threshold_uncertainty_score":0.009901643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102055416,0.00031118508,0.8833888,0.00080534886,0.00019357222,0.0005537481,0.00014140346,0.002588544,0.009961931],"genre_scores_gemma":[0.9406228,0.00007714193,0.055404514,0.00012305494,0.000049195194,0.00013073084,0.00005434372,0.00006036634,0.0034777145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920954,0.0033409533,0.0005880753,0.0011322927,0.0019174663,0.00092592626],"domain_scores_gemma":[0.9753862,0.010033162,0.0026943719,0.008094521,0.002587875,0.0012040327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063390625,0.0006753867,0.0017236442,0.0014585367,0.0018807048,0.002355622,0.0033092522,0.0021502103,0.0027819197],"category_scores_gemma":[0.034115177,0.00052786444,0.00066761,0.0011469994,0.0023560398,0.005513074,0.00590682,0.0021391585,0.0007560797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00275117,0.0006568193,0.0077589583,0.00036087012,0.00019299028,0.0012805206,0.0014613617,0.24798255,0.024818834,0.43363315,0.012617532,0.2664852],"study_design_scores_gemma":[0.00012297808,0.00020126619,0.00053150364,0.000027729753,0.000036289377,0.00038474821,0.00010930992,0.92189646,0.0046694907,0.0680539,0.0039065056,0.000059793256],"about_ca_topic_score_codex":0.0020334744,"about_ca_topic_score_gemma":0.0014620904,"teacher_disagreement_score":0.0063390625,"about_ca_system_score_codex":0.0017287559,"about_ca_system_score_gemma":0.00259025,"threshold_uncertainty_score":0.033524573},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027422668,0.00087377103,0.58096457,0.00053472666,0.00033266746,0.00072060263,0.003945955,0.22177349,0.16343158],"genre_scores_gemma":[0.21265958,0.0015876167,0.45564422,0.0007120747,0.00019333375,0.0013237952,0.014320349,0.021095421,0.29246357],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994646,0.000053637854,0.000027166068,0.00011798613,0.00027779292,0.000058847498],"domain_scores_gemma":[0.9989366,0.0002110157,0.000052238167,0.0004222164,0.00023909981,0.00013880264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057205587,0.00082080805,0.00034730922,0.0010965134,0.0005623097,0.0016145925,0.0016906037,0.00064816937,0.06535477],"category_scores_gemma":[0.001867373,0.0005743768,0.00054118666,0.00086336426,0.00030468154,0.0028596,0.0018168533,0.00096902973,0.020337317],"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.0004792977,0.0002732196,0.0024888355,0.0010306059,0.00006576521,0.0008011943,0.0013111127,0.004075711,0.056779265,0.01811964,0.16568147,0.7488939],"study_design_scores_gemma":[0.000059399,0.00022549306,0.0016254697,0.00006460823,0.00004465774,0.0014176327,0.0001705193,0.017665215,0.02102584,0.0046188664,0.9530231,0.00005910048],"about_ca_topic_score_codex":0.0016760278,"about_ca_topic_score_gemma":0.0035677415,"teacher_disagreement_score":0.06535477,"about_ca_system_score_codex":0.00051873294,"about_ca_system_score_gemma":0.0009481143,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95805335,0.0017918772,0.010968171,0.00024183458,0.00036687526,0.0001176281,0.0006868417,0.012560507,0.015212977],"genre_scores_gemma":[0.9879552,0.00021490529,0.0060885274,0.000035202913,0.000053435622,0.000028351582,0.0011411613,0.0004791814,0.0040041017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972729,0.00050584,0.00017077058,0.00047660896,0.0011061623,0.00046769524],"domain_scores_gemma":[0.99475175,0.0023033335,0.00023396748,0.0008760925,0.0013982239,0.0004366226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018496475,0.0010176688,0.001111738,0.0012070162,0.001395507,0.0017342832,0.0017595876,0.00097061764,0.005998729],"category_scores_gemma":[0.006026963,0.00035083553,0.00028891038,0.0011915881,0.0007413279,0.0015775671,0.0010828495,0.0007739507,0.0014308903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.034369778,0.002295906,0.02344975,0.0016566522,0.0008248606,0.0010694962,0.0012778336,0.31226563,0.2266919,0.008287595,0.032113608,0.35569698],"study_design_scores_gemma":[0.0011017367,0.0036698314,0.0150182955,0.000052105574,0.00030022228,0.00067048566,0.0008556975,0.8298101,0.13637404,0.0014972497,0.010508886,0.0001414933],"about_ca_topic_score_codex":0.008053759,"about_ca_topic_score_gemma":0.005349537,"teacher_disagreement_score":0.008053759,"about_ca_system_score_codex":0.0008633726,"about_ca_system_score_gemma":0.0008207948,"threshold_uncertainty_score":0.020067751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42987558,0.00071428105,0.49274778,0.0005296612,0.0004412215,0.0002630002,0.0005153829,0.01348643,0.061426636],"genre_scores_gemma":[0.85067564,0.00018758755,0.14503755,0.000044771437,0.000011935184,0.000101211146,0.00024282442,0.00012127189,0.0035771949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977213,0.00007432935,0.000014413304,0.000027046397,0.00007147644,0.000040557177],"domain_scores_gemma":[0.9995491,0.00019479051,0.000026071508,0.000088368506,0.00010400506,0.000037596034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034337313,0.0006232053,0.00039980988,0.0003534398,0.00029405722,0.0005287321,0.0007679134,0.00033639063,0.005925236],"category_scores_gemma":[0.00090567564,0.00022838013,0.00029190056,0.0002963733,0.00019657174,0.000394494,0.00036608265,0.00048313287,0.0007626786],"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.0004954658,0.00013053368,0.0032053732,0.00020262755,0.00007463932,0.00036735996,0.00013199367,0.8665634,0.018130992,0.010766822,0.0040089292,0.0959219],"study_design_scores_gemma":[0.000058720616,0.00007338216,0.00044081412,0.000013037302,0.000009939106,0.000029140758,0.00001852225,0.98823094,0.006381435,0.00086801866,0.0038692644,0.0000068415766],"about_ca_topic_score_codex":0.0064553767,"about_ca_topic_score_gemma":0.0048223976,"teacher_disagreement_score":0.0064553767,"about_ca_system_score_codex":0.00057852804,"about_ca_system_score_gemma":0.00055234384,"threshold_uncertainty_score":0.019821882},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067669884,0.00083212275,0.67818224,0.0018977562,0.00060617854,0.0011334339,0.02054437,0.21364915,0.076387644],"genre_scores_gemma":[0.14063647,0.0025393856,0.6359548,0.0030399987,0.00037146825,0.0014207967,0.11920991,0.030000878,0.06682631],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978048,0.0004420738,0.00023990936,0.00039423894,0.00093794666,0.0001810437],"domain_scores_gemma":[0.994399,0.0009658922,0.00025149185,0.0032280418,0.00094253395,0.00021300383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019125773,0.0011421693,0.0008665295,0.0024506862,0.0015161746,0.0043050316,0.002896847,0.0021722452,0.02719178],"category_scores_gemma":[0.009171022,0.0008779821,0.0019657118,0.004067589,0.0014339294,0.006729887,0.0053731464,0.0017651359,0.021688543],"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.00052270916,0.0001645659,0.002484088,0.0015093619,0.0003050983,0.00089229696,0.00075684395,0.014946293,0.011116778,0.21979854,0.42322633,0.3242772],"study_design_scores_gemma":[0.000083722975,0.000051223014,0.0004980034,0.000120390796,0.000069860886,0.0004245175,0.00019025979,0.033917475,0.007743863,0.09426844,0.86256504,0.00006725085],"about_ca_topic_score_codex":0.011295458,"about_ca_topic_score_gemma":0.008932566,"teacher_disagreement_score":0.02719178,"about_ca_system_score_codex":0.0013079391,"about_ca_system_score_gemma":0.0022557836,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35630193,0.0025664223,0.62982416,0.0010994991,0.0001667357,0.00018751892,0.00015941396,0.0010820065,0.008612304],"genre_scores_gemma":[0.97642535,0.00027164703,0.022325836,0.00007822889,0.000020436108,0.000038129932,0.000031047406,0.00003125262,0.0007780112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870574,0.0004010316,0.000082554645,0.00019766169,0.00037714143,0.00023584673],"domain_scores_gemma":[0.9959965,0.0019367265,0.00043370397,0.00069210585,0.00077876874,0.00016215068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018849558,0.00051433925,0.000986424,0.0006178807,0.0008865091,0.0015113982,0.0016184449,0.001131018,0.0008343919],"category_scores_gemma":[0.01111796,0.0005056529,0.00033426902,0.0005694895,0.0010097928,0.0027273952,0.0010264389,0.0008600414,0.0002246099],"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.0004477527,0.00023406159,0.004013061,0.00031373752,0.00009828058,0.00040972274,0.00044372102,0.84397376,0.012153295,0.049683,0.002186546,0.08604302],"study_design_scores_gemma":[0.000089175155,0.00017914137,0.00086024107,0.000035437482,0.00004300028,0.0001636089,0.00017068685,0.95369023,0.0047723064,0.03628823,0.00366903,0.000038926064],"about_ca_topic_score_codex":0.0047689625,"about_ca_topic_score_gemma":0.0034478845,"teacher_disagreement_score":0.0047689625,"about_ca_system_score_codex":0.0008806487,"about_ca_system_score_gemma":0.0011817642,"threshold_uncertainty_score":0.009968698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99654835,0.000069283386,0.0012470664,0.00006753485,0.000009605959,0.000041750343,0.00012992778,0.0002669723,0.001619554],"genre_scores_gemma":[0.9983949,0.000027424243,0.0007200219,0.000029964269,0.000004383445,0.000018369725,0.00027483507,0.00004581659,0.0004842285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733835,0.000510066,0.00018412157,0.00053106924,0.00080308336,0.00063316815],"domain_scores_gemma":[0.9889576,0.0045941086,0.0008288564,0.000852014,0.0031761213,0.0015912768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018762999,0.0010408731,0.00074394426,0.0015948344,0.0011403136,0.0021443458,0.0022895825,0.0011715284,0.0023552633],"category_scores_gemma":[0.012571807,0.0004800265,0.00034126302,0.0014885085,0.0012285695,0.0015570675,0.0013919789,0.0014490183,0.0009361771],"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.007776797,0.0059925574,0.34080094,0.00046876364,0.00053918536,0.002647395,0.004683363,0.40698808,0.15844512,0.01118454,0.010462542,0.05001073],"study_design_scores_gemma":[0.00009181921,0.0008533882,0.03722059,0.000013842548,0.00004134064,0.0003405695,0.0011007577,0.93870354,0.018766005,0.0018241155,0.0009773392,0.00006664152],"about_ca_topic_score_codex":0.011241259,"about_ca_topic_score_gemma":0.005117066,"teacher_disagreement_score":0.011241259,"about_ca_system_score_codex":0.0017779684,"about_ca_system_score_gemma":0.0012309391,"threshold_uncertainty_score":0.022351623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049876925,0.0002870655,0.9475351,0.00014820887,0.000023341634,0.00010240118,0.000039670296,0.0008985298,0.0010886893],"genre_scores_gemma":[0.26601,0.00032197495,0.7321837,0.000062377105,0.000028177088,0.00011847473,0.00020391122,0.00009069949,0.0009806827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997415,0.00009477365,0.000016214275,0.000037398167,0.000082312035,0.000027733817],"domain_scores_gemma":[0.99912995,0.0004780555,0.00008764673,0.0001103939,0.00014665221,0.00004738126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007895307,0.00045973607,0.00048074586,0.0008858074,0.0008835028,0.000488476,0.00088983704,0.0008918836,0.0007300249],"category_scores_gemma":[0.0023475494,0.00029985953,0.00034974655,0.0008503789,0.00033826844,0.0016723139,0.00071993115,0.00059883826,0.0002716737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054444355,0.0002514254,0.0028857356,0.0002596092,0.00008919957,0.000323018,0.0005102815,0.40809476,0.043157388,0.03712647,0.006050627,0.5007071],"study_design_scores_gemma":[0.00005411349,0.000105279774,0.0003183889,0.000013535483,0.000020113377,0.00009374303,0.00006289192,0.97082776,0.010984474,0.014474639,0.003031988,0.000013053967],"about_ca_topic_score_codex":0.0017768837,"about_ca_topic_score_gemma":0.0022176343,"teacher_disagreement_score":0.0017768837,"about_ca_system_score_codex":0.00049433624,"about_ca_system_score_gemma":0.0005396339,"threshold_uncertainty_score":0.004175544},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063647022,0.0011634519,0.9714019,0.0011646859,0.0004841779,0.0003535433,0.00033178652,0.0070997085,0.011636089],"genre_scores_gemma":[0.2685668,0.0022559196,0.71377945,0.0009621641,0.0009281092,0.0007271236,0.0016429705,0.0014470859,0.009690425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99113667,0.0032008057,0.0009193667,0.0011169731,0.0031889868,0.00043732097],"domain_scores_gemma":[0.9825752,0.0047075525,0.0012796527,0.008720637,0.002340297,0.00037661602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006957316,0.0010998658,0.0010927395,0.0018686702,0.0022884815,0.004693866,0.0033352724,0.0023118444,0.005900814],"category_scores_gemma":[0.019060824,0.00075763866,0.0008286258,0.0032870767,0.0017155854,0.009796061,0.004819673,0.0031304772,0.003492233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056214124,0.00031561803,0.0039645783,0.0011759178,0.00020839286,0.0008302907,0.0014098019,0.031328376,0.021868913,0.31340247,0.04215734,0.5827762],"study_design_scores_gemma":[0.00025280568,0.00043504487,0.0019828987,0.0003301704,0.00022252904,0.002593806,0.0006487731,0.2506431,0.06679781,0.18582761,0.48997596,0.00028954915],"about_ca_topic_score_codex":0.0012341975,"about_ca_topic_score_gemma":0.0009969083,"teacher_disagreement_score":0.006957316,"about_ca_system_score_codex":0.0008611345,"about_ca_system_score_gemma":0.0026200064,"threshold_uncertainty_score":0.036794305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08317177,0.00083435327,0.90526754,0.00023898318,0.00011595717,0.00017811573,0.00017049657,0.0040834565,0.005939335],"genre_scores_gemma":[0.709329,0.00041969534,0.28710967,0.00011931135,0.000047537327,0.0001376185,0.00034419214,0.00021371232,0.0022793123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996884,0.000059130743,0.000017330442,0.00003188474,0.00015483797,0.00004853476],"domain_scores_gemma":[0.9996644,0.00008640341,0.00004481746,0.00006802985,0.00008078399,0.000055576053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041397224,0.00032962215,0.0003148225,0.0006040671,0.00045054013,0.0005383067,0.0012903019,0.00057339063,0.0012607385],"category_scores_gemma":[0.0011664885,0.00016219575,0.00024624082,0.00041599252,0.00025765883,0.00115439,0.0013038886,0.0005021352,0.00030065476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007194035,0.00033085348,0.0031593798,0.0004668381,0.00015441343,0.000812421,0.000517364,0.20428944,0.25557226,0.034653686,0.014595323,0.48472875],"study_design_scores_gemma":[0.000081509854,0.0005335572,0.0011840945,0.000030095698,0.000051421055,0.0005996008,0.00014724619,0.9288678,0.032201286,0.009631772,0.026616603,0.000055100074],"about_ca_topic_score_codex":0.0013477998,"about_ca_topic_score_gemma":0.0022974364,"teacher_disagreement_score":0.0013477998,"about_ca_system_score_codex":0.00036355475,"about_ca_system_score_gemma":0.00038448925,"threshold_uncertainty_score":0.004217565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030063285,0.00017441192,0.9679052,0.00021128714,0.00002340477,0.00006749788,0.000018575181,0.0005156637,0.0010205939],"genre_scores_gemma":[0.3124211,0.00048192366,0.68489134,0.00011005614,0.000028616425,0.00013964453,0.00015210142,0.00012613896,0.0016490837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999458,0.00022017566,0.000021664815,0.00005980832,0.00020371097,0.000036562746],"domain_scores_gemma":[0.998108,0.00094176776,0.00021610488,0.00029062483,0.00028975809,0.00015373636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001830392,0.000364519,0.00042691338,0.00061574765,0.00054908235,0.00095653353,0.0013649383,0.0007778877,0.0006861574],"category_scores_gemma":[0.006042932,0.00023473486,0.00026762797,0.00053616497,0.00065160316,0.0016986334,0.0013293106,0.0008633931,0.00021151839],"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.00018001224,0.00022948944,0.002929563,0.00024076356,0.00008469412,0.00028741825,0.0006808311,0.62766284,0.05091298,0.06034329,0.0031948902,0.25325322],"study_design_scores_gemma":[0.000048106835,0.00014955075,0.0004034837,0.00001480376,0.000017400573,0.00018803286,0.00017499016,0.96113956,0.011264379,0.01684009,0.009744191,0.000015302418],"about_ca_topic_score_codex":0.0007834514,"about_ca_topic_score_gemma":0.0010685414,"teacher_disagreement_score":0.001830392,"about_ca_system_score_codex":0.0003884679,"about_ca_system_score_gemma":0.0004986245,"threshold_uncertainty_score":0.009680212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9392682,0.0013009477,0.023014171,0.00054586306,0.00042406132,0.00044751502,0.0007211318,0.021953208,0.012324899],"genre_scores_gemma":[0.97423077,0.0003852521,0.017726118,0.00008374526,0.00007367229,0.000103236496,0.0018074036,0.00090641674,0.004683495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900827,0.0021434082,0.0006368925,0.0012124481,0.0048693637,0.0010552756],"domain_scores_gemma":[0.98700225,0.003936265,0.00044560572,0.0027232969,0.0047123376,0.001180248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005922102,0.0012279564,0.0012436142,0.0015631231,0.0016205458,0.0031238105,0.0031293998,0.0014218559,0.00337085],"category_scores_gemma":[0.0162964,0.00056896836,0.00045704594,0.002205261,0.0010631563,0.0034379158,0.0016284264,0.0014307642,0.0012657088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017510869,0.005196546,0.029459594,0.002214469,0.00091870694,0.0016335635,0.003325704,0.18283874,0.23875253,0.010162248,0.03926796,0.46871912],"study_design_scores_gemma":[0.0015381855,0.00557597,0.037237797,0.00010321261,0.00041848357,0.00081113126,0.001672577,0.7520568,0.1744773,0.0025222679,0.023332188,0.00025414006],"about_ca_topic_score_codex":0.011217661,"about_ca_topic_score_gemma":0.005265341,"teacher_disagreement_score":0.011217661,"about_ca_system_score_codex":0.0015112667,"about_ca_system_score_gemma":0.0021082056,"threshold_uncertainty_score":0.0313195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08929032,0.00028913782,0.90177995,0.00039500388,0.0001241714,0.00012913864,0.00004656259,0.000092505965,0.007853157],"genre_scores_gemma":[0.94618803,0.00018278715,0.050432228,0.000082881954,0.000085637694,0.00012729362,0.000024203136,0.000023119366,0.0028538494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949026,0.0030477275,0.0001969578,0.00044939684,0.00082642667,0.00057682954],"domain_scores_gemma":[0.987576,0.009533264,0.0008242527,0.00046040755,0.0009624569,0.0006437034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005071267,0.0009136587,0.0011464603,0.0006091209,0.0011387564,0.0020870205,0.0015814541,0.0012314862,0.0018915721],"category_scores_gemma":[0.015013683,0.0003344775,0.00044206213,0.00058415614,0.0016767404,0.0028581372,0.0016139185,0.0013079379,0.00019257495],"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.0006034145,0.00016970183,0.0016138741,0.00014283038,0.000064126056,0.0004078126,0.0004327153,0.59687877,0.0049896603,0.36471277,0.0012465196,0.028737701],"study_design_scores_gemma":[0.000035466266,0.000070992384,0.0001451998,0.000009143346,0.000009271227,0.000051427916,0.000045211185,0.9357272,0.00089140376,0.0620791,0.00092285103,0.0000128196125],"about_ca_topic_score_codex":0.0027118474,"about_ca_topic_score_gemma":0.001303664,"teacher_disagreement_score":0.005071267,"about_ca_system_score_codex":0.0018433101,"about_ca_system_score_gemma":0.0013679998,"threshold_uncertainty_score":0.026819766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036938924,0.0006385691,0.8807903,0.0009549678,0.00064024143,0.001316342,0.0010548873,0.017983437,0.059682302],"genre_scores_gemma":[0.6719682,0.0006837678,0.27650735,0.00070162455,0.00039430868,0.0018096353,0.0027611014,0.0012659739,0.043908056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925643,0.00021124638,0.000083063234,0.00006693192,0.00030331936,0.000079068785],"domain_scores_gemma":[0.9992206,0.00012613104,0.000045217254,0.00020896246,0.00028157883,0.000117431475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011257045,0.00034593474,0.0003444893,0.0004901729,0.00080156326,0.00126325,0.0009540583,0.0006998602,0.0061249114],"category_scores_gemma":[0.001668964,0.00020894305,0.00029436802,0.00039845382,0.0004767178,0.0010086293,0.0010267617,0.0009962389,0.0034544375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013455134,0.0006863672,0.0027409142,0.0012108581,0.00015517899,0.002393056,0.001787697,0.02662316,0.1952951,0.30106816,0.1179726,0.34872136],"study_design_scores_gemma":[0.00022981287,0.0008231815,0.003359421,0.00018263052,0.00016041994,0.002421338,0.0005228275,0.33857518,0.15654711,0.07518579,0.42179245,0.00019988512],"about_ca_topic_score_codex":0.0005491229,"about_ca_topic_score_gemma":0.00050870463,"teacher_disagreement_score":0.0061249114,"about_ca_system_score_codex":0.00044289115,"about_ca_system_score_gemma":0.00081860065,"threshold_uncertainty_score":0.020489872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816772,0.0008253532,0.010582,0.00029425143,0.00006135309,0.00009686406,0.00016659185,0.0016919795,0.0046044667],"genre_scores_gemma":[0.99529535,0.00023836325,0.00320165,0.000028715087,0.000034687353,0.000020728612,0.00016032968,0.000086512824,0.000933699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492174,0.0012815967,0.00048234823,0.0004476682,0.0023662806,0.00050033024],"domain_scores_gemma":[0.97850317,0.012824259,0.0015894421,0.002737367,0.0033631714,0.0009826088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00709036,0.0006030788,0.0009281686,0.00097020157,0.0012511708,0.0021579384,0.0009560748,0.0006167605,0.0022525843],"category_scores_gemma":[0.022176897,0.0003810234,0.0002275327,0.0013422864,0.0007797445,0.0027511287,0.00095173233,0.0006650029,0.0007156787],"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.006635865,0.0019734458,0.10121776,0.0016384914,0.0005366947,0.0015235904,0.0027728353,0.36842725,0.1582071,0.009609927,0.009545793,0.33791128],"study_design_scores_gemma":[0.00033873192,0.005036837,0.043355618,0.000049580947,0.00026571276,0.0011995891,0.0016074319,0.80163556,0.13380183,0.0040880986,0.008522943,0.00009798519],"about_ca_topic_score_codex":0.0027963372,"about_ca_topic_score_gemma":0.0014129665,"teacher_disagreement_score":0.00709036,"about_ca_system_score_codex":0.001325182,"about_ca_system_score_gemma":0.000866954,"threshold_uncertainty_score":0.037497878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26606655,0.0011823267,0.729559,0.00026206535,0.00004247119,0.00012581483,0.000085584135,0.0011926692,0.001483492],"genre_scores_gemma":[0.9512042,0.00014800821,0.047826737,0.000025975221,0.000015460037,0.000045782166,0.000036908412,0.00002173422,0.00067520264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951565,0.00014064221,0.00003903099,0.00008405983,0.0001461317,0.00007446166],"domain_scores_gemma":[0.9984419,0.00079469854,0.00013595339,0.00022266722,0.00028830755,0.0001165499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072413916,0.0003860128,0.0007247032,0.00044751866,0.00056413136,0.0005568322,0.0011159118,0.00068046513,0.00049444864],"category_scores_gemma":[0.003660427,0.00039899393,0.00018511328,0.0006480687,0.00050860544,0.0012879194,0.00082388055,0.0003925526,0.00014169628],"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.00091180427,0.00015634221,0.006044612,0.00019366705,0.000064750435,0.0006162979,0.00049391453,0.79327166,0.03032611,0.012833975,0.0024732272,0.15261365],"study_design_scores_gemma":[0.000020356694,0.00007169351,0.00035850224,0.0000046192076,0.000008378227,0.00006494436,0.00003843945,0.99466187,0.0019202945,0.0024299745,0.0004093783,0.000011487589],"about_ca_topic_score_codex":0.004186488,"about_ca_topic_score_gemma":0.0048857373,"teacher_disagreement_score":0.004186488,"about_ca_system_score_codex":0.0005941562,"about_ca_system_score_gemma":0.000768152,"threshold_uncertainty_score":0.008324206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8216355,0.017696224,0.10730534,0.0036195184,0.00030038942,0.00037418984,0.00066456565,0.0016416744,0.04676271],"genre_scores_gemma":[0.98774314,0.0013817286,0.009533354,0.00010611376,0.00014729584,0.000046825593,0.0003067132,0.00010762252,0.00062721176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9855172,0.005633662,0.00095363986,0.0010242778,0.0060110507,0.00086023234],"domain_scores_gemma":[0.92046183,0.06451887,0.0022390932,0.005235183,0.0062714205,0.0012736438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016806459,0.0011547194,0.0012178933,0.0027262517,0.0006292367,0.0027325517,0.0015830494,0.0020876802,0.0018445712],"category_scores_gemma":[0.06740903,0.00025977127,0.00036163884,0.002073788,0.0013571655,0.0045195906,0.0013701937,0.0011529246,0.00032514773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008118346,0.0014604118,0.032080133,0.0022084247,0.0007081764,0.00056240306,0.000791953,0.26719758,0.05934375,0.04021848,0.0065235225,0.58078694],"study_design_scores_gemma":[0.00039951265,0.008269637,0.034301907,0.00060547143,0.00062163774,0.0009629866,0.0016055558,0.80304754,0.08772847,0.053080942,0.009208851,0.00016754912],"about_ca_topic_score_codex":0.0014005209,"about_ca_topic_score_gemma":0.0010347413,"teacher_disagreement_score":0.016806459,"about_ca_system_score_codex":0.0013424117,"about_ca_system_score_gemma":0.000931182,"threshold_uncertainty_score":0.08888209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19344302,0.0002780606,0.79918844,0.00024311336,0.000051597402,0.000190853,0.000052530446,0.0013706875,0.0051816995],"genre_scores_gemma":[0.77406454,0.00011472225,0.22278509,0.000030870626,0.000012152306,0.0000949408,0.00007125387,0.000054243126,0.0027721792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969196,0.00013281025,0.000014452172,0.00006428681,0.000059819693,0.000036678743],"domain_scores_gemma":[0.9993248,0.00039214868,0.000065572814,0.00004841071,0.00007432442,0.000094799034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057568285,0.00070758467,0.00065776333,0.0004109032,0.000874937,0.0007642268,0.001006298,0.00083479274,0.0022426161],"category_scores_gemma":[0.0022287937,0.000317372,0.00027737435,0.00023230888,0.0006171933,0.0013570376,0.0013925366,0.0005629564,0.0003844722],"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.0012328094,0.00051473005,0.004936058,0.00030786538,0.00010821572,0.001121544,0.0014979477,0.60807705,0.037732385,0.05190638,0.0036007015,0.28896433],"study_design_scores_gemma":[0.00003716019,0.00014279626,0.00034599056,0.000008255374,0.000011387702,0.00016615141,0.00017353817,0.97753775,0.003482708,0.016556397,0.0015231906,0.000014722313],"about_ca_topic_score_codex":0.0020688667,"about_ca_topic_score_gemma":0.0020426374,"teacher_disagreement_score":0.0022426161,"about_ca_system_score_codex":0.00031782436,"about_ca_system_score_gemma":0.00045884575,"threshold_uncertainty_score":0.0075023174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16335294,0.0010344594,0.78904885,0.0016932345,0.00033993943,0.00034553683,0.00015472296,0.032426916,0.011603387],"genre_scores_gemma":[0.6416873,0.00048530096,0.35050106,0.00023688903,0.00016093336,0.00021886182,0.0005988564,0.0008442017,0.0052666944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974591,0.000608776,0.00019495281,0.0004498136,0.0009960042,0.00029138307],"domain_scores_gemma":[0.9951107,0.0014548851,0.00033342058,0.0019188374,0.00092391425,0.00025830185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046952334,0.0005651558,0.0010931664,0.0007094831,0.0018127527,0.004593185,0.0034774374,0.0018855085,0.0026149896],"category_scores_gemma":[0.010368974,0.00067903026,0.00036721496,0.0012062892,0.0010942322,0.007005059,0.002107655,0.0016783272,0.0013007927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021206578,0.0008911562,0.008240884,0.00074901094,0.00022635421,0.0007153202,0.0019362543,0.15957767,0.07972132,0.09879435,0.029464709,0.6175624],"study_design_scores_gemma":[0.00044680078,0.0003389275,0.0018361089,0.000045647015,0.00006946612,0.00045125993,0.00047857626,0.90049016,0.046050467,0.02212506,0.027570719,0.00009681784],"about_ca_topic_score_codex":0.0033824714,"about_ca_topic_score_gemma":0.0028833738,"teacher_disagreement_score":0.0046952334,"about_ca_system_score_codex":0.0008198289,"about_ca_system_score_gemma":0.0021009282,"threshold_uncertainty_score":0.024831057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11978173,0.0002798797,0.8660205,0.00081870524,0.00008757492,0.00019529586,0.00061513635,0.0017197233,0.010481516],"genre_scores_gemma":[0.96722233,0.00019331119,0.029340433,0.0000620398,0.000028908858,0.00014979143,0.00025141914,0.000047617308,0.002704051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820673,0.0004189609,0.00012592858,0.0004196771,0.0006143978,0.00021433638],"domain_scores_gemma":[0.9967541,0.0013918387,0.00045612335,0.00065550103,0.00057659723,0.00016571686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014464023,0.0004910977,0.0007070191,0.0012011165,0.0005646505,0.0028590467,0.0020614346,0.0017761252,0.0017865705],"category_scores_gemma":[0.008511665,0.00041057548,0.000365382,0.0012302616,0.001439156,0.003614603,0.0016625038,0.0012633848,0.0005701043],"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.00021919925,0.00011509743,0.0044679116,0.00008201602,0.000029628129,0.00020653028,0.00040170265,0.8538491,0.0070545133,0.11252544,0.0013969536,0.01965193],"study_design_scores_gemma":[0.000011435082,0.000026989728,0.00035477435,0.000006478251,0.0000049259884,0.000027505968,0.000024184901,0.98834,0.0010253562,0.009309207,0.00085811724,0.000011096418],"about_ca_topic_score_codex":0.007819114,"about_ca_topic_score_gemma":0.0033923115,"teacher_disagreement_score":0.007819114,"about_ca_system_score_codex":0.002391954,"about_ca_system_score_gemma":0.001257204,"threshold_uncertainty_score":0.017354906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003978685,0.00006301945,0.9936673,0.00013971771,0.000022841594,0.00011889156,0.000028920698,0.00027943612,0.0017011965],"genre_scores_gemma":[0.14084378,0.00009567108,0.854413,0.00005908081,0.000020949752,0.0002942667,0.0001290259,0.00008194786,0.0040622726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953367,0.0022991821,0.0003112167,0.00070543657,0.0011218749,0.00022555399],"domain_scores_gemma":[0.99251056,0.004131666,0.000352314,0.0016259768,0.000988896,0.00039060324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058211437,0.000599391,0.0016511179,0.0025509584,0.0033151298,0.003732731,0.0045913784,0.0020192377,0.0061030434],"category_scores_gemma":[0.011930515,0.00066815736,0.0014082065,0.0027325896,0.0025172483,0.005526376,0.004960757,0.0016887995,0.0010546217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003128334,0.00037130652,0.0017747778,0.00048702196,0.00029531823,0.00030138693,0.0018120713,0.08044056,0.0057759024,0.6362086,0.0039922716,0.26822802],"study_design_scores_gemma":[0.000108332206,0.00012289739,0.00032204937,0.000056948673,0.00013192235,0.00025643787,0.0005449421,0.73235923,0.0062965034,0.24744216,0.012300669,0.000057904377],"about_ca_topic_score_codex":0.002512932,"about_ca_topic_score_gemma":0.0038385359,"teacher_disagreement_score":0.0061030434,"about_ca_system_score_codex":0.0014764913,"about_ca_system_score_gemma":0.0027148318,"threshold_uncertainty_score":0.030785501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15268812,0.00094734406,0.815277,0.0008228972,0.00036594106,0.00033675984,0.00020934717,0.009798425,0.019554202],"genre_scores_gemma":[0.72925854,0.00073259213,0.25912964,0.00022550591,0.00017786003,0.00013227687,0.001107829,0.00025928853,0.008976424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00019935124,0.000108456836,0.00010963027,0.00047754016,0.00013655462],"domain_scores_gemma":[0.996627,0.000508238,0.00024152815,0.0011805465,0.0012512446,0.00019145117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019145756,0.00047696778,0.00053715147,0.0009502174,0.0008837963,0.0017127816,0.002227794,0.0006373109,0.0012328493],"category_scores_gemma":[0.0036355774,0.00028509495,0.0004045534,0.0011774977,0.00068450853,0.004222868,0.0023391885,0.00075375027,0.00072886504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015046854,0.00054185465,0.012791729,0.0006955886,0.00016358543,0.0006947944,0.0012841163,0.12272742,0.1134243,0.16217028,0.01739155,0.5666101],"study_design_scores_gemma":[0.00012623312,0.00055890455,0.0024803854,0.000039363786,0.00016285072,0.00059598207,0.0005452839,0.7992631,0.069821626,0.039350335,0.08693264,0.0001231611],"about_ca_topic_score_codex":0.0077418024,"about_ca_topic_score_gemma":0.007909084,"teacher_disagreement_score":0.0077418024,"about_ca_system_score_codex":0.0015160172,"about_ca_system_score_gemma":0.0014889736,"threshold_uncertainty_score":0.015393496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078341335,0.00053797645,0.916165,0.00041482528,0.000092673,0.00012052433,0.00007574585,0.001260984,0.0029909464],"genre_scores_gemma":[0.8633896,0.00030984782,0.13211001,0.000200885,0.0000927475,0.0001531255,0.00012866355,0.00010446615,0.003510671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976928,0.00056347577,0.00015084259,0.0002466185,0.0010050541,0.00034122207],"domain_scores_gemma":[0.97878474,0.010335363,0.0021382445,0.0037336233,0.0044658566,0.00054220454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024681697,0.00064754667,0.0006457874,0.0010529797,0.00082938216,0.0013906313,0.0012959883,0.0009463947,0.0012872277],"category_scores_gemma":[0.01673071,0.00030032502,0.00035159392,0.0013472576,0.0013511807,0.0026797939,0.0018716591,0.0013904871,0.00047307942],"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.0016778022,0.0003538999,0.0029954617,0.00029793207,0.00008558998,0.00062422117,0.00087041646,0.4997093,0.050254185,0.20226832,0.004111025,0.23675194],"study_design_scores_gemma":[0.000097561715,0.0003180273,0.0002246505,0.000025081885,0.00002497414,0.00033225975,0.00007711307,0.93932176,0.015692767,0.04155709,0.0022546835,0.000074031654],"about_ca_topic_score_codex":0.002217669,"about_ca_topic_score_gemma":0.0017770292,"teacher_disagreement_score":0.0024681697,"about_ca_system_score_codex":0.0014309142,"about_ca_system_score_gemma":0.0015811996,"threshold_uncertainty_score":0.01305306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02148212,0.0025399495,0.94675905,0.0005896597,0.0005783622,0.00096646056,0.0016300059,0.01613666,0.009317732],"genre_scores_gemma":[0.5366979,0.0030521282,0.43316275,0.00067346945,0.0005978182,0.0012794508,0.0077108718,0.0014603178,0.015365247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987238,0.00026607167,0.00013459715,0.00018222963,0.00058853906,0.0001047634],"domain_scores_gemma":[0.9979539,0.00050727464,0.00025558312,0.00070149085,0.00042402092,0.0001577572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017135319,0.000512893,0.00092165836,0.0013904752,0.0008834262,0.001830575,0.0033480583,0.0012280126,0.0035748733],"category_scores_gemma":[0.0052729836,0.00045085483,0.00048038125,0.0013805164,0.00080017315,0.0036809214,0.0030137943,0.0010206661,0.0017355467],"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.0020150987,0.0002962297,0.0028307845,0.0020366446,0.0003554441,0.0014633518,0.0010658153,0.057593692,0.0903245,0.10102192,0.084248506,0.656748],"study_design_scores_gemma":[0.0010232955,0.0012866976,0.0018084575,0.00019707745,0.00041167683,0.0036191235,0.0006034747,0.37112984,0.082985885,0.06725234,0.46924114,0.00044100397],"about_ca_topic_score_codex":0.0011829513,"about_ca_topic_score_gemma":0.0010162978,"teacher_disagreement_score":0.0035748733,"about_ca_system_score_codex":0.00074238935,"about_ca_system_score_gemma":0.00095245126,"threshold_uncertainty_score":0.0119591355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004432696,0.000037800208,0.9906826,0.00017543283,0.000053136246,0.00006137604,0.000020602343,0.0016349348,0.0029015003],"genre_scores_gemma":[0.05852754,0.000081910344,0.93631595,0.000081394384,0.000025318875,0.00022834369,0.00011585324,0.000244835,0.0043789633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894077,0.00029507274,0.0000701716,0.00019702326,0.00042320986,0.00007372753],"domain_scores_gemma":[0.9989962,0.00030435552,0.00008935193,0.00032584826,0.00017375342,0.000110584675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822435,0.00056556537,0.00037654128,0.00038267567,0.00068260764,0.0014028858,0.0022649642,0.0013741873,0.0034790935],"category_scores_gemma":[0.003395983,0.0004594986,0.00072726404,0.00031057556,0.0007652937,0.0021874115,0.0031909568,0.0013368145,0.0010604267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003173227,0.00044537857,0.001545916,0.0007345587,0.00021487554,0.0015943059,0.0026083998,0.13461325,0.089592434,0.3149568,0.017435467,0.43594134],"study_design_scores_gemma":[0.00017392031,0.0002851372,0.0003890579,0.00007038619,0.00008173869,0.0013698391,0.00027354565,0.7154633,0.04105847,0.050995592,0.18976429,0.000074749],"about_ca_topic_score_codex":0.0004975081,"about_ca_topic_score_gemma":0.00074344606,"teacher_disagreement_score":0.0034790935,"about_ca_system_score_codex":0.00030948195,"about_ca_system_score_gemma":0.00076518324,"threshold_uncertainty_score":0.011638701},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095690385,0.000364515,0.89583176,0.00019621923,0.00010101811,0.00037136447,0.00017873292,0.005365103,0.0019009298],"genre_scores_gemma":[0.710919,0.00021828225,0.2855542,0.000120296434,0.000043177675,0.000211064,0.00028851986,0.00026434555,0.0023810791],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995202,0.00009154091,0.00003585317,0.000088202614,0.00022364274,0.00004054781],"domain_scores_gemma":[0.9989976,0.0002746566,0.000112361544,0.00025509708,0.0002073019,0.00015292161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008164856,0.00050626084,0.000718575,0.0005392285,0.0007409157,0.000680048,0.0018723309,0.0007788537,0.0010100333],"category_scores_gemma":[0.0015654647,0.0002983823,0.00032946066,0.00045165903,0.00049674994,0.001468805,0.0012097573,0.0008032749,0.00028561513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011047958,0.00061978394,0.0028226995,0.0006113245,0.0003033944,0.00092373515,0.00085434876,0.24070391,0.36969787,0.016577324,0.007842851,0.35793793],"study_design_scores_gemma":[0.00012700672,0.00071865536,0.0014081952,0.000017536682,0.000059724796,0.0005889861,0.0001110442,0.90728253,0.07233145,0.0046306495,0.012608008,0.000116126765],"about_ca_topic_score_codex":0.0013182216,"about_ca_topic_score_gemma":0.0015073172,"teacher_disagreement_score":0.0018723309,"about_ca_system_score_codex":0.00041874338,"about_ca_system_score_gemma":0.0004928643,"threshold_uncertainty_score":0.004317999},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031768847,0.07147321,0.17539255,0.067373656,0.029084744,0.00016793601,0.00025503448,0.0029800604,0.6215039],"genre_scores_gemma":[0.3197285,0.04290584,0.055264764,0.023457237,0.007097124,0.000119578275,0.00022933283,0.0017071924,0.5494905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903,0.00014634317,0.000027751556,0.00013496353,0.00055916345,0.000101766476],"domain_scores_gemma":[0.9975555,0.0008500076,0.00014673507,0.0004024072,0.0009094689,0.00013578386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787237,0.0008404376,0.0004343789,0.0012742232,0.002077753,0.0023136672,0.0015720954,0.0023961985,0.03081671],"category_scores_gemma":[0.007485656,0.00054115313,0.00046536233,0.0007487451,0.0036260572,0.00726827,0.0028066838,0.0038962807,0.007003388],"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.0002765375,0.000055404264,0.0009567572,0.00072593946,0.000041736384,0.001007087,0.0015249749,0.0026402355,0.01240528,0.20248328,0.24245206,0.5354308],"study_design_scores_gemma":[0.000018747878,0.00016803,0.0012118293,0.00058475486,0.00004479037,0.0035960453,0.0013503043,0.0034886324,0.014874202,0.12063372,0.85392237,0.00010645268],"about_ca_topic_score_codex":0.001594713,"about_ca_topic_score_gemma":0.0026413526,"teacher_disagreement_score":0.03081671,"about_ca_system_score_codex":0.0008527255,"about_ca_system_score_gemma":0.0006655973,"threshold_uncertainty_score":0.103092134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116204366,0.00033053322,0.8758628,0.0001880328,0.00004842271,0.00016057641,0.000083371364,0.0026380897,0.004483897],"genre_scores_gemma":[0.8089942,0.0003074693,0.18820766,0.000050007988,0.00005374742,0.00012186982,0.00015920476,0.000059632417,0.0020463031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943274,0.00016905884,0.0000375646,0.000072741546,0.00023979964,0.000048036876],"domain_scores_gemma":[0.99857366,0.00058301404,0.00016452675,0.00026716382,0.00027816856,0.00013349295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007368224,0.00036239036,0.0004817032,0.0005126313,0.0007067985,0.00066946883,0.0011523503,0.00042527827,0.0009524812],"category_scores_gemma":[0.0021867747,0.0001831782,0.00017903873,0.0006472416,0.00048487913,0.0016056708,0.0010630843,0.00043623144,0.00026303183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010178724,0.00046696042,0.0036076198,0.00044020254,0.00012483829,0.0012183936,0.0006687324,0.31622475,0.23775215,0.08366082,0.006932523,0.34788507],"study_design_scores_gemma":[0.00008698372,0.0003670525,0.00048500582,0.000011005575,0.000034491535,0.00024807965,0.000049055467,0.95304894,0.029884683,0.009033622,0.0067179757,0.000033022032],"about_ca_topic_score_codex":0.0018724238,"about_ca_topic_score_gemma":0.0021257165,"teacher_disagreement_score":0.0018724238,"about_ca_system_score_codex":0.00045327816,"about_ca_system_score_gemma":0.0006631384,"threshold_uncertainty_score":0.0038967133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010173862,0.0019180289,0.9717389,0.0007892668,0.00070562965,0.00047634228,0.00012683873,0.0032808806,0.010790273],"genre_scores_gemma":[0.34336036,0.0029238374,0.6171275,0.0014470456,0.0007042525,0.0016443605,0.0011575018,0.0003728317,0.031262286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990325,0.00025358828,0.00009864802,0.00010628256,0.00040431242,0.00010466873],"domain_scores_gemma":[0.9992906,0.00014138427,0.000078347286,0.00012983532,0.0002967055,0.00006307689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009638669,0.0004824688,0.00045752653,0.0008955038,0.0012005504,0.0012324526,0.0016712865,0.0014034684,0.0018091858],"category_scores_gemma":[0.0014063228,0.0002639239,0.00044499373,0.0007290944,0.0004913159,0.0018615508,0.0017480529,0.0017641918,0.00096169155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005680895,0.00033775053,0.0010730727,0.0010301409,0.00027444537,0.0022469382,0.0010937103,0.023312006,0.16292012,0.18882619,0.054528844,0.56378883],"study_design_scores_gemma":[0.0002772041,0.00076453073,0.0012475321,0.00020820198,0.0003204783,0.003654442,0.0003681343,0.34840623,0.070852466,0.0377747,0.535849,0.00027709163],"about_ca_topic_score_codex":0.0013516974,"about_ca_topic_score_gemma":0.0017861369,"teacher_disagreement_score":0.0018091858,"about_ca_system_score_codex":0.00085775065,"about_ca_system_score_gemma":0.00091509346,"threshold_uncertainty_score":0.0062235},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021801427,0.00030451774,0.9691608,0.00022014353,0.00012207519,0.00022563076,0.000045242497,0.0033603597,0.0047597373],"genre_scores_gemma":[0.540359,0.00042611817,0.44121516,0.00028376252,0.00019329617,0.00039156762,0.00017599468,0.00047157402,0.016483478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993148,0.000097038755,0.00003389093,0.00017481325,0.00032192256,0.000057602552],"domain_scores_gemma":[0.99925095,0.00017509138,0.0000564272,0.00020729634,0.000243219,0.000066960216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050486333,0.000617881,0.00059457595,0.00074542285,0.00095480715,0.0008332803,0.0018347445,0.00061787455,0.0035061063],"category_scores_gemma":[0.0013036384,0.00034537783,0.0004150809,0.000584101,0.00061603024,0.0017411734,0.001301902,0.0009017319,0.0010561931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007494068,0.0004891332,0.001229662,0.00035941918,0.00006643357,0.00091350306,0.00076620275,0.026594011,0.31299618,0.030857094,0.011270239,0.6137087],"study_design_scores_gemma":[0.00025935558,0.00079515984,0.0015277256,0.000051280043,0.00009015503,0.0017927699,0.00027476007,0.7541347,0.17570452,0.012738018,0.052501667,0.00012989383],"about_ca_topic_score_codex":0.0014809495,"about_ca_topic_score_gemma":0.00120338,"teacher_disagreement_score":0.0035061063,"about_ca_system_score_codex":0.0005489641,"about_ca_system_score_gemma":0.000603733,"threshold_uncertainty_score":0.011729062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97698385,0.00048120244,0.01713219,0.00014365771,0.00010166155,0.00038790336,0.00052751903,0.0011319567,0.0031101003],"genre_scores_gemma":[0.98677814,0.00021873134,0.011371401,0.0000390713,0.000034664114,0.00018649618,0.00073382875,0.00009190837,0.00054570124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964935,0.0010620106,0.0004124324,0.0005145559,0.0012045611,0.00031287066],"domain_scores_gemma":[0.97405124,0.013110465,0.0016127216,0.004099026,0.0061172475,0.0010093251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002724349,0.00091106637,0.00086867396,0.0012962136,0.0008912456,0.00062658853,0.0015183851,0.0006857988,0.0019745692],"category_scores_gemma":[0.011438558,0.00035726768,0.00041571606,0.0018731448,0.00073554064,0.0016596137,0.0008901202,0.00091789884,0.0003911175],"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.0057609584,0.013576356,0.026269993,0.0024537204,0.00095675304,0.001301714,0.0013383144,0.5002183,0.31470487,0.0049984576,0.009036427,0.11938421],"study_design_scores_gemma":[0.0004960448,0.010315294,0.014468611,0.000110183515,0.0002459317,0.00057760347,0.00078445993,0.70968676,0.25742343,0.0030404013,0.0027301274,0.00012120373],"about_ca_topic_score_codex":0.0022850784,"about_ca_topic_score_gemma":0.0015812734,"teacher_disagreement_score":0.002724349,"about_ca_system_score_codex":0.001010999,"about_ca_system_score_gemma":0.00039922795,"threshold_uncertainty_score":0.014407933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15906918,0.00049073243,0.8279328,0.0004576586,0.000169392,0.00026262182,0.00009913602,0.004984174,0.0065343194],"genre_scores_gemma":[0.8822165,0.00017774633,0.11342828,0.000099166224,0.000121400466,0.00013179466,0.00016459462,0.00014051443,0.0035199989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989993,0.00027518353,0.000071103335,0.00018450983,0.00038680286,0.000083070765],"domain_scores_gemma":[0.9976928,0.0010040583,0.00019842283,0.00056139566,0.00041212852,0.00013127786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017273879,0.0004331756,0.0007053317,0.0007497747,0.0012071496,0.0016638609,0.0013153815,0.000727842,0.0012596967],"category_scores_gemma":[0.0034267548,0.00033266706,0.00026714843,0.0011188537,0.00058250845,0.0017765149,0.0009038028,0.00060185656,0.0005583157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010777734,0.0010138769,0.00762414,0.00040572113,0.00020898262,0.0007246936,0.00084723165,0.24227993,0.12906542,0.035939205,0.009663761,0.57114923],"study_design_scores_gemma":[0.00013654046,0.0001482011,0.0012110522,0.000010426121,0.00004690473,0.00024893307,0.00015605787,0.93565696,0.03584823,0.019019801,0.0074893814,0.000027509965],"about_ca_topic_score_codex":0.0008986387,"about_ca_topic_score_gemma":0.0010684202,"teacher_disagreement_score":0.0017273879,"about_ca_system_score_codex":0.0006741973,"about_ca_system_score_gemma":0.0006463065,"threshold_uncertainty_score":0.009135425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045934916,0.0006790769,0.9450181,0.001197127,0.00008394461,0.0002412928,0.00022620174,0.0013672325,0.005252123],"genre_scores_gemma":[0.80814445,0.0010086348,0.18266027,0.00038322218,0.00018122967,0.0005103831,0.00045052322,0.00022541021,0.006435909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912451,0.0029633224,0.0006425255,0.0016958097,0.0024543926,0.0009988954],"domain_scores_gemma":[0.9835397,0.008076927,0.0015775888,0.0056859073,0.0007737702,0.0003462267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058021112,0.0010335442,0.0019722183,0.0009511952,0.001977634,0.003594914,0.0032518653,0.0025993884,0.0033219857],"category_scores_gemma":[0.016706841,0.0008698932,0.0011641918,0.0019819622,0.003382232,0.011001347,0.0068688765,0.0034583912,0.0013335617],"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.0013864657,0.00018510193,0.0012338023,0.0009525237,0.00018916676,0.00091065885,0.0012498682,0.31931898,0.04591773,0.5267862,0.0067588994,0.09511061],"study_design_scores_gemma":[0.00027558292,0.00040626372,0.00031802757,0.00007522344,0.00010084553,0.00058096,0.0003593302,0.6868103,0.03351311,0.26036134,0.01711554,0.00008347792],"about_ca_topic_score_codex":0.0007878045,"about_ca_topic_score_gemma":0.00040025247,"teacher_disagreement_score":0.0058021112,"about_ca_system_score_codex":0.0025900824,"about_ca_system_score_gemma":0.0017824924,"threshold_uncertainty_score":0.030684829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028724095,0.00087795104,0.9682243,0.00018036527,0.00011069199,0.00008034534,0.000013162931,0.00033234825,0.0014566944],"genre_scores_gemma":[0.74696094,0.0008011324,0.24945256,0.00009654718,0.00024093178,0.00020642726,0.00005275436,0.000104508435,0.0020841975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988937,0.00054570485,0.000049231796,0.00014893834,0.00029224384,0.00007036315],"domain_scores_gemma":[0.99851435,0.00082583,0.00016178915,0.00017683065,0.00024998863,0.00007125491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022052336,0.0006274565,0.0011368841,0.00062854553,0.0013156014,0.0006935476,0.0013909135,0.0006428313,0.0010026103],"category_scores_gemma":[0.0038711245,0.00034488045,0.00033826326,0.0007290752,0.00060225395,0.001298883,0.0008488156,0.0008631414,0.00034104392],"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.00084653293,0.00038152828,0.0009913002,0.00043816539,0.00010564158,0.0005844035,0.00068340974,0.6396808,0.038131084,0.08896774,0.004787137,0.2244023],"study_design_scores_gemma":[0.00005256647,0.00012401099,0.000098211785,0.0000085415995,0.00002140578,0.000080237885,0.000041454063,0.9816058,0.004050705,0.012337175,0.0015632409,0.000016609347],"about_ca_topic_score_codex":0.00076703686,"about_ca_topic_score_gemma":0.0012485303,"teacher_disagreement_score":0.0022052336,"about_ca_system_score_codex":0.0009049717,"about_ca_system_score_gemma":0.00094004645,"threshold_uncertainty_score":0.011662543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9110714,0.0018462122,0.05400268,0.0072537255,0.00050411175,0.00018839544,0.00018757096,0.00091116456,0.024034627],"genre_scores_gemma":[0.9984255,0.00010074179,0.00091863837,0.000100861565,0.000047475536,0.000015557865,0.000012446519,0.000014906309,0.00036384744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.988467,0.006628011,0.00061649224,0.0006589618,0.0023032425,0.0013263684],"domain_scores_gemma":[0.8961219,0.067310534,0.014513422,0.009926559,0.0064205145,0.0057071047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0085177515,0.0007019917,0.0016708379,0.0012935633,0.0033103107,0.002894282,0.0014567614,0.0024751849,0.004022249],"category_scores_gemma":[0.07267009,0.00067522126,0.00081992114,0.00077448896,0.0047819144,0.0057601403,0.0052754674,0.0037501298,0.0005579282],"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.006457457,0.0011887125,0.060196903,0.00087283517,0.00079210213,0.00924296,0.0089568,0.567687,0.029797604,0.21783574,0.0138345,0.08313737],"study_design_scores_gemma":[0.00070847257,0.001995288,0.032365557,0.00015795857,0.0005021459,0.002181343,0.0043210844,0.67907023,0.0071783257,0.26574948,0.0053548366,0.00041532464],"about_ca_topic_score_codex":0.0037786483,"about_ca_topic_score_gemma":0.0015652076,"teacher_disagreement_score":0.0085177515,"about_ca_system_score_codex":0.0020137497,"about_ca_system_score_gemma":0.0007713314,"threshold_uncertainty_score":0.045046747},"labels":[],"label_agreement":null},{"id":"W2117718929","doi":"10.1007/s12083-009-0048-4","title":"Adaptive topology formation for peer-to-peer video streaming","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Upload; Video quality; Bandwidth (computing); Overlay; Peer-to-peer; Distributed computing; Overlay network; Network topology; The Internet; Real-time computing","score_opus":0.025986668830844765,"score_gpt":0.2889531711439613,"score_spread":0.2629665023131165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117718929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042555213,0.00053450937,0.95330703,0.00027971694,0.00014205478,0.00011797167,0.000057764322,0.00071710255,0.0022886698],"genre_scores_gemma":[0.8123492,0.00043085348,0.18339993,0.00005923456,0.00012023718,0.00013415205,0.00016498908,0.00009604583,0.0032452524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921453,0.00026659743,0.00004459745,0.00014454262,0.00026279988,0.000066956054],"domain_scores_gemma":[0.99797124,0.001064934,0.00017719234,0.00029905187,0.00032928068,0.00015833389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010880393,0.0003737295,0.0009710288,0.00071801094,0.0009884904,0.00070134713,0.0016517005,0.00081097323,0.0011581513],"category_scores_gemma":[0.005423413,0.0003496767,0.00029656722,0.00083886785,0.0006112427,0.0015397619,0.0013193312,0.0008967962,0.0002863404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044634467,0.00018982604,0.0009760124,0.00014828781,0.00007081,0.00032226538,0.00033286258,0.7444728,0.03003276,0.03316284,0.0041971467,0.18564805],"study_design_scores_gemma":[0.000023554785,0.00004842554,0.00013832473,0.0000028480952,0.000009755885,0.00007483332,0.000026653854,0.98840034,0.0021630863,0.008089197,0.0010132216,0.000009790873],"about_ca_topic_score_codex":0.001755637,"about_ca_topic_score_gemma":0.0019651253,"teacher_disagreement_score":0.001755637,"about_ca_system_score_codex":0.0006188034,"about_ca_system_score_gemma":0.0005479538,"threshold_uncertainty_score":0.005754173},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100541845,0.007052637,0.82005286,0.004265741,0.00027847337,0.00022824862,0.00026161474,0.0004392162,0.06687941],"genre_scores_gemma":[0.9463947,0.00449358,0.03529171,0.0002255134,0.00042850425,0.00017269487,0.000094563846,0.00011031273,0.012788499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.00016220675,0.00002150796,0.00008050688,0.0002693971,0.00009737748],"domain_scores_gemma":[0.997919,0.0013139982,0.00021360315,0.000094911826,0.0003641758,0.00009422569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085859746,0.00077157404,0.0007066803,0.0010626581,0.00092948147,0.0011476289,0.0013179492,0.0012903595,0.0024133376],"category_scores_gemma":[0.007883753,0.0004657522,0.0005917366,0.00097440346,0.0015951367,0.003156994,0.0010663215,0.0012557918,0.00043122025],"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.00002362894,0.00005115141,0.00083925517,0.00019271269,0.000027329605,0.00063168415,0.00044114137,0.57782674,0.0039998307,0.40177858,0.0025877878,0.011600049],"study_design_scores_gemma":[0.0000032923886,0.000012758613,0.00013993558,0.00001704506,0.000005076875,0.0001036766,0.000052303978,0.9578138,0.00029517766,0.039100267,0.002447719,0.000009033003],"about_ca_topic_score_codex":0.0051149544,"about_ca_topic_score_gemma":0.0014984993,"teacher_disagreement_score":0.0051149544,"about_ca_system_score_codex":0.0018396633,"about_ca_system_score_gemma":0.0011960058,"threshold_uncertainty_score":0.013347805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31748524,0.004686406,0.5673105,0.0010300638,0.00067542796,0.007121838,0.0020398921,0.07114303,0.02850753],"genre_scores_gemma":[0.6230351,0.0017882335,0.3531177,0.00025428564,0.00013142452,0.0013953431,0.004090443,0.001187346,0.015000108],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9944028,0.0013382114,0.0006169116,0.0005417258,0.0026800612,0.0004202859],"domain_scores_gemma":[0.9917659,0.0034158553,0.00049946003,0.0014039667,0.0022462318,0.0006684929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004608393,0.000950835,0.0015687593,0.0018322452,0.0010869597,0.0026015504,0.0033128194,0.0015535392,0.0048322296],"category_scores_gemma":[0.011914505,0.0006349891,0.00043045837,0.001611751,0.0010033934,0.004905103,0.0015308711,0.0011956738,0.0016894846],"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.0045971493,0.0032627066,0.009147399,0.0038286129,0.0007187537,0.0017840499,0.0012821361,0.27123705,0.10822676,0.018293343,0.04510046,0.5325215],"study_design_scores_gemma":[0.00071431504,0.0036251566,0.003439487,0.00006751866,0.0002879059,0.001147936,0.00041547228,0.88065994,0.07387613,0.0023208216,0.03320958,0.0002357395],"about_ca_topic_score_codex":0.011056002,"about_ca_topic_score_gemma":0.0054608746,"teacher_disagreement_score":0.011056002,"about_ca_system_score_codex":0.0015789152,"about_ca_system_score_gemma":0.0020838957,"threshold_uncertainty_score":0.024371803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8970929,0.0033745184,0.06294077,0.0017894937,0.00020820269,0.00012970773,0.00020949832,0.00038484603,0.033869997],"genre_scores_gemma":[0.9979911,0.0003368057,0.0011431583,0.000041108196,0.000022476766,0.000008497649,0.000013231719,0.000011729921,0.00043185012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673647,0.0016641995,0.00012578364,0.00022449034,0.00082437566,0.00042461214],"domain_scores_gemma":[0.977262,0.016400624,0.0019632874,0.00127491,0.0024435695,0.0006556275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024926874,0.0007847905,0.00085990905,0.0007408162,0.0014360223,0.001771301,0.0010061015,0.0013741074,0.0017420315],"category_scores_gemma":[0.01938248,0.00036829984,0.0003282311,0.00081596366,0.0015553648,0.004340906,0.0016931882,0.00078439905,0.00030598714],"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.0007471635,0.00016775215,0.013933461,0.00029098915,0.00011024528,0.0016759784,0.0005395188,0.89018285,0.011693092,0.0560842,0.0021801847,0.022394562],"study_design_scores_gemma":[0.000020632002,0.00017070025,0.0029993348,0.00002619766,0.00006357104,0.00056116097,0.00037251433,0.978736,0.0042319465,0.011558101,0.0012163222,0.00004344779],"about_ca_topic_score_codex":0.004024037,"about_ca_topic_score_gemma":0.0029457621,"teacher_disagreement_score":0.004024037,"about_ca_system_score_codex":0.0015907411,"about_ca_system_score_gemma":0.00075107475,"threshold_uncertainty_score":0.0131827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03442836,0.0005542879,0.8832483,0.0006243342,0.00048356416,0.0008871462,0.00089673337,0.05784575,0.021031378],"genre_scores_gemma":[0.19279054,0.000576365,0.77317166,0.00023541987,0.00020802097,0.0007600613,0.0029031439,0.0019833634,0.027371386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876225,0.000236323,0.00014127986,0.00035423966,0.000406964,0.00009886891],"domain_scores_gemma":[0.9971221,0.0005582798,0.0001762989,0.00086367433,0.000656735,0.0006228614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014580749,0.0006900182,0.0011030029,0.0016193427,0.002352409,0.0029221824,0.002640269,0.0011762914,0.0033481298],"category_scores_gemma":[0.005182775,0.0004984392,0.00053715653,0.0018112521,0.0009024372,0.0057370095,0.0037556721,0.0013303821,0.0024730782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012867885,0.0012321114,0.006252516,0.0015145564,0.00035683482,0.0022998916,0.0024856161,0.030041,0.06247269,0.096478045,0.10059842,0.6949816],"study_design_scores_gemma":[0.00068145926,0.00078905595,0.003961228,0.0001680957,0.00036001112,0.0041515282,0.00063763704,0.48711067,0.059281427,0.06578267,0.3765319,0.0005443113],"about_ca_topic_score_codex":0.004089295,"about_ca_topic_score_gemma":0.004575156,"teacher_disagreement_score":0.004089295,"about_ca_system_score_codex":0.000741702,"about_ca_system_score_gemma":0.0028188347,"threshold_uncertainty_score":0.011200666},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013780266,0.0025816476,0.34889996,0.0028830606,0.001601226,0.0015196993,0.0041415943,0.059341457,0.5652511],"genre_scores_gemma":[0.10464408,0.0029818327,0.47660288,0.0040260716,0.0005773872,0.0020557006,0.01383637,0.01000805,0.3852677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988894,0.00014188496,0.000039097635,0.00021768366,0.00060898595,0.0001029936],"domain_scores_gemma":[0.9990735,0.00022992463,0.000051930045,0.00018804168,0.00027660903,0.0001799078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095686305,0.0007195086,0.0005127833,0.0011671586,0.0010451763,0.0023304329,0.0023886452,0.0012060922,0.0544483],"category_scores_gemma":[0.0028349238,0.00046973102,0.00051421596,0.000638836,0.0006255932,0.002276281,0.0033049155,0.0010777029,0.020722179],"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.000660165,0.0002420538,0.0016579287,0.00085853715,0.00005265144,0.00052404177,0.0010551569,0.003052508,0.01829837,0.111995295,0.33204827,0.5295551],"study_design_scores_gemma":[0.00004048675,0.00012648472,0.00083487964,0.00007734171,0.000020023788,0.00046019934,0.00009769854,0.006785899,0.0023425277,0.010167881,0.9790123,0.000034244298],"about_ca_topic_score_codex":0.0039042947,"about_ca_topic_score_gemma":0.0078074704,"teacher_disagreement_score":0.0544483,"about_ca_system_score_codex":0.000746179,"about_ca_system_score_gemma":0.0013706492,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106871836,0.003512881,0.74986655,0.038496744,0.0016025879,0.00043389277,0.00009821826,0.0020568424,0.09706039],"genre_scores_gemma":[0.92915106,0.0011919712,0.05967463,0.0017862936,0.00025467123,0.00015756478,0.00003563,0.00019604241,0.0075521646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977558,0.0011585089,0.00009799103,0.00014639019,0.0005686231,0.00027267614],"domain_scores_gemma":[0.98878026,0.0059343386,0.0012688689,0.0016800342,0.0014587331,0.00087768596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004333273,0.00067824154,0.00028812065,0.0006110741,0.0014045795,0.0035735029,0.0017933924,0.0012579102,0.0019492074],"category_scores_gemma":[0.02092427,0.00035885943,0.0005475889,0.00042316873,0.0042148414,0.007886636,0.0038600601,0.0032773332,0.000380687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007164306,0.00020634873,0.008065358,0.00056039804,0.00012802481,0.0016107304,0.011495727,0.03667349,0.008502735,0.79007745,0.01900338,0.12295981],"study_design_scores_gemma":[0.00031043682,0.0007451134,0.0030546777,0.00038113075,0.00026928735,0.0017663295,0.005191692,0.21194747,0.025911706,0.5884698,0.1616664,0.00028590384],"about_ca_topic_score_codex":0.002579693,"about_ca_topic_score_gemma":0.0042308946,"teacher_disagreement_score":0.004333273,"about_ca_system_score_codex":0.0014774716,"about_ca_system_score_gemma":0.0017447377,"threshold_uncertainty_score":0.022916794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47973657,0.005417469,0.50675404,0.0007335192,0.0001151881,0.00012434556,0.00013250434,0.0014148523,0.0055715246],"genre_scores_gemma":[0.9744572,0.0003642867,0.023971269,0.0000341851,0.000022553144,0.000024445255,0.000036055462,0.000023182009,0.001066907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968505,0.000089943445,0.000021069956,0.000054460103,0.00009319785,0.000056304933],"domain_scores_gemma":[0.99930406,0.0004002764,0.000054055326,0.000053142012,0.00015073834,0.00003771342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039083257,0.00036475502,0.00051707105,0.00038037865,0.0005227398,0.0004455574,0.00061261473,0.00056199945,0.00057414256],"category_scores_gemma":[0.0016554388,0.0002921464,0.000104810795,0.0006091398,0.00028743446,0.00070221623,0.00038419646,0.0003230947,0.00013742341],"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.0006734185,0.0001891689,0.0045712222,0.00025020642,0.000040861436,0.0005405247,0.00022659736,0.7326518,0.046079475,0.0071229,0.0035199933,0.20413381],"study_design_scores_gemma":[0.000018257466,0.000065111264,0.00052757486,0.000004594956,0.00000921899,0.00006901976,0.000036442485,0.99144137,0.00455172,0.002444599,0.0008221849,0.000009917508],"about_ca_topic_score_codex":0.004876468,"about_ca_topic_score_gemma":0.005086913,"teacher_disagreement_score":0.004876468,"about_ca_system_score_codex":0.00065302406,"about_ca_system_score_gemma":0.0006254605,"threshold_uncertainty_score":0.009696186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7214984,0.0026598845,0.25603843,0.0005796896,0.00012584569,0.00012866686,0.00007449131,0.0093271015,0.009567493],"genre_scores_gemma":[0.97338223,0.0003915561,0.022717547,0.00006235059,0.000042273583,0.000029979003,0.00010842708,0.0001629418,0.0031028034],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854773,0.00019191255,0.00010635171,0.0001938005,0.0007557857,0.00020448164],"domain_scores_gemma":[0.995908,0.0015403894,0.00037884177,0.0012825859,0.00069834676,0.00019185754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001186349,0.0005653153,0.0010430779,0.0007757328,0.0007156763,0.001588551,0.0010020946,0.0007547358,0.0014854154],"category_scores_gemma":[0.007124798,0.00022789702,0.00028355364,0.0009806528,0.00075589813,0.002292906,0.0013131484,0.00075225846,0.0008584559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026998033,0.00049802655,0.0032845263,0.00038785642,0.00014321443,0.0012419006,0.0006840767,0.12983534,0.4826066,0.005118189,0.0046069524,0.36889356],"study_design_scores_gemma":[0.00013230887,0.0013577167,0.0032808697,0.000018701054,0.00009283071,0.00201083,0.00030253254,0.7101903,0.2719786,0.0044104154,0.0061295424,0.00009542718],"about_ca_topic_score_codex":0.001758084,"about_ca_topic_score_gemma":0.0013091791,"teacher_disagreement_score":0.001758084,"about_ca_system_score_codex":0.0006684946,"about_ca_system_score_gemma":0.0005713206,"threshold_uncertainty_score":0.006274104},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025058227,0.0030982485,0.89351726,0.0014608846,0.0007989467,0.0011894307,0.0012105732,0.044294663,0.029371755],"genre_scores_gemma":[0.30298394,0.0034142744,0.66069365,0.00072937674,0.00043471696,0.0012499001,0.0031057796,0.0012416076,0.026146786],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993524,0.00018252614,0.000037119196,0.000108740394,0.00027069394,0.000048556125],"domain_scores_gemma":[0.9992693,0.0002050989,0.0000834096,0.00017170681,0.00018636447,0.00008425048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460076,0.00061496877,0.0005498493,0.00085872505,0.0011023592,0.0011387847,0.0018229123,0.0007297756,0.0052513033],"category_scores_gemma":[0.002521387,0.0003593053,0.00027509363,0.0010824719,0.00067324156,0.0017728606,0.001487072,0.0012422114,0.0021840432],"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.0010623978,0.00039064934,0.0015071176,0.0013875983,0.0001701327,0.0010762843,0.00043885122,0.08278036,0.054785866,0.11305905,0.13558836,0.6077532],"study_design_scores_gemma":[0.00028387885,0.00064889237,0.0008285557,0.000069284324,0.00011182515,0.001191484,0.00010240556,0.5908586,0.027110234,0.033505566,0.3451204,0.00016890393],"about_ca_topic_score_codex":0.0020125848,"about_ca_topic_score_gemma":0.0032129302,"teacher_disagreement_score":0.0052513033,"about_ca_system_score_codex":0.00051892013,"about_ca_system_score_gemma":0.0010572502,"threshold_uncertainty_score":0.017567396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2065066,0.00059209944,0.7877108,0.00029513342,0.00010794734,0.000062779196,0.00011665747,0.0021090596,0.002498942],"genre_scores_gemma":[0.8937529,0.00018197983,0.104973,0.000049959057,0.000030159652,0.0000326724,0.000116707364,0.00008121693,0.0007813406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521,0.00096829695,0.0002787496,0.00075533683,0.002359684,0.0004278987],"domain_scores_gemma":[0.97402936,0.012784266,0.0027252934,0.0053673093,0.0046498124,0.000444012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036706093,0.0008165105,0.0011810451,0.0010806817,0.00054073497,0.0021943925,0.0017004164,0.0011034128,0.00077287765],"category_scores_gemma":[0.027634079,0.00041761683,0.0003041333,0.0013007877,0.00086142257,0.00321193,0.0016367947,0.0017017922,0.00050163455],"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.00087698223,0.0001299707,0.012922272,0.00019531856,0.000093178736,0.00029599576,0.00036209243,0.8056739,0.026126826,0.0150625575,0.0017302706,0.13653062],"study_design_scores_gemma":[0.000014547087,0.00005999956,0.0008985899,0.000008763128,0.000009661768,0.0001107862,0.000036788042,0.98330194,0.0122463545,0.0028553058,0.0004354456,0.000021748974],"about_ca_topic_score_codex":0.003885139,"about_ca_topic_score_gemma":0.0020193732,"teacher_disagreement_score":0.003885139,"about_ca_system_score_codex":0.0016313469,"about_ca_system_score_gemma":0.001983504,"threshold_uncertainty_score":0.01941222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7499383,0.0016494597,0.22965722,0.0006595451,0.00008611673,0.0002343379,0.000171324,0.0022429998,0.015360703],"genre_scores_gemma":[0.9808818,0.00015676537,0.015796734,0.00006316244,0.000024898301,0.000056014982,0.00006277594,0.00014306478,0.0028148892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880576,0.00028133419,0.00005876392,0.0002133166,0.00033150282,0.00030932657],"domain_scores_gemma":[0.9970541,0.0014515345,0.00040535367,0.00029414074,0.00056443707,0.00023040255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010057794,0.0010444899,0.00087676325,0.0004940357,0.0005846427,0.0018328523,0.0017342361,0.0008180502,0.0022430685],"category_scores_gemma":[0.0054593342,0.0005073666,0.0002550626,0.0005840356,0.0006010085,0.0023738558,0.0009525392,0.0007357941,0.00070831843],"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.00083816214,0.00064143556,0.003234145,0.00019064858,0.0000398174,0.00020507435,0.000258235,0.82889956,0.05843024,0.006930795,0.0023086716,0.09802321],"study_design_scores_gemma":[0.00004714695,0.00023123478,0.0008732803,0.000007720862,0.000023970006,0.000057613146,0.00016793289,0.97200376,0.02313224,0.0025749356,0.00086210354,0.000018152099],"about_ca_topic_score_codex":0.002291339,"about_ca_topic_score_gemma":0.0034659097,"teacher_disagreement_score":0.002291339,"about_ca_system_score_codex":0.0013766092,"about_ca_system_score_gemma":0.0015917722,"threshold_uncertainty_score":0.0099880695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34708315,0.0033615318,0.624508,0.004144075,0.0006268467,0.00030110095,0.00011806563,0.0038448793,0.016012322],"genre_scores_gemma":[0.9767889,0.00047716126,0.019794958,0.00038385615,0.00015026334,0.00004163309,0.00006883311,0.00013125288,0.0021632072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671715,0.00097378454,0.00011784068,0.00043654835,0.0012964671,0.000458141],"domain_scores_gemma":[0.98939615,0.006108906,0.0008499809,0.0016385732,0.0014802082,0.0005261294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035001177,0.00077364914,0.0012312451,0.000971621,0.0020227174,0.0021136578,0.0014259781,0.0023853693,0.0013301268],"category_scores_gemma":[0.019082582,0.0004697709,0.0003969067,0.00093391596,0.002059216,0.0041100993,0.0033935083,0.0026730974,0.00042054598],"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.0036261268,0.0007735826,0.013550513,0.0004257046,0.0004014425,0.0019680872,0.0016516659,0.4453799,0.07102653,0.12850498,0.024796406,0.307895],"study_design_scores_gemma":[0.00007594642,0.00024186251,0.00087619154,0.00002496261,0.00005305394,0.00045099572,0.00029019656,0.9282249,0.011564687,0.053311385,0.0048602903,0.000025470179],"about_ca_topic_score_codex":0.0014749421,"about_ca_topic_score_gemma":0.0011344046,"teacher_disagreement_score":0.0035001177,"about_ca_system_score_codex":0.0009221661,"about_ca_system_score_gemma":0.0009460894,"threshold_uncertainty_score":0.01851064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011113553,0.0005570888,0.9820936,0.00025959715,0.00008481366,0.00028203012,0.00013648819,0.003278639,0.0021943299],"genre_scores_gemma":[0.14172907,0.0004181515,0.8533054,0.0001374414,0.00007215669,0.00032432075,0.00043810616,0.00021370864,0.0033616626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944586,0.00012969322,0.000039943923,0.00007088247,0.00025163326,0.00006196929],"domain_scores_gemma":[0.9991073,0.00035739708,0.000086627944,0.0001499407,0.0002309834,0.00006776472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011329725,0.00064921664,0.0008831111,0.0012701664,0.0012370498,0.00085001026,0.0020670108,0.0013154335,0.0017143323],"category_scores_gemma":[0.0034127887,0.0003123852,0.000377939,0.0012344073,0.0005839209,0.0026872095,0.0016753282,0.0006551985,0.00092021626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042618837,0.00023843018,0.0012230722,0.00037822052,0.000105420426,0.0004758902,0.0003962085,0.23797059,0.032092836,0.042924345,0.02553694,0.65823185],"study_design_scores_gemma":[0.00010108877,0.000121500576,0.00030026145,0.000025857496,0.000026513817,0.00036469055,0.00008133059,0.9423339,0.010869535,0.02222146,0.02351282,0.000041049425],"about_ca_topic_score_codex":0.0025378861,"about_ca_topic_score_gemma":0.0028621748,"teacher_disagreement_score":0.0025378861,"about_ca_system_score_codex":0.00057101465,"about_ca_system_score_gemma":0.0010825936,"threshold_uncertainty_score":0.0059918165},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31939015,0.010061649,0.6447985,0.004170658,0.0002642438,0.00034035096,0.0002921578,0.0004460235,0.020236256],"genre_scores_gemma":[0.96808696,0.003404057,0.025335869,0.00011951587,0.00039061363,0.00015588192,0.00010042768,0.000048526614,0.0023582361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969408,0.0012254927,0.0001425019,0.00050127076,0.000911813,0.0002781155],"domain_scores_gemma":[0.9823,0.013242104,0.0014581819,0.0011811234,0.0010763602,0.00074223505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002693836,0.0007069113,0.0011960639,0.00179925,0.002445204,0.0026268999,0.0017111413,0.0019879437,0.0019311045],"category_scores_gemma":[0.021692542,0.0005758294,0.0005485558,0.0018141001,0.003217885,0.007543246,0.002793881,0.0017127743,0.00045945655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002679945,0.00029424627,0.009486314,0.00062100636,0.00014350595,0.0020084614,0.00295371,0.4430702,0.0086942585,0.46007589,0.0038125166,0.06857194],"study_design_scores_gemma":[0.000029282171,0.00017042675,0.0020264268,0.000051871946,0.000049892136,0.00050186407,0.00044674403,0.8415965,0.001130442,0.14848842,0.005448564,0.00005957627],"about_ca_topic_score_codex":0.0029718038,"about_ca_topic_score_gemma":0.0019687957,"teacher_disagreement_score":0.0029718038,"about_ca_system_score_codex":0.0016603156,"about_ca_system_score_gemma":0.00084320415,"threshold_uncertainty_score":0.014246523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014059181,0.0008747032,0.9743478,0.0015376862,0.00012254166,0.0002340461,0.00019032242,0.002473734,0.0061599254],"genre_scores_gemma":[0.3899499,0.0020635088,0.59740835,0.0008161908,0.00044172435,0.0006521941,0.0007378341,0.0011968358,0.0067335265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.97861814,0.0073896386,0.0033542512,0.0019386776,0.0077731316,0.00092621223],"domain_scores_gemma":[0.96560884,0.019795056,0.0026992275,0.008001243,0.0031876666,0.000708006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0185618,0.0009170006,0.0015269818,0.0013336265,0.0016372248,0.01201242,0.0037018394,0.002297585,0.0030966704],"category_scores_gemma":[0.038200088,0.0013267279,0.0014522467,0.0022998224,0.0034089407,0.012469684,0.0037082408,0.0042775325,0.0013557632],"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.0006151758,0.0002910955,0.0024238683,0.001689403,0.00017339522,0.000777707,0.0041650967,0.06579639,0.03644088,0.69407696,0.007279262,0.1862708],"study_design_scores_gemma":[0.00023622211,0.0003555126,0.0009158762,0.00035355764,0.00030721608,0.0013423548,0.0010556369,0.39567572,0.036481608,0.4596424,0.103416696,0.00021716637],"about_ca_topic_score_codex":0.0019734635,"about_ca_topic_score_gemma":0.0012042485,"teacher_disagreement_score":0.0185618,"about_ca_system_score_codex":0.00233258,"about_ca_system_score_gemma":0.0026718853,"threshold_uncertainty_score":0.09816533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049798,0.00006467284,0.088081196,0.00007294178,0.000028961264,0.00026880435,0.000047554553,0.00024705462,0.0062089977],"genre_scores_gemma":[0.98580825,0.000029630477,0.01315387,0.000011889271,0.0000033118308,0.0000685913,0.000029570265,0.000022652554,0.0008722667],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987527,0.00043609948,0.000065765555,0.00018759536,0.00035842607,0.00019948673],"domain_scores_gemma":[0.99507314,0.0031054928,0.0004118669,0.0005920869,0.00056466466,0.00025273435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012745236,0.0006575646,0.00032950842,0.00036771994,0.0003884288,0.0010250879,0.001476518,0.00037328107,0.005413361],"category_scores_gemma":[0.007830464,0.00019675569,0.0004192602,0.00022960344,0.0009133079,0.0024439471,0.0012586615,0.0006515184,0.0002835834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017256819,0.005339023,0.03358877,0.0014124787,0.00045168397,0.0012803029,0.0028473868,0.31646323,0.31785625,0.09720245,0.0011911187,0.20511056],"study_design_scores_gemma":[0.0006067923,0.007693155,0.008336283,0.000058430393,0.00020143104,0.00044714625,0.0011998428,0.80440336,0.1546577,0.018649664,0.003638969,0.00010723693],"about_ca_topic_score_codex":0.0025139793,"about_ca_topic_score_gemma":0.0014013634,"teacher_disagreement_score":0.005413361,"about_ca_system_score_codex":0.00053057657,"about_ca_system_score_gemma":0.0007929497,"threshold_uncertainty_score":0.0181095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93526846,0.0011975385,0.060937967,0.000351287,0.000029737806,0.00013694531,0.00024855506,0.00028146987,0.001547967],"genre_scores_gemma":[0.9845584,0.00022246348,0.014511471,0.000018296823,0.0000203756,0.00006595358,0.00034646303,0.00003779072,0.00021879967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951757,0.0021200345,0.00034785774,0.0006123604,0.0014646874,0.0002794304],"domain_scores_gemma":[0.8617236,0.11441564,0.008485704,0.007311191,0.006860634,0.0012031586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010902291,0.00064265914,0.0007202661,0.0019331237,0.00080979447,0.0010379213,0.0016176346,0.0012513454,0.00075800874],"category_scores_gemma":[0.082700685,0.00037248305,0.00035490107,0.0018665431,0.0012366769,0.0022424092,0.0006802059,0.0013238683,0.00016218926],"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.00077694206,0.0009969486,0.13584581,0.00047480836,0.00029680305,0.00027576802,0.0008171127,0.73851645,0.007009936,0.014061964,0.002474973,0.09845251],"study_design_scores_gemma":[0.00003287385,0.00039682732,0.02229838,0.000020265456,0.000035199002,0.00024141918,0.00021018917,0.96913075,0.0028626963,0.004111217,0.0006260397,0.000034199307],"about_ca_topic_score_codex":0.0026712345,"about_ca_topic_score_gemma":0.0017532611,"teacher_disagreement_score":0.010902291,"about_ca_system_score_codex":0.001560277,"about_ca_system_score_gemma":0.00072894216,"threshold_uncertainty_score":0.05765748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99251103,0.00006424844,0.006657886,0.000035656216,0.0000055968426,0.000025295547,0.00013877277,0.00011465029,0.00044689255],"genre_scores_gemma":[0.9969177,0.000036020258,0.0026716935,0.000010109122,0.000004677717,0.000016820544,0.00023083267,0.000009324299,0.00010291214],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987889,0.00037202233,0.00006269566,0.00029117914,0.000385765,0.00009942669],"domain_scores_gemma":[0.993916,0.0029902104,0.00078434276,0.0008718411,0.0010735816,0.00036406875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093260704,0.00026432905,0.00054704736,0.00085917773,0.0005168947,0.00043854027,0.00069594645,0.00056360336,0.0002268921],"category_scores_gemma":[0.006507712,0.0001914282,0.00018131227,0.0010628003,0.00056129816,0.0011623163,0.0004948753,0.00063825515,0.00008610133],"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.0010965763,0.0014606579,0.4637696,0.0004963339,0.00047786935,0.0015998157,0.004478112,0.19577841,0.19936983,0.005010352,0.002484561,0.123977885],"study_design_scores_gemma":[0.000042438387,0.0012388041,0.25708804,0.000028074386,0.00007696854,0.0012823046,0.0010844057,0.67252237,0.06319606,0.0015346922,0.001797472,0.00010842841],"about_ca_topic_score_codex":0.0019542975,"about_ca_topic_score_gemma":0.0012624309,"teacher_disagreement_score":0.0019542975,"about_ca_system_score_codex":0.00047918464,"about_ca_system_score_gemma":0.00022385753,"threshold_uncertainty_score":0.004932165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073284516,0.0032179446,0.97841656,0.0004861331,0.0005561061,0.00021773587,0.00024953685,0.0013551806,0.008172411],"genre_scores_gemma":[0.22889228,0.0063685765,0.73621833,0.00044652165,0.00075899856,0.00040207367,0.0012456545,0.00036132886,0.025306271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983347,0.00033157787,0.00015201312,0.0003796872,0.0006505658,0.00015161165],"domain_scores_gemma":[0.99806124,0.00042507393,0.0001259052,0.0005886368,0.0007091511,0.000090018315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418576,0.0007594393,0.0016329755,0.0018421868,0.0013910898,0.0023365926,0.002239474,0.0010363207,0.0050931135],"category_scores_gemma":[0.0047636516,0.0004642544,0.00074325973,0.0031358849,0.0010821775,0.0056517827,0.0018302796,0.001414434,0.0020233912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052820425,0.00010005939,0.0013253409,0.00048466798,0.00011833539,0.00019483396,0.0004086893,0.06364774,0.010012708,0.16947947,0.026542561,0.7271574],"study_design_scores_gemma":[0.00025728557,0.0004918728,0.00072714133,0.00012931056,0.00014584325,0.0014677121,0.00029361364,0.76610625,0.02439731,0.070252255,0.13556202,0.00016941493],"about_ca_topic_score_codex":0.0038550724,"about_ca_topic_score_gemma":0.0024567856,"teacher_disagreement_score":0.0050931135,"about_ca_system_score_codex":0.0011734387,"about_ca_system_score_gemma":0.0020714882,"threshold_uncertainty_score":0.017038226},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06456272,0.113884546,0.2558747,0.48420134,0.001567073,0.0003100468,0.00013871466,0.0011336942,0.07832718],"genre_scores_gemma":[0.75072634,0.090163186,0.12797797,0.0083428705,0.004491208,0.0003230609,0.0001626078,0.00028230902,0.017530354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867438,0.0055531366,0.0009016252,0.00087644486,0.0050327713,0.00089228764],"domain_scores_gemma":[0.966203,0.020612769,0.0017393716,0.0033522581,0.0058883275,0.0022042536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018461393,0.00063244184,0.0011500366,0.0018051948,0.0047164126,0.014509891,0.0036107546,0.0072085587,0.0036903992],"category_scores_gemma":[0.021602388,0.000759478,0.0006744302,0.0030740793,0.009358883,0.02666212,0.00634216,0.005711226,0.0021347813],"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.000118635915,0.00023117919,0.0032502958,0.0012938343,0.000045716326,0.0005617606,0.002586911,0.013681727,0.0017147925,0.58378035,0.022490477,0.37024435],"study_design_scores_gemma":[0.00007058285,0.00020253911,0.0016944391,0.0015811301,0.000048874994,0.002232434,0.008751012,0.044815507,0.0035293514,0.741936,0.19499364,0.00014444522],"about_ca_topic_score_codex":0.002382532,"about_ca_topic_score_gemma":0.0013444301,"teacher_disagreement_score":0.018461393,"about_ca_system_score_codex":0.0036479656,"about_ca_system_score_gemma":0.0047785547,"threshold_uncertainty_score":0.097634315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03830242,0.00065613195,0.9453575,0.00022853976,0.000098213335,0.00012509839,0.000052763182,0.0027258792,0.012453502],"genre_scores_gemma":[0.6242842,0.00065632357,0.35871637,0.00014654883,0.00008119193,0.00017244616,0.00019960922,0.000117319476,0.015625905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998029,0.000039187013,0.000009047072,0.00006538401,0.00006091677,0.00002256224],"domain_scores_gemma":[0.99977547,0.000043577675,0.000020316704,0.000036080815,0.000083941304,0.000040669827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030397187,0.0003380595,0.00030391885,0.00031704298,0.00049684936,0.0007148369,0.0011957347,0.0006452768,0.0022825294],"category_scores_gemma":[0.00053652615,0.00020152575,0.0002192231,0.00031408592,0.0003049399,0.00083404296,0.0007115178,0.00052977906,0.0005403998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072820694,0.00029238264,0.002531702,0.000302418,0.00010631959,0.0012083944,0.0005440716,0.28624937,0.20594046,0.072124094,0.011793742,0.41817892],"study_design_scores_gemma":[0.00006469778,0.00025446713,0.0009225106,0.000026093288,0.000053743504,0.0006044825,0.00006539945,0.93430406,0.028305564,0.007787377,0.027555494,0.00005606462],"about_ca_topic_score_codex":0.0031113725,"about_ca_topic_score_gemma":0.0037993416,"teacher_disagreement_score":0.0031113725,"about_ca_system_score_codex":0.0005879113,"about_ca_system_score_gemma":0.00056788564,"threshold_uncertainty_score":0.007635832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32725912,0.0004853951,0.65396565,0.001357338,0.00013699061,0.00023625245,0.00006478042,0.0019493377,0.014545221],"genre_scores_gemma":[0.8662895,0.00014998559,0.12969862,0.00010917982,0.00005410553,0.000062301464,0.00007840989,0.00006370401,0.003494127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993511,0.0002350255,0.000031751537,0.00008309312,0.00024383307,0.000055096632],"domain_scores_gemma":[0.9982015,0.00042517376,0.00021629008,0.00063686783,0.00028097234,0.00023911512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649201,0.00020032647,0.00037784284,0.00063231826,0.0008786421,0.0013028925,0.0008013761,0.000614025,0.0009918668],"category_scores_gemma":[0.0032441171,0.00022083007,0.00018877603,0.0004986155,0.0008451331,0.0016811338,0.0024661382,0.0005452101,0.0003061021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087454636,0.00038406896,0.0094346395,0.00046545573,0.00014991309,0.0011499285,0.0044058193,0.20563324,0.17832726,0.20662865,0.013346251,0.37920028],"study_design_scores_gemma":[0.0001710782,0.0005920003,0.0039048886,0.000056256846,0.00012387316,0.0007671801,0.00067332684,0.8227578,0.02741956,0.075539,0.06790844,0.00008660219],"about_ca_topic_score_codex":0.00093223085,"about_ca_topic_score_gemma":0.0009881661,"teacher_disagreement_score":0.0013028925,"about_ca_system_score_codex":0.0004507388,"about_ca_system_score_gemma":0.0005675777,"threshold_uncertainty_score":0.0056319237},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030982776,0.0032395045,0.9303191,0.0007959234,0.0005504807,0.0004547209,0.0010157401,0.022608384,0.010033436],"genre_scores_gemma":[0.27285433,0.003104626,0.68901485,0.00043431853,0.0003678025,0.00049245014,0.0037776215,0.0009186591,0.029035252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964,0.000076935336,0.0000268013,0.00003883415,0.00018310579,0.00003431271],"domain_scores_gemma":[0.99931216,0.00019355972,0.000041704938,0.00020344148,0.00014864704,0.00010044476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097080716,0.00036155543,0.0010568253,0.0012258049,0.00074517843,0.0011161258,0.0013223548,0.00061552646,0.0048673158],"category_scores_gemma":[0.0020324374,0.00037232577,0.00028430644,0.0015457525,0.00026062116,0.0027453601,0.0019444645,0.0007974705,0.0017703064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007489029,0.00034064133,0.001034962,0.0005596235,0.00015030608,0.00040127328,0.00033338086,0.03256343,0.04705755,0.022028409,0.09017723,0.80460435],"study_design_scores_gemma":[0.0004725742,0.00061728124,0.0019494052,0.00007443976,0.00021182891,0.0007871405,0.0002619138,0.7379613,0.030382497,0.06649683,0.16064839,0.00013643081],"about_ca_topic_score_codex":0.0016930954,"about_ca_topic_score_gemma":0.004375682,"teacher_disagreement_score":0.0048673158,"about_ca_system_score_codex":0.00044274025,"about_ca_system_score_gemma":0.00089832826,"threshold_uncertainty_score":0.016282797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32592115,0.00035121618,0.67089,0.0003547452,0.000024102701,0.000040336065,0.000042459873,0.00026330716,0.0021126447],"genre_scores_gemma":[0.9784904,0.00010203967,0.020974828,0.00002543461,0.000009582883,0.00001378103,0.000014956515,0.000008948318,0.00035995152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989285,0.0004883652,0.00006581164,0.00011300486,0.0002896143,0.000114618924],"domain_scores_gemma":[0.9961461,0.0022898184,0.00059110776,0.0005338321,0.00030316584,0.00013591375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023712318,0.00019716905,0.0004858873,0.0004969498,0.0006357327,0.0009230043,0.0008820527,0.00077630143,0.0004141406],"category_scores_gemma":[0.0071140183,0.00030002795,0.00030442807,0.0004413926,0.00088165863,0.0021409122,0.0010232744,0.00039599737,0.00007346625],"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.00053915096,0.00012797338,0.0052742832,0.0001758002,0.00009983881,0.0009462872,0.0011722809,0.68947256,0.039114974,0.21006052,0.0011108351,0.05190551],"study_design_scores_gemma":[0.000023486027,0.00006998011,0.00042625293,0.0000072308912,0.000019332716,0.000093301256,0.00007072005,0.9537304,0.0028783,0.042078596,0.0005918314,0.000010451262],"about_ca_topic_score_codex":0.0008521362,"about_ca_topic_score_gemma":0.000607587,"teacher_disagreement_score":0.0023712318,"about_ca_system_score_codex":0.00078905467,"about_ca_system_score_gemma":0.0003629025,"threshold_uncertainty_score":0.01254046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04555397,0.0011977026,0.9481881,0.00056329323,0.00007026256,0.00018786658,0.00041891268,0.0009792323,0.0028406142],"genre_scores_gemma":[0.38548416,0.0009125089,0.60978454,0.00015003893,0.000108437445,0.00030258272,0.0009813315,0.00021178948,0.0020646376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921584,0.00022328505,0.00006207301,0.00017511076,0.00020467253,0.000119016106],"domain_scores_gemma":[0.9974256,0.0015780833,0.00030428535,0.00032529535,0.00025488035,0.00011175184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015189947,0.0010423795,0.0011662124,0.0011709131,0.0012253609,0.0011346807,0.0022984901,0.0012843687,0.0017243121],"category_scores_gemma":[0.0069544865,0.00048454324,0.0007479435,0.0016352758,0.0005412406,0.0030681153,0.0015786331,0.0010658767,0.00034968735],"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.0003417965,0.00019795101,0.0018510782,0.0004638508,0.00010467049,0.00009970531,0.000330456,0.7825409,0.007598386,0.05277767,0.008213057,0.14548045],"study_design_scores_gemma":[0.00006286434,0.00006602423,0.00027672524,0.00002120742,0.000023529925,0.00007750711,0.00008239031,0.94253284,0.0023314452,0.05139268,0.0031218424,0.000010874364],"about_ca_topic_score_codex":0.0021581387,"about_ca_topic_score_gemma":0.0027720807,"teacher_disagreement_score":0.0022984901,"about_ca_system_score_codex":0.0019915625,"about_ca_system_score_gemma":0.0011532508,"threshold_uncertainty_score":0.014449835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029232278,0.0006324396,0.9642896,0.000820033,0.000083725805,0.00014426387,0.000061145314,0.00063923455,0.004097247],"genre_scores_gemma":[0.49268138,0.0015019416,0.5010122,0.00019219151,0.00014850798,0.0002865023,0.00027038134,0.0001301521,0.0037767037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980106,0.00081035175,0.000110599336,0.0003450558,0.0005981793,0.0001251832],"domain_scores_gemma":[0.99738556,0.0011831446,0.0002894746,0.000647022,0.00035589808,0.00013889567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002427759,0.0004578042,0.001030733,0.0010143651,0.002219682,0.0019692418,0.00194255,0.0017312774,0.0008339865],"category_scores_gemma":[0.006591767,0.0005626351,0.00063551095,0.001930554,0.0020596676,0.00456072,0.0018255163,0.0009765872,0.0004331913],"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.00009701816,0.00013356443,0.0012562599,0.00027876033,0.000104736995,0.00027116598,0.0006422651,0.6357864,0.010065628,0.22808045,0.0042133,0.11907054],"study_design_scores_gemma":[0.00004491976,0.00006219184,0.00053223694,0.000019479725,0.00003491302,0.00015370274,0.00019353506,0.8117894,0.00479508,0.16937812,0.01294387,0.000052534106],"about_ca_topic_score_codex":0.005450148,"about_ca_topic_score_gemma":0.0046343324,"teacher_disagreement_score":0.005450148,"about_ca_system_score_codex":0.0015994704,"about_ca_system_score_gemma":0.0021200196,"threshold_uncertainty_score":0.012839377},"labels":[],"label_agreement":null},{"id":"W2125948488","doi":"10.1007/s12083-007-0007-x","title":"An inexpensive unstructured platform for wireless mobile peer-to-peer networks","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gossip; Peer-to-peer; Wireless; Computer network; Distributed computing; Robustness (evolution); Wireless network; Mobile device; Gossip protocol; Bandwidth (computing); Exploit; Mobile computing; Computer security; Operating system","score_opus":0.02363411094292499,"score_gpt":0.2832382619596718,"score_spread":0.2596041510167468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125948488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097975135,0.0014700352,0.80193305,0.00090410473,0.0028925887,0.002196303,0.0017892723,0.041288152,0.049551304],"genre_scores_gemma":[0.39815688,0.0010849668,0.49929932,0.0006353867,0.0007455457,0.0020103622,0.0038071396,0.0020299943,0.09223041],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902415,0.00009235602,0.00004493786,0.000109643806,0.0006199364,0.00010910589],"domain_scores_gemma":[0.9987871,0.00019580808,0.00008622324,0.00038878748,0.0002833689,0.00025876262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924558,0.00058685266,0.0008181761,0.0009842719,0.0010025206,0.0011386757,0.0027772842,0.0009014214,0.014327722],"category_scores_gemma":[0.0020979603,0.0004309626,0.00034422762,0.0007228454,0.00036759797,0.0020110444,0.0030345283,0.0010097403,0.0073188283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024344749,0.0010204613,0.0013602498,0.00126306,0.00011219321,0.0015117094,0.0004311968,0.014092079,0.44878128,0.044864632,0.088582404,0.39554623],"study_design_scores_gemma":[0.00085289165,0.0030792467,0.003139671,0.00016238433,0.00028759614,0.002032615,0.00029948767,0.23835726,0.23631819,0.03885035,0.4762382,0.0003821726],"about_ca_topic_score_codex":0.0006508711,"about_ca_topic_score_gemma":0.00083772,"teacher_disagreement_score":0.014327722,"about_ca_system_score_codex":0.00036530418,"about_ca_system_score_gemma":0.0006402322,"threshold_uncertainty_score":0.047931075},"labels":[],"label_agreement":null},{"id":"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20933354,0.02910822,0.20229729,0.28923944,0.0048766644,0.00025978274,0.00064129476,0.002269255,0.26197454],"genre_scores_gemma":[0.9381272,0.01086539,0.0330423,0.004003013,0.00051155785,0.00007641669,0.000116459225,0.00016792052,0.013089724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994295,0.00016276128,0.000010292755,0.000053075848,0.00017823008,0.0001660872],"domain_scores_gemma":[0.99860626,0.000733916,0.00006129873,0.00012637296,0.00031972982,0.00015243051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001149127,0.0005678459,0.00046560683,0.00039977484,0.0012534276,0.0026898447,0.0012584206,0.0025411523,0.005559948],"category_scores_gemma":[0.004818827,0.00017085666,0.00035392516,0.0008851185,0.0012142411,0.008568853,0.0008676478,0.0014823385,0.0014466385],"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.00040563993,0.00050084427,0.005432177,0.0005745785,0.00011936966,0.0007592292,0.00060425594,0.07798083,0.005393389,0.54547024,0.10358924,0.25917032],"study_design_scores_gemma":[0.0001033279,0.00015743758,0.0013950252,0.00015907086,0.000041326333,0.00026232892,0.0013754809,0.19249636,0.0044361725,0.6691398,0.13035288,0.00008074414],"about_ca_topic_score_codex":0.008388279,"about_ca_topic_score_gemma":0.011124473,"teacher_disagreement_score":0.008388279,"about_ca_system_score_codex":0.0012429387,"about_ca_system_score_gemma":0.0017970179,"threshold_uncertainty_score":0.018599868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04171071,0.00035067854,0.9500219,0.00020387163,0.000092842165,0.000106794665,0.000039345527,0.0050403723,0.002433502],"genre_scores_gemma":[0.7110177,0.00022270056,0.28236702,0.0001343777,0.000082681254,0.00019298066,0.00018396915,0.00016518668,0.0056334375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956423,0.000092385686,0.00003327906,0.00008213725,0.00016701435,0.000060926744],"domain_scores_gemma":[0.9992298,0.0001260763,0.000060724768,0.00022314023,0.00022588922,0.00013441911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065988593,0.0004307061,0.00042228925,0.0004190932,0.00083082885,0.0012298011,0.002432234,0.00072848593,0.0016981848],"category_scores_gemma":[0.001534785,0.00026228384,0.00024189887,0.00043950073,0.00047991943,0.0021153693,0.0015405987,0.0007686807,0.00046844143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013326103,0.0005248799,0.0035657315,0.00033905377,0.00021050399,0.000812839,0.0011869562,0.26085013,0.15842868,0.08425424,0.017437523,0.47105676],"study_design_scores_gemma":[0.00009201642,0.00041810249,0.00080865907,0.000014483358,0.00007500719,0.0003570287,0.00013255925,0.9304748,0.029742712,0.017702857,0.020098489,0.00008322811],"about_ca_topic_score_codex":0.002257407,"about_ca_topic_score_gemma":0.0022669253,"teacher_disagreement_score":0.002432234,"about_ca_system_score_codex":0.0009119613,"about_ca_system_score_gemma":0.0010243229,"threshold_uncertainty_score":0.006616831},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032771612,0.0041853474,0.6465567,0.011559879,0.0138802,0.0005137937,0.001762571,0.07220113,0.24606323],"genre_scores_gemma":[0.06271473,0.010442318,0.48913914,0.012338049,0.01295311,0.001474095,0.0054670176,0.0416354,0.36383614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949663,0.0012418452,0.00039532522,0.0008935037,0.002063511,0.00043946583],"domain_scores_gemma":[0.9874791,0.0041043865,0.0008959855,0.0040722745,0.0019700085,0.0014783556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00671683,0.0009886472,0.0007512344,0.0025025012,0.002044346,0.011224063,0.003298465,0.0026611455,0.073657736],"category_scores_gemma":[0.019916335,0.001242692,0.0012249821,0.0020821888,0.0036850034,0.02312871,0.010154851,0.0064566103,0.04739049],"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.00019269895,0.00009831124,0.0008090978,0.0006905021,0.000028923303,0.00041655,0.0013513163,0.0004976091,0.0035082514,0.5421544,0.19724219,0.25301024],"study_design_scores_gemma":[0.000012684724,0.000025693098,0.000084120955,0.000087766995,0.000008285701,0.0003160795,0.000068606074,0.00055990025,0.0009346995,0.025061164,0.97281903,0.00002189622],"about_ca_topic_score_codex":0.0006764689,"about_ca_topic_score_gemma":0.0006674675,"teacher_disagreement_score":0.073657736,"about_ca_system_score_codex":0.0011509467,"about_ca_system_score_gemma":0.0029294854,"threshold_uncertainty_score":0.24640965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12856188,0.0019271123,0.862945,0.0005969401,0.00014431223,0.00036071334,0.000043808723,0.00083210936,0.0045881514],"genre_scores_gemma":[0.5751414,0.0013638088,0.42024928,0.00017156536,0.00014907248,0.0002948063,0.00007409721,0.000079751444,0.0024761702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993212,0.00025914112,0.000052349165,0.00008154898,0.00023838435,0.000047372254],"domain_scores_gemma":[0.9983577,0.0007215695,0.00012157711,0.00013468543,0.0005244041,0.00013997163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018118635,0.0005733239,0.00060682045,0.0006260447,0.00063668133,0.0010934335,0.0015353112,0.0011461889,0.0010041608],"category_scores_gemma":[0.003937959,0.00029380136,0.00032009286,0.00039457862,0.00054436084,0.002240383,0.0007239073,0.0007413416,0.0004160651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066673756,0.0007221834,0.0051939045,0.00095864275,0.00023750712,0.001265683,0.0020133988,0.32592362,0.13145612,0.12488201,0.0076782014,0.39900205],"study_design_scores_gemma":[0.00018186978,0.00046787114,0.00055091083,0.00003481857,0.00006707187,0.0005128755,0.00030514906,0.9502811,0.013711602,0.022031007,0.01180652,0.00004924795],"about_ca_topic_score_codex":0.0014365785,"about_ca_topic_score_gemma":0.0014247308,"teacher_disagreement_score":0.0018118635,"about_ca_system_score_codex":0.0003329926,"about_ca_system_score_gemma":0.0005196958,"threshold_uncertainty_score":0.009582162},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009496542,0.002293794,0.89615446,0.00077964924,0.0007455468,0.001212673,0.0006895265,0.053359244,0.03526868],"genre_scores_gemma":[0.12778117,0.0036189607,0.76452726,0.0006900136,0.0006040368,0.001964844,0.0032669774,0.0039678016,0.09357897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922895,0.0001480535,0.00008683868,0.00008539247,0.0003673257,0.000083380946],"domain_scores_gemma":[0.9993369,0.00012651461,0.00006203449,0.00012457577,0.0001583073,0.00019162477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009359288,0.00083723076,0.00094758015,0.00081234414,0.0015152162,0.002940038,0.0025504017,0.0020166873,0.00933478],"category_scores_gemma":[0.0025197768,0.0006571117,0.0005569198,0.00072103494,0.0009773052,0.0036397148,0.0029534665,0.0022231815,0.0062071634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010697825,0.000598748,0.001596474,0.0012018866,0.00026998445,0.0016068202,0.002246122,0.019220013,0.041398667,0.27334738,0.19056606,0.46687794],"study_design_scores_gemma":[0.0002766854,0.00025632328,0.0004986782,0.00012526473,0.00013842486,0.00068826583,0.00012298347,0.077811696,0.0134119345,0.02642269,0.88013136,0.00011565885],"about_ca_topic_score_codex":0.0025649336,"about_ca_topic_score_gemma":0.0031893905,"teacher_disagreement_score":0.00933478,"about_ca_system_score_codex":0.00058690354,"about_ca_system_score_gemma":0.0022679274,"threshold_uncertainty_score":0.031227946},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21564116,0.0010293605,0.6657972,0.0012142318,0.0007574015,0.0016434095,0.018263342,0.039405737,0.056248214],"genre_scores_gemma":[0.6353809,0.0009032365,0.33331192,0.00039545697,0.00006955065,0.0021496755,0.010885349,0.0015510386,0.015352933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996629,0.000105145504,0.000025449508,0.00003590534,0.000120592114,0.000050007617],"domain_scores_gemma":[0.99884063,0.0005735555,0.00008154903,0.00013387445,0.00026042436,0.0001100332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470234,0.0006457163,0.0007772586,0.00046966993,0.0005768245,0.0008439034,0.0017987003,0.0012584397,0.0072759604],"category_scores_gemma":[0.0017119014,0.00039497734,0.00063845015,0.0004920353,0.00045029304,0.0008498766,0.0007476485,0.0014683309,0.0015353953],"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.00020387406,0.00019193903,0.0022318328,0.00036528613,0.00009714954,0.0002314187,0.00019843204,0.9324428,0.013690806,0.022701886,0.011535512,0.01610909],"study_design_scores_gemma":[0.00006089417,0.00005402771,0.0001905439,0.000008938498,0.000013375219,0.000031576838,0.000014917948,0.9811018,0.0031947126,0.0024791188,0.012836006,0.000014109031],"about_ca_topic_score_codex":0.0050926404,"about_ca_topic_score_gemma":0.0056353128,"teacher_disagreement_score":0.0072759604,"about_ca_system_score_codex":0.000828897,"about_ca_system_score_gemma":0.0014357934,"threshold_uncertainty_score":0.02434057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07677802,0.0014073963,0.91549206,0.00020420577,0.00010424232,0.00016079677,0.0001114289,0.001061205,0.0046806824],"genre_scores_gemma":[0.7275485,0.0009892175,0.26833108,0.000077514065,0.000061934945,0.00016604045,0.00020874378,0.000040886287,0.0025760604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977535,0.000066479384,0.000013574649,0.000033793858,0.00009228692,0.000018545465],"domain_scores_gemma":[0.9996712,0.00012135929,0.000032647218,0.000058715417,0.00008020029,0.000035830315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041522054,0.00021376197,0.0003228179,0.00037081708,0.0003713224,0.00039250788,0.00064084964,0.0003051301,0.00051018596],"category_scores_gemma":[0.0009515478,0.00010247383,0.00018273162,0.00042725718,0.00023161662,0.0007317035,0.00061298796,0.0002876834,0.00011643182],"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.0004631476,0.00024853591,0.0025803933,0.00063751946,0.00013252746,0.0007026123,0.00033078901,0.21583793,0.20554693,0.048340086,0.005336964,0.5198425],"study_design_scores_gemma":[0.000049429684,0.00044103616,0.0010354358,0.000015419255,0.00006153396,0.0005500522,0.000081100516,0.9462192,0.019320512,0.009196162,0.022984918,0.000045104644],"about_ca_topic_score_codex":0.0011460149,"about_ca_topic_score_gemma":0.0019064577,"teacher_disagreement_score":0.0011460149,"about_ca_system_score_codex":0.0003031852,"about_ca_system_score_gemma":0.00036630206,"threshold_uncertainty_score":0.0022786856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057513397,0.00043591848,0.9841463,0.0002507943,0.00012333036,0.00043979686,0.00009812352,0.0040951176,0.004659376],"genre_scores_gemma":[0.17272414,0.0006275694,0.8194957,0.00014973312,0.00012099191,0.00058571534,0.00040718436,0.00047956384,0.0054093692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872595,0.00025285082,0.00008346847,0.00015404116,0.0006851659,0.00009852938],"domain_scores_gemma":[0.9991529,0.0002590063,0.000055352906,0.00014098281,0.00024676754,0.00014492983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019228332,0.00071464817,0.0008865847,0.0006858697,0.001394087,0.0016522611,0.0038257807,0.001388909,0.0030500004],"category_scores_gemma":[0.0029774336,0.00051014853,0.0006447493,0.00060219364,0.00060613465,0.002547314,0.0016077306,0.001412807,0.00090697734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006743567,0.00059960195,0.0012224977,0.0009869436,0.00020343895,0.0018383174,0.00086502003,0.20372002,0.057255324,0.18059646,0.035494868,0.51654315],"study_design_scores_gemma":[0.00022159799,0.00022205201,0.00040312507,0.00005540224,0.00007302239,0.0007499581,0.000109918146,0.8611645,0.013017152,0.033656854,0.09020272,0.00012364253],"about_ca_topic_score_codex":0.006759377,"about_ca_topic_score_gemma":0.006990579,"teacher_disagreement_score":0.006759377,"about_ca_system_score_codex":0.00093607226,"about_ca_system_score_gemma":0.0015661578,"threshold_uncertainty_score":0.013440073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054580444,0.0002887221,0.98647726,0.0006951948,0.0002094653,0.00022347897,0.00018916793,0.0012270422,0.0052316138],"genre_scores_gemma":[0.26660758,0.0007901075,0.7225027,0.0003957115,0.0001852097,0.00042422873,0.0009644904,0.00019837118,0.007931621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988098,0.0003426668,0.00015578326,0.00019351428,0.00042473443,0.00007355761],"domain_scores_gemma":[0.9989697,0.00020542159,0.00010539243,0.00034606483,0.000298493,0.00007486389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002116391,0.00049367297,0.0006959795,0.0013556437,0.0017691929,0.0019265201,0.0014673749,0.0010774138,0.0017028262],"category_scores_gemma":[0.0033534488,0.00031483482,0.0007338449,0.0016163121,0.0010507321,0.0038135916,0.0019240397,0.0009320883,0.0008523551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019522614,0.00015413231,0.00066148286,0.00023969913,0.00009432618,0.0003286773,0.00049111265,0.097909205,0.020754581,0.6041737,0.018810585,0.25618738],"study_design_scores_gemma":[0.000098420416,0.00021208622,0.00035830788,0.00005325723,0.000116999145,0.0006053485,0.00025362562,0.5391021,0.014434377,0.3296606,0.114958115,0.0001468761],"about_ca_topic_score_codex":0.0022528716,"about_ca_topic_score_gemma":0.004146777,"teacher_disagreement_score":0.0022528716,"about_ca_system_score_codex":0.0014541917,"about_ca_system_score_gemma":0.0020450475,"threshold_uncertainty_score":0.011192739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028734817,0.00034175318,0.9893835,0.00019729073,0.000097063465,0.0002633177,0.000056860546,0.0026101095,0.0041765594],"genre_scores_gemma":[0.10142067,0.0005773573,0.88939476,0.00013663815,0.000109127315,0.0005631849,0.00026316856,0.0002600837,0.007275061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998577,0.0003299862,0.00015609266,0.00019346345,0.000594935,0.00014848176],"domain_scores_gemma":[0.9991035,0.00017201198,0.00007162885,0.0002040119,0.0002467845,0.00020211969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001916128,0.00055553927,0.00069783325,0.00062911253,0.0016607541,0.0024143425,0.0021028966,0.001091619,0.003789891],"category_scores_gemma":[0.0024259156,0.00048669896,0.00081041665,0.0006369906,0.00075451465,0.0026245122,0.002261309,0.0014146825,0.0015077731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005490268,0.00034114174,0.0014336666,0.0010891559,0.00020950554,0.0012734219,0.002135944,0.09331733,0.056616317,0.4060275,0.030305643,0.40670133],"study_design_scores_gemma":[0.00023414053,0.00042049526,0.00079208834,0.00020138358,0.0002231793,0.0010562801,0.00027423553,0.5143067,0.02081219,0.13255355,0.32890368,0.000222045],"about_ca_topic_score_codex":0.0048719416,"about_ca_topic_score_gemma":0.0053608622,"teacher_disagreement_score":0.0048719416,"about_ca_system_score_codex":0.0008801256,"about_ca_system_score_gemma":0.0023610946,"threshold_uncertainty_score":0.012678504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34499118,0.0017373838,0.6424687,0.0005325256,0.00007335325,0.00024156253,0.00014149555,0.001232318,0.0085816],"genre_scores_gemma":[0.9498327,0.0009838645,0.047736317,0.000038005273,0.00003353966,0.00009555273,0.00006454073,0.00004072567,0.0011749017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.00037057966,0.000033889184,0.0000813503,0.00054415036,0.00009262345],"domain_scores_gemma":[0.9968342,0.0021831344,0.00031190732,0.00019617158,0.00039481555,0.000079807505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012560927,0.00054686546,0.00059759954,0.0006008464,0.0007635629,0.00070603716,0.0011291826,0.00084187306,0.0008325589],"category_scores_gemma":[0.005835923,0.00038162083,0.00027928228,0.00079625257,0.0010135402,0.001598633,0.00053741335,0.00061615766,0.00020985828],"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.0000997084,0.00006826161,0.0012136745,0.00013037433,0.000030199068,0.00036016598,0.00015215798,0.94672686,0.009025867,0.024268692,0.0006365716,0.01728749],"study_design_scores_gemma":[0.000012866383,0.000056471625,0.0002454532,0.000006266342,0.0000061944947,0.000050984734,0.000020612411,0.99126875,0.0014046346,0.0065385527,0.00037859238,0.000010602004],"about_ca_topic_score_codex":0.0046797385,"about_ca_topic_score_gemma":0.002241619,"teacher_disagreement_score":0.0046797385,"about_ca_system_score_codex":0.0008212849,"about_ca_system_score_gemma":0.000800944,"threshold_uncertainty_score":0.009305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123781726,0.001917028,0.8360365,0.000318759,0.000534646,0.0004677962,0.0003422372,0.009387666,0.027213639],"genre_scores_gemma":[0.6687867,0.00201164,0.29018605,0.00015513877,0.000378135,0.000174584,0.0010951615,0.00057733804,0.03663536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963367,0.000052808362,0.00001982587,0.000050583647,0.00020833514,0.00003481497],"domain_scores_gemma":[0.9993104,0.00020905779,0.000025254329,0.00017393658,0.0002229621,0.00005836384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043216342,0.00055231806,0.0009731084,0.0006233937,0.00059479364,0.0010445735,0.0020235386,0.0008542137,0.0028887996],"category_scores_gemma":[0.0012338697,0.00031565412,0.00038979627,0.0007450979,0.0003107506,0.0015307677,0.0010412193,0.0009481677,0.0011922256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010350654,0.00052910607,0.0007665188,0.00068019796,0.0002390521,0.0008348266,0.0005434782,0.052432664,0.3249887,0.028305631,0.024866974,0.5647778],"study_design_scores_gemma":[0.000103018516,0.0003771421,0.0009508195,0.000049067512,0.00010024083,0.0013553086,0.000110636734,0.8025166,0.14572069,0.017002318,0.03161265,0.000101549995],"about_ca_topic_score_codex":0.0009543052,"about_ca_topic_score_gemma":0.0014254657,"teacher_disagreement_score":0.0028887996,"about_ca_system_score_codex":0.00031131966,"about_ca_system_score_gemma":0.00036550447,"threshold_uncertainty_score":0.009663999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034569647,0.00029848158,0.9468992,0.00047811028,0.00006970094,0.00013799548,0.0006862052,0.0010763905,0.015784403],"genre_scores_gemma":[0.7906885,0.00041717678,0.20195818,0.00013252201,0.000039070976,0.00036631068,0.000920104,0.00016996927,0.005308216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990428,0.00023335077,0.000043760054,0.00022835252,0.0003145446,0.00013718076],"domain_scores_gemma":[0.99869007,0.0005599429,0.00016205313,0.0001646646,0.00032976587,0.00009353343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000797567,0.0005576847,0.0005359218,0.00055285054,0.00043532316,0.0015216563,0.001917114,0.0009296759,0.0041019],"category_scores_gemma":[0.0036376696,0.00033101407,0.00029591421,0.0010094936,0.00055587187,0.0013590292,0.00077724934,0.0011721406,0.0008424605],"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.00007850877,0.000046044068,0.0006231634,0.000044229586,0.000007906993,0.000033651693,0.000027754506,0.9738463,0.0019527625,0.013198146,0.0011611119,0.00898038],"study_design_scores_gemma":[0.0000045378342,0.0000087058015,0.00006698133,0.0000022226027,9.620086e-7,0.0000064676155,0.000003643287,0.99781454,0.00051332865,0.0011477788,0.0004273757,0.0000035308412],"about_ca_topic_score_codex":0.01391107,"about_ca_topic_score_gemma":0.006609188,"teacher_disagreement_score":0.01391107,"about_ca_system_score_codex":0.0019874307,"about_ca_system_score_gemma":0.0020329289,"threshold_uncertainty_score":0.027660191},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030770302,0.000455667,0.96192384,0.00021319321,0.00007261222,0.00032494412,0.000030754483,0.0024994863,0.0037091987],"genre_scores_gemma":[0.5651246,0.0005649157,0.4263509,0.000107261,0.00011312178,0.00024111895,0.00008483587,0.00019756542,0.0072157998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923706,0.00023734602,0.000039191105,0.00014281679,0.0002818793,0.000061775856],"domain_scores_gemma":[0.998887,0.00044384238,0.000085209766,0.00019487715,0.00024970682,0.00013938217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786456,0.000503861,0.00073740043,0.0005011549,0.001177178,0.0010718972,0.0016611329,0.0009842962,0.0025485635],"category_scores_gemma":[0.0029877522,0.00032802558,0.0003666495,0.000573116,0.00066822994,0.001746303,0.001027286,0.00075122836,0.0007080218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010765035,0.00069558603,0.002444839,0.0007141591,0.0001764232,0.0031498817,0.0019024491,0.14626525,0.2613092,0.065749325,0.011562682,0.5049537],"study_design_scores_gemma":[0.00013713904,0.00081377634,0.0010738359,0.000043603544,0.00008378331,0.0023618739,0.0003669228,0.8738798,0.06543384,0.022194197,0.03345921,0.00015206511],"about_ca_topic_score_codex":0.0020741434,"about_ca_topic_score_gemma":0.0022967109,"teacher_disagreement_score":0.0025485635,"about_ca_system_score_codex":0.00043533085,"about_ca_system_score_gemma":0.00061939727,"threshold_uncertainty_score":0.008525848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19527145,0.0009052362,0.7921304,0.00042267473,0.00025008954,0.00013163543,0.00006628697,0.0028637066,0.00795847],"genre_scores_gemma":[0.8526827,0.00028625055,0.14426455,0.00006527869,0.00008997074,0.000051183568,0.00009972586,0.000030576226,0.0024297282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997178,0.00006321227,0.000023885324,0.00006144321,0.00009365057,0.00004001657],"domain_scores_gemma":[0.9996252,0.00005184206,0.000043496722,0.00008631691,0.00012937885,0.00006373545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549896,0.00019425947,0.000353286,0.0004822998,0.000528563,0.00064524263,0.0008152832,0.00051820936,0.0009791893],"category_scores_gemma":[0.0005417864,0.0001320071,0.00016745734,0.0004017592,0.0002670723,0.0012892178,0.0009020984,0.00048202038,0.00023807706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005649735,0.0004102844,0.0061978847,0.0004161835,0.00015135264,0.0014362467,0.00086664676,0.11514615,0.307277,0.06519938,0.009327368,0.4930065],"study_design_scores_gemma":[0.000055290482,0.00040805383,0.0021980118,0.000032467477,0.00011227294,0.0008134274,0.00015351498,0.91736823,0.03513661,0.01387923,0.029788395,0.000054442215],"about_ca_topic_score_codex":0.0010075696,"about_ca_topic_score_gemma":0.0010001155,"teacher_disagreement_score":0.0010075696,"about_ca_system_score_codex":0.00033194537,"about_ca_system_score_gemma":0.00030882997,"threshold_uncertainty_score":0.0032756925},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022577794,0.013893126,0.938343,0.0033935134,0.00095597067,0.0003193831,0.00022929134,0.0020162922,0.01827161],"genre_scores_gemma":[0.69345,0.014025194,0.2757276,0.0010224158,0.0015192508,0.0005070067,0.00046010228,0.00036246542,0.012926011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984378,0.00032151368,0.00008074236,0.00021942063,0.000792691,0.00014784714],"domain_scores_gemma":[0.9958947,0.0015680855,0.00067585846,0.00089892367,0.0007529506,0.00020947744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034260612,0.0006178204,0.0009296848,0.0010079775,0.0010664094,0.0028373608,0.0020129038,0.0020737525,0.0015193427],"category_scores_gemma":[0.010763436,0.00057765446,0.0004195865,0.0014327324,0.0016750683,0.0057212613,0.001982667,0.0024440063,0.0005198043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011514019,0.00014240896,0.0015949111,0.0008955317,0.00012278822,0.0010171136,0.0010262026,0.09936316,0.021264795,0.50684845,0.016290238,0.350283],"study_design_scores_gemma":[0.0002654306,0.00049471983,0.001006299,0.0002814944,0.00015842271,0.0015675266,0.0003866367,0.46490952,0.031395707,0.37545055,0.12383831,0.00024541366],"about_ca_topic_score_codex":0.0019263679,"about_ca_topic_score_gemma":0.0014728724,"teacher_disagreement_score":0.0034260612,"about_ca_system_score_codex":0.0010189305,"about_ca_system_score_gemma":0.0010615198,"threshold_uncertainty_score":0.018118978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15691566,0.00020969255,0.8303771,0.00082646735,0.00003231788,0.00019432453,0.000039261467,0.000100574165,0.01130451],"genre_scores_gemma":[0.9526528,0.00018825341,0.044155724,0.000112491885,0.00001767864,0.00020665303,0.000020083446,0.000018857783,0.0026274761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756134,0.0017319547,0.000077465964,0.00016075141,0.00027196988,0.00019656272],"domain_scores_gemma":[0.99041486,0.007498485,0.000888797,0.00038525029,0.00043114662,0.00038142817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033420792,0.0007680646,0.00070504064,0.0006445195,0.0009144969,0.0011667112,0.0011758965,0.0013961855,0.0021734838],"category_scores_gemma":[0.010417582,0.00038060208,0.00065375416,0.00044333405,0.0021086552,0.0021417132,0.0011947886,0.0011264274,0.00027436207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026338518,0.0002155353,0.0017520064,0.00019821247,0.00014087658,0.00082756625,0.0014697964,0.33831167,0.010748796,0.6182763,0.001536124,0.026259754],"study_design_scores_gemma":[0.000061299535,0.00009822841,0.00024069971,0.000014816051,0.000021895743,0.00014331992,0.00019836177,0.8234671,0.00090496097,0.17366819,0.001157466,0.000023670744],"about_ca_topic_score_codex":0.0010465642,"about_ca_topic_score_gemma":0.00094886805,"teacher_disagreement_score":0.0033420792,"about_ca_system_score_codex":0.0012844689,"about_ca_system_score_gemma":0.0009605249,"threshold_uncertainty_score":0.017674804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9193626,0.0003519693,0.056653004,0.001364965,0.0002445058,0.0003228933,0.00051484973,0.006535207,0.014650047],"genre_scores_gemma":[0.9411937,0.00011845811,0.052744783,0.00021546599,0.000040704992,0.00017163578,0.000612272,0.00053866784,0.004364318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99455726,0.0029556863,0.00014866986,0.0006622551,0.0011584986,0.0005177051],"domain_scores_gemma":[0.9755163,0.016393287,0.0006787846,0.0046530417,0.0015800152,0.0011785238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005700486,0.00071307604,0.0008147423,0.0009934485,0.0024139015,0.0016858388,0.0024126333,0.0021144212,0.0032401478],"category_scores_gemma":[0.027237829,0.0005973718,0.0006174769,0.0014633079,0.0014764062,0.003916235,0.0027241611,0.0019612527,0.0010126502],"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.011626292,0.008475751,0.041477025,0.001925738,0.0013160539,0.0019914345,0.0075441403,0.41403267,0.12856007,0.08220976,0.037904665,0.26293644],"study_design_scores_gemma":[0.00135828,0.0013591558,0.0028105376,0.00006579412,0.00015122052,0.00050907035,0.0016055906,0.89981395,0.041260656,0.036293756,0.014663388,0.00010866213],"about_ca_topic_score_codex":0.005240134,"about_ca_topic_score_gemma":0.007078553,"teacher_disagreement_score":0.005700486,"about_ca_system_score_codex":0.00092035613,"about_ca_system_score_gemma":0.0011965996,"threshold_uncertainty_score":0.030147374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07658748,0.00021329109,0.8788909,0.0006309958,0.00033198166,0.00043636299,0.00029773376,0.028235586,0.014375635],"genre_scores_gemma":[0.8401807,0.0002265882,0.1454111,0.00041864644,0.000112610134,0.00048562174,0.00085315475,0.00025918827,0.01205234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994573,0.00016578354,0.000048930146,0.00012482269,0.00014168578,0.00006152428],"domain_scores_gemma":[0.99933296,0.000119945886,0.000044901924,0.00013982497,0.00018628535,0.0001759558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031548,0.0004999435,0.0006365609,0.00057231414,0.0006733102,0.0009884156,0.0015514917,0.0009106056,0.0048817927],"category_scores_gemma":[0.0013696162,0.0002489181,0.00039375215,0.0003626495,0.00042085216,0.001276905,0.00210495,0.0007400672,0.0014629721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036391371,0.0021942232,0.01290259,0.0003953655,0.00036970884,0.0024348714,0.0013626827,0.24514434,0.19193666,0.052636594,0.051604223,0.43537956],"study_design_scores_gemma":[0.00024752395,0.00038260577,0.0018351446,0.000021167998,0.00010178727,0.00054388476,0.0001100505,0.926547,0.024154922,0.006168596,0.039792776,0.00009458094],"about_ca_topic_score_codex":0.0017955507,"about_ca_topic_score_gemma":0.00087310025,"teacher_disagreement_score":0.0048817927,"about_ca_system_score_codex":0.0005010859,"about_ca_system_score_gemma":0.0009134084,"threshold_uncertainty_score":0.016331255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2678471,0.0031394835,0.71135306,0.00073154696,0.00046960489,0.00047928366,0.00034392206,0.004402034,0.011233989],"genre_scores_gemma":[0.94902986,0.00066858594,0.048284773,0.00005917957,0.00007695774,0.00007207536,0.00015952402,0.000028665254,0.0016204057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00015872734,0.000031954016,0.00008173896,0.00016975337,0.000063148946],"domain_scores_gemma":[0.9986172,0.0005698795,0.00015968496,0.00016217053,0.00038095273,0.00011015062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424074,0.0004858806,0.0005570801,0.00056749035,0.00062656106,0.00052767026,0.0010941187,0.00031710556,0.0005369953],"category_scores_gemma":[0.0026025146,0.00022709511,0.0002084287,0.0004901259,0.00026073077,0.0010682732,0.00086389965,0.00042388318,0.00012533441],"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.0006746524,0.0003216184,0.007040285,0.0007083096,0.00022672726,0.00080960494,0.0003617098,0.56819946,0.08189367,0.020765997,0.012757527,0.30624053],"study_design_scores_gemma":[0.000040645573,0.00017096571,0.0009186027,0.000008037434,0.00006825059,0.00023792284,0.000062451334,0.9822859,0.006757145,0.0033485256,0.0060686646,0.000032824664],"about_ca_topic_score_codex":0.002716078,"about_ca_topic_score_gemma":0.004575871,"teacher_disagreement_score":0.002716078,"about_ca_system_score_codex":0.00049524434,"about_ca_system_score_gemma":0.0008946566,"threshold_uncertainty_score":0.0054005384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013160598,0.0002167737,0.9761268,0.0005448204,0.00015816817,0.00030637265,0.000053718435,0.0050313994,0.0044013294],"genre_scores_gemma":[0.23985027,0.0004943583,0.7506254,0.0001969537,0.00014678668,0.00037573485,0.00028506815,0.00041048654,0.0076149143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542516,0.0012792113,0.00051095476,0.0006641754,0.0018529156,0.0002675046],"domain_scores_gemma":[0.99083436,0.0028496657,0.0006580684,0.003198484,0.0019043374,0.000555088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007090958,0.00035154732,0.00081543595,0.0012709735,0.0024897973,0.004139105,0.0019840554,0.0016812866,0.0020928343],"category_scores_gemma":[0.013437703,0.00067919306,0.00092174223,0.0014041682,0.0018558044,0.007458013,0.0034854128,0.0017660208,0.0010871994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008242515,0.000520573,0.00359565,0.00069680327,0.00018909448,0.0018364837,0.0042393343,0.030764189,0.07271505,0.54897785,0.014656669,0.32098404],"study_design_scores_gemma":[0.00042364237,0.0007970062,0.0019045762,0.00016395948,0.00041753228,0.0019777243,0.00087486557,0.50550044,0.09495986,0.16787599,0.22474891,0.00035552197],"about_ca_topic_score_codex":0.0033252744,"about_ca_topic_score_gemma":0.0020875281,"teacher_disagreement_score":0.007090958,"about_ca_system_score_codex":0.001138333,"about_ca_system_score_gemma":0.0034360085,"threshold_uncertainty_score":0.037501037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17950575,0.0025818972,0.80675495,0.00064332096,0.00016454878,0.00041652107,0.00009642248,0.0024722472,0.0073643136],"genre_scores_gemma":[0.7474435,0.0010201731,0.24453375,0.00017145394,0.00018430583,0.00028023342,0.00021700384,0.00019565216,0.005953918],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994325,0.00014602189,0.00003255325,0.000063405525,0.00026601707,0.000059501177],"domain_scores_gemma":[0.99935037,0.00014182,0.00004666031,0.00007502324,0.00028787227,0.00009828607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089532346,0.00064884924,0.00042030867,0.0005156322,0.00079605565,0.0011758903,0.0014066349,0.001120063,0.001349345],"category_scores_gemma":[0.001692155,0.00034236605,0.00023000376,0.00046388683,0.0005227388,0.0013226457,0.0004394111,0.00058483105,0.0008575693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012471153,0.0004681482,0.0054970654,0.0005976875,0.0001508511,0.0006818428,0.00043893856,0.23805821,0.350313,0.048797235,0.007569766,0.3461801],"study_design_scores_gemma":[0.000067797475,0.00079265505,0.0014051226,0.000019195182,0.00006930893,0.00050622725,0.000062098276,0.88960344,0.08970563,0.0056125787,0.01211266,0.00004341952],"about_ca_topic_score_codex":0.0012387884,"about_ca_topic_score_gemma":0.001074817,"teacher_disagreement_score":0.0014066349,"about_ca_system_score_codex":0.0011947829,"about_ca_system_score_gemma":0.000961851,"threshold_uncertainty_score":0.00866884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067147955,0.0008410268,0.9108785,0.00020102019,0.000120216435,0.00032792072,0.00031343068,0.017559012,0.002610986],"genre_scores_gemma":[0.6927623,0.00032161621,0.30085316,0.00011979724,0.00011229166,0.00033311572,0.0008703138,0.00034105356,0.0042862906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689204,0.00077669456,0.00020149756,0.00060123997,0.0013156984,0.00021280881],"domain_scores_gemma":[0.9906007,0.0034342688,0.0006802401,0.0032418324,0.0015135431,0.00052942935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034762213,0.0008403495,0.0019452855,0.0025638228,0.001149773,0.001616937,0.0031762165,0.00120683,0.0013239288],"category_scores_gemma":[0.009039032,0.00066554785,0.00032293182,0.0017782621,0.0006708196,0.002313488,0.0015466881,0.0011536711,0.0007881878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026530016,0.00065366586,0.014277426,0.00034016374,0.00038813142,0.00067034323,0.0008425133,0.077580184,0.15909965,0.01900955,0.010817657,0.7136677],"study_design_scores_gemma":[0.0004123429,0.00036710824,0.0030957926,0.00002279554,0.00011465023,0.00083789765,0.0001100298,0.8982942,0.07339504,0.006997326,0.016220191,0.00013266988],"about_ca_topic_score_codex":0.0036037008,"about_ca_topic_score_gemma":0.0035379569,"teacher_disagreement_score":0.0036037008,"about_ca_system_score_codex":0.0007613606,"about_ca_system_score_gemma":0.0011969295,"threshold_uncertainty_score":0.018384218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7652521,0.0011094137,0.22137536,0.0006839773,0.00005898781,0.000286861,0.00023531103,0.0023498598,0.0086480165],"genre_scores_gemma":[0.9758445,0.00015903862,0.022384971,0.000031742326,0.00001547486,0.00006294626,0.00011346439,0.00006203234,0.0013259116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983865,0.0005361279,0.00013697876,0.00026768728,0.00046966175,0.00020303625],"domain_scores_gemma":[0.98634976,0.008497401,0.00151729,0.0018664063,0.0009868214,0.00078224903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021673434,0.00056258496,0.00069222663,0.00096376403,0.0012664276,0.0024836431,0.0019083784,0.0009608581,0.0024055578],"category_scores_gemma":[0.015409034,0.0004347784,0.00024678564,0.0009785496,0.0010298466,0.0033914025,0.002422152,0.0010705318,0.00038231286],"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.003711437,0.0019290062,0.049629293,0.00070963835,0.00018200364,0.001136094,0.0047499686,0.4073856,0.028848488,0.08860121,0.0066807396,0.40643647],"study_design_scores_gemma":[0.00012773265,0.0007467271,0.010261165,0.000055951306,0.00006875496,0.0006771158,0.0013665885,0.8913199,0.008913337,0.07851556,0.00787542,0.00007180311],"about_ca_topic_score_codex":0.0053723925,"about_ca_topic_score_gemma":0.0037201617,"teacher_disagreement_score":0.0053723925,"about_ca_system_score_codex":0.0010806456,"about_ca_system_score_gemma":0.0008561013,"threshold_uncertainty_score":0.011462152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44667763,0.00095835293,0.52343893,0.0033064138,0.00018435945,0.00022867622,0.0005001836,0.00034736464,0.024358105],"genre_scores_gemma":[0.982703,0.0004646548,0.010834578,0.00011496292,0.000045833218,0.000110634595,0.000089892805,0.000019165876,0.0056173312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990922,0.00041927298,0.00004526615,0.00013019361,0.00015808045,0.000155009],"domain_scores_gemma":[0.9950864,0.0031067291,0.00078397413,0.000271576,0.0005559397,0.00019540598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013793973,0.0005617831,0.0008245505,0.0011572135,0.001080413,0.0020223747,0.0015673185,0.0029396787,0.0022500127],"category_scores_gemma":[0.009210001,0.00052401714,0.00086119806,0.00083929516,0.0018665503,0.002509813,0.0011800746,0.0013604965,0.0004874218],"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.000023343513,0.000037654747,0.0024754324,0.000033732318,0.000023582688,0.000169371,0.00015583988,0.9412966,0.0012634266,0.051561035,0.00057348196,0.0023865728],"study_design_scores_gemma":[0.0000075335697,0.000016568172,0.00028867988,0.0000072531484,0.0000065333047,0.00005394559,0.000043064378,0.989943,0.00016090072,0.00899688,0.00046716747,0.000008430313],"about_ca_topic_score_codex":0.010901387,"about_ca_topic_score_gemma":0.003618082,"teacher_disagreement_score":0.010901387,"about_ca_system_score_codex":0.0018656852,"about_ca_system_score_gemma":0.0010332459,"threshold_uncertainty_score":0.021675885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004675173,0.0008848983,0.98563844,0.00070493313,0.00008232661,0.00005276667,0.000031403393,0.000101602614,0.00782848],"genre_scores_gemma":[0.53412986,0.0044402783,0.44877595,0.00039663276,0.00040943112,0.00046762536,0.00028023575,0.00017605795,0.010923959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981729,0.00065421604,0.000074762815,0.00017566791,0.00077388523,0.00014855365],"domain_scores_gemma":[0.9988532,0.0006298378,0.000093331095,0.00012492512,0.0002373363,0.00006140143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016513806,0.0008238754,0.0006908114,0.0006113007,0.0008521528,0.0015742081,0.0011994747,0.0014776207,0.0023289986],"category_scores_gemma":[0.004510874,0.00026432276,0.0006566243,0.001215425,0.001500292,0.0019566491,0.0018041561,0.0018390986,0.0008331624],"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.000038664566,0.00004710872,0.00019654073,0.00014829871,0.00002002428,0.00018145972,0.00014198873,0.22213452,0.0035806932,0.72237414,0.0026203578,0.048516173],"study_design_scores_gemma":[0.000013186383,0.000027171094,0.000053808006,0.000019347988,0.000008520624,0.00009990889,0.00004089209,0.63139045,0.0010018635,0.35431898,0.013015644,0.00001025598],"about_ca_topic_score_codex":0.002342437,"about_ca_topic_score_gemma":0.0014233902,"teacher_disagreement_score":0.002342437,"about_ca_system_score_codex":0.0019107361,"about_ca_system_score_gemma":0.0017043469,"threshold_uncertainty_score":0.013863385},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068898066,0.22335573,0.7507611,0.0019817539,0.00041183838,0.00033565843,0.0002627445,0.0010295538,0.014971857],"genre_scores_gemma":[0.1624115,0.27647072,0.54568887,0.0010348586,0.0019506285,0.0009317867,0.0010136075,0.00037668113,0.010121271],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99682224,0.0007967974,0.0003635775,0.0003867248,0.0014621116,0.00016850828],"domain_scores_gemma":[0.99561065,0.0029421323,0.00018517725,0.00053250924,0.00064668723,0.0000828066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026270947,0.0009620728,0.0026396648,0.0034242023,0.0012502273,0.0029907338,0.0026504465,0.0021491733,0.0037329386],"category_scores_gemma":[0.0077906065,0.0008730976,0.0011828509,0.011881492,0.0010348418,0.0064339316,0.0016829177,0.0017705499,0.0019301333],"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.00017057346,0.00019069265,0.0014010512,0.004918244,0.00013845733,0.00029187775,0.0005013122,0.034225553,0.0033032314,0.11676397,0.017613687,0.82048136],"study_design_scores_gemma":[0.00019835075,0.00045040416,0.0020708032,0.0016261417,0.0002900335,0.0031779623,0.0008043493,0.38929588,0.005226185,0.246142,0.3505838,0.00013416335],"about_ca_topic_score_codex":0.0020211383,"about_ca_topic_score_gemma":0.0014597907,"teacher_disagreement_score":0.0037329386,"about_ca_system_score_codex":0.001490368,"about_ca_system_score_gemma":0.0019366799,"threshold_uncertainty_score":0.013893545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010371099,0.0010830683,0.97288203,0.0007204959,0.0002568091,0.00017875785,0.00011789532,0.005728716,0.008661118],"genre_scores_gemma":[0.4698735,0.0016860057,0.50992906,0.00033473116,0.0007503212,0.00030788465,0.0005221498,0.000712556,0.015883775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448264,0.0010306241,0.0003027124,0.0006514568,0.0031198498,0.00041288766],"domain_scores_gemma":[0.9912156,0.0023796202,0.0005993234,0.0033548488,0.0020558753,0.0003947207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00516893,0.0008053043,0.001211962,0.0013669188,0.0015689057,0.0034972746,0.0031831884,0.0013535763,0.0041055637],"category_scores_gemma":[0.012874741,0.0008629189,0.00050345337,0.0016788074,0.001461478,0.0038048557,0.002899673,0.0017376421,0.002855725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007951263,0.00038844452,0.002400953,0.0006267751,0.00016524848,0.0012180888,0.0006894599,0.1845244,0.031677146,0.28168055,0.029025298,0.4668086],"study_design_scores_gemma":[0.00018379407,0.00028359194,0.0005866956,0.00005592267,0.00010030145,0.00075695815,0.00016485158,0.7501373,0.02025025,0.14350237,0.083882235,0.00009576629],"about_ca_topic_score_codex":0.0013274995,"about_ca_topic_score_gemma":0.0010456698,"teacher_disagreement_score":0.00516893,"about_ca_system_score_codex":0.000845148,"about_ca_system_score_gemma":0.0020586036,"threshold_uncertainty_score":0.02733624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06369731,0.00027342272,0.92899126,0.00044023062,0.0000610344,0.00012729436,0.0001611458,0.0012585963,0.004989749],"genre_scores_gemma":[0.83725154,0.00023804283,0.15932816,0.000080691716,0.000040465136,0.00012467147,0.00015556287,0.00007646385,0.002704368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937063,0.00019332235,0.000032032185,0.000102876606,0.00022911142,0.00007208596],"domain_scores_gemma":[0.9988514,0.00043954948,0.000118408105,0.00023215971,0.00025136778,0.00010715782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803531,0.00033050607,0.00056635565,0.000572867,0.00096110575,0.00092674413,0.0015848655,0.0006648026,0.0014450666],"category_scores_gemma":[0.0032776152,0.00023718731,0.00031527606,0.0007267701,0.00082786655,0.0017448498,0.0012530556,0.00065031153,0.0003173012],"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.00026483677,0.00016710102,0.0011578809,0.00015820099,0.000033116263,0.0004496445,0.00025186688,0.79751205,0.026569657,0.09742791,0.003962969,0.07204478],"study_design_scores_gemma":[0.000015325133,0.00005084073,0.00007601437,0.0000030001393,0.0000069887237,0.00005490094,0.000013804668,0.99203765,0.0014759363,0.004842162,0.0014122822,0.0000111267655],"about_ca_topic_score_codex":0.0058567864,"about_ca_topic_score_gemma":0.0060579814,"teacher_disagreement_score":0.0058567864,"about_ca_system_score_codex":0.0014424092,"about_ca_system_score_gemma":0.0016549155,"threshold_uncertainty_score":0.011645377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02644577,0.0002254934,0.9693609,0.00015339993,0.00008848556,0.00025092758,0.00007017985,0.0022759826,0.0011288464],"genre_scores_gemma":[0.55070645,0.00025439195,0.4446468,0.00013391644,0.00017742839,0.00035034365,0.0005578511,0.0004020406,0.002770807],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971992,0.00046843555,0.00024587224,0.0005225315,0.0013280906,0.00023592502],"domain_scores_gemma":[0.99362355,0.0021723178,0.00079958636,0.0015717642,0.0015313688,0.00030158105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020370346,0.0004598347,0.0008070802,0.0014048879,0.0014952176,0.0010012878,0.0017305813,0.0010339445,0.0017273872],"category_scores_gemma":[0.007258028,0.00035440287,0.0005050506,0.0006323107,0.0006027139,0.0020376823,0.0012805967,0.0012754726,0.00048301014],"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.0011724872,0.00043737204,0.008478197,0.00046622442,0.00015203767,0.0006142497,0.0009879426,0.034926184,0.13432397,0.025332635,0.0058219507,0.78728676],"study_design_scores_gemma":[0.0003544701,0.001544742,0.015461283,0.00012015522,0.00047593517,0.004393694,0.0006580062,0.66995776,0.23517233,0.027553143,0.043869223,0.00043931886],"about_ca_topic_score_codex":0.0010268189,"about_ca_topic_score_gemma":0.0007071768,"teacher_disagreement_score":0.0020370346,"about_ca_system_score_codex":0.0006088284,"about_ca_system_score_gemma":0.0013386932,"threshold_uncertainty_score":0.010773003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039768986,0.00039063676,0.95104986,0.00039534498,0.000033931294,0.00008749439,0.0004584689,0.00046637803,0.0073488695],"genre_scores_gemma":[0.78185207,0.00080846006,0.21035501,0.00013507257,0.00007944703,0.00023052449,0.00048656185,0.00011911159,0.005933713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981147,0.0006053157,0.00008325605,0.00036879507,0.00052368775,0.00030431498],"domain_scores_gemma":[0.99405247,0.0038630182,0.00059613684,0.0006496535,0.0006335551,0.0002052246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013747135,0.000908949,0.0009211681,0.0006037419,0.00085481955,0.0018892067,0.0020379045,0.0012428251,0.0029896705],"category_scores_gemma":[0.0085620135,0.0007519574,0.00052744045,0.0019238987,0.0011114315,0.003970921,0.0016830837,0.001466362,0.00048223382],"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.000026158003,0.000023369881,0.00030704323,0.000063924475,0.000016112004,0.00010248962,0.00004370818,0.94339395,0.0012539448,0.042440403,0.0012165912,0.011112303],"study_design_scores_gemma":[0.0000064689552,0.000014066763,0.00008462771,0.00000552575,0.000005994983,0.00003605249,0.00001585985,0.97448844,0.0006842713,0.023174465,0.0014763122,0.0000079652045],"about_ca_topic_score_codex":0.0075143287,"about_ca_topic_score_gemma":0.0068654427,"teacher_disagreement_score":0.0075143287,"about_ca_system_score_codex":0.0019460688,"about_ca_system_score_gemma":0.0016826581,"threshold_uncertainty_score":0.014941156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037634973,0.00079473347,0.98910207,0.0010361513,0.00007244648,0.00014791742,0.00008741306,0.00067761366,0.0043182443],"genre_scores_gemma":[0.2165724,0.0024547917,0.77443206,0.00046149097,0.00032373567,0.0004954483,0.0004074382,0.0002261195,0.004626515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969037,0.00063216593,0.0003071959,0.00061907916,0.0013223594,0.00021542975],"domain_scores_gemma":[0.9940825,0.0022908833,0.00050023675,0.002365331,0.00055699184,0.00020414992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027493238,0.00065788435,0.0015388216,0.0012872007,0.0014396331,0.003491858,0.003078743,0.0029615543,0.003472497],"category_scores_gemma":[0.0116179045,0.0008165171,0.000780073,0.0032921173,0.0026905867,0.010098415,0.0046707187,0.0024672905,0.0021313264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002093684,0.00015951287,0.0013527919,0.0007374015,0.00010424889,0.00055492425,0.00038283507,0.056539558,0.0302186,0.5097177,0.012607055,0.38741598],"study_design_scores_gemma":[0.00013276687,0.00017468994,0.00050648383,0.00010531711,0.000059622147,0.00211888,0.0001897848,0.22751336,0.01828182,0.67077845,0.08005984,0.00007903647],"about_ca_topic_score_codex":0.00079703936,"about_ca_topic_score_gemma":0.0004621875,"teacher_disagreement_score":0.003491858,"about_ca_system_score_codex":0.00082186464,"about_ca_system_score_gemma":0.0017329373,"threshold_uncertainty_score":0.014540017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039270278,0.00047548994,0.9274604,0.00034961745,0.0001564854,0.00046914408,0.00015525726,0.0032716198,0.028391788],"genre_scores_gemma":[0.6351574,0.0010295447,0.3401943,0.00028872822,0.00022685113,0.00046346596,0.00065777847,0.00027372787,0.021708142],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911696,0.00028382553,0.000051342206,0.00012173828,0.0003507459,0.000075427786],"domain_scores_gemma":[0.9987986,0.00035781908,0.000094815914,0.00036577863,0.00028818348,0.00009486793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091591,0.00037543537,0.0003437834,0.00039072247,0.00060006836,0.0011370021,0.0008217452,0.0006829304,0.0018482589],"category_scores_gemma":[0.0017482426,0.0002109794,0.00025382295,0.00036210974,0.00059460005,0.0015930587,0.0011565192,0.000751063,0.0014431304],"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.0005812411,0.00050427543,0.0034632026,0.0011223553,0.00020662507,0.0018254007,0.0023196547,0.03621346,0.2125476,0.1737407,0.022023704,0.5454518],"study_design_scores_gemma":[0.000110645095,0.0011253718,0.0030585425,0.00021790627,0.00018358143,0.0029022337,0.000781281,0.31988743,0.133227,0.16353613,0.3747818,0.00018811226],"about_ca_topic_score_codex":0.00035161522,"about_ca_topic_score_gemma":0.00042537984,"teacher_disagreement_score":0.0018482589,"about_ca_system_score_codex":0.00021166727,"about_ca_system_score_gemma":0.00057639246,"threshold_uncertainty_score":0.006183028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17237116,0.000106754684,0.822193,0.00041511568,0.000045168264,0.000075662734,0.000037465023,0.0001821785,0.0045735226],"genre_scores_gemma":[0.9482024,0.00008680257,0.050261848,0.00005098963,0.000024194387,0.00006266361,0.000018085024,0.00003656011,0.0012564592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984262,0.00076409895,0.000061616214,0.00015805011,0.00038165163,0.00020830845],"domain_scores_gemma":[0.9934416,0.0039241193,0.0010901047,0.00077661,0.0005413407,0.00022626507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031457923,0.0006045206,0.0009387701,0.000576481,0.00075115747,0.001507839,0.0012425038,0.0010182651,0.0007603959],"category_scores_gemma":[0.011519861,0.00036249505,0.00036867944,0.0006073137,0.0014133757,0.0020680302,0.0014692149,0.0010797519,0.00013308266],"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.00015023527,0.00007826997,0.0007704001,0.000050949016,0.000036050824,0.00012566028,0.00011524003,0.8201216,0.005218707,0.15547372,0.0005650344,0.017294087],"study_design_scores_gemma":[0.000012502128,0.000018457644,0.0000675887,0.000003987332,0.0000043111777,0.00001704525,0.000012712748,0.9684074,0.0012722295,0.029914329,0.00026511226,0.000004309455],"about_ca_topic_score_codex":0.00110586,"about_ca_topic_score_gemma":0.000833635,"teacher_disagreement_score":0.0031457923,"about_ca_system_score_codex":0.001508723,"about_ca_system_score_gemma":0.0013278959,"threshold_uncertainty_score":0.016636789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11977073,0.0024610115,0.8642887,0.000679813,0.00020441493,0.00023879686,0.000062917075,0.0039488208,0.008344823],"genre_scores_gemma":[0.8441009,0.0012164722,0.15134802,0.00011788451,0.00021979368,0.00011565448,0.0001070519,0.00013274883,0.0026415973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865025,0.0003577033,0.00008193054,0.00014889325,0.0006144011,0.000146865],"domain_scores_gemma":[0.9951068,0.0018191535,0.00046038962,0.0013860947,0.0010720454,0.00015555098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015741002,0.00083153497,0.00082450337,0.0009194529,0.00090264704,0.0010600995,0.002194024,0.00094060815,0.0016462478],"category_scores_gemma":[0.005916387,0.00040180667,0.0003418993,0.00069251034,0.00072894775,0.0036947676,0.002443732,0.0006463733,0.00092258665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073178124,0.00038858198,0.0031796237,0.0015038722,0.00020889385,0.001531477,0.0016248582,0.2503241,0.23075026,0.08456272,0.0085932575,0.41660053],"study_design_scores_gemma":[0.0002471219,0.001134341,0.0011875276,0.00008121843,0.00026193514,0.0022697055,0.00038425656,0.81617165,0.08743878,0.05192624,0.038753834,0.00014345377],"about_ca_topic_score_codex":0.00074851036,"about_ca_topic_score_gemma":0.0003833572,"teacher_disagreement_score":0.002194024,"about_ca_system_score_codex":0.0004016047,"about_ca_system_score_gemma":0.00062776846,"threshold_uncertainty_score":0.008324742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0241651,0.0012847313,0.9680633,0.00088490534,0.00014281935,0.00024272712,0.000058646263,0.0011376196,0.00402019],"genre_scores_gemma":[0.7125167,0.0019868305,0.27921313,0.00022622879,0.00039811843,0.0005823657,0.00022098125,0.00024081631,0.0046148603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99224234,0.0025721872,0.0009317649,0.0005504957,0.0033400129,0.00036329738],"domain_scores_gemma":[0.98930234,0.0055239503,0.0011707961,0.0024313517,0.0012264024,0.0003451675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007610622,0.00051125715,0.0009836246,0.00092892634,0.0014905708,0.004153466,0.0020724395,0.001876039,0.001522834],"category_scores_gemma":[0.018039135,0.00091482064,0.0006060122,0.0014854685,0.0036163363,0.0076888558,0.001960622,0.0023860263,0.0006490206],"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.00035618458,0.00022695781,0.0034268564,0.00057959574,0.000084822335,0.0013900384,0.0023043307,0.08593932,0.021073988,0.7640891,0.0033717863,0.11715694],"study_design_scores_gemma":[0.00022661277,0.00048414024,0.00096177385,0.00019878827,0.0001778202,0.0019255326,0.0006397088,0.5540003,0.029654019,0.35969764,0.051869255,0.0001643632],"about_ca_topic_score_codex":0.0013179453,"about_ca_topic_score_gemma":0.0007409023,"teacher_disagreement_score":0.007610622,"about_ca_system_score_codex":0.0013154747,"about_ca_system_score_gemma":0.0018783592,"threshold_uncertainty_score":0.040249288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04003687,0.009772333,0.90813655,0.0013645703,0.00030695673,0.00041441532,0.00059154176,0.003631702,0.035745114],"genre_scores_gemma":[0.4377529,0.010427862,0.51909554,0.0007601444,0.00092762447,0.00047562202,0.0035341165,0.0006055218,0.026420744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976538,0.00049967336,0.00022931321,0.00033894804,0.0011376109,0.00014077977],"domain_scores_gemma":[0.9974699,0.0009990777,0.00016362473,0.00071081374,0.00055799325,0.000098549724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201707,0.0007180643,0.0017998128,0.006537066,0.0018448882,0.005802499,0.0018359562,0.0016641191,0.0041320645],"category_scores_gemma":[0.008360806,0.0005581755,0.0008292451,0.005853864,0.0007651774,0.007298075,0.005657059,0.001138404,0.0029173002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006697037,0.00022415904,0.0017391298,0.00153347,0.00033277637,0.00207898,0.002053856,0.02970293,0.031324085,0.0854733,0.020260708,0.8246069],"study_design_scores_gemma":[0.00040651282,0.0003467604,0.0027470554,0.0007660538,0.00080611336,0.0025094808,0.002379667,0.40849352,0.080712646,0.2211213,0.279418,0.00029290284],"about_ca_topic_score_codex":0.0023655791,"about_ca_topic_score_gemma":0.0026477166,"teacher_disagreement_score":0.006537066,"about_ca_system_score_codex":0.00093600096,"about_ca_system_score_gemma":0.0011787197,"threshold_uncertainty_score":0.013823152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057760156,0.000052174983,0.99180096,0.000085078784,0.000018567902,0.00006253109,0.000043189288,0.00077790226,0.001383622],"genre_scores_gemma":[0.19321583,0.00014461315,0.80326253,0.0000649459,0.000032809254,0.00019086515,0.00023477778,0.00010679887,0.0027468035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999374,0.00015992793,0.00004720365,0.00009398711,0.00027908717,0.000045881294],"domain_scores_gemma":[0.99943286,0.00016589114,0.000048011418,0.00013640121,0.00016978935,0.000047062815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009040301,0.00042033734,0.0004814223,0.0006644498,0.00084372534,0.0009174135,0.0013789514,0.0005883003,0.0017154866],"category_scores_gemma":[0.0017659595,0.0002532283,0.00035837668,0.0007016834,0.0005408543,0.0016718323,0.0012683221,0.00065348035,0.0007025797],"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.00023270378,0.00023198078,0.0008023003,0.00019091029,0.0000527313,0.000759991,0.000523061,0.32872427,0.070955284,0.30153632,0.012939169,0.28305125],"study_design_scores_gemma":[0.000028442291,0.00006465128,0.00011222239,0.0000063489115,0.000010108224,0.00017467703,0.00007354721,0.9460399,0.00839101,0.035462048,0.00960984,0.000027103484],"about_ca_topic_score_codex":0.0015178971,"about_ca_topic_score_gemma":0.0019718448,"teacher_disagreement_score":0.0017154866,"about_ca_system_score_codex":0.0004960236,"about_ca_system_score_gemma":0.0009986582,"threshold_uncertainty_score":0.0057388544},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035426944,0.71256715,0.12567616,0.0051298933,0.0019182148,0.00046447836,0.0017475069,0.0038765916,0.113193065],"genre_scores_gemma":[0.15789764,0.7266636,0.07854932,0.0012330615,0.0019196067,0.0004731667,0.006594531,0.0011042577,0.025564872],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971886,0.000587058,0.00035451158,0.00048409821,0.0011434812,0.00024229125],"domain_scores_gemma":[0.990122,0.0055421833,0.0006766629,0.00091157376,0.0020742745,0.0006731926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002667873,0.00081403926,0.0011538981,0.011431215,0.0010498025,0.0040049357,0.0018716039,0.0010012033,0.003909353],"category_scores_gemma":[0.0086258175,0.0007146999,0.000548583,0.017652458,0.0008883182,0.0103823645,0.0024872795,0.0015635563,0.00243044],"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.00006974866,0.00015746446,0.0033400923,0.0052577984,0.000058505557,0.00014511854,0.00087691116,0.001981671,0.0009817096,0.0340502,0.048568342,0.9045124],"study_design_scores_gemma":[0.000017045164,0.00008924412,0.004834578,0.0017255186,0.000049911203,0.0012971007,0.0011802118,0.0051841047,0.0018897259,0.017137805,0.9665424,0.000052358795],"about_ca_topic_score_codex":0.002028027,"about_ca_topic_score_gemma":0.0015071493,"teacher_disagreement_score":0.011431215,"about_ca_system_score_codex":0.0014171725,"about_ca_system_score_gemma":0.0019942315,"threshold_uncertainty_score":0.014109254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7795778,0.00091277726,0.2142494,0.00028963937,0.00006178387,0.00021824132,0.000059872815,0.0009724357,0.0036580588],"genre_scores_gemma":[0.9756444,0.000116132745,0.023687748,0.000022214519,0.000011036425,0.00003185125,0.00003052991,0.000015035339,0.0004410406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969837,0.0016198606,0.00019446872,0.00019390501,0.0008444905,0.00016352812],"domain_scores_gemma":[0.98384964,0.010387757,0.0014411164,0.0024389378,0.001552615,0.00032997646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037904764,0.00034347727,0.0005612923,0.000943519,0.0006245444,0.0012024398,0.0007801968,0.0007831521,0.00073156017],"category_scores_gemma":[0.016498424,0.0002261763,0.00015768882,0.00074769196,0.0007364384,0.0018250741,0.0010013918,0.00059043884,0.00017818395],"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.0014699377,0.00089686154,0.014618055,0.0004599776,0.00017454903,0.0007534368,0.0012834647,0.47381717,0.22512257,0.019647824,0.0020971857,0.25965896],"study_design_scores_gemma":[0.000068401954,0.0005670659,0.0015905926,0.000018491746,0.000033815984,0.0002241086,0.00019408528,0.9413805,0.051071785,0.0031716975,0.0016542361,0.000025117302],"about_ca_topic_score_codex":0.00090297475,"about_ca_topic_score_gemma":0.0004813872,"teacher_disagreement_score":0.0037904764,"about_ca_system_score_codex":0.0006863699,"about_ca_system_score_gemma":0.00032033157,"threshold_uncertainty_score":0.020046234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06563869,0.0011912688,0.9181167,0.00029085862,0.0002960606,0.0006507475,0.00021468652,0.0041038534,0.009497183],"genre_scores_gemma":[0.68817073,0.0006564438,0.29940525,0.00020379284,0.00011895104,0.0003868657,0.00049952685,0.00029342083,0.010264959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986181,0.00048400916,0.000075235206,0.00022376291,0.00046280108,0.00013599334],"domain_scores_gemma":[0.9960198,0.0012090051,0.00040638933,0.0014820452,0.00067185983,0.0002109539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016763828,0.00077850017,0.0010188746,0.0011308737,0.0010023004,0.0011555793,0.0020461797,0.0008741436,0.00348964],"category_scores_gemma":[0.006118995,0.0004245192,0.0006099781,0.0011794689,0.0006182424,0.0012565282,0.0016317982,0.00060671463,0.001733103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096998754,0.00027845564,0.0058829132,0.0003948514,0.00022543618,0.00089406705,0.00064699794,0.27931786,0.058419254,0.030271214,0.016794963,0.6059039],"study_design_scores_gemma":[0.00018052629,0.00041848517,0.0013832966,0.000032841526,0.00010339383,0.0013250076,0.00022955361,0.92695886,0.028630909,0.018624483,0.022042489,0.00007010945],"about_ca_topic_score_codex":0.00079287565,"about_ca_topic_score_gemma":0.001227408,"teacher_disagreement_score":0.00348964,"about_ca_system_score_codex":0.00045299952,"about_ca_system_score_gemma":0.0007120907,"threshold_uncertainty_score":0.0116740465},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020377923,0.000506979,0.86379856,0.0006017976,0.00035901627,0.0013484237,0.0007618931,0.09858291,0.013662441],"genre_scores_gemma":[0.5101323,0.0010641599,0.4399185,0.0007934333,0.0005694612,0.0019319993,0.0036988673,0.0049880096,0.036903214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981577,0.0003680727,0.00019799343,0.00039701787,0.00071632635,0.00016285454],"domain_scores_gemma":[0.9969302,0.00060608744,0.00032772726,0.000950124,0.00072003424,0.00046575218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018028574,0.0007675765,0.0007396251,0.00123961,0.0013092341,0.00207073,0.0036702817,0.00150858,0.007701417],"category_scores_gemma":[0.0067134756,0.000637068,0.00044477408,0.0014177631,0.000807107,0.003856501,0.004003587,0.0021083902,0.005936861],"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.0019575192,0.000980732,0.0054135635,0.0011890143,0.00022596981,0.0023233416,0.0023043423,0.022197932,0.06392797,0.052503143,0.2256701,0.6213063],"study_design_scores_gemma":[0.0005251089,0.0007363939,0.0039154016,0.000121597564,0.00014900406,0.0022056315,0.00032127253,0.43608108,0.05119942,0.028675197,0.47573772,0.00033212203],"about_ca_topic_score_codex":0.0018638241,"about_ca_topic_score_gemma":0.001126031,"teacher_disagreement_score":0.007701417,"about_ca_system_score_codex":0.00065079634,"about_ca_system_score_gemma":0.0016074383,"threshold_uncertainty_score":0.02576381},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101312045,0.0022846397,0.93289566,0.002855767,0.00028035633,0.00039277077,0.000102760896,0.00082382833,0.050233014],"genre_scores_gemma":[0.37342897,0.006458992,0.5317463,0.0018809417,0.0006966723,0.0018265534,0.0007290539,0.00034903197,0.08288351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815243,0.0006367801,0.00013402944,0.00024940041,0.00061921414,0.00020812546],"domain_scores_gemma":[0.9989618,0.0003205628,0.00011743398,0.00022008755,0.0002550855,0.0001249804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019131828,0.0006847865,0.0005052244,0.00077918044,0.0019141345,0.004952956,0.0022650505,0.0026152122,0.004069512],"category_scores_gemma":[0.0028243032,0.0004842717,0.00073632784,0.0012215385,0.0016538147,0.0065067876,0.0029185528,0.0018975936,0.0017949203],"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.00003303745,0.000104110484,0.00034832975,0.0001663787,0.000014046968,0.000397843,0.0011201923,0.015133707,0.0035979687,0.9175855,0.01074025,0.050758615],"study_design_scores_gemma":[0.00003253928,0.00012557703,0.00035178167,0.00022921823,0.000043968455,0.00092533487,0.0007783849,0.22702208,0.0065583037,0.3725986,0.39126915,0.0000650789],"about_ca_topic_score_codex":0.003358691,"about_ca_topic_score_gemma":0.0025315243,"teacher_disagreement_score":0.004952956,"about_ca_system_score_codex":0.0020662232,"about_ca_system_score_gemma":0.0017337465,"threshold_uncertainty_score":0.014991581},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85721487,0.0004802757,0.10121235,0.0015077464,0.00008870611,0.0005159023,0.00003182314,0.0003502267,0.038598087],"genre_scores_gemma":[0.993244,0.000038630926,0.0055504455,0.00006254836,0.000013437517,0.00009248696,0.000008115797,0.000007965666,0.0009823937],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99742484,0.001702152,0.0000698556,0.00019602703,0.00042457486,0.00018246584],"domain_scores_gemma":[0.9869359,0.008808454,0.001097585,0.0005116204,0.0016333582,0.0010130944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037507177,0.00043788776,0.00039517396,0.0009891198,0.00087824784,0.0016367532,0.0004702756,0.0012345227,0.0019784982],"category_scores_gemma":[0.016031029,0.00015502509,0.00039166224,0.0003019169,0.0008611591,0.0011744603,0.0007627415,0.00075215776,0.00030889446],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001476831,0.005791326,0.1487244,0.0011425095,0.00059374614,0.0018012032,0.013047268,0.026425008,0.040275674,0.29757875,0.0047277636,0.4584155],"study_design_scores_gemma":[0.0008470508,0.004886272,0.15674414,0.00029454954,0.0007628144,0.0028247712,0.0077526756,0.5738502,0.02192217,0.20624742,0.02352049,0.00034745096],"about_ca_topic_score_codex":0.0005270075,"about_ca_topic_score_gemma":0.00042656594,"teacher_disagreement_score":0.0037507177,"about_ca_system_score_codex":0.0006514694,"about_ca_system_score_gemma":0.00068757235,"threshold_uncertainty_score":0.01983589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11590777,0.0019359522,0.85896516,0.0010565027,0.0002715864,0.0003250346,0.00014728867,0.0028230222,0.018567739],"genre_scores_gemma":[0.90113974,0.0008244741,0.095151134,0.00011446727,0.000063966334,0.00012344895,0.000086994616,0.000036079717,0.002459718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991423,0.00028759558,0.000065297456,0.00012653199,0.00027725377,0.00010105572],"domain_scores_gemma":[0.9988423,0.00046938148,0.000121980214,0.00019757751,0.00022180112,0.00014695532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011213708,0.00038589875,0.00048737304,0.000417759,0.0011567363,0.0015708512,0.0010232984,0.00082826655,0.00095954206],"category_scores_gemma":[0.003103172,0.00026943418,0.0002508278,0.00044996437,0.00079889514,0.0017461958,0.0013996522,0.0008295039,0.00023436922],"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.00033690807,0.00034470722,0.0037766169,0.00022608004,0.00009267765,0.0007312277,0.00083965284,0.69937897,0.025206871,0.12818679,0.005386639,0.13549283],"study_design_scores_gemma":[0.000031564243,0.0000483964,0.00046496824,0.000016198122,0.000030547515,0.000108684406,0.000096879194,0.9584217,0.0043981834,0.027651368,0.00870811,0.000023476246],"about_ca_topic_score_codex":0.007108777,"about_ca_topic_score_gemma":0.007233281,"teacher_disagreement_score":0.007108777,"about_ca_system_score_codex":0.00083076785,"about_ca_system_score_gemma":0.0014126027,"threshold_uncertainty_score":0.014134824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14183868,0.004590481,0.590845,0.013975789,0.0005633767,0.0006225061,0.00030376823,0.00071806245,0.24654233],"genre_scores_gemma":[0.94091886,0.0013500467,0.034376647,0.00037106356,0.00039803845,0.00048215617,0.000068003865,0.00009297953,0.021942075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956404,0.0019716495,0.00016228884,0.00062994997,0.0010498015,0.00054595794],"domain_scores_gemma":[0.9936242,0.0036942018,0.00067253446,0.0007545808,0.00062726816,0.0006270866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004060429,0.0005582048,0.0011293982,0.0012299446,0.0035745574,0.006213797,0.002139388,0.0035774645,0.014492938],"category_scores_gemma":[0.01418003,0.0006986407,0.00085457764,0.0018734997,0.005920306,0.011464068,0.0034647535,0.0023008327,0.0015502755],"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.000023422614,0.000015739062,0.00007404849,0.000022331946,0.000005120691,0.00005109942,0.00013905241,0.0072782445,0.00013067112,0.9881682,0.001032636,0.0030594098],"study_design_scores_gemma":[0.000044477158,0.000026780712,0.00009065667,0.00001806814,0.0000063704415,0.00005503468,0.000096977645,0.044512104,0.00013083749,0.94647557,0.008525175,0.000017957374],"about_ca_topic_score_codex":0.0032727646,"about_ca_topic_score_gemma":0.002255186,"teacher_disagreement_score":0.014492938,"about_ca_system_score_codex":0.0047174552,"about_ca_system_score_gemma":0.0025642004,"threshold_uncertainty_score":0.04848367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9026821,0.00063224917,0.081946015,0.0015617716,0.000087544184,0.0004162423,0.00069536763,0.0004461008,0.011532439],"genre_scores_gemma":[0.98181605,0.00025393174,0.015948402,0.000074215466,0.000010649581,0.00018064541,0.00030386634,0.000031279847,0.0013809486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862146,0.00068038935,0.000061913146,0.00014961687,0.00022128732,0.00026537184],"domain_scores_gemma":[0.9794351,0.016517552,0.00094321946,0.00077085925,0.0011388336,0.0011945087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030178458,0.0007622314,0.00094366336,0.0012179415,0.0012513555,0.0012922647,0.001577308,0.0019829492,0.0023781871],"category_scores_gemma":[0.012693817,0.0004094859,0.0007403875,0.0017487903,0.0012004136,0.0018852197,0.0013093781,0.0013047347,0.00019888347],"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.00010156942,0.00016286335,0.0025698978,0.000041336712,0.000031769097,0.00010333543,0.00012992167,0.9880717,0.0008351867,0.0049003926,0.0005542679,0.002497799],"study_design_scores_gemma":[0.000051445335,0.00009803026,0.00040557943,0.0000054766174,0.000011593799,0.000024455545,0.000094616684,0.9972589,0.00032583924,0.0013270928,0.00038871513,0.000008342025],"about_ca_topic_score_codex":0.016304184,"about_ca_topic_score_gemma":0.010358884,"teacher_disagreement_score":0.016304184,"about_ca_system_score_codex":0.0021344929,"about_ca_system_score_gemma":0.0017907064,"threshold_uncertainty_score":0.03241861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016477657,0.00023480436,0.9768018,0.00025809818,0.00020443666,0.00028927904,0.00006678166,0.0031162316,0.0025507798],"genre_scores_gemma":[0.5514529,0.0004473759,0.44091198,0.00017565844,0.0001499703,0.0007888431,0.0004708078,0.00033655233,0.005265996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990798,0.00025062115,0.00011342085,0.00013369035,0.00036626423,0.000056204557],"domain_scores_gemma":[0.99862325,0.0005124429,0.000121376106,0.00030946094,0.00029922614,0.0001341433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019534105,0.00039607572,0.000540576,0.0005356702,0.0009922766,0.0011120378,0.0015484802,0.00067134853,0.0017436111],"category_scores_gemma":[0.0045103924,0.00027390182,0.00033986932,0.00056046393,0.0005862042,0.0017964073,0.0016332079,0.0012299118,0.00043209095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013027356,0.00040858766,0.00233036,0.00044056377,0.00023983096,0.0010104119,0.0013680602,0.29928863,0.112391025,0.15432851,0.018869659,0.40802172],"study_design_scores_gemma":[0.0001872129,0.00022553497,0.00031696475,0.000017664172,0.00007014027,0.0002027939,0.000083896084,0.9430057,0.020261679,0.0106472215,0.024928393,0.00005283802],"about_ca_topic_score_codex":0.0017173904,"about_ca_topic_score_gemma":0.0014736869,"teacher_disagreement_score":0.0019534105,"about_ca_system_score_codex":0.000584385,"about_ca_system_score_gemma":0.0012106149,"threshold_uncertainty_score":0.010330737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026127754,0.0015290701,0.9683511,0.00035934846,0.00008198686,0.00030686532,0.000010282176,0.00038908227,0.0028444838],"genre_scores_gemma":[0.38672432,0.0042546582,0.6038431,0.000139037,0.00019590987,0.00046441637,0.000056656972,0.00013420933,0.004187799],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986099,0.00050159905,0.00012081772,0.0001311639,0.00053411856,0.00010238365],"domain_scores_gemma":[0.9987872,0.00062432163,0.00011798985,0.00014876065,0.00025898832,0.00006279166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017228904,0.000577634,0.00062439736,0.00037925201,0.001013656,0.0013700735,0.0010801532,0.0012151772,0.0006467772],"category_scores_gemma":[0.0035891524,0.0006648397,0.00032518274,0.0003851822,0.0009843024,0.0030564114,0.0010870969,0.000788973,0.0006549577],"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.0002729572,0.00025698385,0.002620464,0.0014724749,0.000117621,0.0023797003,0.0021900926,0.2794385,0.1377124,0.21194585,0.0055554775,0.3560375],"study_design_scores_gemma":[0.00010015711,0.00049626053,0.0007771772,0.00013961979,0.00012296601,0.0014767782,0.0007863274,0.7553166,0.08768731,0.081323504,0.07169415,0.00007922174],"about_ca_topic_score_codex":0.00040348366,"about_ca_topic_score_gemma":0.00062708586,"teacher_disagreement_score":0.0017228904,"about_ca_system_score_codex":0.0004516569,"about_ca_system_score_gemma":0.0007545023,"threshold_uncertainty_score":0.009111583},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021627876,0.0001474737,0.991372,0.00055847765,0.000047087935,0.00059482,0.0001398517,0.00384071,0.0011368323],"genre_scores_gemma":[0.058994565,0.00025463826,0.93795186,0.00017541987,0.00007256657,0.0006898885,0.0005996496,0.00021044062,0.0010509876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9821628,0.0053419527,0.0031166526,0.002699594,0.0057351138,0.0009439814],"domain_scores_gemma":[0.9807628,0.006492765,0.0021442305,0.0039518704,0.0050713676,0.0015770439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028017802,0.0017165837,0.0014947932,0.0037793252,0.001993168,0.007307799,0.005150956,0.0037287185,0.0016951881],"category_scores_gemma":[0.02242842,0.0013746951,0.0023120542,0.0019323961,0.0031552806,0.0060463673,0.004688471,0.004515341,0.0008591314],"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.0003883067,0.0010190931,0.006937619,0.0016172142,0.000465422,0.002095269,0.0050784517,0.14894119,0.021304226,0.5015086,0.015802182,0.2948424],"study_design_scores_gemma":[0.00025048744,0.0005130917,0.0025493032,0.0009034941,0.00029994978,0.0012304329,0.0007746929,0.705688,0.015988287,0.15520227,0.11626541,0.00033456265],"about_ca_topic_score_codex":0.016671652,"about_ca_topic_score_gemma":0.008432125,"teacher_disagreement_score":0.028017802,"about_ca_system_score_codex":0.0028059767,"about_ca_system_score_gemma":0.009515193,"threshold_uncertainty_score":0.1481741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08535695,0.0014128918,0.9030521,0.0011618689,0.00010772028,0.00028104737,0.00039344016,0.0032623617,0.004971622],"genre_scores_gemma":[0.47368056,0.0017067478,0.51110554,0.00042912853,0.00013863744,0.00040703593,0.0016100064,0.0005051872,0.010417174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977581,0.0008305817,0.00021166333,0.0004319363,0.0006372416,0.0001303683],"domain_scores_gemma":[0.9972856,0.0015237157,0.00026996154,0.0005802274,0.00024636768,0.00009409828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002820544,0.0004688833,0.00077277014,0.0009456641,0.0010338383,0.0022602547,0.001342808,0.0013583642,0.0017045814],"category_scores_gemma":[0.006339168,0.00049558294,0.00037019598,0.0018128598,0.0009400402,0.003529526,0.001570947,0.0009729929,0.00051242905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014608167,0.00034346324,0.004486557,0.0006815785,0.00014882321,0.0011774244,0.0013251824,0.3607575,0.04937671,0.121491596,0.01826919,0.44048113],"study_design_scores_gemma":[0.00018124275,0.0002032015,0.001599075,0.000039048038,0.00006108243,0.00058246724,0.00036237456,0.85651416,0.029902633,0.08106453,0.029430706,0.000059466354],"about_ca_topic_score_codex":0.0031688306,"about_ca_topic_score_gemma":0.002451782,"teacher_disagreement_score":0.0031688306,"about_ca_system_score_codex":0.0013289441,"about_ca_system_score_gemma":0.0007649573,"threshold_uncertainty_score":0.014916599},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13926263,0.00051396666,0.8393839,0.0003367559,0.00019912476,0.00028246248,0.00012550333,0.007936969,0.011958697],"genre_scores_gemma":[0.86377317,0.00015838005,0.13095737,0.000065731685,0.000069010755,0.000118196935,0.00023247881,0.00032169608,0.0043040467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.00007203391,0.00003099319,0.00008946436,0.00023443521,0.00007408197],"domain_scores_gemma":[0.99906737,0.00020347779,0.000088759436,0.00018674342,0.0002546941,0.00019895862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047526316,0.0006864857,0.0007967945,0.00097589334,0.0013949767,0.0013010913,0.0031373447,0.00060832634,0.0036085546],"category_scores_gemma":[0.0020895635,0.0003592423,0.000271839,0.00080610515,0.00047495752,0.001670181,0.0022638016,0.0007013094,0.0012042032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012041106,0.0008602515,0.004845183,0.00027153429,0.00013329483,0.00045792956,0.001085373,0.29607135,0.13459443,0.02299728,0.013865703,0.5236136],"study_design_scores_gemma":[0.000041706953,0.000080544596,0.00068531855,0.0000053211525,0.0000140427055,0.00007985783,0.00009992391,0.9796367,0.009160143,0.005970749,0.0041957633,0.000029822399],"about_ca_topic_score_codex":0.005063017,"about_ca_topic_score_gemma":0.007313041,"teacher_disagreement_score":0.005063017,"about_ca_system_score_codex":0.00064028375,"about_ca_system_score_gemma":0.0006409187,"threshold_uncertainty_score":0.012071788},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004820361,0.001990481,0.98072994,0.0007726494,0.00023785606,0.00035794335,0.00027236907,0.0013163065,0.009502038],"genre_scores_gemma":[0.28666928,0.0042636716,0.6927963,0.00037207524,0.00049130863,0.00088445516,0.00095869415,0.00021843803,0.013345818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807656,0.0004749189,0.00017602558,0.00017086288,0.00097050087,0.00013117927],"domain_scores_gemma":[0.9966137,0.0008650635,0.00022121971,0.0016386865,0.0005191478,0.0001422267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026722231,0.00037357048,0.0008230919,0.001017078,0.0015314302,0.0018688259,0.002244591,0.0010693601,0.004476924],"category_scores_gemma":[0.007763485,0.00040976994,0.00055910787,0.0024378528,0.0011299332,0.005282316,0.00347659,0.0019373816,0.0016798347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024100805,0.000082730774,0.0005059925,0.0003767428,0.0000542838,0.00034626274,0.0005495971,0.051967215,0.010914518,0.67940825,0.026320955,0.22923253],"study_design_scores_gemma":[0.0002268384,0.00020853861,0.0005343888,0.00009769362,0.00006767247,0.0008805391,0.00031166745,0.38156256,0.010682409,0.4085189,0.19679926,0.00010958261],"about_ca_topic_score_codex":0.0014658413,"about_ca_topic_score_gemma":0.0018313942,"teacher_disagreement_score":0.004476924,"about_ca_system_score_codex":0.001492563,"about_ca_system_score_gemma":0.0012374741,"threshold_uncertainty_score":0.014976859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012047712,0.00005078285,0.9949527,0.00004993202,0.000017857154,0.00011056382,0.00003761106,0.0022477382,0.0013280971],"genre_scores_gemma":[0.105876364,0.00039993878,0.88736284,0.00011937115,0.000053969343,0.0010138534,0.00028522676,0.0011048805,0.0037835937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980907,0.0006355583,0.00014782308,0.00018271236,0.0007921132,0.00015120108],"domain_scores_gemma":[0.99781066,0.0009771923,0.00019298543,0.00039248282,0.00048333607,0.00014342186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033515322,0.0011277765,0.00093451235,0.00084906764,0.0009139494,0.0020757606,0.004481108,0.0015007427,0.004122688],"category_scores_gemma":[0.0071021225,0.00074319803,0.0009996764,0.0004882649,0.0016763533,0.002967849,0.0024408624,0.0019930843,0.0010925261],"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.00026132393,0.00016496918,0.0009458025,0.00049261935,0.00008454925,0.0004550439,0.0006488352,0.5389995,0.016446292,0.32849216,0.010143806,0.10286511],"study_design_scores_gemma":[0.00005053641,0.00007416726,0.000070959795,0.000055003275,0.000023238492,0.0001783145,0.000045667686,0.93775547,0.0062762783,0.022759253,0.03267573,0.00003547538],"about_ca_topic_score_codex":0.0034999826,"about_ca_topic_score_gemma":0.0028472333,"teacher_disagreement_score":0.004481108,"about_ca_system_score_codex":0.0013604499,"about_ca_system_score_gemma":0.0020328842,"threshold_uncertainty_score":0.017724872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698629,0.00023237678,0.024946243,0.000072302224,0.000022712056,0.00014893261,0.00010697179,0.0020368549,0.0025706808],"genre_scores_gemma":[0.9943901,0.000052061896,0.005030514,0.000013110653,0.0000064251785,0.00002693191,0.00011387783,0.000023467881,0.0003435766],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987367,0.0003474489,0.000104018676,0.00014499441,0.00050745043,0.00015943196],"domain_scores_gemma":[0.99752396,0.0006881778,0.00017737712,0.00039486593,0.0008417992,0.00037381786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010524548,0.00044978337,0.0007774593,0.0007896511,0.00046602506,0.00053348555,0.00077545416,0.0006375764,0.0015572335],"category_scores_gemma":[0.0030693172,0.00016257277,0.00021976807,0.0007682431,0.0003384899,0.0009873732,0.00048268866,0.00046575972,0.00041324124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038914718,0.0017262215,0.02546565,0.00049199775,0.0002646361,0.001436485,0.000754583,0.09119435,0.7153845,0.002038293,0.0025319078,0.15481995],"study_design_scores_gemma":[0.00014942973,0.0038224715,0.032964163,0.0000184007,0.00016789258,0.00071175763,0.0004120074,0.69761086,0.26181832,0.00040759574,0.001821284,0.00009586888],"about_ca_topic_score_codex":0.0023332848,"about_ca_topic_score_gemma":0.0009712883,"teacher_disagreement_score":0.0023332848,"about_ca_system_score_codex":0.00061004114,"about_ca_system_score_gemma":0.00031666478,"threshold_uncertainty_score":0.005566001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36496076,0.0009398206,0.60341454,0.0010585602,0.00014509172,0.0005192883,0.0008419738,0.0008399399,0.027280012],"genre_scores_gemma":[0.95860976,0.00071440113,0.035007354,0.00006512483,0.000039221864,0.00030268604,0.0002010226,0.00005427856,0.0050061876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948406,0.00016651973,0.000033871405,0.00008674131,0.00014650592,0.000082238425],"domain_scores_gemma":[0.9987135,0.0006857101,0.00017439593,0.00006855571,0.00030512924,0.000052685995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064852904,0.0008011028,0.00092713494,0.00053760194,0.0007884976,0.001170728,0.0015063272,0.0018674228,0.0018947491],"category_scores_gemma":[0.0023097445,0.0003716169,0.00060394476,0.0006276847,0.0007246676,0.0017133518,0.0006746945,0.0008180022,0.0003766149],"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.000029973655,0.000024863988,0.0005153464,0.00003474386,0.0000092110895,0.00011840031,0.000065419554,0.9895002,0.0014673527,0.0066660107,0.00017085095,0.0013976695],"study_design_scores_gemma":[0.0000034155169,0.000008605316,0.00004613926,0.0000015187634,0.0000025244435,0.000009396726,0.000007708196,0.99912435,0.00018341356,0.0005120999,0.00009834662,0.00000245511],"about_ca_topic_score_codex":0.017520191,"about_ca_topic_score_gemma":0.008605173,"teacher_disagreement_score":0.017520191,"about_ca_system_score_codex":0.0013893573,"about_ca_system_score_gemma":0.0013001349,"threshold_uncertainty_score":0.03483641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004651259,0.0003731919,0.98975945,0.00015529396,0.000040025676,0.00014953315,0.00006775181,0.0039557535,0.0008478213],"genre_scores_gemma":[0.14438888,0.0008003309,0.8476563,0.00033238583,0.000099952624,0.00024451836,0.000381464,0.0004287459,0.0056674485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955764,0.0012783622,0.0005284151,0.00067969615,0.00160953,0.00032764385],"domain_scores_gemma":[0.99599564,0.0019391977,0.00029546808,0.00086637714,0.000766946,0.00013633224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007105765,0.0006877807,0.0015069403,0.0025244362,0.0018539425,0.0027650583,0.0020013056,0.0023483236,0.004314577],"category_scores_gemma":[0.008110399,0.000759092,0.0012972363,0.0029229661,0.001138359,0.0065107094,0.0012859158,0.0014630432,0.0020758475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010510485,0.0003962908,0.0023304948,0.0005588495,0.0002088248,0.00035121207,0.0007386542,0.07809182,0.031306177,0.060397338,0.009841569,0.8147277],"study_design_scores_gemma":[0.00025161146,0.0005583868,0.0010073446,0.00008095496,0.00011687313,0.0006119727,0.00019539667,0.8218624,0.066549584,0.06984667,0.03874683,0.00017202648],"about_ca_topic_score_codex":0.010910357,"about_ca_topic_score_gemma":0.0039612334,"teacher_disagreement_score":0.010910357,"about_ca_system_score_codex":0.0016515778,"about_ca_system_score_gemma":0.0018746414,"threshold_uncertainty_score":0.037579358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28108254,0.0002679954,0.7142386,0.00036139225,0.000028157538,0.00007333619,0.00002964766,0.0002861862,0.0036320917],"genre_scores_gemma":[0.9799242,0.00006958297,0.019262085,0.000028269382,0.000005874611,0.0000333872,0.000009114279,0.000012872599,0.0006546301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994116,0.00028313723,0.000021025657,0.00006653904,0.00012693815,0.00009088798],"domain_scores_gemma":[0.99811137,0.0010717155,0.00029895557,0.00012597289,0.00024417663,0.00014778331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016424725,0.00026114052,0.00055126514,0.00035788317,0.0004281158,0.00075053883,0.00095461257,0.00061914994,0.0006486035],"category_scores_gemma":[0.0044263205,0.0002655053,0.00021371548,0.00027025593,0.0011444755,0.001276603,0.0006219853,0.00046407146,0.0000883222],"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.00005419748,0.000049803035,0.00071293575,0.000027196435,0.000022925997,0.00009280531,0.000102501326,0.9621125,0.003796351,0.022135938,0.0002756289,0.010617202],"study_design_scores_gemma":[0.000010773034,0.000014082721,0.000102770595,0.0000013363989,0.0000028225347,0.0000116589745,0.000015119406,0.9898503,0.00052069046,0.009262343,0.00020508605,0.0000030220363],"about_ca_topic_score_codex":0.0026905446,"about_ca_topic_score_gemma":0.0017999843,"teacher_disagreement_score":0.0026905446,"about_ca_system_score_codex":0.00089008675,"about_ca_system_score_gemma":0.0008455769,"threshold_uncertainty_score":0.008686304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24897479,0.000447043,0.74748737,0.00040682967,0.000050770817,0.000098462275,0.00006604445,0.0013711934,0.0010974999],"genre_scores_gemma":[0.9674246,0.00008809759,0.031891424,0.000029376213,0.00003193542,0.000028249293,0.00004852422,0.000025216563,0.0004325459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991025,0.00029113202,0.000072858835,0.00015550097,0.0002814902,0.00009660028],"domain_scores_gemma":[0.9970594,0.0016011567,0.0003960783,0.00024576744,0.000517903,0.00017974935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019126293,0.0008020595,0.0008873787,0.0007559882,0.00050579174,0.0011801325,0.0010018861,0.0005937302,0.0005435191],"category_scores_gemma":[0.005746319,0.00037179972,0.0003455242,0.00037994122,0.0003053958,0.0014560346,0.00097580545,0.0006539268,0.00014610298],"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.00053030613,0.00025522476,0.0125473915,0.000076980075,0.00012445767,0.00028573105,0.0003314298,0.7298219,0.021297462,0.004906797,0.0017079127,0.22811437],"study_design_scores_gemma":[0.000005072864,0.000022445905,0.0005842756,0.0000016220993,0.000007815783,0.00001936625,0.000018987112,0.9962968,0.0016529256,0.0012646262,0.00011971966,0.0000062930603],"about_ca_topic_score_codex":0.0023365717,"about_ca_topic_score_gemma":0.002028662,"teacher_disagreement_score":0.0023365717,"about_ca_system_score_codex":0.0008420981,"about_ca_system_score_gemma":0.0006912678,"threshold_uncertainty_score":0.010115027},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010076489,0.003585676,0.13521367,0.0054692966,0.0036368659,0.00052655477,0.0077274526,0.029284824,0.8044792],"genre_scores_gemma":[0.06890764,0.0028766934,0.09611999,0.0037817876,0.0006723851,0.00043314643,0.01437753,0.004041329,0.80878943],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993912,0.000075034746,0.000029995144,0.00017209993,0.00024483318,0.000086848384],"domain_scores_gemma":[0.9994147,0.00007470835,0.0000363179,0.00016562665,0.00020165906,0.00010701374],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058020366,0.000799595,0.00052310614,0.001480542,0.0013879349,0.0028988076,0.0016834948,0.001741918,0.2221941],"category_scores_gemma":[0.0016332569,0.00037344248,0.000566739,0.0011918134,0.0004266528,0.002865951,0.0028433937,0.0012260274,0.1332794],"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.00030013412,0.0001641293,0.001854672,0.0005957352,0.00004434639,0.0005694415,0.0004192944,0.0027110605,0.009350804,0.08651814,0.3008855,0.5965867],"study_design_scores_gemma":[0.000014737711,0.000032209526,0.0004849823,0.000047952664,0.000010210627,0.00026323384,0.00006619979,0.0018878002,0.0017443978,0.0043090405,0.99112296,0.000016330201],"about_ca_topic_score_codex":0.0030287018,"about_ca_topic_score_gemma":0.003467354,"teacher_disagreement_score":0.7778059,"about_ca_system_score_codex":0.0007711605,"about_ca_system_score_gemma":0.0010065766,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18288578,0.0015845917,0.77487594,0.0011274446,0.00034444637,0.0006428398,0.00020888033,0.012483877,0.025846245],"genre_scores_gemma":[0.77224094,0.0006894124,0.21376228,0.00027496007,0.000060846527,0.00039488648,0.000384395,0.0002125499,0.011979735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995407,0.0001707106,0.000022906113,0.00007964541,0.00012792014,0.000058184647],"domain_scores_gemma":[0.9995278,0.000076868324,0.00004555145,0.00012087713,0.00013607285,0.00009286922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006133065,0.00039775154,0.0002822627,0.0006212608,0.000895236,0.0010027875,0.0012023745,0.0006478751,0.0018688892],"category_scores_gemma":[0.0011689912,0.00017524774,0.0002289136,0.00046121352,0.0004104101,0.0011079505,0.0012083891,0.0007303116,0.0007230865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017601711,0.00057396997,0.005927915,0.00064028136,0.00025713208,0.0020401194,0.0009834627,0.237265,0.25675073,0.085268416,0.027571777,0.38096103],"study_design_scores_gemma":[0.00015975864,0.0009818916,0.0034860082,0.000089059264,0.00018174744,0.0011501053,0.00029810955,0.85695845,0.03863723,0.0091508925,0.088789366,0.00011744191],"about_ca_topic_score_codex":0.00518131,"about_ca_topic_score_gemma":0.0062207174,"teacher_disagreement_score":0.00518131,"about_ca_system_score_codex":0.0009905745,"about_ca_system_score_gemma":0.00071334315,"threshold_uncertainty_score":0.010302305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023203273,0.00038586633,0.98449945,0.00038556044,0.00011478086,0.0007946685,0.00044654874,0.006130652,0.004922076],"genre_scores_gemma":[0.05357387,0.00058875384,0.9372677,0.00019309549,0.00009232242,0.0009812542,0.001378317,0.00042159567,0.0055031064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964227,0.0013348175,0.00043772277,0.00050395355,0.0010857304,0.00021509654],"domain_scores_gemma":[0.99714464,0.00080106343,0.00025807906,0.0009853888,0.00049758016,0.000313191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004303086,0.00093958573,0.0015391228,0.00271177,0.0041828933,0.0057503367,0.0040702536,0.002880221,0.0034954934],"category_scores_gemma":[0.0073580826,0.0011022919,0.001024855,0.004414181,0.0024582902,0.007759207,0.004986439,0.0020497085,0.0033303704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032195915,0.0002462574,0.0016468805,0.0009646397,0.00015206504,0.0016297061,0.0024311168,0.02232045,0.010689867,0.6304109,0.052594528,0.2765916],"study_design_scores_gemma":[0.00014591169,0.00020472969,0.00056713563,0.00022726697,0.00013723459,0.0019653507,0.00065620925,0.28543475,0.01972327,0.2551141,0.43556106,0.00026302758],"about_ca_topic_score_codex":0.0066227354,"about_ca_topic_score_gemma":0.0042404938,"teacher_disagreement_score":0.0066227354,"about_ca_system_score_codex":0.001443217,"about_ca_system_score_gemma":0.0036440454,"threshold_uncertainty_score":0.022757173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07404207,0.00015671251,0.92420036,0.00012141212,0.000020088204,0.000078575256,0.000024441246,0.00020020454,0.0011561486],"genre_scores_gemma":[0.8272352,0.0001316149,0.17120941,0.00004062475,0.000022868187,0.00014843939,0.000047052064,0.000033291613,0.0011315091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892116,0.00042321166,0.00004426357,0.00014095455,0.00038435825,0.00008600634],"domain_scores_gemma":[0.99761957,0.0014109595,0.00025726008,0.00019756577,0.00040920026,0.00010539262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013932807,0.0003843509,0.00073144515,0.0004184495,0.00058145646,0.00051906804,0.0010415154,0.0006142919,0.0004608496],"category_scores_gemma":[0.0060709813,0.00027841452,0.00023289658,0.000409154,0.0008779337,0.0009503972,0.0010534066,0.0005122711,0.0001621115],"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.00019915191,0.000051857136,0.0005321369,0.00006357858,0.000024282339,0.000111910944,0.00018218478,0.9103696,0.013608044,0.03216903,0.0007439819,0.041944243],"study_design_scores_gemma":[0.000022807439,0.000027819948,0.00005352661,0.0000024162978,0.0000031750342,0.00002202488,0.000009530568,0.9925609,0.0012914992,0.005812836,0.0001873717,0.0000060770353],"about_ca_topic_score_codex":0.0025459647,"about_ca_topic_score_gemma":0.002116234,"teacher_disagreement_score":0.0025459647,"about_ca_system_score_codex":0.00083175366,"about_ca_system_score_gemma":0.0013637512,"threshold_uncertainty_score":0.0073684454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052512873,0.00044174335,0.9217574,0.0016047937,0.000088194414,0.00035417205,0.00016728506,0.0012462387,0.021827301],"genre_scores_gemma":[0.697742,0.00038335787,0.29649442,0.00017741331,0.00004997943,0.00025899912,0.0002761739,0.00008362385,0.0045339926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998154,0.00071314664,0.00007748878,0.00020884712,0.00072040374,0.0001262254],"domain_scores_gemma":[0.9969387,0.0013943567,0.00020574353,0.0005436488,0.0006571817,0.00026039293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018636626,0.0003057827,0.0006021702,0.0016460426,0.0021078174,0.0018685439,0.0013098832,0.0011027938,0.0017163361],"category_scores_gemma":[0.008131459,0.00038334823,0.0005276328,0.0019093953,0.0011896023,0.0037901052,0.0027760882,0.0007828697,0.0005229027],"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.000533652,0.00033797798,0.0038258296,0.00040856958,0.00013227646,0.0014013528,0.0014513457,0.2150533,0.012191774,0.52926016,0.015825136,0.21957864],"study_design_scores_gemma":[0.000111701134,0.00005032811,0.00041152342,0.000028148384,0.000028810906,0.00035023,0.0002983196,0.7446105,0.004053285,0.23154382,0.018475179,0.000038271763],"about_ca_topic_score_codex":0.004643534,"about_ca_topic_score_gemma":0.00439971,"teacher_disagreement_score":0.004643534,"about_ca_system_score_codex":0.0008370094,"about_ca_system_score_gemma":0.0018948114,"threshold_uncertainty_score":0.009856105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5167,0.0003245327,0.47774717,0.00031082222,0.0000454859,0.00028023173,0.00013006829,0.0008340832,0.0036276942],"genre_scores_gemma":[0.97458005,0.00006452621,0.02448335,0.000030783252,0.000006718818,0.000057050675,0.000039404986,0.000024686586,0.0007134685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921477,0.0002595421,0.000055907727,0.00016478065,0.00017884877,0.0001262663],"domain_scores_gemma":[0.995622,0.0022771175,0.00060722843,0.0004799659,0.0005180607,0.00049571384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019496202,0.0004771406,0.0007579766,0.0006326516,0.00065494876,0.0010000194,0.0013243638,0.0006052693,0.0012576261],"category_scores_gemma":[0.006674876,0.00031037666,0.00032784676,0.0004145312,0.0006506023,0.0014961874,0.0008991054,0.0006716813,0.00019497146],"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.00025895526,0.00029882786,0.0032736512,0.00008237971,0.000052352945,0.00028896923,0.0002481825,0.93111783,0.016942937,0.015186474,0.0012225031,0.031027002],"study_design_scores_gemma":[0.000013236731,0.000046703262,0.00044075146,0.000003660246,0.0000067644205,0.00005908532,0.000027059721,0.9955681,0.001346159,0.0021636342,0.00031342937,0.0000114523655],"about_ca_topic_score_codex":0.0034099764,"about_ca_topic_score_gemma":0.002965515,"teacher_disagreement_score":0.0034099764,"about_ca_system_score_codex":0.00094359496,"about_ca_system_score_gemma":0.00085086,"threshold_uncertainty_score":0.0103107095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10303082,0.00027137826,0.8563977,0.00034455466,0.00014585203,0.0006024159,0.00014971248,0.031133916,0.0079236645],"genre_scores_gemma":[0.7410936,0.00015732789,0.24858917,0.000305971,0.00009323272,0.00036641228,0.00033391244,0.00031870248,0.008741767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948835,0.00010457946,0.000044045533,0.00011756257,0.00018329744,0.00006210628],"domain_scores_gemma":[0.9992355,0.00013367599,0.00008336416,0.00019043307,0.00019580594,0.00016118608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074344105,0.00033854134,0.00036013572,0.0003779359,0.0007857019,0.0012126773,0.0012763998,0.0005671059,0.0032841286],"category_scores_gemma":[0.0012270233,0.00028997223,0.00019158049,0.00028402195,0.00042402055,0.0013386683,0.0008911726,0.00060791743,0.00091393903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014912662,0.0010825107,0.0077667194,0.0003862808,0.0001557186,0.0012569468,0.0017672098,0.037402008,0.30340618,0.028758297,0.0263575,0.59016937],"study_design_scores_gemma":[0.00017237695,0.0008687464,0.0032998705,0.0000484473,0.00012299749,0.00086427585,0.0001466576,0.7740352,0.14826281,0.008390513,0.0636134,0.00017466604],"about_ca_topic_score_codex":0.0018261569,"about_ca_topic_score_gemma":0.0014602204,"teacher_disagreement_score":0.0032841286,"about_ca_system_score_codex":0.0005861544,"about_ca_system_score_gemma":0.000884866,"threshold_uncertainty_score":0.010986507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50208026,0.0009673715,0.47091594,0.0012859658,0.00006209087,0.00032762412,0.00020285611,0.0010936835,0.023064196],"genre_scores_gemma":[0.9905572,0.00008107514,0.0076325415,0.000028414057,0.000013396734,0.000031310086,0.00003061108,0.000022559014,0.0016029932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829584,0.0007168575,0.000062565705,0.00030741637,0.00036105255,0.00025619203],"domain_scores_gemma":[0.99332666,0.003698123,0.0007584041,0.000725684,0.001168766,0.00032238147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027969156,0.000510958,0.0010927838,0.00074310636,0.0010335713,0.001580393,0.0012365874,0.0013628236,0.0031419024],"category_scores_gemma":[0.011093844,0.00026590304,0.00066804717,0.0005458052,0.0014123727,0.0021485046,0.0011259018,0.0009745386,0.00039923537],"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.0004014929,0.00019716381,0.0060337535,0.00018731596,0.00015865207,0.0004327937,0.0006893938,0.82885796,0.018958475,0.112316035,0.0024116053,0.029355256],"study_design_scores_gemma":[0.00001524072,0.00011820691,0.0013164594,0.0000072353832,0.000027843658,0.00007451882,0.00006376177,0.98831546,0.0011358995,0.008362424,0.00054432795,0.000018741008],"about_ca_topic_score_codex":0.005331404,"about_ca_topic_score_gemma":0.002094276,"teacher_disagreement_score":0.005331404,"about_ca_system_score_codex":0.0019551774,"about_ca_system_score_gemma":0.0010768812,"threshold_uncertainty_score":0.014791667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021466518,0.00053840893,0.972537,0.00027334815,0.00017330251,0.0002407412,0.00007428746,0.0025932968,0.0021030267],"genre_scores_gemma":[0.49711448,0.00047913438,0.49710932,0.00020358065,0.00014419189,0.00034979702,0.00030381314,0.0002709775,0.004024665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831045,0.00031075202,0.00015155433,0.00025909563,0.0007464797,0.00022163271],"domain_scores_gemma":[0.9973953,0.00068925845,0.00022893895,0.000756025,0.00067810307,0.00025245085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014711433,0.0008381615,0.0013892031,0.0010044465,0.0017335106,0.001481554,0.003426317,0.0010602246,0.0015874312],"category_scores_gemma":[0.005794159,0.00045163752,0.0005757262,0.00087824906,0.0007756582,0.002943515,0.0026274184,0.0016509537,0.0006081174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018674927,0.000437397,0.0042615803,0.00035263877,0.00021919553,0.00054775504,0.00081062724,0.24355695,0.04958143,0.08486979,0.014552195,0.5989429],"study_design_scores_gemma":[0.00012591723,0.00013168908,0.00030803203,0.000017286142,0.0000558846,0.00043086306,0.000085037595,0.9620185,0.014334743,0.013933536,0.008468822,0.00008972547],"about_ca_topic_score_codex":0.0027270503,"about_ca_topic_score_gemma":0.0028281868,"teacher_disagreement_score":0.003426317,"about_ca_system_score_codex":0.00081236893,"about_ca_system_score_gemma":0.002366554,"threshold_uncertainty_score":0.007780254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19497764,0.00479991,0.7702819,0.0025299813,0.00016878048,0.00019575891,0.00028105863,0.00048513073,0.02627976],"genre_scores_gemma":[0.95092374,0.002091334,0.04335964,0.0001607935,0.00015708969,0.00013804974,0.00014351604,0.00020552508,0.002820292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932458,0.0030304098,0.000252561,0.000706281,0.0020035366,0.0007615271],"domain_scores_gemma":[0.95147675,0.039432257,0.0013671418,0.004423832,0.0027873858,0.0005126719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006810824,0.00094777794,0.0022840917,0.0014452147,0.0014005663,0.0029031993,0.0029988948,0.0021657539,0.0031475723],"category_scores_gemma":[0.053321697,0.0005501143,0.00059493794,0.0023921006,0.0028295992,0.008267996,0.00263157,0.0014476196,0.00087132],"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.0003620998,0.00013086738,0.001516973,0.00018594861,0.00008431933,0.00017294059,0.00023209596,0.6983769,0.004748613,0.2547473,0.0022172502,0.03722471],"study_design_scores_gemma":[0.000038543243,0.000073384384,0.00040329323,0.000034733755,0.000026340493,0.00015340299,0.000080992024,0.89405406,0.0029813836,0.10028494,0.0018389856,0.000029800787],"about_ca_topic_score_codex":0.0021640325,"about_ca_topic_score_gemma":0.0010213908,"teacher_disagreement_score":0.006810824,"about_ca_system_score_codex":0.0023369917,"about_ca_system_score_gemma":0.0014650802,"threshold_uncertainty_score":0.036019564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010186498,0.00009162565,0.98640686,0.00013281732,0.00007462864,0.000065652726,0.000015976693,0.0012824885,0.0017434208],"genre_scores_gemma":[0.47181803,0.00017726906,0.5233662,0.00013622706,0.00009359382,0.0002715308,0.00012115916,0.00023947249,0.0037765522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.00018672534,0.0000360104,0.00011673223,0.0002474056,0.000057501333],"domain_scores_gemma":[0.9993438,0.00020814825,0.000056843,0.00012201852,0.00019383777,0.00007540061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007657617,0.00054933573,0.00062598236,0.00069243903,0.0011004196,0.0010049419,0.0015324989,0.000792387,0.0021399986],"category_scores_gemma":[0.002444504,0.00028459364,0.00037388635,0.0006158958,0.0005162511,0.0012154342,0.0014787399,0.00080978754,0.0005562768],"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.00033321348,0.00020893003,0.0012403184,0.00009216855,0.000084430816,0.00016736747,0.00018512098,0.6192368,0.036789384,0.036653563,0.005603169,0.29940557],"study_design_scores_gemma":[0.000018016046,0.000016983413,0.000074378135,0.000002357098,0.0000047232124,0.000020326986,0.000008096945,0.99381095,0.0018205605,0.0024180806,0.0017991461,0.0000063762122],"about_ca_topic_score_codex":0.0023070385,"about_ca_topic_score_gemma":0.0021515123,"teacher_disagreement_score":0.0023070385,"about_ca_system_score_codex":0.00068220275,"about_ca_system_score_gemma":0.00086869136,"threshold_uncertainty_score":0.0071589947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98130715,0.00027932314,0.015438654,0.0001761039,0.000032777698,0.000106613974,0.000037933693,0.00032014263,0.0023013668],"genre_scores_gemma":[0.9910642,0.00006675369,0.008275471,0.000024526742,0.000013131086,0.00007160566,0.00004007202,0.00005757585,0.00038668848],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99123377,0.005013172,0.00069490005,0.0007914905,0.001684762,0.00058192457],"domain_scores_gemma":[0.8043463,0.17059861,0.008386557,0.008928503,0.0048433375,0.0028966446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008488389,0.0012630101,0.000685541,0.0010455517,0.0007321617,0.0019482754,0.0020345584,0.001069411,0.0016618748],"category_scores_gemma":[0.092570625,0.0004515951,0.00044579405,0.0006118017,0.0013015771,0.002401756,0.0018185576,0.0016250397,0.0002214848],"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.02081734,0.015278765,0.10251305,0.0018559097,0.0008637892,0.000554515,0.006614204,0.19450863,0.055443097,0.0055859955,0.0019799995,0.59398466],"study_design_scores_gemma":[0.0017221839,0.03771578,0.15508229,0.0003478479,0.0011218146,0.0007744268,0.0062160487,0.72242135,0.059274293,0.011672622,0.0032810343,0.0003704111],"about_ca_topic_score_codex":0.0016247914,"about_ca_topic_score_gemma":0.001838002,"teacher_disagreement_score":0.008488389,"about_ca_system_score_codex":0.0008828103,"about_ca_system_score_gemma":0.00064685,"threshold_uncertainty_score":0.044891417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06723479,0.0019379369,0.5450599,0.001731735,0.00057364797,0.00083524483,0.0059669153,0.27741107,0.09924881],"genre_scores_gemma":[0.5885287,0.0017935043,0.26955327,0.0016783015,0.0004575776,0.0005894709,0.016513864,0.009769484,0.11111583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.00009451454,0.00005362798,0.00015541555,0.00039454064,0.00013401236],"domain_scores_gemma":[0.99906415,0.00013657383,0.00010324285,0.00037004345,0.00018032352,0.00014562269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008045136,0.00066623837,0.00056660693,0.0010667187,0.0006049463,0.0018747002,0.0019289091,0.00075616763,0.014930546],"category_scores_gemma":[0.0021535011,0.00038034056,0.00045841886,0.0010764895,0.00042664303,0.0018536927,0.0021032267,0.0007597784,0.007987824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001611351,0.00038796692,0.006197971,0.0004042008,0.00013848329,0.0007671323,0.0005760287,0.021982271,0.053242244,0.05196013,0.34937063,0.51336163],"study_design_scores_gemma":[0.00040092305,0.00039284953,0.004569167,0.0000813586,0.00006721414,0.0013694311,0.0002858562,0.43619576,0.0371614,0.021008437,0.4982757,0.00019192464],"about_ca_topic_score_codex":0.006679904,"about_ca_topic_score_gemma":0.0069068726,"teacher_disagreement_score":0.014930546,"about_ca_system_score_codex":0.0008341066,"about_ca_system_score_gemma":0.0010737277,"threshold_uncertainty_score":0.04994768},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04072976,0.001162896,0.94043046,0.00085281284,0.0002648926,0.00040854735,0.00017051824,0.007415407,0.008564774],"genre_scores_gemma":[0.6086992,0.00076090696,0.38317478,0.00026830222,0.000105721934,0.0004343504,0.00034807433,0.00021595963,0.0059926864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994326,0.00013244382,0.00003557294,0.00012154366,0.00021201331,0.00006565573],"domain_scores_gemma":[0.99951005,0.000096419935,0.000042792166,0.00014983329,0.00012668266,0.000074252195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077715784,0.0006685421,0.00054711854,0.0005516593,0.0014843047,0.0011995668,0.0022704753,0.0008584363,0.00218019],"category_scores_gemma":[0.0015971275,0.00033759445,0.00040217492,0.00079594983,0.00068703777,0.0017207355,0.00187376,0.001215128,0.00069577864],"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.00068998453,0.00034159154,0.0018170264,0.0004966529,0.00021621444,0.001468295,0.00074852875,0.4698706,0.06308805,0.13871731,0.028151745,0.2943941],"study_design_scores_gemma":[0.00006985394,0.00026953666,0.00041316202,0.000024929763,0.000047163823,0.0004082144,0.000101027574,0.92464525,0.009887668,0.032447297,0.03161478,0.0000710849],"about_ca_topic_score_codex":0.0038294152,"about_ca_topic_score_gemma":0.0030135394,"teacher_disagreement_score":0.0038294152,"about_ca_system_score_codex":0.00075010344,"about_ca_system_score_gemma":0.0012270082,"threshold_uncertainty_score":0.007614255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031374093,0.0020054644,0.9223506,0.00084494665,0.00059715635,0.00039805184,0.00031239752,0.030192832,0.011924581],"genre_scores_gemma":[0.45443738,0.0019279307,0.51392424,0.00030717166,0.00060693186,0.0005707922,0.0016520743,0.0017151525,0.024858376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847776,0.00037226945,0.00018516264,0.00014589506,0.0006958764,0.00012303171],"domain_scores_gemma":[0.9969829,0.00077905954,0.00019224768,0.0011293787,0.000623311,0.00029304656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715223,0.00058987073,0.0007109586,0.0006363474,0.0010109199,0.0029587706,0.0016880609,0.0009867484,0.005239535],"category_scores_gemma":[0.0065354495,0.00068599556,0.0003420786,0.00106574,0.00050578284,0.003535206,0.001574969,0.0016050395,0.002966114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001468895,0.0005662884,0.005022684,0.0013421539,0.00025278327,0.0012876065,0.00092842645,0.03754704,0.18603337,0.09447743,0.07122517,0.59984815],"study_design_scores_gemma":[0.0005337758,0.000831209,0.003402785,0.00008588446,0.00018013087,0.0014086044,0.00028390417,0.51040345,0.122700304,0.058530133,0.30145365,0.00018624324],"about_ca_topic_score_codex":0.0007150934,"about_ca_topic_score_gemma":0.00069248164,"teacher_disagreement_score":0.005239535,"about_ca_system_score_codex":0.0006776584,"about_ca_system_score_gemma":0.0008486119,"threshold_uncertainty_score":0.017528057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90323734,0.000819773,0.06855391,0.0007843249,0.00024545574,0.00031056404,0.0017747977,0.0009852252,0.023288582],"genre_scores_gemma":[0.9889797,0.00025658685,0.008595989,0.00004020451,0.000009815485,0.00009905379,0.00028512135,0.000023801787,0.0017098833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996026,0.00011164949,0.000029185789,0.000053356172,0.00009792872,0.000105310464],"domain_scores_gemma":[0.99858,0.0008699072,0.00013339124,0.00008169852,0.0002224972,0.00011247192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005010162,0.00067099766,0.00082417304,0.0007723284,0.0006455108,0.0007009843,0.00092454767,0.0011065771,0.0018953914],"category_scores_gemma":[0.0013660236,0.00031701213,0.00061096315,0.0007024663,0.00066578545,0.00088779395,0.0007246417,0.000830083,0.00018288709],"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.000069682486,0.00006035649,0.0014480522,0.0000468869,0.000016989346,0.00012923931,0.000042232692,0.99317354,0.0012665682,0.0019408539,0.00034237432,0.0014631959],"study_design_scores_gemma":[0.000009336313,0.000033229655,0.00023820988,0.0000036584863,0.0000044218195,0.000015071086,0.000020313462,0.998406,0.0005717585,0.00043053683,0.0002642034,0.0000033922993],"about_ca_topic_score_codex":0.009294197,"about_ca_topic_score_gemma":0.0034939358,"teacher_disagreement_score":0.009294197,"about_ca_system_score_codex":0.00079179334,"about_ca_system_score_gemma":0.000691825,"threshold_uncertainty_score":0.018480241},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.536486,0.001321613,0.44508785,0.0017254197,0.00007330991,0.00031107425,0.00038003694,0.0005329502,0.0140817035],"genre_scores_gemma":[0.9817028,0.00063669047,0.014611056,0.00006834226,0.000024003479,0.00010838037,0.000115963216,0.00006234288,0.0026704448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992017,0.00030316858,0.000025810843,0.000061917344,0.00031688152,0.000090559624],"domain_scores_gemma":[0.99451834,0.0037115994,0.0005610565,0.00027786286,0.0007768066,0.00015447532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018169787,0.00076090917,0.00078238983,0.0007906367,0.0005819325,0.001092281,0.0012774202,0.0009823308,0.0016532777],"category_scores_gemma":[0.012256886,0.0004512887,0.0006421969,0.000472603,0.0009061637,0.00203624,0.0006962419,0.0010011571,0.00021376705],"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.000050832565,0.000054460543,0.000642212,0.00007763491,0.000027556443,0.000107149564,0.00013339648,0.94325817,0.003976542,0.046523463,0.0009225786,0.004226017],"study_design_scores_gemma":[0.000002469146,0.0000115932735,0.00010006544,0.000002999961,0.0000033837075,0.000017383061,0.00001585757,0.9961338,0.00035083634,0.0032443968,0.000113661394,0.0000035245512],"about_ca_topic_score_codex":0.0070094056,"about_ca_topic_score_gemma":0.002769859,"teacher_disagreement_score":0.0070094056,"about_ca_system_score_codex":0.0026037672,"about_ca_system_score_gemma":0.0016195163,"threshold_uncertainty_score":0.018891752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023515021,0.0002430985,0.9681705,0.0005865268,0.00006259221,0.0001208514,0.00018149316,0.00032890882,0.006790898],"genre_scores_gemma":[0.76011497,0.00045449453,0.22858948,0.000162038,0.00008983081,0.00047462704,0.00027402706,0.00007674059,0.009763764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988931,0.00038914592,0.00005681021,0.0002541545,0.00028944417,0.00011733232],"domain_scores_gemma":[0.999119,0.00035765202,0.00011598915,0.00014171861,0.00015213384,0.00011349595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011181696,0.00054662046,0.00069947983,0.00056701835,0.0008493173,0.001878051,0.002448222,0.001729841,0.0023121159],"category_scores_gemma":[0.0027849055,0.000319287,0.0004996765,0.0010057904,0.00089841004,0.0033468907,0.0015102992,0.0011216288,0.0005601376],"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.00013626991,0.000089523,0.00083214033,0.00007385734,0.000027271923,0.00028089006,0.00023967764,0.84367794,0.0027518766,0.11856514,0.0025978347,0.030727468],"study_design_scores_gemma":[0.000011132592,0.000026581474,0.00008375754,0.0000030699532,0.000004808867,0.000055934775,0.00002971396,0.98597205,0.00020551162,0.011864176,0.0017368792,0.0000063671846],"about_ca_topic_score_codex":0.0054913885,"about_ca_topic_score_gemma":0.0041931844,"teacher_disagreement_score":0.0054913885,"about_ca_system_score_codex":0.0012881419,"about_ca_system_score_gemma":0.0010618208,"threshold_uncertainty_score":0.010918796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25542432,0.00055400433,0.6525393,0.00035097176,0.00019420618,0.00041619828,0.0001970009,0.075881176,0.014442763],"genre_scores_gemma":[0.8884938,0.00019722077,0.101126984,0.000101650374,0.0001489902,0.00025359102,0.00047274356,0.0034064022,0.005798609],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978313,0.0003721615,0.00027663895,0.00024198102,0.0008803196,0.0003975316],"domain_scores_gemma":[0.98789644,0.0024315377,0.00066292664,0.006060917,0.0024882213,0.00046004687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021568954,0.00077244657,0.00097382383,0.000984098,0.00093089056,0.0019294398,0.002696192,0.0005778127,0.004772916],"category_scores_gemma":[0.013537943,0.0005542572,0.00035605757,0.00061756815,0.00066285505,0.0039200927,0.002767726,0.0016084786,0.0018372122],"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.0046692626,0.0012083277,0.013591795,0.00071295793,0.00025002737,0.0013179041,0.0037432036,0.016741715,0.25860208,0.058163356,0.021904428,0.619095],"study_design_scores_gemma":[0.0006567744,0.0008392869,0.008667355,0.00012812892,0.0003537861,0.0013677685,0.0006434738,0.61112416,0.2675664,0.036744244,0.071644954,0.0002635848],"about_ca_topic_score_codex":0.0008393256,"about_ca_topic_score_gemma":0.00067182595,"teacher_disagreement_score":0.004772916,"about_ca_system_score_codex":0.0005372336,"about_ca_system_score_gemma":0.0011416788,"threshold_uncertainty_score":0.015966952},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35254616,0.0010832521,0.63670224,0.0004129532,0.00007667404,0.00010093559,0.000081668375,0.0008289804,0.008167246],"genre_scores_gemma":[0.9631164,0.00027149662,0.03527815,0.000043841956,0.000035883364,0.000047481506,0.000046477064,0.000042601783,0.001117634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.00019329131,0.00002006827,0.00011583071,0.00014000166,0.00011872907],"domain_scores_gemma":[0.99765414,0.0015326521,0.00010618938,0.00019850957,0.0003410904,0.0001674626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012356497,0.00058692956,0.00092900294,0.00044343612,0.00077149575,0.00080052286,0.0011092488,0.0008158798,0.0008302638],"category_scores_gemma":[0.0039735325,0.00034579015,0.00024015739,0.00055355707,0.0008742107,0.0012989368,0.0014451363,0.00060274464,0.00027691934],"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.0005404552,0.00023217547,0.002179566,0.00020800509,0.000070362345,0.0004330401,0.00033337323,0.84965533,0.049504135,0.018677473,0.0020699175,0.07609626],"study_design_scores_gemma":[0.00004301908,0.000117523254,0.00034924987,0.000007971789,0.000020074494,0.00009947234,0.00006692021,0.983296,0.00773207,0.007023563,0.0012275693,0.000016659998],"about_ca_topic_score_codex":0.0019522067,"about_ca_topic_score_gemma":0.0013868753,"teacher_disagreement_score":0.0019522067,"about_ca_system_score_codex":0.0006098069,"about_ca_system_score_gemma":0.0007392394,"threshold_uncertainty_score":0.006534815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011903852,0.011277104,0.95293516,0.004168297,0.0005932766,0.00020092071,0.00023044902,0.00092428946,0.01776662],"genre_scores_gemma":[0.34289062,0.022369666,0.5859661,0.0014883289,0.0012914608,0.000555243,0.0012618317,0.00044973008,0.043726943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775594,0.00084834476,0.00020258124,0.0004940406,0.00053619826,0.00016299328],"domain_scores_gemma":[0.99773836,0.0013751688,0.00021753984,0.00034165249,0.00023011738,0.00009710259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029181673,0.00062989036,0.0009540129,0.0010283157,0.0014381834,0.004487296,0.0014219953,0.0025729,0.0053924005],"category_scores_gemma":[0.006109329,0.00069253874,0.00065812893,0.0028575354,0.0012529477,0.006484533,0.0018451554,0.0016088953,0.0014597713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014119755,0.00007002717,0.0005197106,0.00066254096,0.00005913881,0.00027483172,0.00027244005,0.13618515,0.0029226851,0.63204765,0.019335035,0.20750962],"study_design_scores_gemma":[0.0000763525,0.00008499723,0.00029696614,0.00014512033,0.000064667234,0.00045989925,0.00021102683,0.31976607,0.0039018884,0.52842975,0.14651969,0.00004353672],"about_ca_topic_score_codex":0.0018571411,"about_ca_topic_score_gemma":0.0011441986,"teacher_disagreement_score":0.0053924005,"about_ca_system_score_codex":0.0023201318,"about_ca_system_score_gemma":0.0012081233,"threshold_uncertainty_score":0.018039405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9765578,0.00085099856,0.015280207,0.00009192476,0.000041273932,0.00006872612,0.00031453514,0.00070040394,0.006094194],"genre_scores_gemma":[0.9948325,0.00020767431,0.0037785044,0.000023165632,0.0000146648235,0.000026067342,0.00025512313,0.000040417803,0.0008218411],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957594,0.0009761816,0.0002935493,0.00035650004,0.0022237727,0.00039049922],"domain_scores_gemma":[0.9833192,0.0092957895,0.0012760671,0.0015982297,0.0039242147,0.0005864732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020450496,0.0003830677,0.0005059948,0.001519266,0.00047060117,0.0007744226,0.0006870839,0.001011592,0.0012073393],"category_scores_gemma":[0.009971884,0.0001646313,0.00017919345,0.0014297644,0.0004483173,0.0012059842,0.0005628198,0.0005662927,0.00061512616],"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.0021712068,0.0012020768,0.091261744,0.0005382977,0.0003047607,0.00063513225,0.0010762591,0.022673778,0.7281158,0.0019262222,0.0011776524,0.14891712],"study_design_scores_gemma":[0.000062704596,0.006951471,0.14297046,0.00005581169,0.00025343007,0.0013312146,0.0008936704,0.07594444,0.76565,0.0008689467,0.004923367,0.000094560375],"about_ca_topic_score_codex":0.00037268797,"about_ca_topic_score_gemma":0.00022255213,"teacher_disagreement_score":0.0020450496,"about_ca_system_score_codex":0.00027811236,"about_ca_system_score_gemma":0.0001417832,"threshold_uncertainty_score":0.010815382},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87168217,0.0010551573,0.052855294,0.0035586068,0.0001538385,0.00007235172,0.00052814826,0.0005115592,0.06958295],"genre_scores_gemma":[0.99121207,0.00029561037,0.0062242197,0.00010874079,0.000039968072,0.000018293866,0.00017395166,0.000025297039,0.0019018331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990538,0.0003925511,0.000033801593,0.00009620236,0.00024924194,0.00017435056],"domain_scores_gemma":[0.99815196,0.00038214127,0.00027202064,0.00046920517,0.0005656517,0.00015894085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010410155,0.00027351038,0.00025332754,0.0016751018,0.0020068255,0.003338019,0.0006335471,0.0005641365,0.0015804373],"category_scores_gemma":[0.0052868505,0.0001751106,0.0001647453,0.0019205065,0.0024236562,0.0054423246,0.0022117652,0.0009706939,0.00042266038],"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.0004261676,0.0001311169,0.040027723,0.00013337003,0.00003970665,0.00068071287,0.007868159,0.043947488,0.007959353,0.78208417,0.007762569,0.10893962],"study_design_scores_gemma":[0.000025855223,0.00016235391,0.034843925,0.00012354957,0.000044254568,0.00096693373,0.015251558,0.2661062,0.005570611,0.59464955,0.08214275,0.00011255937],"about_ca_topic_score_codex":0.013729085,"about_ca_topic_score_gemma":0.010588323,"teacher_disagreement_score":0.013729085,"about_ca_system_score_codex":0.0014549639,"about_ca_system_score_gemma":0.0013525918,"threshold_uncertainty_score":0.02729839},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012859658,0.001647418,0.9507763,0.0007162134,0.00040765843,0.0006056635,0.00060753064,0.017494364,0.014885233],"genre_scores_gemma":[0.2486648,0.002255074,0.72904843,0.00031198945,0.0003374646,0.0008654125,0.003401258,0.0009197495,0.014195763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984799,0.00029521406,0.00009542618,0.00016176167,0.00082433835,0.00014327146],"domain_scores_gemma":[0.9982287,0.00066373445,0.00013564918,0.00044067102,0.00034669143,0.00018461049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022036624,0.0007142029,0.00079880375,0.0010494667,0.0010524723,0.0019310206,0.002497811,0.0007423073,0.0048167217],"category_scores_gemma":[0.006016628,0.00037682534,0.00029632018,0.0015800423,0.0006499744,0.004006153,0.0022087924,0.0010905447,0.0017534648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005276094,0.00022772474,0.0017487578,0.0007932234,0.00012896153,0.0004919873,0.00040420284,0.14104605,0.0278082,0.09638214,0.06893081,0.6615103],"study_design_scores_gemma":[0.0002598604,0.0005555609,0.0013515074,0.00010098512,0.00009606723,0.0012431485,0.00029636372,0.6892324,0.03226926,0.11193695,0.16252564,0.00013216893],"about_ca_topic_score_codex":0.0012121155,"about_ca_topic_score_gemma":0.001235179,"teacher_disagreement_score":0.0048167217,"about_ca_system_score_codex":0.0006391162,"about_ca_system_score_gemma":0.0011527753,"threshold_uncertainty_score":0.01611352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16257444,0.00031302153,0.8285357,0.00027499397,0.000042905383,0.00018817508,0.000102477854,0.0014889998,0.0064793294],"genre_scores_gemma":[0.89634013,0.0001737761,0.10046448,0.000046158242,0.00004343806,0.00013269502,0.0001586465,0.000094158226,0.0025465272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993636,0.00013053014,0.000028936669,0.000082916056,0.00026980907,0.00012413235],"domain_scores_gemma":[0.99906963,0.00041456468,0.000085642416,0.00015899324,0.00019410586,0.00007703442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009993251,0.0005518029,0.00074101775,0.00031398085,0.00056818017,0.0007190233,0.0016743125,0.0006135842,0.0009145997],"category_scores_gemma":[0.002132574,0.00034958153,0.00035260952,0.0004784968,0.00031999397,0.0009251147,0.0009608512,0.0008450731,0.00023438866],"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.00031106014,0.00024780468,0.0014010534,0.000110726745,0.000056072604,0.0002869193,0.0001832682,0.78913397,0.066141896,0.017692903,0.0028604313,0.121573865],"study_design_scores_gemma":[0.00000901932,0.000021162612,0.000103332546,0.0000012512088,0.00000403059,0.000013908434,0.000012705592,0.99530447,0.0027300846,0.00152533,0.00027137552,0.0000033666372],"about_ca_topic_score_codex":0.0050469297,"about_ca_topic_score_gemma":0.005507425,"teacher_disagreement_score":0.0050469297,"about_ca_system_score_codex":0.0010864995,"about_ca_system_score_gemma":0.0010461002,"threshold_uncertainty_score":0.010035098},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29046854,0.0009775368,0.7031282,0.0005648072,0.00006939628,0.00015161098,0.00010583466,0.00079251046,0.0037415128],"genre_scores_gemma":[0.9430894,0.00022267966,0.05560343,0.000032365315,0.00002500354,0.000066112436,0.00005101986,0.000029990657,0.0008800381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.0001891962,0.000021613057,0.00006492,0.00013440287,0.000059564234],"domain_scores_gemma":[0.99921346,0.0005125937,0.000062643,0.000043325537,0.00009880214,0.000069229915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084449875,0.00032862654,0.0007662136,0.0004191937,0.0006569107,0.00061062607,0.0009446317,0.00063573755,0.00046204892],"category_scores_gemma":[0.0023235672,0.0002798356,0.00018493457,0.0007011079,0.00044868136,0.000936807,0.0005296559,0.00038341293,0.00009924363],"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.00043272224,0.00013650085,0.0011783128,0.00015088158,0.00003687944,0.0003969357,0.0002070874,0.8911971,0.020268697,0.020743271,0.0023126407,0.06293905],"study_design_scores_gemma":[0.000014867499,0.000017150567,0.00007210708,8.439108e-7,0.0000031314958,0.000021800726,0.000016197248,0.99697864,0.0010526346,0.0015902275,0.00022978193,0.0000026476205],"about_ca_topic_score_codex":0.007591565,"about_ca_topic_score_gemma":0.0058773756,"teacher_disagreement_score":0.007591565,"about_ca_system_score_codex":0.0007645415,"about_ca_system_score_gemma":0.0009812354,"threshold_uncertainty_score":0.015094757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6479428,0.0009598954,0.3391805,0.0024869444,0.00006566954,0.00018394836,0.00009844252,0.00017273445,0.008909144],"genre_scores_gemma":[0.9946228,0.00022703415,0.004520016,0.000032049098,0.00001816948,0.000021446886,0.0000122669135,0.000008923765,0.0005373237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989704,0.00052373274,0.000030519794,0.00013760135,0.00016211625,0.00017574843],"domain_scores_gemma":[0.99053776,0.007161307,0.00088375615,0.00036127155,0.0006860354,0.000369829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021768203,0.00052286434,0.00051011035,0.00060867926,0.00086734694,0.0016781122,0.0013240423,0.0015024121,0.0013650585],"category_scores_gemma":[0.016020749,0.0003764182,0.00036882164,0.0006315112,0.0022167345,0.0042707664,0.0015455465,0.0012969719,0.000086903274],"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.00020972721,0.00024304271,0.010446171,0.0002197958,0.000093691924,0.0006541515,0.0007531083,0.6721312,0.011569867,0.26930356,0.0012531155,0.03312263],"study_design_scores_gemma":[0.000017962173,0.000070273796,0.00090087426,0.000012238686,0.000018460349,0.000093888426,0.000167629,0.9136346,0.0020937638,0.082130685,0.00084361894,0.000015997186],"about_ca_topic_score_codex":0.0032459171,"about_ca_topic_score_gemma":0.0016719326,"teacher_disagreement_score":0.0032459171,"about_ca_system_score_codex":0.0020228568,"about_ca_system_score_gemma":0.0015246021,"threshold_uncertainty_score":0.014676988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09158479,0.00026359822,0.8983622,0.0002918743,0.00011206791,0.00026410044,0.0001017011,0.0055180546,0.0035015915],"genre_scores_gemma":[0.9001591,0.00008191617,0.09653134,0.0000983523,0.00004845141,0.000142848,0.00010492517,0.00006993791,0.0027630776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993222,0.00021057438,0.000058950496,0.0001348063,0.00019691604,0.000076583194],"domain_scores_gemma":[0.9983158,0.00053544797,0.00018795174,0.000561669,0.0002157705,0.00018339643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095332146,0.00038867493,0.00052496925,0.0009588658,0.00067394186,0.0010598031,0.0015752699,0.00094240723,0.0018057972],"category_scores_gemma":[0.0029517468,0.0001986299,0.00022573446,0.00051234436,0.0004695663,0.0020019591,0.0018354048,0.0007312692,0.00036339412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019464097,0.0011074904,0.006111408,0.00036880118,0.00016153025,0.0012555016,0.0015022632,0.057579137,0.19035198,0.12607208,0.008880255,0.60466325],"study_design_scores_gemma":[0.00023245125,0.0005620449,0.0014940592,0.000030161878,0.00006909082,0.0008063439,0.00019764228,0.8923079,0.05409438,0.025358383,0.024756748,0.00009077591],"about_ca_topic_score_codex":0.00054223766,"about_ca_topic_score_gemma":0.0005185995,"teacher_disagreement_score":0.0018057972,"about_ca_system_score_codex":0.00038307408,"about_ca_system_score_gemma":0.00047246044,"threshold_uncertainty_score":0.00604105},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0306144,0.00025328834,0.95800436,0.0004903215,0.00022076994,0.001270138,0.000101541526,0.0028440587,0.006201133],"genre_scores_gemma":[0.73581874,0.000244339,0.25099558,0.00029567783,0.00014543222,0.001788058,0.00021700503,0.00029275782,0.010202491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965358,0.0010558646,0.0002899087,0.00046483966,0.0013434077,0.0003102694],"domain_scores_gemma":[0.99418676,0.0021533994,0.00068009004,0.0014382128,0.0009930613,0.00054852985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003921119,0.00087812275,0.0010339076,0.00081042206,0.0020609333,0.002064404,0.003084887,0.0016111265,0.0034252242],"category_scores_gemma":[0.011279759,0.00047021644,0.0005027307,0.0007252583,0.002532666,0.0031402078,0.0031636548,0.003393097,0.0007498104],"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.0026318156,0.0011535458,0.0016895293,0.00063879427,0.00027950972,0.0011726998,0.0027725673,0.115448914,0.12927581,0.53251016,0.014366708,0.19806],"study_design_scores_gemma":[0.00043061818,0.0006770351,0.0005017986,0.000048117723,0.00012293199,0.00057276327,0.0001742038,0.8492236,0.040152725,0.08501087,0.022877825,0.00020742865],"about_ca_topic_score_codex":0.002107346,"about_ca_topic_score_gemma":0.0019822272,"teacher_disagreement_score":0.003921119,"about_ca_system_score_codex":0.0014260244,"about_ca_system_score_gemma":0.002358453,"threshold_uncertainty_score":0.020737112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07184966,0.00081356725,0.9163118,0.0036819684,0.00018294582,0.00038009085,0.00023537621,0.0011583226,0.005386349],"genre_scores_gemma":[0.84840655,0.00026735108,0.1487667,0.00054166565,0.00018774277,0.00030362353,0.00009587445,0.000089638976,0.0013407356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99001837,0.0037709682,0.0007681155,0.0015858655,0.0033760986,0.00048061434],"domain_scores_gemma":[0.8535912,0.10794903,0.012202042,0.017841583,0.005875472,0.002540593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01388175,0.00072539516,0.0024129143,0.003696223,0.0021977287,0.0040606447,0.0051531387,0.0048430716,0.0035002904],"category_scores_gemma":[0.11466511,0.0009580772,0.0013540824,0.0027053105,0.0061177257,0.011841994,0.0070767165,0.0038295826,0.00059837924],"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.0018170892,0.00047015163,0.0143576,0.0011735894,0.0005725085,0.004525444,0.0027634152,0.18616991,0.03044914,0.5076329,0.007446464,0.24262175],"study_design_scores_gemma":[0.0003992634,0.00040772758,0.001585533,0.0001372756,0.0002147113,0.0018338873,0.0003045052,0.6601523,0.007518224,0.32153016,0.0057129175,0.00020352374],"about_ca_topic_score_codex":0.0013710767,"about_ca_topic_score_gemma":0.000894354,"teacher_disagreement_score":0.01388175,"about_ca_system_score_codex":0.0011632396,"about_ca_system_score_gemma":0.0023862363,"threshold_uncertainty_score":0.073414624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41208473,0.03104919,0.2729268,0.011264082,0.0013035939,0.0023807443,0.10033827,0.045852512,0.122800075],"genre_scores_gemma":[0.48698524,0.009119637,0.3881904,0.0010161337,0.0012925265,0.0015745212,0.09443709,0.0048048175,0.0125797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99597377,0.00081735547,0.0005728798,0.0005757325,0.0018054929,0.00025478812],"domain_scores_gemma":[0.95589995,0.020522611,0.008154752,0.0053888974,0.008782766,0.0012510238],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007655678,0.00079723576,0.00055162836,0.025369449,0.001260251,0.004400641,0.0009011178,0.0009457601,0.0023383186],"category_scores_gemma":[0.034299687,0.00047661082,0.00065137906,0.023535402,0.000581278,0.0073156175,0.001415289,0.0008921169,0.0018161461],"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.00052619824,0.00019952777,0.11650784,0.0058070435,0.00026041127,0.0011573862,0.0076001934,0.0013037103,0.025899297,0.036511254,0.06870574,0.7355214],"study_design_scores_gemma":[0.000079946396,0.0003136518,0.19654283,0.0020052984,0.0005399618,0.0034099778,0.0030744963,0.010683941,0.024316108,0.03575801,0.72304475,0.00023104747],"about_ca_topic_score_codex":0.0022058233,"about_ca_topic_score_gemma":0.003606285,"teacher_disagreement_score":0.9955993,"about_ca_system_score_codex":0.0008729958,"about_ca_system_score_gemma":0.0025574504,"threshold_uncertainty_score":0.040487587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069615105,0.0003421238,0.9900754,0.00029404392,0.000045108667,0.00009528191,0.000016084636,0.00030443375,0.0018659458],"genre_scores_gemma":[0.53475976,0.00083898514,0.45987648,0.00028776404,0.00014121918,0.0008989531,0.00008293933,0.00011964856,0.0029942368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538946,0.002032292,0.0004174678,0.00043160535,0.001433107,0.00029614617],"domain_scores_gemma":[0.9896741,0.005178513,0.0017089883,0.002118037,0.00089858234,0.00042167853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007336615,0.0008043177,0.00061924494,0.0011135835,0.0013840628,0.0027833576,0.0027637663,0.0021350402,0.0014961703],"category_scores_gemma":[0.02075634,0.0006780916,0.0008255741,0.0008677483,0.00357952,0.00489302,0.003579202,0.0015893802,0.00044607167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007961475,0.000063766376,0.0003893474,0.00017863198,0.00005489775,0.00019100955,0.0006327941,0.027816175,0.008676511,0.91501206,0.0011472164,0.04575797],"study_design_scores_gemma":[0.00015676784,0.00018969725,0.00017367287,0.0000830678,0.00006413731,0.00035384845,0.00014384303,0.22764109,0.007985894,0.74614197,0.016992856,0.00007314966],"about_ca_topic_score_codex":0.0004756568,"about_ca_topic_score_gemma":0.00044395233,"teacher_disagreement_score":0.007336615,"about_ca_system_score_codex":0.0013759349,"about_ca_system_score_gemma":0.0018796095,"threshold_uncertainty_score":0.03880018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2166002,0.006549015,0.50588274,0.0015326042,0.00054310483,0.0008091197,0.0010133301,0.03358344,0.23348656],"genre_scores_gemma":[0.7275355,0.00510119,0.1509499,0.00047490376,0.0004947771,0.00022765518,0.0014358888,0.0011224459,0.112657756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998254,0.000026078966,0.000008373869,0.000027427337,0.00007903251,0.000033764944],"domain_scores_gemma":[0.9997038,0.00006793023,0.000019481,0.0000626242,0.000096127726,0.000050043254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023259189,0.0002407707,0.00020261917,0.00067850045,0.00042635744,0.0011730739,0.0007616001,0.00043545765,0.011214124],"category_scores_gemma":[0.00074214104,0.00013826753,0.00014569645,0.0006745919,0.00012458659,0.0008836157,0.00055199803,0.00028247054,0.0026829664],"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.000324737,0.00027063917,0.0018315654,0.00022627463,0.000026291093,0.0006610251,0.0003619436,0.0040179533,0.06633664,0.013114711,0.029300984,0.8835273],"study_design_scores_gemma":[0.00015906373,0.0006402998,0.011027552,0.00019832252,0.00016154782,0.0027946748,0.00052944646,0.11194854,0.21215177,0.013859042,0.6464099,0.000119879514],"about_ca_topic_score_codex":0.0022900433,"about_ca_topic_score_gemma":0.0020785104,"teacher_disagreement_score":0.011214124,"about_ca_system_score_codex":0.00057767396,"about_ca_system_score_gemma":0.00025290597,"threshold_uncertainty_score":0.037515044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009917904,0.00015758394,0.9871252,0.00007611037,0.000040044517,0.000038215334,0.000009963924,0.001166168,0.0014687508],"genre_scores_gemma":[0.55911267,0.00036561507,0.4360938,0.0001308119,0.00008978326,0.00014630941,0.000073584284,0.00017875707,0.0038087245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996581,0.00010201758,0.000018734961,0.000052101357,0.00013102852,0.000037922982],"domain_scores_gemma":[0.9996879,0.00008771023,0.000034991648,0.000075654076,0.00006833003,0.000045393637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077577645,0.00035017577,0.0004307096,0.00028917825,0.0004712934,0.00076530286,0.0014804897,0.000752726,0.0009148446],"category_scores_gemma":[0.0015340655,0.00018349531,0.0003386256,0.00029690613,0.00054178614,0.00095220306,0.00085128937,0.0009472204,0.00031391138],"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.00035434816,0.00027146403,0.0020474244,0.00016360177,0.000094487295,0.0009757023,0.00071625947,0.35925508,0.07846105,0.20673794,0.0066274316,0.34429523],"study_design_scores_gemma":[0.000019915182,0.000052320163,0.00016726524,0.0000070151696,0.000019433859,0.00018721193,0.000028354541,0.9731083,0.00775596,0.011166442,0.0074641323,0.000023700666],"about_ca_topic_score_codex":0.0018171639,"about_ca_topic_score_gemma":0.001191062,"teacher_disagreement_score":0.0018171639,"about_ca_system_score_codex":0.0005167681,"about_ca_system_score_gemma":0.0005501961,"threshold_uncertainty_score":0.004102707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19879061,0.0020974206,0.7877614,0.0012101039,0.00019302205,0.00039305957,0.00012523608,0.0022723316,0.007156765],"genre_scores_gemma":[0.8753606,0.0008849841,0.12022074,0.00012898896,0.00014601595,0.00026640663,0.00013915944,0.00019093281,0.0026621413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9827984,0.0075436626,0.0012710915,0.0015773629,0.0058198087,0.0009896703],"domain_scores_gemma":[0.9487317,0.032267794,0.0036098948,0.009574501,0.0045818198,0.0012343731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014930673,0.0008525857,0.0017010763,0.001415175,0.0028448151,0.0041508,0.0020275966,0.0023812468,0.0019834463],"category_scores_gemma":[0.056245785,0.0010860095,0.0006528321,0.0025242933,0.0033938629,0.009707193,0.0022432168,0.0021662074,0.0006596325],"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.0011431255,0.00043335938,0.011346754,0.0008085151,0.00022199853,0.00060617446,0.0021802485,0.4797996,0.02423792,0.3626478,0.003844171,0.11273036],"study_design_scores_gemma":[0.00031161334,0.0007086709,0.0014315968,0.000069674934,0.00022095758,0.00074033224,0.00052771234,0.82303566,0.027835833,0.1285952,0.01639487,0.00012781704],"about_ca_topic_score_codex":0.0013982088,"about_ca_topic_score_gemma":0.00071636855,"teacher_disagreement_score":0.014930673,"about_ca_system_score_codex":0.0025977956,"about_ca_system_score_gemma":0.0026415535,"threshold_uncertainty_score":0.07896191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23869951,0.0008559703,0.7555343,0.00036665596,0.00004326982,0.00006456648,0.000056968955,0.00042563595,0.003953146],"genre_scores_gemma":[0.979676,0.00013123595,0.019500153,0.000022657197,0.00001692648,0.000027850443,0.000019925066,0.000018202063,0.0005870906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940205,0.00022223104,0.000019478332,0.00010897098,0.00014295128,0.00010431038],"domain_scores_gemma":[0.99866676,0.0009196932,0.00007426975,0.00006751802,0.00020802587,0.00006370787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016322628,0.0005866762,0.0007811026,0.00045255778,0.00064387795,0.0008628441,0.0011945878,0.00077748083,0.00053751684],"category_scores_gemma":[0.0027192095,0.00037010846,0.00027994768,0.00059427373,0.0007472528,0.0010845285,0.00080834544,0.00040228746,0.00011559108],"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.00022053477,0.00005925461,0.00064657145,0.000057120298,0.000030391555,0.00015255515,0.00009844572,0.952249,0.010093704,0.012504708,0.0007583989,0.023129322],"study_design_scores_gemma":[0.0000088915585,0.000020793912,0.00008129019,0.0000013648189,0.00000431877,0.000014927242,0.00001168809,0.9952631,0.0010067273,0.0034608648,0.0001230319,0.000003036841],"about_ca_topic_score_codex":0.0024717143,"about_ca_topic_score_gemma":0.0017174083,"teacher_disagreement_score":0.0024717143,"about_ca_system_score_codex":0.0012991441,"about_ca_system_score_gemma":0.0006082023,"threshold_uncertainty_score":0.009425998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5305,0.00040883542,0.44800994,0.0011146691,0.000032154236,0.00015903791,0.000050221162,0.00017018952,0.019555004],"genre_scores_gemma":[0.97983325,0.000080725025,0.018515946,0.000075965734,0.000011338909,0.00007654351,0.00001849243,0.000013151281,0.0013746773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997635,0.0013006432,0.000113644375,0.00025196734,0.0003953176,0.00030338395],"domain_scores_gemma":[0.99254864,0.00479308,0.0008787209,0.0004381054,0.00047072503,0.00087070855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025079576,0.00051377306,0.0006435767,0.00069374824,0.0015171437,0.0020243563,0.0012951,0.0014157568,0.0016747629],"category_scores_gemma":[0.011506831,0.0004997453,0.00047532842,0.00050561293,0.0024431325,0.0029867725,0.002751504,0.0009388098,0.00019146946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035456318,0.00016629217,0.0056548486,0.00015717224,0.00015853297,0.0019273212,0.0029171484,0.29962784,0.01168323,0.6449513,0.0014988929,0.030902857],"study_design_scores_gemma":[0.00010747759,0.00016015382,0.00074857805,0.000018904046,0.00004627666,0.00046466046,0.001046289,0.6303724,0.0019329092,0.3620411,0.0030204374,0.000040869436],"about_ca_topic_score_codex":0.0010730998,"about_ca_topic_score_gemma":0.00087191176,"teacher_disagreement_score":0.0025079576,"about_ca_system_score_codex":0.0009971899,"about_ca_system_score_gemma":0.0006362728,"threshold_uncertainty_score":0.013263464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016076408,0.00039312313,0.97401285,0.0004166329,0.000116768984,0.00037073664,0.0002927568,0.004808563,0.003512227],"genre_scores_gemma":[0.3670144,0.00067853194,0.6206939,0.0003806907,0.00015760738,0.00040681937,0.0016347981,0.0003811937,0.008652074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979528,0.00040751873,0.00024668258,0.00024111805,0.0009961008,0.0001556683],"domain_scores_gemma":[0.99854374,0.0003775394,0.00016802737,0.0005301584,0.00025231022,0.00012814182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029527564,0.0005871268,0.0010732976,0.0017129602,0.0015285711,0.0025864325,0.0022772884,0.001220314,0.0014696661],"category_scores_gemma":[0.0039362316,0.00039708588,0.00062539586,0.0019773855,0.001149985,0.0058251987,0.0042344956,0.0011450546,0.0008045573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009874634,0.00047258814,0.0014354311,0.00051066396,0.00017929077,0.00067997223,0.0017475535,0.05981314,0.05833148,0.2622779,0.026340624,0.5872239],"study_design_scores_gemma":[0.00022738078,0.00045885815,0.0008356831,0.000053451764,0.00016593211,0.00079889485,0.00061750057,0.72685397,0.042590603,0.14148961,0.085700594,0.00020746421],"about_ca_topic_score_codex":0.0030522007,"about_ca_topic_score_gemma":0.0034965584,"teacher_disagreement_score":0.0030522007,"about_ca_system_score_codex":0.001255595,"about_ca_system_score_gemma":0.0015965543,"threshold_uncertainty_score":0.015615821},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3598963,0.0005735381,0.6030378,0.0010299447,0.0001999888,0.0017347041,0.00026275413,0.018482171,0.01478279],"genre_scores_gemma":[0.73333454,0.00031347547,0.2581464,0.00011948527,0.000027692528,0.0005754054,0.0003880003,0.00031747308,0.006777534],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.00017485312,0.000047034297,0.000084096115,0.0002935898,0.000070226546],"domain_scores_gemma":[0.9990752,0.00029636442,0.000060097645,0.00022332626,0.00020352188,0.00014145614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011776782,0.00036408225,0.00057078636,0.00036494946,0.00059970934,0.0012203847,0.002446351,0.001323676,0.0013480873],"category_scores_gemma":[0.0024841144,0.00031142888,0.00031742768,0.00024698713,0.00064753956,0.0015777503,0.0011305726,0.0009118424,0.0003960021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020020653,0.0028768354,0.008472885,0.001198626,0.00022173898,0.002129751,0.003698361,0.16714121,0.4388258,0.05008937,0.013420622,0.30992278],"study_design_scores_gemma":[0.00041750484,0.0012524764,0.0013904822,0.000054490007,0.0000813701,0.00065691996,0.00041449012,0.8265908,0.14434834,0.00362794,0.021095246,0.00006993674],"about_ca_topic_score_codex":0.0017436882,"about_ca_topic_score_gemma":0.0010104313,"teacher_disagreement_score":0.002446351,"about_ca_system_score_codex":0.00066499686,"about_ca_system_score_gemma":0.00067421206,"threshold_uncertainty_score":0.006228268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047709063,0.00028617252,0.9379977,0.00034157973,0.00011718341,0.000332523,0.00004050723,0.007845209,0.0053300983],"genre_scores_gemma":[0.42529768,0.0004937909,0.56295365,0.00016856706,0.000105290586,0.00018885224,0.0001935906,0.0004916393,0.010106981],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991658,0.0001540304,0.00008999375,0.00012029225,0.00039637697,0.00007350226],"domain_scores_gemma":[0.9985026,0.0003369425,0.00013278578,0.00042593607,0.00047309013,0.00012853272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011594456,0.00029504992,0.00057290005,0.000603804,0.000693777,0.0015269811,0.00096653093,0.0009674924,0.0029127114],"category_scores_gemma":[0.003267305,0.0002810704,0.00038028276,0.00031351423,0.0005587701,0.001960774,0.0016321836,0.0010705031,0.0013574046],"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.0011103863,0.00041810411,0.0030489285,0.00044357034,0.00013271565,0.0054460405,0.0026915038,0.015048928,0.41309983,0.07502907,0.010145682,0.47338524],"study_design_scores_gemma":[0.0001474437,0.00076781545,0.002176959,0.00009070974,0.00016507068,0.007172957,0.0006674489,0.35950118,0.52199984,0.015792452,0.091384366,0.00013379069],"about_ca_topic_score_codex":0.0006102206,"about_ca_topic_score_gemma":0.0004055417,"teacher_disagreement_score":0.0029127114,"about_ca_system_score_codex":0.00043478463,"about_ca_system_score_gemma":0.00068927876,"threshold_uncertainty_score":0.009743929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022517331,0.0002802558,0.97147083,0.00024428498,0.000048370206,0.00009351741,0.000013571886,0.0007819647,0.004549845],"genre_scores_gemma":[0.70890254,0.00057987554,0.28789267,0.00015020823,0.000080132064,0.00028887682,0.000081093494,0.000113579976,0.0019109413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989573,0.00034747177,0.000057835936,0.00018172775,0.00036423607,0.000091354574],"domain_scores_gemma":[0.9982711,0.0007279582,0.00022073531,0.00043221255,0.00023111474,0.000116903524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016171918,0.0005351321,0.0007566401,0.00037741155,0.0005261663,0.0010203909,0.00135972,0.000661427,0.0011329644],"category_scores_gemma":[0.004461807,0.00033723383,0.00045757496,0.00030537337,0.0010142191,0.0015118524,0.001678499,0.0010255069,0.00030027636],"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.000047611335,0.00013427992,0.0014044516,0.00012572277,0.00010866587,0.00014938864,0.00017683332,0.84639245,0.0048610135,0.036083434,0.0013337366,0.10918246],"study_design_scores_gemma":[0.00003193549,0.000076439865,0.00018032653,0.000017367545,0.000023332013,0.00005583502,0.00002683394,0.9669175,0.0018970296,0.025670342,0.005089238,0.000013728106],"about_ca_topic_score_codex":0.0015091713,"about_ca_topic_score_gemma":0.0013110752,"teacher_disagreement_score":0.0016171918,"about_ca_system_score_codex":0.00052087335,"about_ca_system_score_gemma":0.00082297745,"threshold_uncertainty_score":0.008552611},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56073564,0.0021802592,0.42169872,0.0005368079,0.00017061434,0.0007612102,0.0001641934,0.001833004,0.0119195795],"genre_scores_gemma":[0.9488481,0.00044378042,0.047459427,0.00004214428,0.000039359213,0.00012536098,0.00008818833,0.000036993428,0.0029165654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989281,0.00038909924,0.00007111021,0.00015292104,0.00031252022,0.00014629755],"domain_scores_gemma":[0.9966396,0.0015637131,0.00023611712,0.0005699468,0.00078450766,0.00020609965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011886463,0.0005849244,0.0009960737,0.0008564375,0.0012614651,0.0010796613,0.0012520541,0.00073497446,0.0015313225],"category_scores_gemma":[0.0050720996,0.00035961115,0.00032652356,0.00075466343,0.00066088635,0.0019365379,0.0011837009,0.00035741142,0.00050416775],"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.0011848381,0.00050706684,0.007797613,0.00083175086,0.00027136336,0.0030871953,0.0019444402,0.5236434,0.08153646,0.04322049,0.009219353,0.32675612],"study_design_scores_gemma":[0.00008262573,0.00044464148,0.0025892658,0.000032589243,0.00007850566,0.00057626935,0.0006548934,0.94889206,0.015914988,0.02007525,0.010594401,0.000064540545],"about_ca_topic_score_codex":0.0043233535,"about_ca_topic_score_gemma":0.004584597,"teacher_disagreement_score":0.0043233535,"about_ca_system_score_codex":0.00070415495,"about_ca_system_score_gemma":0.00067556306,"threshold_uncertainty_score":0.00859642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079459816,0.0005895822,0.90314025,0.0012722411,0.00014483924,0.00019217606,0.00021763693,0.00060094637,0.014382503],"genre_scores_gemma":[0.92066664,0.000498917,0.063860804,0.00017813184,0.00008814281,0.00031214018,0.00011382425,0.00012022283,0.014161154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831885,0.0009996635,0.000055294997,0.00020582137,0.00026716696,0.00015315166],"domain_scores_gemma":[0.99796355,0.0013945367,0.00015140447,0.000114783295,0.0002535289,0.00012214226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015370635,0.00079008803,0.0015301424,0.00059610547,0.0010111834,0.0019313956,0.0023031412,0.0023233604,0.003584442],"category_scores_gemma":[0.005084131,0.0008800497,0.00095966365,0.00088202715,0.00092962274,0.0027931225,0.0014831193,0.0013964124,0.0007286032],"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.00010495434,0.00013237202,0.0015685336,0.00009732366,0.0000790753,0.00032194928,0.0007255987,0.93344784,0.00089776365,0.048252832,0.0015444946,0.012827308],"study_design_scores_gemma":[0.000006428238,0.000014275617,0.000119049335,0.0000033886515,0.0000102976,0.000023753551,0.000035225028,0.99470127,0.000116998155,0.004598815,0.00036321208,0.00000727042],"about_ca_topic_score_codex":0.019068984,"about_ca_topic_score_gemma":0.014701091,"teacher_disagreement_score":0.019068984,"about_ca_system_score_codex":0.0012027995,"about_ca_system_score_gemma":0.001177603,"threshold_uncertainty_score":0.037916005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15737803,0.0010806471,0.8204398,0.0023296236,0.0002941072,0.00042487058,0.00028341214,0.0013492382,0.016420223],"genre_scores_gemma":[0.7284853,0.00066058105,0.255944,0.00027662324,0.00017493858,0.00031565194,0.0003253361,0.00030572072,0.013511907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961294,0.0016463061,0.0001928472,0.00065629644,0.00097494654,0.00040019202],"domain_scores_gemma":[0.9882086,0.008482356,0.0005138346,0.0015635088,0.0005452617,0.00068643485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144167,0.0007846473,0.0026249927,0.0011911404,0.003099047,0.0030793357,0.0035508214,0.0029626978,0.0051544514],"category_scores_gemma":[0.025262905,0.0008613909,0.00073890435,0.002215715,0.0029060359,0.0061220555,0.0044639255,0.0019817369,0.001324618],"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.003087832,0.00039763717,0.0057433634,0.0006476112,0.00019380212,0.00061247003,0.001562782,0.2810855,0.0052648857,0.5292898,0.013262912,0.1588514],"study_design_scores_gemma":[0.0003460812,0.0002785269,0.00032369778,0.000060206403,0.00012831483,0.00038736823,0.00046241935,0.6272997,0.004281493,0.36098498,0.0053752577,0.000071940216],"about_ca_topic_score_codex":0.0015997955,"about_ca_topic_score_gemma":0.0031014683,"teacher_disagreement_score":0.0051544514,"about_ca_system_score_codex":0.0013170218,"about_ca_system_score_gemma":0.002238447,"threshold_uncertainty_score":0.021916687},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016101979,0.0009831116,0.9649025,0.0005448057,0.0002765938,0.0005966449,0.00021376692,0.0030006513,0.013379956],"genre_scores_gemma":[0.4297613,0.0010234133,0.5512208,0.0003268599,0.00015284069,0.0016034752,0.0005573549,0.00015725054,0.015196735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905497,0.00022534389,0.00005750981,0.00012986723,0.000472271,0.00006005976],"domain_scores_gemma":[0.99938893,0.00013843257,0.00005315717,0.00021179853,0.00015878974,0.000048865528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073300337,0.00042653183,0.00041472787,0.00048670752,0.0010053536,0.0013023621,0.0016888229,0.0011346294,0.0021098827],"category_scores_gemma":[0.0016131748,0.00020416653,0.00036685896,0.00087840355,0.00055145856,0.001620427,0.0012428772,0.00097315013,0.0010042393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005786771,0.00037202542,0.0009711029,0.0010098492,0.00016222807,0.0018032907,0.00055764394,0.09100967,0.090745986,0.29476002,0.039937153,0.47809234],"study_design_scores_gemma":[0.0003203826,0.00077711506,0.00089998235,0.000065152795,0.00010675477,0.0028564755,0.0001572026,0.58035046,0.047771234,0.12969723,0.23683618,0.00016180282],"about_ca_topic_score_codex":0.0009270899,"about_ca_topic_score_gemma":0.00087478355,"teacher_disagreement_score":0.0021098827,"about_ca_system_score_codex":0.00045212943,"about_ca_system_score_gemma":0.0008743623,"threshold_uncertainty_score":0.007058263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009660242,0.006301093,0.9648574,0.0017010728,0.0007110833,0.0005052709,0.00016706953,0.0029773568,0.013119392],"genre_scores_gemma":[0.4065229,0.010113759,0.56051403,0.00048657996,0.0016715203,0.0013792292,0.00094593904,0.00039836857,0.017967653],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875605,0.00030353258,0.00010235119,0.00019751297,0.00054907845,0.00009136456],"domain_scores_gemma":[0.9989448,0.0002500587,0.00015400001,0.0002736812,0.0002825414,0.000094852774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013852048,0.00065187836,0.0008119445,0.00058450364,0.0017804082,0.0019604855,0.002589607,0.0010835206,0.0038766393],"category_scores_gemma":[0.003932354,0.00030799082,0.0003436869,0.0010546865,0.0008124762,0.0032967613,0.0017209625,0.0011628241,0.0019521002],"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.0002889284,0.00016449108,0.0011813139,0.0012303311,0.00011627824,0.0010165911,0.0008529422,0.0630867,0.0251907,0.26284802,0.05520632,0.58881736],"study_design_scores_gemma":[0.00012399534,0.00032351282,0.0013086336,0.00018485956,0.0001381633,0.0013941217,0.0002978095,0.49060175,0.010301324,0.21796052,0.27722216,0.00014311519],"about_ca_topic_score_codex":0.0017101795,"about_ca_topic_score_gemma":0.0018714909,"teacher_disagreement_score":0.0038766393,"about_ca_system_score_codex":0.0008783374,"about_ca_system_score_gemma":0.0013217272,"threshold_uncertainty_score":0.0129686},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022497068,0.0033885415,0.97703755,0.0011770629,0.0009185041,0.0010129991,0.00029111144,0.0028064267,0.011118114],"genre_scores_gemma":[0.07811196,0.0036559522,0.8973103,0.0010445779,0.000901505,0.0031277668,0.0015023679,0.00044639054,0.013899111],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967554,0.0011057782,0.00036097484,0.00022950274,0.0013987666,0.0001495739],"domain_scores_gemma":[0.9982052,0.0005166812,0.00016278886,0.0004491158,0.0005389508,0.00012733141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028119294,0.0009039931,0.0009790676,0.0013107955,0.0023627935,0.0023230333,0.0029868034,0.0021668514,0.0043904474],"category_scores_gemma":[0.0047895745,0.00044270814,0.0008930826,0.0021729833,0.001307292,0.0030680145,0.0023464642,0.0026581087,0.0021195929],"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.000349415,0.00020959791,0.0005268284,0.0016382267,0.0001860818,0.0009864355,0.00082130195,0.014596492,0.03434343,0.42522812,0.07008938,0.45102462],"study_design_scores_gemma":[0.00027147104,0.0005810144,0.00070842175,0.00042505102,0.000245052,0.0018687769,0.00018289604,0.13178058,0.019337174,0.18448521,0.65987486,0.00023950884],"about_ca_topic_score_codex":0.0011498333,"about_ca_topic_score_gemma":0.0012401467,"teacher_disagreement_score":0.0043904474,"about_ca_system_score_codex":0.0009741343,"about_ca_system_score_gemma":0.0017364763,"threshold_uncertainty_score":0.014871061},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042280715,0.0004597645,0.9370226,0.00095406896,0.000104739374,0.0012192567,0.00004088819,0.00091147097,0.01700652],"genre_scores_gemma":[0.28074372,0.0008857492,0.7103041,0.0002783705,0.00004476952,0.0008779594,0.00011007175,0.00018790412,0.0065673366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966929,0.0012645475,0.000251916,0.00030320467,0.0011774397,0.00030997136],"domain_scores_gemma":[0.9972173,0.0008291939,0.0003330619,0.00077385764,0.0006273492,0.00021918627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027069242,0.0013544152,0.00055215834,0.0007157865,0.0011119827,0.0033793014,0.0015963613,0.0018847962,0.00268948],"category_scores_gemma":[0.0077945925,0.0012008819,0.00088989816,0.00025030557,0.002106506,0.0053161797,0.0032649268,0.0020943007,0.0009888281],"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.00030089196,0.00066145806,0.0077652615,0.0016996909,0.00017225504,0.0016348755,0.004601309,0.11388157,0.061655764,0.57338166,0.0063520144,0.2278933],"study_design_scores_gemma":[0.00019840898,0.0009909287,0.0015432839,0.00061343,0.000258248,0.0017821738,0.0028467937,0.5499368,0.06405187,0.22502111,0.15265396,0.00010300187],"about_ca_topic_score_codex":0.0006863385,"about_ca_topic_score_gemma":0.0013067108,"teacher_disagreement_score":0.0033793014,"about_ca_system_score_codex":0.00079919776,"about_ca_system_score_gemma":0.0016220085,"threshold_uncertainty_score":0.014315784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0455263,0.0007559944,0.9274585,0.0007222643,0.00039346033,0.00030628304,0.00016737833,0.014484691,0.010185127],"genre_scores_gemma":[0.48031643,0.00058820075,0.5007428,0.00029238904,0.00023432671,0.00022076491,0.00056686765,0.00025872607,0.016779508],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947983,0.000071964685,0.00006129305,0.000110097,0.00020627248,0.00007069725],"domain_scores_gemma":[0.99957865,0.000079332545,0.00004030966,0.00011903776,0.000113316775,0.000069424575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005551925,0.00031785437,0.0004497448,0.0005144037,0.00060347264,0.0015354318,0.0016691175,0.00070060627,0.009531224],"category_scores_gemma":[0.0007020727,0.00041682893,0.00031025417,0.0005839009,0.0003808649,0.0016757023,0.00061052747,0.0006770464,0.0024191374],"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.0018243965,0.0006243123,0.0049999505,0.0008582068,0.00022598107,0.0013077514,0.00051723456,0.044191863,0.3937448,0.08165254,0.039634854,0.4304181],"study_design_scores_gemma":[0.0006227999,0.0014496988,0.0022346615,0.00004990804,0.00025037667,0.0014551146,0.00015330418,0.57712495,0.23117305,0.013397537,0.1719486,0.00014004025],"about_ca_topic_score_codex":0.0018741962,"about_ca_topic_score_gemma":0.0014224382,"teacher_disagreement_score":0.009531224,"about_ca_system_score_codex":0.00085060706,"about_ca_system_score_gemma":0.0010662412,"threshold_uncertainty_score":0.031885147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003542875,0.00064866693,0.94990605,0.0022981663,0.00055200217,0.0007746479,0.00052625715,0.0051447013,0.036606703],"genre_scores_gemma":[0.3586462,0.0043043746,0.5535278,0.0018141781,0.002011522,0.0025781374,0.001978908,0.0012040093,0.07393483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98755825,0.0031465644,0.0015167763,0.0015706429,0.005477337,0.0007304516],"domain_scores_gemma":[0.9875123,0.0048055444,0.0010200744,0.00436265,0.001712025,0.0005874502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008140721,0.0010753415,0.0018775407,0.0021413665,0.0030499701,0.011872415,0.0037943185,0.0037821592,0.012744289],"category_scores_gemma":[0.014390132,0.0015643933,0.0016318681,0.0029106762,0.0031625002,0.015774075,0.0030186179,0.003859939,0.008526088],"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.00019368785,0.00024217147,0.00070362666,0.00047977996,0.00011533303,0.00063160504,0.000510559,0.02427954,0.005304879,0.8807417,0.019704567,0.06709236],"study_design_scores_gemma":[0.00029379386,0.0002443659,0.00033093683,0.00014263323,0.00016105516,0.0011884182,0.0002007756,0.21382116,0.009568076,0.50753623,0.2662936,0.00021889906],"about_ca_topic_score_codex":0.0038174267,"about_ca_topic_score_gemma":0.0029308521,"teacher_disagreement_score":0.012744289,"about_ca_system_score_codex":0.0023359081,"about_ca_system_score_gemma":0.0040851333,"threshold_uncertainty_score":0.043052793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114942845,0.00009513745,0.98442924,0.0008443141,0.00005029986,0.00014974762,0.000084625,0.0004186827,0.0024337485],"genre_scores_gemma":[0.4244758,0.00031717107,0.5620776,0.00030385432,0.00009479148,0.0004626278,0.00026727363,0.00016365791,0.011837306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978224,0.00051944813,0.00019927279,0.0005543232,0.00062391494,0.00028074003],"domain_scores_gemma":[0.9964671,0.0015111164,0.00042851194,0.0006751686,0.00061650365,0.00030163012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025372622,0.0008610135,0.00092721,0.0007129364,0.0018648178,0.0029770657,0.0023095643,0.00238345,0.004112727],"category_scores_gemma":[0.0061194478,0.0008625199,0.0019557711,0.0008240007,0.0022000335,0.006043402,0.0032179658,0.0038705291,0.00070489984],"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.00026942661,0.00020388598,0.0014678825,0.0003377144,0.000077908415,0.0007492482,0.0017377028,0.35046104,0.0077585513,0.5839525,0.0037514162,0.049232725],"study_design_scores_gemma":[0.00006431257,0.00013087559,0.00015563042,0.000042837524,0.000042412004,0.00014231524,0.00022835252,0.8280769,0.0042224,0.15776524,0.009084298,0.000044415745],"about_ca_topic_score_codex":0.007771743,"about_ca_topic_score_gemma":0.0075626965,"teacher_disagreement_score":0.007771743,"about_ca_system_score_codex":0.002323704,"about_ca_system_score_gemma":0.0041633113,"threshold_uncertainty_score":0.01685971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42723867,0.0012666956,0.46100733,0.0045013353,0.0014151335,0.0060970825,0.0067114104,0.023951104,0.06781121],"genre_scores_gemma":[0.69213253,0.000606956,0.28559396,0.000493444,0.00013569917,0.0027932187,0.0081414115,0.00031841945,0.009784294],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980591,0.0007583742,0.00019256004,0.00025064553,0.00047551378,0.00026379217],"domain_scores_gemma":[0.99641716,0.0007366963,0.0002911031,0.00068101636,0.0007758483,0.0010980864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034296936,0.00041281915,0.00038763002,0.0007351618,0.0012550576,0.0012455846,0.0017603457,0.0010366366,0.005915986],"category_scores_gemma":[0.0033084657,0.0002444215,0.00029693104,0.0009502863,0.00076683663,0.0016472356,0.0012451467,0.0011112198,0.0016262679],"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.0058004684,0.008544203,0.02726079,0.001668128,0.00023697618,0.0030648285,0.0028581885,0.19362804,0.2300227,0.15394466,0.1395067,0.23346429],"study_design_scores_gemma":[0.0017387461,0.0049984823,0.013365096,0.00021079327,0.00012590317,0.0008097213,0.0010910283,0.6083632,0.072681025,0.020214848,0.27622303,0.00017823292],"about_ca_topic_score_codex":0.0025589934,"about_ca_topic_score_gemma":0.00170132,"teacher_disagreement_score":0.005915986,"about_ca_system_score_codex":0.0013961729,"about_ca_system_score_gemma":0.0018424594,"threshold_uncertainty_score":0.019791007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05054404,0.00024109296,0.943663,0.00024175306,0.00004020098,0.00028111992,0.000080426995,0.001601728,0.0033066343],"genre_scores_gemma":[0.6012706,0.00032934165,0.39486954,0.00013980064,0.000043086005,0.00028877668,0.00032274716,0.00021363476,0.00252247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992804,0.00025713138,0.000025832183,0.000113146714,0.00024398585,0.000079586556],"domain_scores_gemma":[0.99800724,0.0008511455,0.00029078568,0.00032650944,0.00031890025,0.00020545203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011433325,0.00091862807,0.0009743877,0.0008913819,0.001103897,0.00091051875,0.0022247687,0.0008375882,0.0016456376],"category_scores_gemma":[0.004633818,0.0004163119,0.0003821323,0.00077959744,0.000805786,0.0019658576,0.002389659,0.0007393147,0.0002986413],"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.0002654489,0.00026968517,0.0018394431,0.000387705,0.000054861448,0.00035842488,0.0004955872,0.6926955,0.028434597,0.028485615,0.006222085,0.24049108],"study_design_scores_gemma":[0.000057537116,0.00023300378,0.00036477184,0.000020545289,0.000021270977,0.00029819802,0.00017353227,0.97163796,0.009129317,0.0141335,0.00391211,0.000018268149],"about_ca_topic_score_codex":0.0016340315,"about_ca_topic_score_gemma":0.0024887563,"teacher_disagreement_score":0.0022247687,"about_ca_system_score_codex":0.00085293886,"about_ca_system_score_gemma":0.0012892552,"threshold_uncertainty_score":0.0061885715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83778703,0.0015645241,0.15495491,0.00061643025,0.00007947651,0.00025201374,0.00004007447,0.0010230257,0.0036825957],"genre_scores_gemma":[0.99339736,0.00013716426,0.006172465,0.00002437621,0.000014514281,0.000022087612,0.000012077599,0.00002608433,0.00019378157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9893721,0.0052503925,0.000695477,0.000654822,0.0031838801,0.00084328867],"domain_scores_gemma":[0.9214933,0.056135267,0.007368248,0.009328072,0.00430268,0.0013724506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077940244,0.0008725239,0.0010352717,0.0011059389,0.0021764755,0.0016877378,0.0014872184,0.0015722653,0.0005894242],"category_scores_gemma":[0.04733234,0.0007128362,0.000536283,0.0007988053,0.002645788,0.0038252177,0.002434008,0.0014866891,0.00020788072],"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.004473558,0.000980965,0.043582775,0.0014256483,0.0006777042,0.005059761,0.0058932914,0.5904197,0.11680817,0.040993873,0.0022253077,0.18745914],"study_design_scores_gemma":[0.00015802385,0.002071483,0.0071554515,0.0000793987,0.00034238322,0.0021831093,0.0010189275,0.9136314,0.055446733,0.01520465,0.0025546856,0.00015373985],"about_ca_topic_score_codex":0.0027717222,"about_ca_topic_score_gemma":0.001979046,"teacher_disagreement_score":0.0077940244,"about_ca_system_score_codex":0.0011850947,"about_ca_system_score_gemma":0.0013617144,"threshold_uncertainty_score":0.041219234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2746871,0.0015708497,0.70603764,0.001356703,0.00007529727,0.00028402562,0.00018113955,0.00080672477,0.015000608],"genre_scores_gemma":[0.9570502,0.00050960295,0.040355053,0.00009990781,0.00007444122,0.00015675087,0.00014686072,0.00007737001,0.0015299028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761814,0.0006908588,0.000088049215,0.00019654896,0.0010381953,0.00036823424],"domain_scores_gemma":[0.99321026,0.003146224,0.00063006714,0.0007445045,0.0018954048,0.0003734249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028099527,0.0005140959,0.00048221956,0.00092807185,0.0007099681,0.0012195429,0.0016290568,0.0005637304,0.0019348733],"category_scores_gemma":[0.015822371,0.00038255294,0.0004898466,0.0009448239,0.00083177985,0.0022915406,0.0013296606,0.001085573,0.0002739974],"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.00031785158,0.000167669,0.006803965,0.00025085435,0.00008050411,0.00029576308,0.0005286632,0.78041565,0.016451122,0.13817328,0.004545157,0.051969573],"study_design_scores_gemma":[0.000010975974,0.000036159057,0.0006593286,0.0000069551093,0.000010043736,0.00003872514,0.000045670462,0.9852158,0.0007381025,0.0127043165,0.0005267126,0.0000072496473],"about_ca_topic_score_codex":0.006268889,"about_ca_topic_score_gemma":0.0029954338,"teacher_disagreement_score":0.006268889,"about_ca_system_score_codex":0.0021489677,"about_ca_system_score_gemma":0.0016494729,"threshold_uncertainty_score":0.015591919},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01304587,0.0054512047,0.65988976,0.0032782112,0.0017919323,0.0028848657,0.007051407,0.023397194,0.2832096],"genre_scores_gemma":[0.29372528,0.011667982,0.4366573,0.002760664,0.0012608428,0.006308156,0.022964206,0.0041412706,0.22051425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979311,0.00029997676,0.00027433067,0.00027704897,0.00093283143,0.0002847092],"domain_scores_gemma":[0.99682474,0.0009072613,0.00019620862,0.0011210758,0.0007748917,0.00017589402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018757115,0.0013213942,0.0011864721,0.0024502606,0.0020819027,0.002996351,0.0032544844,0.002093383,0.027335027],"category_scores_gemma":[0.006400846,0.00080917776,0.00091331574,0.0022774974,0.0010242454,0.005908626,0.0063771163,0.0020317112,0.011587118],"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.00043532695,0.00023271282,0.0010662831,0.0015891156,0.00015446909,0.0009048141,0.0008559952,0.02354182,0.012606139,0.4516941,0.18414657,0.32277265],"study_design_scores_gemma":[0.00025488855,0.00014518459,0.00048142468,0.00034449785,0.00010296562,0.0010474421,0.000389604,0.11820845,0.011670425,0.23329155,0.6339381,0.00012560053],"about_ca_topic_score_codex":0.0020646772,"about_ca_topic_score_gemma":0.0025962552,"teacher_disagreement_score":0.027335027,"about_ca_system_score_codex":0.0015573632,"about_ca_system_score_gemma":0.0018558316,"threshold_uncertainty_score":0.09144473},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07736582,0.0010598454,0.8840799,0.0007652076,0.0004275801,0.00067110226,0.00022101264,0.0050488384,0.030360723],"genre_scores_gemma":[0.7029315,0.0009969716,0.26325893,0.00019437862,0.00046280236,0.00053700607,0.00057535194,0.0004739091,0.030569073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834,0.00046356837,0.00006644887,0.00027486793,0.000671216,0.00018395703],"domain_scores_gemma":[0.99174964,0.0041865436,0.0003285296,0.001333539,0.001589771,0.0008120127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606433,0.0007359904,0.0010821724,0.0009086845,0.0022634754,0.002243234,0.0030760202,0.0019814144,0.006123544],"category_scores_gemma":[0.0104193315,0.0006241749,0.00046057184,0.0012220045,0.0006860152,0.005074396,0.0041961144,0.0012239331,0.0034603951],"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.0010518873,0.0011079275,0.0032184448,0.0015915016,0.00021809957,0.0019266844,0.0042418335,0.051642746,0.07377058,0.17581917,0.04060295,0.64480823],"study_design_scores_gemma":[0.000320386,0.00043781174,0.00086508144,0.00011768495,0.00014136692,0.0014376778,0.0011479385,0.60912603,0.039227206,0.25888476,0.08816283,0.00013122447],"about_ca_topic_score_codex":0.0009593625,"about_ca_topic_score_gemma":0.0013706131,"teacher_disagreement_score":0.006123544,"about_ca_system_score_codex":0.00032849688,"about_ca_system_score_gemma":0.00082452147,"threshold_uncertainty_score":0.020485282},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24711122,0.0007633758,0.7493727,0.00031435184,0.000032865042,0.00022411981,0.00005446672,0.00053449394,0.0015923566],"genre_scores_gemma":[0.86484206,0.00035534447,0.1335814,0.000036333968,0.000027566373,0.00013110196,0.000058904694,0.000042685908,0.00092472247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948126,0.00024235157,0.000024782481,0.00007394464,0.00009726813,0.00008046834],"domain_scores_gemma":[0.99783725,0.0015666794,0.00018492214,0.000083123115,0.00017653136,0.00015146169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012530831,0.0007530205,0.0011788849,0.00049044157,0.0007582303,0.0007801143,0.0012912541,0.0010944678,0.00069482706],"category_scores_gemma":[0.0048364648,0.00055870356,0.00022015985,0.00071044586,0.0009258968,0.0015273278,0.0008937969,0.00053411466,0.00017279582],"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.00022336554,0.00008774064,0.0009840081,0.00011028067,0.000027527632,0.00026522632,0.00014020085,0.95375204,0.009095004,0.0076681296,0.00077824586,0.026868157],"study_design_scores_gemma":[0.000020555264,0.000035042965,0.000080550904,0.0000023651237,0.000004984441,0.000025357784,0.000030719282,0.99551386,0.0014660697,0.002650892,0.00016464683,0.0000049521186],"about_ca_topic_score_codex":0.0039507286,"about_ca_topic_score_gemma":0.0031016173,"teacher_disagreement_score":0.0039507286,"about_ca_system_score_codex":0.0009097656,"about_ca_system_score_gemma":0.0008450731,"threshold_uncertainty_score":0.007855415},"labels":[],"label_agreement":null},{"id":"W2159896477","doi":"10.1007/s12083-009-0066-2","title":"From P2P to reliable semantic P2P systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scalability; Semantic Web; Semantics (computer science); Disconnection; Reliability (semiconductor); Fault tolerance; Social Semantic Web; Distributed computing; Information retrieval; Database; Power (physics)","score_opus":0.013452727753118765,"score_gpt":0.2577501957171053,"score_spread":0.24429746796398652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159896477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013171218,0.012281803,0.9152047,0.0126227485,0.0014974882,0.00015060532,0.0002917192,0.0025496099,0.042230014],"genre_scores_gemma":[0.6231955,0.022373289,0.32914463,0.0021028735,0.0028863337,0.00039424174,0.00091527775,0.00079661974,0.018191231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962321,0.0010662541,0.00020198617,0.0005116653,0.0017353281,0.0002526783],"domain_scores_gemma":[0.99588996,0.0016411612,0.00020757076,0.0013145589,0.00071073766,0.00023605475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031223064,0.00084616203,0.0010541616,0.0011107102,0.0013173769,0.005411613,0.0024449702,0.0027810081,0.0046018115],"category_scores_gemma":[0.009420454,0.00072879693,0.0005009207,0.0021160487,0.0035896248,0.012593603,0.0051884106,0.0032319836,0.0018804086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018941215,0.00006454573,0.00035037295,0.00065703917,0.00005417793,0.00040841507,0.0005289351,0.02123314,0.0035645536,0.8220879,0.022165032,0.12869643],"study_design_scores_gemma":[0.000034174438,0.000041448515,0.00014491339,0.000084870364,0.000034565706,0.00025951242,0.00021882416,0.05780495,0.0024568175,0.8465068,0.09237855,0.000034484674],"about_ca_topic_score_codex":0.0014334735,"about_ca_topic_score_gemma":0.0008235309,"teacher_disagreement_score":0.005411613,"about_ca_system_score_codex":0.0011701193,"about_ca_system_score_gemma":0.0015462635,"threshold_uncertainty_score":0.016512513},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1022157,0.00017097597,0.89416146,0.00014421325,0.000041948722,0.00010429467,0.000054334523,0.00068006205,0.002426991],"genre_scores_gemma":[0.7795775,0.00011901234,0.21857128,0.000052377094,0.00002998141,0.00008424387,0.00008393705,0.00008948176,0.0013921671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996031,0.000101565325,0.00001705165,0.00007332218,0.00014585974,0.00005914989],"domain_scores_gemma":[0.9995254,0.00020156546,0.00005636712,0.00004402017,0.00011075105,0.000061937826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006613091,0.00034455612,0.00054829393,0.00027082572,0.00060094864,0.00040400692,0.0009964302,0.0005851265,0.0011042661],"category_scores_gemma":[0.0014435517,0.000306889,0.0002575542,0.00032719696,0.00038051192,0.00060472987,0.0005981073,0.00051528536,0.00020958955],"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.00022645124,0.00012017335,0.00088355894,0.000071519666,0.000017205493,0.00015928475,0.00021102488,0.8795728,0.028557533,0.008488068,0.0018588022,0.07983358],"study_design_scores_gemma":[0.000007061207,0.000023329143,0.000073958654,0.0000010237802,0.0000014506871,0.000012238534,0.000017031965,0.99667215,0.0021047785,0.0008260207,0.00025754306,0.0000034146287],"about_ca_topic_score_codex":0.007935238,"about_ca_topic_score_gemma":0.006925429,"teacher_disagreement_score":0.007935238,"about_ca_system_score_codex":0.00086549425,"about_ca_system_score_gemma":0.0012431708,"threshold_uncertainty_score":0.015778065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045551237,0.00026656385,0.93599415,0.00041518186,0.00013158357,0.0003168283,0.00010531554,0.009756179,0.0074629425],"genre_scores_gemma":[0.39389575,0.00023299876,0.600469,0.00015841868,0.000061474144,0.00031792987,0.00025693394,0.00034709118,0.0042603263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991358,0.00019297561,0.00007536349,0.00014586777,0.00031791127,0.00013210266],"domain_scores_gemma":[0.9980621,0.0005752176,0.000118034026,0.0007469897,0.00037995767,0.00011765381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006823,0.00032362217,0.00048520183,0.0008861282,0.0012987247,0.0018253252,0.0022050384,0.0011509921,0.0035803453],"category_scores_gemma":[0.0048429016,0.0003710091,0.00031827707,0.0008991705,0.0013459636,0.0037265206,0.0019862414,0.0011029594,0.0014482195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006693872,0.0004474313,0.006769504,0.0007319432,0.00019123683,0.0013171729,0.002312938,0.12552911,0.121398225,0.25688878,0.030786298,0.452958],"study_design_scores_gemma":[0.00032765116,0.00087428355,0.002775176,0.00010933565,0.00014094352,0.0011640791,0.00041975864,0.66193175,0.07589797,0.09761835,0.15853105,0.00020972082],"about_ca_topic_score_codex":0.0042302795,"about_ca_topic_score_gemma":0.00399426,"teacher_disagreement_score":0.0042302795,"about_ca_system_score_codex":0.00085536303,"about_ca_system_score_gemma":0.0008211742,"threshold_uncertainty_score":0.011977375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09430283,0.00041278513,0.8906366,0.0003892519,0.00011112006,0.00030243612,0.00012741216,0.003826788,0.009890786],"genre_scores_gemma":[0.8542068,0.00016669156,0.14119042,0.00015727185,0.000106802916,0.0001829581,0.00015265074,0.00010770199,0.0037286452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995271,0.00009982342,0.000033771903,0.0001323552,0.000114863185,0.00009209952],"domain_scores_gemma":[0.999453,0.000084483225,0.00006542718,0.00015714306,0.00013190122,0.00010808351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048102663,0.0003607613,0.0005034942,0.0005739171,0.0007191974,0.0012752685,0.0014930846,0.0005016907,0.0024872925],"category_scores_gemma":[0.0010431752,0.0001845027,0.00025498186,0.0007389354,0.0005649765,0.0017448474,0.0015801355,0.00058549974,0.000597954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018896413,0.00061429816,0.016999386,0.00045472046,0.0001471325,0.0012118063,0.001773969,0.062473945,0.20222543,0.09803937,0.017757295,0.59641296],"study_design_scores_gemma":[0.00018071632,0.00063418556,0.0069793654,0.000035549197,0.0001302699,0.0011659353,0.00053811877,0.8396753,0.059830733,0.016474614,0.074253134,0.000102054204],"about_ca_topic_score_codex":0.0024858355,"about_ca_topic_score_gemma":0.0033791326,"teacher_disagreement_score":0.0024872925,"about_ca_system_score_codex":0.000552336,"about_ca_system_score_gemma":0.00072271656,"threshold_uncertainty_score":0.008320868},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5450209,0.0014017518,0.44694874,0.0009771722,0.000119791934,0.00020806071,0.00011902112,0.0019089665,0.0032955762],"genre_scores_gemma":[0.9429071,0.00027711567,0.05597928,0.000052464857,0.00004421495,0.000036358022,0.00006706084,0.00007826566,0.0005582481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986712,0.00048089598,0.00007395817,0.00024813987,0.00037108667,0.00015484086],"domain_scores_gemma":[0.99515224,0.0034210996,0.00021652575,0.0005088035,0.00051672064,0.0001846382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020158333,0.0007818346,0.0008080297,0.0006959076,0.0011403044,0.00090152107,0.0013154311,0.00091757445,0.00057996536],"category_scores_gemma":[0.008354182,0.0003846232,0.0002547729,0.00062304264,0.001027546,0.002116929,0.00075760763,0.00089292816,0.00015626104],"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.00052799645,0.000306158,0.004728882,0.00010051707,0.000049253344,0.00023933177,0.00022431588,0.8566793,0.0115910955,0.0043803407,0.0010559066,0.12011686],"study_design_scores_gemma":[0.00000797631,0.00004671261,0.00049030205,0.0000027067729,0.0000056118747,0.0000416705,0.000028851351,0.99526596,0.0027841297,0.0010521369,0.00026641935,0.0000074885647],"about_ca_topic_score_codex":0.007630719,"about_ca_topic_score_gemma":0.0052181254,"teacher_disagreement_score":0.007630719,"about_ca_system_score_codex":0.0009904966,"about_ca_system_score_gemma":0.0009349042,"threshold_uncertainty_score":0.015172601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040783126,0.0006568599,0.95231116,0.00037863522,0.00015212632,0.00033699145,0.00010845427,0.002497433,0.0027751995],"genre_scores_gemma":[0.7541395,0.0009305218,0.23993623,0.00012624328,0.00017309602,0.0003580181,0.0002003683,0.00023080426,0.0039051468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831617,0.00048925134,0.00012828366,0.00013451657,0.00079335715,0.00013854018],"domain_scores_gemma":[0.99628973,0.0010710958,0.00071630505,0.0010916465,0.0005444022,0.00028677093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028324623,0.00058358966,0.0008948769,0.0013249365,0.0013044899,0.0015373563,0.0023098674,0.0012921306,0.00124752],"category_scores_gemma":[0.0077715227,0.00035538018,0.00062868337,0.0010857194,0.001463634,0.0026537853,0.0022573338,0.0012556632,0.00050868763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00210346,0.0007088367,0.0041309977,0.0016271068,0.0009348068,0.0027508445,0.0043170447,0.17342928,0.20284022,0.27201018,0.012424092,0.32272318],"study_design_scores_gemma":[0.0005481126,0.001618691,0.0014118367,0.0001594624,0.0005007599,0.002278942,0.000501455,0.7393399,0.10713064,0.08588561,0.060297564,0.00032694265],"about_ca_topic_score_codex":0.00095799094,"about_ca_topic_score_gemma":0.0007767447,"teacher_disagreement_score":0.0028324623,"about_ca_system_score_codex":0.0005030413,"about_ca_system_score_gemma":0.0011955007,"threshold_uncertainty_score":0.0149796605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052039293,0.001977493,0.97713655,0.0023341007,0.00008429597,0.000081708225,0.00003461803,0.000051383053,0.013095935],"genre_scores_gemma":[0.5481315,0.011790006,0.42967743,0.00073542213,0.00076451234,0.00075666956,0.00011310269,0.00009016885,0.007941177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969638,0.0016996778,0.0001414515,0.0001894797,0.00078769535,0.00021783954],"domain_scores_gemma":[0.9963825,0.0027763254,0.00018342465,0.00021287294,0.00030804507,0.0001368935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033233485,0.0012634547,0.0013222465,0.0012907266,0.0010250463,0.004294608,0.0017792551,0.0027024767,0.0016652088],"category_scores_gemma":[0.008253167,0.0006055589,0.0008401269,0.0019902892,0.005342245,0.005818804,0.0019089888,0.002919659,0.00041479862],"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.000015040846,0.000024106803,0.00012695392,0.000098601384,0.00001847818,0.00005385892,0.00013385294,0.10926958,0.00055394956,0.88116914,0.00058521464,0.007951139],"study_design_scores_gemma":[0.000019609284,0.000036034467,0.00005371245,0.000032626165,0.000014853705,0.00005714957,0.00010107428,0.31394118,0.00036041706,0.67842674,0.006945187,0.000011377116],"about_ca_topic_score_codex":0.0022333018,"about_ca_topic_score_gemma":0.0017628102,"teacher_disagreement_score":0.004294608,"about_ca_system_score_codex":0.0022876717,"about_ca_system_score_gemma":0.0021126885,"threshold_uncertainty_score":0.01757574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13875192,0.00020526914,0.85583454,0.00027815218,0.000061365885,0.00028717265,0.00004337414,0.0007940074,0.0037440893],"genre_scores_gemma":[0.778235,0.00009933956,0.21795133,0.000081681144,0.000056797388,0.00019578298,0.00007222125,0.000043106116,0.0032647604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.00013270957,0.000023797626,0.00011244885,0.00019018419,0.000052987605],"domain_scores_gemma":[0.9986761,0.00029823772,0.000101560305,0.00025945264,0.00038675204,0.00027785584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010094931,0.00036016936,0.0004356748,0.00048495905,0.0010845652,0.00062128715,0.0013578637,0.0008972441,0.0009789957],"category_scores_gemma":[0.002957225,0.00016123017,0.00031922976,0.0005184401,0.00047763844,0.0012956298,0.0014622868,0.00082991057,0.00026724857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011946311,0.00090992876,0.0034705803,0.00033841422,0.00017380677,0.0016681209,0.0019193236,0.12018595,0.28831008,0.09060026,0.0053826934,0.48584625],"study_design_scores_gemma":[0.00013233784,0.00053616305,0.0011295828,0.000015855427,0.000066973764,0.0010295975,0.00023647092,0.9448151,0.025049243,0.01777869,0.009136756,0.00007318168],"about_ca_topic_score_codex":0.0015445314,"about_ca_topic_score_gemma":0.0014542963,"teacher_disagreement_score":0.0015445314,"about_ca_system_score_codex":0.00044576987,"about_ca_system_score_gemma":0.000624179,"threshold_uncertainty_score":0.005338788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27984387,0.00032017645,0.70476663,0.00066382415,0.00003767899,0.00029025314,0.000037679707,0.00016034866,0.013879601],"genre_scores_gemma":[0.98013705,0.0001000317,0.017858202,0.000053505642,0.000010625064,0.00015204286,0.000012746428,0.0000095187615,0.0016662828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985777,0.00092067436,0.000036107594,0.00012508924,0.00020303176,0.00013731346],"domain_scores_gemma":[0.99689996,0.0021705264,0.0003011775,0.00013252095,0.0002496261,0.00024620994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018985908,0.00069223385,0.0006912345,0.0006102534,0.0006936831,0.00084592664,0.0011029015,0.0010295871,0.0020477497],"category_scores_gemma":[0.005508668,0.00026801098,0.00048015965,0.00034278393,0.0012060262,0.0013743005,0.0011150382,0.0005577466,0.00029911258],"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.00037401723,0.00040007013,0.0019193955,0.00023302638,0.00019123711,0.000807739,0.0012527048,0.69952476,0.016854968,0.21912923,0.0018563225,0.057456505],"study_design_scores_gemma":[0.000046812027,0.0001777141,0.00035581566,0.000011867264,0.000025508458,0.00012716882,0.00022337327,0.93695754,0.0010007999,0.060124896,0.0009296114,0.00001887465],"about_ca_topic_score_codex":0.00083841756,"about_ca_topic_score_gemma":0.0006786453,"teacher_disagreement_score":0.0020477497,"about_ca_system_score_codex":0.000904386,"about_ca_system_score_gemma":0.0006540013,"threshold_uncertainty_score":0.01004082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016190595,0.023545945,0.8962277,0.002051718,0.00088168716,0.0003188339,0.00022518568,0.004271067,0.07085871],"genre_scores_gemma":[0.048393533,0.029198091,0.8757078,0.0015112823,0.0011410902,0.0009157234,0.0010399419,0.0023498766,0.039742727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9856845,0.004115603,0.0017148484,0.001678038,0.006316202,0.0004907054],"domain_scores_gemma":[0.98550975,0.0055733277,0.0011654933,0.004364808,0.0030061863,0.00038027097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007704701,0.001391863,0.0022524826,0.011568842,0.002663365,0.008702503,0.003962671,0.0020610127,0.020757526],"category_scores_gemma":[0.023363775,0.0009609061,0.0019126175,0.012332318,0.006447989,0.017249923,0.0064863362,0.0031049468,0.011828632],"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.000025595924,0.00003435765,0.00026596888,0.0010911699,0.000026831693,0.00009366458,0.0008296556,0.00070907857,0.0012105831,0.55516565,0.014983997,0.42556342],"study_design_scores_gemma":[0.000019451236,0.00004751265,0.00027613068,0.0009295064,0.000046986082,0.0007250828,0.00037980336,0.0023385468,0.0027463227,0.400688,0.5917503,0.000052333948],"about_ca_topic_score_codex":0.001960884,"about_ca_topic_score_gemma":0.0016972682,"teacher_disagreement_score":0.020757526,"about_ca_system_score_codex":0.003553532,"about_ca_system_score_gemma":0.004541304,"threshold_uncertainty_score":0.06944084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027618927,0.0025955406,0.9455304,0.0021069823,0.001507002,0.0006174254,0.0003463149,0.001887367,0.04264717],"genre_scores_gemma":[0.15436462,0.005674663,0.74638695,0.0037931462,0.0014426229,0.0034993275,0.0022899401,0.0008367012,0.08171199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985935,0.0004914785,0.00013788356,0.00010902817,0.00056823296,0.00009993497],"domain_scores_gemma":[0.99894434,0.0002978675,0.00007915997,0.00023540348,0.0003759822,0.000067288376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015085636,0.00045256558,0.0005288641,0.0007957584,0.001406276,0.0016803746,0.0012739738,0.002216453,0.005750882],"category_scores_gemma":[0.002861609,0.0002595205,0.00036118936,0.0007715424,0.00092396996,0.0027534922,0.002610325,0.002586616,0.0025900453],"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.00018186198,0.00010738632,0.0002694668,0.0005233873,0.000044701243,0.0010961967,0.0011092358,0.004962816,0.030401032,0.6760007,0.06824236,0.21706073],"study_design_scores_gemma":[0.00009669632,0.00020256623,0.00035587177,0.00017457036,0.00006446231,0.0016544037,0.00020438347,0.04019459,0.019512128,0.11982681,0.8176139,0.000099709665],"about_ca_topic_score_codex":0.0005566908,"about_ca_topic_score_gemma":0.0006573028,"teacher_disagreement_score":0.005750882,"about_ca_system_score_codex":0.0006600951,"about_ca_system_score_gemma":0.0009823556,"threshold_uncertainty_score":0.01923865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034607068,0.0019640955,0.9369797,0.00091382884,0.0007363493,0.000632056,0.00022062227,0.012888668,0.0110575985],"genre_scores_gemma":[0.56049174,0.0013233665,0.41475785,0.0003126523,0.0006245095,0.0004483623,0.0006259535,0.0006217505,0.020793794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991627,0.0001366252,0.0000588794,0.00008615768,0.00047907728,0.00007668768],"domain_scores_gemma":[0.998782,0.00027269172,0.000059216058,0.00025731532,0.000481422,0.00014749695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007989499,0.0006951009,0.0009826462,0.0008231021,0.0013965068,0.0016005763,0.0036504206,0.0013075386,0.0062928447],"category_scores_gemma":[0.0029752958,0.00048011023,0.0003314451,0.00092587253,0.00058462954,0.0028584728,0.0019964895,0.0014097072,0.002534007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013301227,0.00073036324,0.0011092996,0.0005224477,0.00015566013,0.0007790456,0.0006380744,0.09427703,0.09410977,0.044671502,0.07154202,0.6901347],"study_design_scores_gemma":[0.00022150314,0.00054828566,0.0005424129,0.000038820865,0.00010060392,0.00045304524,0.00017668967,0.92393875,0.021515995,0.021439645,0.030922547,0.000101678714],"about_ca_topic_score_codex":0.003895596,"about_ca_topic_score_gemma":0.0057630544,"teacher_disagreement_score":0.0062928447,"about_ca_system_score_codex":0.0009622969,"about_ca_system_score_gemma":0.0010259412,"threshold_uncertainty_score":0.021051705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006415327,0.00016491846,0.9881337,0.0002345357,0.000037206104,0.000117088886,0.000034407036,0.0021572993,0.0027054907],"genre_scores_gemma":[0.27369943,0.00024735034,0.7215132,0.0002771995,0.00008256945,0.00023653441,0.00014468632,0.0001087705,0.00369027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.00036766825,0.00004697923,0.00014947377,0.0004060916,0.00008580127],"domain_scores_gemma":[0.9992563,0.00023941777,0.00010893826,0.00013793352,0.00019434332,0.000063091684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011713353,0.00043914813,0.0005501626,0.0011244772,0.00070715527,0.0007696629,0.0020994733,0.000974003,0.0009393306],"category_scores_gemma":[0.002079176,0.00021941254,0.00045246418,0.00065675395,0.00047822524,0.0011871527,0.0011219735,0.00069460797,0.00046580815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026259257,0.00040709818,0.004189831,0.000281234,0.00013850555,0.00044841017,0.00060773775,0.04648291,0.04205768,0.051254243,0.00801812,0.84585166],"study_design_scores_gemma":[0.000022489956,0.00009863744,0.00088626344,0.000020965585,0.00004543131,0.0002906413,0.00009800265,0.95781577,0.009494119,0.019225948,0.0119677065,0.00003411531],"about_ca_topic_score_codex":0.0018477505,"about_ca_topic_score_gemma":0.0020486007,"teacher_disagreement_score":0.0020994733,"about_ca_system_score_codex":0.0005854183,"about_ca_system_score_gemma":0.00061432144,"threshold_uncertainty_score":0.0061947107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005493828,0.01497931,0.8463086,0.0048142145,0.0010965213,0.0002653846,0.00021952261,0.0016307578,0.12519185],"genre_scores_gemma":[0.19205469,0.037238117,0.66908395,0.0021850602,0.001642682,0.0014258578,0.00073128985,0.0005889819,0.095049344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990094,0.0002264979,0.0000600016,0.00019159539,0.0003903312,0.00012206951],"domain_scores_gemma":[0.99943835,0.00012850846,0.0000647521,0.000111852154,0.00013621048,0.000120358585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012691505,0.0008625243,0.0005404171,0.0015332615,0.0017846726,0.006442539,0.0022436066,0.0020865053,0.004915112],"category_scores_gemma":[0.0016733636,0.0005151795,0.0005369618,0.0018657367,0.0044657527,0.007990107,0.0037464155,0.0025354465,0.002122745],"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.000011845141,0.000014949632,0.000083380924,0.00014443994,0.000007722259,0.000083521154,0.0003610112,0.0017796361,0.0009218897,0.95369613,0.006722362,0.036173187],"study_design_scores_gemma":[0.000011542017,0.000037858576,0.00016060036,0.00018988863,0.000017081486,0.0005483361,0.00028929397,0.014335948,0.00091715006,0.54713964,0.43631902,0.000033607725],"about_ca_topic_score_codex":0.003050161,"about_ca_topic_score_gemma":0.0023382541,"teacher_disagreement_score":0.006442539,"about_ca_system_score_codex":0.0020676975,"about_ca_system_score_gemma":0.002240271,"threshold_uncertainty_score":0.016442716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33124155,0.0007303119,0.5549172,0.0016562459,0.0009807497,0.0022079793,0.00033025054,0.061731935,0.04620382],"genre_scores_gemma":[0.70648986,0.00033360295,0.26394376,0.00068313343,0.0001667855,0.0003364998,0.000651742,0.001215442,0.026179057],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982462,0.00031191812,0.00018973176,0.00021935928,0.0007518643,0.00028100982],"domain_scores_gemma":[0.9971119,0.00046228265,0.00015422654,0.0011549012,0.00088221545,0.00023451766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019661665,0.0005218986,0.00039012716,0.00046939577,0.0006240306,0.0021117076,0.001592807,0.0010331682,0.006601388],"category_scores_gemma":[0.0034004806,0.0005057826,0.00065573794,0.00019166198,0.000470335,0.0030443682,0.0012438447,0.0014638843,0.0021001047],"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.004403911,0.0022555764,0.012788429,0.0008591301,0.00024458344,0.003366153,0.0025384785,0.019724684,0.5084854,0.07269728,0.027174897,0.3454615],"study_design_scores_gemma":[0.0005337523,0.0018713478,0.009029637,0.00019407064,0.0004467215,0.0027222913,0.00025365362,0.3654179,0.34158078,0.00883463,0.26880503,0.00031013213],"about_ca_topic_score_codex":0.0014044564,"about_ca_topic_score_gemma":0.00082568586,"teacher_disagreement_score":0.006601388,"about_ca_system_score_codex":0.0007081712,"about_ca_system_score_gemma":0.0011847476,"threshold_uncertainty_score":0.022083879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020615337,0.0012889487,0.9659809,0.0004223552,0.00023355754,0.00034964387,0.00008868548,0.0054677213,0.005552938],"genre_scores_gemma":[0.5492379,0.0010687344,0.44205025,0.0006474325,0.00026937996,0.00034792806,0.00026830443,0.00035969692,0.0057502487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817,0.00048971985,0.00015636675,0.00024204516,0.0007757477,0.00016610394],"domain_scores_gemma":[0.997823,0.0006174079,0.00017796498,0.0004722587,0.00063876953,0.00027058375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358867,0.0006178136,0.0008343143,0.0008574978,0.0010285117,0.0018486344,0.0022430664,0.0010763366,0.0014677228],"category_scores_gemma":[0.004723009,0.0003652885,0.00034806514,0.0009371418,0.0010074395,0.0018540969,0.0023566105,0.0018181752,0.00088452006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012049854,0.0004868103,0.0027677186,0.00076781644,0.00015571104,0.0011171887,0.00097310037,0.12013376,0.1382388,0.13474187,0.019538406,0.57987386],"study_design_scores_gemma":[0.00023955261,0.0005270125,0.00094954885,0.000088899025,0.00008287833,0.0015158843,0.00022765333,0.80223566,0.0633647,0.055628873,0.07498006,0.00015925869],"about_ca_topic_score_codex":0.0010097441,"about_ca_topic_score_gemma":0.0012505066,"teacher_disagreement_score":0.002358867,"about_ca_system_score_codex":0.0008411378,"about_ca_system_score_gemma":0.001060652,"threshold_uncertainty_score":0.012475014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010102018,0.0014614206,0.9828303,0.00041976554,0.00021199207,0.00013539987,0.000026275458,0.0012679889,0.0035449637],"genre_scores_gemma":[0.3250921,0.0021932833,0.6649794,0.00035148932,0.00026464005,0.00030689064,0.0001956053,0.00012082342,0.0064957757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994029,0.00015393508,0.00003703518,0.00007932646,0.00028055575,0.000046212594],"domain_scores_gemma":[0.9996486,0.00007605997,0.000037652346,0.00005723584,0.00012441857,0.000056073797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665224,0.0004078856,0.0004433539,0.00035572928,0.000698246,0.00084857875,0.0015757266,0.00084758556,0.0011348844],"category_scores_gemma":[0.0013728236,0.0002810377,0.0003649653,0.0004501175,0.00053656066,0.0018576593,0.0012341634,0.0010005387,0.0007615461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002603702,0.00022796082,0.0012500345,0.0012632248,0.0002779512,0.0017621706,0.0011472865,0.20953949,0.1356376,0.16631304,0.01529696,0.4670239],"study_design_scores_gemma":[0.00006766302,0.00052310294,0.0005990214,0.00007300205,0.00016715132,0.0013007738,0.00017224393,0.82902,0.022373807,0.057475563,0.08809267,0.00013500692],"about_ca_topic_score_codex":0.0010240249,"about_ca_topic_score_gemma":0.001297122,"teacher_disagreement_score":0.0015757266,"about_ca_system_score_codex":0.0003183074,"about_ca_system_score_gemma":0.000698724,"threshold_uncertainty_score":0.0040537715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49626714,0.0068126447,0.36380237,0.01593036,0.0014911954,0.0012648825,0.0004616575,0.0006739075,0.11329579],"genre_scores_gemma":[0.98691875,0.0005573296,0.010550192,0.00026322395,0.000089234585,0.00020521654,0.000025702475,0.000025593286,0.0013648757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96463567,0.023349902,0.0012702879,0.001448376,0.0070897103,0.0022059898],"domain_scores_gemma":[0.8595631,0.10892263,0.010536734,0.008324442,0.009393358,0.0032596937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033879682,0.00091348885,0.00090233015,0.0014369964,0.0011421546,0.005072179,0.0023276783,0.003398784,0.006188413],"category_scores_gemma":[0.12585908,0.00046642034,0.0009407731,0.0009790508,0.0025308575,0.0070239804,0.004043295,0.002076981,0.00045977946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019110984,0.00068929774,0.008291507,0.0008497449,0.00033355792,0.0003198704,0.0007200342,0.101416506,0.00600758,0.76095253,0.0022216667,0.11628663],"study_design_scores_gemma":[0.0016884767,0.0061353953,0.02392059,0.0012272862,0.0006795106,0.0009867294,0.0020618294,0.22798935,0.015874036,0.6758759,0.0431057,0.00045519075],"about_ca_topic_score_codex":0.00074400025,"about_ca_topic_score_gemma":0.00023925828,"teacher_disagreement_score":0.033879682,"about_ca_system_score_codex":0.0023325467,"about_ca_system_score_gemma":0.0028492226,"threshold_uncertainty_score":0.17917502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02139388,0.011456684,0.72361064,0.017917315,0.0012020961,0.00022411694,0.00015869325,0.0018092507,0.22222738],"genre_scores_gemma":[0.7700936,0.009175457,0.16994934,0.0015902527,0.0013308858,0.0003436697,0.00034171893,0.00027320103,0.046901934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983193,0.0005071556,0.000071022085,0.00036125822,0.0005578183,0.00018339795],"domain_scores_gemma":[0.9983845,0.00070464105,0.00019911065,0.000297859,0.00021721826,0.00019671026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018295088,0.00035925853,0.00047489683,0.0006028529,0.0012986184,0.0041717635,0.0010267602,0.0014665016,0.0039792415],"category_scores_gemma":[0.0036930898,0.00027988656,0.00032338285,0.0014509181,0.0025097986,0.0034454586,0.0023622967,0.0011277765,0.0008993084],"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.00004942388,0.000035362744,0.00046886015,0.00012571686,0.000025182679,0.00036230567,0.00035303808,0.02036638,0.0014763818,0.90048766,0.013700324,0.06254944],"study_design_scores_gemma":[0.000051124727,0.000035903427,0.00064937206,0.00006578709,0.000019631454,0.00037731775,0.00026857224,0.07441136,0.0015594445,0.71663105,0.20589972,0.000030678624],"about_ca_topic_score_codex":0.004480619,"about_ca_topic_score_gemma":0.002185388,"teacher_disagreement_score":0.004480619,"about_ca_system_score_codex":0.0015964737,"about_ca_system_score_gemma":0.0019708562,"threshold_uncertainty_score":0.013311863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7088208,0.0116507625,0.23135388,0.0032988947,0.0012907513,0.0023660637,0.000719343,0.007038287,0.03346115],"genre_scores_gemma":[0.8851048,0.0020920816,0.106409095,0.00024739778,0.0003112646,0.00035749472,0.00044690573,0.0003508041,0.004680203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9890933,0.005361282,0.0004856354,0.00059193,0.0040573184,0.0004104657],"domain_scores_gemma":[0.9252196,0.05751243,0.0017471383,0.008025523,0.0055500064,0.0019451991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011823958,0.0010096182,0.0016161381,0.0017036687,0.0017810152,0.0027124137,0.0036768245,0.002797276,0.0047237375],"category_scores_gemma":[0.056848984,0.0003417279,0.00079898303,0.0024338723,0.0014213333,0.0054532066,0.0030785305,0.0012053715,0.00086382637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.018023334,0.0035530871,0.006281868,0.0037775324,0.001153066,0.00026767983,0.001959928,0.075806536,0.019351065,0.01546167,0.009110857,0.84525335],"study_design_scores_gemma":[0.009276703,0.02317186,0.014673256,0.0005007805,0.002533604,0.0013248145,0.0036025469,0.8191677,0.04141729,0.04668245,0.03725131,0.00039770082],"about_ca_topic_score_codex":0.003827773,"about_ca_topic_score_gemma":0.0022412392,"teacher_disagreement_score":0.011823958,"about_ca_system_score_codex":0.0010550492,"about_ca_system_score_gemma":0.0022257904,"threshold_uncertainty_score":0.06253177},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21367238,0.0008626562,0.7687797,0.00051028037,0.00021584843,0.00042901168,0.00044455138,0.006918314,0.008167239],"genre_scores_gemma":[0.72447926,0.00050488266,0.26944697,0.000092327085,0.00008462098,0.00015015122,0.0005804421,0.00013978957,0.00452147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978393,0.00005081988,0.000009688734,0.000046641882,0.000087418426,0.000021558259],"domain_scores_gemma":[0.9996346,0.00010115885,0.000030732277,0.00007419972,0.00008678714,0.000072540766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035739355,0.00025041346,0.0004925219,0.0004791814,0.0005005152,0.0005234069,0.001091046,0.00041788063,0.0013207287],"category_scores_gemma":[0.0009255119,0.00017132748,0.00020248108,0.00062857044,0.00034706513,0.0010414846,0.0010488074,0.0004136738,0.00024345118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013525675,0.00059254776,0.0028188112,0.0005473987,0.00013737571,0.0011731149,0.00047102483,0.361508,0.15378706,0.038863126,0.0247557,0.41399327],"study_design_scores_gemma":[0.00008205705,0.00031618905,0.00071714266,0.000009943994,0.000024043855,0.0002386497,0.00005378903,0.96770984,0.015327279,0.0041063265,0.011381797,0.000032962864],"about_ca_topic_score_codex":0.0027509087,"about_ca_topic_score_gemma":0.0031826666,"teacher_disagreement_score":0.0027509087,"about_ca_system_score_codex":0.00047106546,"about_ca_system_score_gemma":0.0006192588,"threshold_uncertainty_score":0.0054698586},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015187182,0.038686506,0.8800321,0.015557325,0.0004993534,0.00026533514,0.00008315915,0.00041301668,0.049276013],"genre_scores_gemma":[0.25245532,0.06501396,0.65144354,0.0015884048,0.0011091634,0.00087755604,0.0002190521,0.00017079533,0.02712224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987375,0.00041692352,0.000058794823,0.00011792762,0.0005848225,0.00008399326],"domain_scores_gemma":[0.9986546,0.00047149055,0.000073834744,0.00013758738,0.00053810596,0.00012437846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029475132,0.0006410433,0.00047063123,0.0005465374,0.0006925348,0.0038088427,0.0023376388,0.0018584516,0.002742123],"category_scores_gemma":[0.002587423,0.0006521514,0.00030869662,0.00081438833,0.0013169184,0.005467065,0.0010867313,0.0017288818,0.0008728003],"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.000056126977,0.000191945,0.001352588,0.0010177438,0.000035462195,0.00027171415,0.0006796422,0.05225985,0.0057993117,0.5841339,0.009369974,0.34483173],"study_design_scores_gemma":[0.000057356523,0.0003090288,0.0005964531,0.0005072982,0.00004364953,0.00078246725,0.0014286989,0.3937064,0.00513923,0.38214415,0.2151991,0.00008613856],"about_ca_topic_score_codex":0.0012666174,"about_ca_topic_score_gemma":0.0019875765,"teacher_disagreement_score":0.0038088427,"about_ca_system_score_codex":0.0016112959,"about_ca_system_score_gemma":0.0011362236,"threshold_uncertainty_score":0.015588105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6704711,0.00018120126,0.32173514,0.00032003268,0.000026632028,0.00008889398,0.00011402833,0.0020589845,0.005004096],"genre_scores_gemma":[0.97344726,0.00003736809,0.026207885,0.0000220229,0.000007736842,0.00003566269,0.00004505569,0.000028875927,0.00016802439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99755895,0.0012944374,0.000059628223,0.00025451943,0.0007116558,0.00012087753],"domain_scores_gemma":[0.99760157,0.0011007464,0.00029937134,0.0005053764,0.00037723765,0.00011573868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016208661,0.00041847464,0.00047661742,0.0010385563,0.00054386427,0.0010980546,0.0010058375,0.00075174,0.0005043011],"category_scores_gemma":[0.004634005,0.00020425883,0.00014647542,0.0013233848,0.0006255607,0.0024052088,0.0013904162,0.0006681312,0.00013071731],"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.0010378595,0.0011485856,0.0953583,0.00036819972,0.00037972626,0.0007076973,0.0022910442,0.3751868,0.17088458,0.049528975,0.0031932825,0.2999149],"study_design_scores_gemma":[0.000039475148,0.00030939502,0.010727998,0.000008490607,0.000028576795,0.0002691947,0.00032882724,0.9420543,0.034965847,0.008938511,0.0022866582,0.000042681466],"about_ca_topic_score_codex":0.0014265019,"about_ca_topic_score_gemma":0.0013295872,"teacher_disagreement_score":0.0016208661,"about_ca_system_score_codex":0.00052098784,"about_ca_system_score_gemma":0.00038555235,"threshold_uncertainty_score":0.008572042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015855975,0.0026582722,0.8468389,0.0023481464,0.0008960566,0.0014184976,0.00072717766,0.024572512,0.10468449],"genre_scores_gemma":[0.25154537,0.0028684072,0.66846955,0.0011262707,0.00044053394,0.0017064121,0.0025069278,0.00088044506,0.0704561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986106,0.00043962125,0.00012445496,0.00022868668,0.00047972947,0.00011689778],"domain_scores_gemma":[0.99782264,0.0005097773,0.00022389257,0.00048678863,0.00060456526,0.00035234296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017142342,0.0006742541,0.00079036213,0.0009293796,0.0014791919,0.0029643786,0.0024393594,0.002131074,0.0071109137],"category_scores_gemma":[0.005096935,0.00046172075,0.00045316864,0.0009783645,0.00081042165,0.002437485,0.002445532,0.0014692709,0.0045046364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007942645,0.0005014803,0.0022137207,0.00089605217,0.00023568798,0.0012349592,0.0006634588,0.1655929,0.015468343,0.21368362,0.12427851,0.474437],"study_design_scores_gemma":[0.00017898912,0.00015602286,0.00041920482,0.000082297505,0.000071637616,0.00059436733,0.00007758893,0.5987004,0.0047685825,0.036430277,0.35844034,0.00008031185],"about_ca_topic_score_codex":0.003251139,"about_ca_topic_score_gemma":0.0028499286,"teacher_disagreement_score":0.0071109137,"about_ca_system_score_codex":0.0008798435,"about_ca_system_score_gemma":0.0026392958,"threshold_uncertainty_score":0.023788393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009679229,0.02560054,0.8960306,0.0033071877,0.0013273221,0.0009776178,0.0010782839,0.017075744,0.04492347],"genre_scores_gemma":[0.2921036,0.03303664,0.5707163,0.0018639548,0.003101855,0.0011098607,0.00402061,0.001900062,0.092147194],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985329,0.00022550789,0.00009473764,0.00020846249,0.00076393614,0.00017438135],"domain_scores_gemma":[0.9987066,0.00022166358,0.00009311168,0.0003979809,0.0004500443,0.00013069098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010134513,0.0010500591,0.0018014567,0.0015770865,0.0018786518,0.0040736822,0.0036664177,0.002531334,0.008714477],"category_scores_gemma":[0.0031005237,0.0006171233,0.0006569536,0.0045883916,0.0008086066,0.0053780926,0.002558386,0.001257864,0.007997458],"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.00042398568,0.00022792346,0.0011257723,0.0014270465,0.00018570274,0.0010145536,0.00038752452,0.011496074,0.022695092,0.12855417,0.17662437,0.6558377],"study_design_scores_gemma":[0.00015908846,0.00025650964,0.0011331636,0.00024770535,0.00018123859,0.0039823283,0.0002450324,0.14599189,0.030325163,0.10365504,0.71358204,0.0002407635],"about_ca_topic_score_codex":0.005582847,"about_ca_topic_score_gemma":0.0033947292,"teacher_disagreement_score":0.008714477,"about_ca_system_score_codex":0.0012324401,"about_ca_system_score_gemma":0.0019083222,"threshold_uncertainty_score":0.02915281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4080753,0.011273572,0.5393728,0.0019658506,0.00027394088,0.00023644543,0.00050946756,0.014384809,0.02390784],"genre_scores_gemma":[0.8738298,0.003146702,0.11553785,0.000122011574,0.00027007743,0.0001135331,0.0006522721,0.0008967527,0.0054309703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954959,0.001145419,0.00025332833,0.0005037186,0.0020334828,0.00056814944],"domain_scores_gemma":[0.9894118,0.0052971835,0.00041173876,0.0027009812,0.0019601665,0.00021812075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032435837,0.00094278745,0.0010324424,0.001566079,0.0008861979,0.0025122317,0.00260776,0.001235495,0.0040632933],"category_scores_gemma":[0.02022123,0.00038057813,0.0003162635,0.0024743832,0.0007931658,0.0072098966,0.00185796,0.0008860058,0.0023947535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015805513,0.00083399954,0.009235673,0.00084545516,0.00018475986,0.00028199342,0.00064140005,0.15889356,0.0829635,0.049442794,0.016255245,0.6788412],"study_design_scores_gemma":[0.00056495634,0.0008455979,0.0080505125,0.00017425203,0.00025189,0.0006413129,0.00034088356,0.6973311,0.18378651,0.061211642,0.046676543,0.00012483326],"about_ca_topic_score_codex":0.0010244489,"about_ca_topic_score_gemma":0.00077717414,"teacher_disagreement_score":0.0040632933,"about_ca_system_score_codex":0.001324478,"about_ca_system_score_gemma":0.001215741,"threshold_uncertainty_score":0.017153919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041084357,0.00025595946,0.9430936,0.00078962697,0.00011689066,0.00019170386,0.00033077167,0.0060400297,0.008097073],"genre_scores_gemma":[0.3824971,0.0008404103,0.60449106,0.000309017,0.00014521132,0.00037645633,0.0010336315,0.0005966431,0.009710334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735,0.0007769898,0.00020009535,0.00042121985,0.0010711963,0.00018053265],"domain_scores_gemma":[0.9921822,0.0032148643,0.0004363578,0.0032326346,0.0005288353,0.00040514412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025159111,0.0004249806,0.0006028917,0.0012654978,0.0025221845,0.0041256296,0.002342117,0.0021403967,0.002551308],"category_scores_gemma":[0.008651258,0.00039058115,0.00048560114,0.003172693,0.0021933988,0.007339379,0.005675131,0.0013674704,0.0014878764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069423503,0.00051470293,0.006574186,0.0006276381,0.00011572272,0.004571633,0.0068770903,0.07546851,0.04688132,0.36496118,0.029154208,0.46355957],"study_design_scores_gemma":[0.00019603924,0.0005062743,0.0016766774,0.00018422313,0.00013339703,0.0031213823,0.0014966833,0.4228603,0.088009454,0.2601899,0.22136523,0.00026041613],"about_ca_topic_score_codex":0.0019336904,"about_ca_topic_score_gemma":0.0014861291,"teacher_disagreement_score":0.0041256296,"about_ca_system_score_codex":0.00050462544,"about_ca_system_score_gemma":0.0011705362,"threshold_uncertainty_score":0.013305545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12023208,0.0026472174,0.8590992,0.0009733726,0.00007234422,0.000072823226,0.00015314686,0.00024294258,0.016506972],"genre_scores_gemma":[0.96503884,0.0012506496,0.031302173,0.000066973196,0.00006631152,0.00007709692,0.000082438244,0.000052975505,0.0020625526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989526,0.00043078655,0.000029398656,0.00012976416,0.000299547,0.0001578666],"domain_scores_gemma":[0.99726784,0.002114568,0.0001191801,0.00009101727,0.00029895426,0.000108511405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013803802,0.00041699864,0.00073277805,0.0006178687,0.0005432011,0.0010731667,0.00084457884,0.0008844483,0.0014871258],"category_scores_gemma":[0.005718886,0.00036854888,0.00032298753,0.00084466295,0.0009797198,0.0021114182,0.0013613247,0.00079703185,0.00020328794],"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.00008300579,0.000031576856,0.0003279116,0.00009803586,0.000019187652,0.00011282297,0.00008050478,0.927073,0.00281281,0.050211377,0.0009755303,0.018174218],"study_design_scores_gemma":[0.0000049687997,0.000014522782,0.000092619346,0.000006830179,0.00000376621,0.000027314696,0.000021001286,0.98031384,0.0006096378,0.018466383,0.0004335136,0.0000056491162],"about_ca_topic_score_codex":0.0020577544,"about_ca_topic_score_gemma":0.00059998117,"teacher_disagreement_score":0.0020577544,"about_ca_system_score_codex":0.0010096566,"about_ca_system_score_gemma":0.0007327603,"threshold_uncertainty_score":0.0073255897},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031362258,0.08001904,0.026335437,0.30040354,0.0067257653,0.00009563954,0.0003228744,0.0011222893,0.55361325],"genre_scores_gemma":[0.6099891,0.090373985,0.03130038,0.045284063,0.012120968,0.00028734247,0.0003427481,0.0012524885,0.20904891],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995501,0.0022742627,0.00014163513,0.00034904946,0.0011544713,0.00057964603],"domain_scores_gemma":[0.9782071,0.014943938,0.001072596,0.0013099047,0.001473224,0.0029932316],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006085794,0.0004912885,0.00048779135,0.0011394672,0.0027143012,0.013887273,0.0018886179,0.0040448606,0.025117528],"category_scores_gemma":[0.022900252,0.00034275025,0.0004582546,0.0032057685,0.0037839778,0.018656088,0.0065207165,0.003207756,0.00786737],"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.00015256857,0.00019154315,0.002066836,0.0010596535,0.00005388942,0.0005371853,0.015788995,0.00041695428,0.0012751295,0.18150331,0.28403935,0.5129147],"study_design_scores_gemma":[0.000053895554,0.00012288039,0.0024689885,0.00074946834,0.000054644348,0.000675066,0.013969376,0.00042311035,0.00087804673,0.33846387,0.642097,0.00004367718],"about_ca_topic_score_codex":0.000835657,"about_ca_topic_score_gemma":0.0019588338,"teacher_disagreement_score":0.9861127,"about_ca_system_score_codex":0.0014455554,"about_ca_system_score_gemma":0.0044047986,"threshold_uncertainty_score":0.084026456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014001177,0.000693161,0.9795955,0.00027516246,0.00015589826,0.00023136225,0.00006600448,0.0025767544,0.0024050586],"genre_scores_gemma":[0.17703488,0.0006223288,0.81552845,0.00013677953,0.0001607707,0.00022569226,0.00025744553,0.00033910616,0.0056945435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802434,0.00057356106,0.00018473277,0.00038057484,0.0006867269,0.0001500524],"domain_scores_gemma":[0.995701,0.0018199265,0.0004881087,0.0010691661,0.0007436359,0.0001781123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003914487,0.0010340435,0.001644419,0.0017838437,0.00222836,0.0024284036,0.0026769903,0.0017226165,0.0033529752],"category_scores_gemma":[0.0085364375,0.0009765057,0.00064258324,0.002917052,0.0012428287,0.0033368785,0.0015377509,0.0011166417,0.0019754732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032577608,0.00040816065,0.0018370022,0.0003320087,0.00009245236,0.00017118981,0.0005009005,0.4073572,0.012212465,0.037499856,0.008781861,0.5304812],"study_design_scores_gemma":[0.00016191405,0.0001583337,0.00043821603,0.000021059439,0.00005179226,0.00019553336,0.00019559845,0.93214977,0.016941095,0.03684944,0.012789275,0.00004799073],"about_ca_topic_score_codex":0.0033488744,"about_ca_topic_score_gemma":0.004667005,"teacher_disagreement_score":0.003914487,"about_ca_system_score_codex":0.0016452271,"about_ca_system_score_gemma":0.00175633,"threshold_uncertainty_score":0.020702064},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0547261,0.018588137,0.3573516,0.17964041,0.0031549023,0.00020864804,0.0001621844,0.00075979,0.38540825],"genre_scores_gemma":[0.67158616,0.03411966,0.2158533,0.023527825,0.00385584,0.0005621989,0.0002476587,0.00049579307,0.049751587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973132,0.0008611584,0.00009718032,0.00038579002,0.0010732376,0.00026949646],"domain_scores_gemma":[0.99419796,0.0022476402,0.00036987293,0.00072358956,0.0018207397,0.0006400944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005717695,0.0005929009,0.00058372313,0.00095303665,0.0027336096,0.0072829835,0.0015463885,0.0040293382,0.003415123],"category_scores_gemma":[0.0071860817,0.0006497301,0.00034308783,0.0009266752,0.009347594,0.01617815,0.0028225537,0.006596671,0.0014143154],"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.000017201506,0.000016596632,0.000161216,0.00005834298,0.000004115299,0.000086376356,0.0005506517,0.0010879014,0.00045741315,0.98289204,0.0030296242,0.011638484],"study_design_scores_gemma":[0.000021648038,0.000055750657,0.00035112698,0.00033368292,0.000012302046,0.0002503165,0.00063269975,0.008345252,0.00065656326,0.8350209,0.15428722,0.000032561682],"about_ca_topic_score_codex":0.0018497162,"about_ca_topic_score_gemma":0.0020183194,"teacher_disagreement_score":0.0072829835,"about_ca_system_score_codex":0.0026566428,"about_ca_system_score_gemma":0.0028941776,"threshold_uncertainty_score":0.03023845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832177,0.0001679965,0.013820591,0.00012153569,0.000049935312,0.00006252334,0.00012354688,0.00023641606,0.0021997672],"genre_scores_gemma":[0.9950944,0.000077209275,0.00450154,0.000012682901,0.000005589374,0.000016010015,0.00007833089,0.000010275807,0.00020398817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913967,0.00024411349,0.000084334875,0.00012861067,0.00029573217,0.00010751574],"domain_scores_gemma":[0.99640405,0.0017396952,0.00027207207,0.00047177495,0.00092204334,0.00019023621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014850519,0.00045498527,0.0004524767,0.00068602205,0.0005708636,0.00080368796,0.00063332065,0.0005656605,0.0006668567],"category_scores_gemma":[0.0066222716,0.000116064904,0.000158931,0.0006523482,0.00047238273,0.0017969769,0.0005870168,0.00050970254,0.000116893694],"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.0029931432,0.0011635084,0.04856397,0.00067486626,0.00024949547,0.0009874407,0.0009738911,0.7014151,0.12169563,0.011700718,0.002472723,0.107109435],"study_design_scores_gemma":[0.000042341722,0.0017150369,0.011634712,0.000025646163,0.000043356904,0.00036472228,0.00047329263,0.9334875,0.04895666,0.002150204,0.0010657572,0.000040739098],"about_ca_topic_score_codex":0.0015373841,"about_ca_topic_score_gemma":0.001180653,"teacher_disagreement_score":0.0015373841,"about_ca_system_score_codex":0.00047117076,"about_ca_system_score_gemma":0.00031140455,"threshold_uncertainty_score":0.007853806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109389005,0.0002525157,0.9861413,0.00015433118,0.000029794575,0.00010493554,0.000027534727,0.00071876525,0.0016318719],"genre_scores_gemma":[0.34533316,0.00046499143,0.64941823,0.0001165354,0.000074184834,0.00031584108,0.00015573026,0.000226332,0.0038949593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792224,0.00069546665,0.00014178883,0.00021895206,0.00079304446,0.00022860685],"domain_scores_gemma":[0.99656194,0.0020108547,0.00027013253,0.0004946579,0.00052209926,0.00014029429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036580646,0.0007375628,0.0011064489,0.0011452896,0.0011688509,0.0022278884,0.0019655311,0.0010020164,0.0023922464],"category_scores_gemma":[0.0083985105,0.00046278062,0.0005543565,0.0014881996,0.00096147665,0.0025675392,0.0016493716,0.0014506639,0.0006692414],"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.00024137352,0.00019878583,0.00082493504,0.00020445426,0.00005872311,0.00007299155,0.00033354,0.65909684,0.009389557,0.09595409,0.004744858,0.22887985],"study_design_scores_gemma":[0.000021150376,0.000022921522,0.0000788163,0.000005355865,0.000008007897,0.000021458487,0.00003086473,0.97762656,0.0020162538,0.01853943,0.0016209151,0.000008265571],"about_ca_topic_score_codex":0.0023910552,"about_ca_topic_score_gemma":0.002567643,"teacher_disagreement_score":0.0036580646,"about_ca_system_score_codex":0.0018777014,"about_ca_system_score_gemma":0.001549703,"threshold_uncertainty_score":0.01934594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011893985,0.0012313726,0.9628504,0.0008307169,0.00032582652,0.0002401809,0.0010604194,0.0035538354,0.018013142],"genre_scores_gemma":[0.35049197,0.0020103506,0.6193947,0.0010344264,0.0003849455,0.00050894066,0.004469867,0.0004838619,0.021220965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998798,0.0002289212,0.00011112935,0.00023290147,0.00047386825,0.00015522781],"domain_scores_gemma":[0.99779874,0.0003429774,0.0001376236,0.00082441256,0.0007096322,0.0001866232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009072078,0.0002951439,0.0006034321,0.0009996122,0.0012502654,0.0018550494,0.0015871517,0.0007820692,0.00468467],"category_scores_gemma":[0.0030366625,0.00028213466,0.0004924604,0.0020973724,0.0008434283,0.0032509055,0.0026348187,0.0010623331,0.0022136918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041775763,0.000115172355,0.0022123703,0.00055113167,0.0000932671,0.0004641366,0.0005795915,0.057836983,0.02310157,0.41688427,0.0636671,0.43407667],"study_design_scores_gemma":[0.00014842601,0.00030022464,0.0010700705,0.00010204012,0.00009090448,0.00096375943,0.00026534623,0.3616318,0.012263345,0.36392346,0.25913864,0.00010198543],"about_ca_topic_score_codex":0.0023757694,"about_ca_topic_score_gemma":0.0024070183,"teacher_disagreement_score":0.00468467,"about_ca_system_score_codex":0.0010526553,"about_ca_system_score_gemma":0.0017656242,"threshold_uncertainty_score":0.01567173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034772374,0.0014243225,0.95360994,0.00029810582,0.00022352894,0.000502277,0.00012458213,0.004545946,0.004498955],"genre_scores_gemma":[0.5897397,0.0017538508,0.40135074,0.0002750564,0.00014480493,0.0005314408,0.0004947223,0.0002977765,0.005411814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976191,0.0008677384,0.00013193433,0.0003521888,0.0008526144,0.0001765436],"domain_scores_gemma":[0.9933888,0.0034394872,0.00037646087,0.0014896673,0.0010393505,0.0002662734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033539585,0.000680389,0.0011058679,0.0007660164,0.0010698915,0.0016793286,0.0025578483,0.0016430301,0.0018131565],"category_scores_gemma":[0.0101044765,0.00046747082,0.00038615157,0.0010612113,0.001323819,0.002666768,0.0014996121,0.0015195176,0.0004870702],"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.0019741633,0.0005147934,0.0058853608,0.0012311129,0.000382361,0.001194783,0.0014966498,0.33522204,0.11157814,0.2229364,0.012514459,0.30506977],"study_design_scores_gemma":[0.0002747694,0.00049586815,0.0005234171,0.00008244042,0.00010316568,0.00063260307,0.00014002019,0.8170844,0.05388871,0.07060717,0.05607923,0.00008818574],"about_ca_topic_score_codex":0.0020659675,"about_ca_topic_score_gemma":0.0015917738,"teacher_disagreement_score":0.0033539585,"about_ca_system_score_codex":0.0008483693,"about_ca_system_score_gemma":0.0010827488,"threshold_uncertainty_score":0.017737627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9620472,0.0015897752,0.028858483,0.00040343395,0.000119257245,0.00008402141,0.000134649,0.0020657985,0.0046973326],"genre_scores_gemma":[0.9956617,0.00019452097,0.0033666624,0.000027738051,0.000024390705,0.000019903317,0.00008974247,0.000067944326,0.0005474486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930118,0.0018803289,0.00054662797,0.0007078339,0.003035903,0.0008175199],"domain_scores_gemma":[0.9843174,0.009857508,0.0011382201,0.0019279155,0.0020491967,0.00070968573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005283842,0.00079658075,0.001217481,0.00077341107,0.0010878408,0.002611813,0.001110526,0.0012747991,0.0010901873],"category_scores_gemma":[0.02446918,0.0005568187,0.00028462728,0.0012796341,0.0010431206,0.002543268,0.0012322224,0.0010166029,0.00048753936],"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.0058999816,0.0012477058,0.046036325,0.0008215166,0.00036950817,0.0011329445,0.0018923483,0.6007199,0.15412968,0.012145612,0.0048702923,0.17073414],"study_design_scores_gemma":[0.0002112312,0.0014732167,0.011856446,0.000026316731,0.00011281889,0.0003954094,0.0005061349,0.8942806,0.083849095,0.0050700568,0.0021252602,0.00009337916],"about_ca_topic_score_codex":0.002743486,"about_ca_topic_score_gemma":0.0009416819,"teacher_disagreement_score":0.005283842,"about_ca_system_score_codex":0.0013952923,"about_ca_system_score_gemma":0.0008977546,"threshold_uncertainty_score":0.027943969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11146194,0.0014687841,0.8684504,0.0011387982,0.00025307797,0.00022102373,0.00010400036,0.0064277765,0.010474216],"genre_scores_gemma":[0.7612155,0.0010042194,0.22649264,0.0003968155,0.00019731098,0.00039294345,0.00033906486,0.0009298133,0.009031759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995411,0.0014267823,0.00044097198,0.00054256263,0.0018433331,0.0003353887],"domain_scores_gemma":[0.988837,0.005402108,0.0008919116,0.0033543042,0.001026512,0.0004881701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005407523,0.0005373309,0.00077699975,0.0009841757,0.0018460926,0.005039261,0.0024113434,0.0018100705,0.002355216],"category_scores_gemma":[0.01850584,0.0011568166,0.0006572655,0.0013935103,0.0026299686,0.0085770795,0.0027216463,0.0019806959,0.0010872295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001381916,0.0005673337,0.012732682,0.0012896544,0.000255349,0.0019732313,0.0041297013,0.1088121,0.069911234,0.5109851,0.008202187,0.27975956],"study_design_scores_gemma":[0.00035325272,0.00050822855,0.0024444903,0.00012253858,0.0003030179,0.0017511634,0.00094726385,0.4271916,0.077938005,0.40421933,0.084051125,0.00017001931],"about_ca_topic_score_codex":0.00079202873,"about_ca_topic_score_gemma":0.00059780123,"teacher_disagreement_score":0.005407523,"about_ca_system_score_codex":0.0011803798,"about_ca_system_score_gemma":0.0015148765,"threshold_uncertainty_score":0.02859807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03652712,0.0006000367,0.9487336,0.00043454146,0.00010893539,0.0003081128,0.00007998788,0.0058578122,0.0073498967],"genre_scores_gemma":[0.5952222,0.00073712703,0.40045953,0.00012041235,0.00007172617,0.0001807457,0.00026189547,0.00023331972,0.0027130735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969662,0.00078559294,0.00020264457,0.00050260685,0.0011840715,0.00035893993],"domain_scores_gemma":[0.99768364,0.0006860049,0.00021272001,0.00088342535,0.00040469968,0.00012939629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020777727,0.0006331822,0.00060435565,0.0008394719,0.0014121656,0.0020007638,0.0020834673,0.0010612372,0.0011533513],"category_scores_gemma":[0.0045215306,0.00044502685,0.00040070596,0.0006946331,0.0007319448,0.0032099215,0.0029003627,0.001318101,0.0005701502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001820791,0.00034476834,0.0051893773,0.00032011815,0.00012372648,0.0005217997,0.0010792702,0.38624913,0.075956516,0.07318782,0.009600149,0.4472453],"study_design_scores_gemma":[0.000028188728,0.00007124104,0.0009973078,0.000040898543,0.00004364261,0.0002349604,0.00022838326,0.8880097,0.03302241,0.038633525,0.03863232,0.0000574692],"about_ca_topic_score_codex":0.006551134,"about_ca_topic_score_gemma":0.0058627455,"teacher_disagreement_score":0.006551134,"about_ca_system_score_codex":0.000991486,"about_ca_system_score_gemma":0.001947719,"threshold_uncertainty_score":0.013026059},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22536762,0.0006716066,0.76857984,0.0003644363,0.000044500433,0.0001465053,0.000058604775,0.000609565,0.004157275],"genre_scores_gemma":[0.9513426,0.00014851122,0.047896553,0.000032019358,0.000015485986,0.000040108414,0.00003550245,0.000037257378,0.00045198135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937975,0.00021401967,0.000034572597,0.00007292209,0.00017871802,0.00011998617],"domain_scores_gemma":[0.9984407,0.0010365655,0.00014728832,0.00013020741,0.00013895526,0.000106365565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007533826,0.0006738677,0.00080996694,0.00038276872,0.0007317028,0.0007480177,0.0011142954,0.00056914246,0.00088037347],"category_scores_gemma":[0.003424951,0.0003770866,0.00020948723,0.00049881655,0.00041817492,0.0016393282,0.0010283442,0.00064655446,0.00010213279],"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.00028612974,0.00017492611,0.0013136211,0.00020975085,0.00004083421,0.00022139214,0.00017194009,0.8591486,0.033986364,0.0094055375,0.001102843,0.093938015],"study_design_scores_gemma":[0.000017567783,0.000094652714,0.0003397468,0.0000039663923,0.000013274018,0.0000659026,0.00006449474,0.9900535,0.006050424,0.0026506258,0.00063513475,0.000010793634],"about_ca_topic_score_codex":0.002209773,"about_ca_topic_score_gemma":0.002654805,"teacher_disagreement_score":0.002209773,"about_ca_system_score_codex":0.0007278104,"about_ca_system_score_gemma":0.000804974,"threshold_uncertainty_score":0.005280733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42946434,0.002728623,0.4795739,0.0024673566,0.00017946215,0.0005349928,0.0003347507,0.0077953204,0.07692125],"genre_scores_gemma":[0.94895107,0.00055841386,0.04218228,0.00014002266,0.00021627115,0.0002627742,0.00033012088,0.00040147785,0.006957567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925299,0.0022254998,0.0005185043,0.0011536661,0.0028834145,0.0006890064],"domain_scores_gemma":[0.97731596,0.011445751,0.0016688138,0.004300036,0.0032536597,0.0020157516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043490254,0.0008361947,0.00093822996,0.0017284538,0.0021396098,0.0045551015,0.0024335044,0.001947616,0.0051817424],"category_scores_gemma":[0.024271749,0.00081914495,0.0006383525,0.0013602964,0.0018208955,0.009529729,0.007502826,0.0015825033,0.0014557247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024093213,0.00221028,0.046792515,0.0017140051,0.0003754289,0.0065566883,0.01679569,0.09982665,0.06350446,0.1829386,0.023897232,0.5529791],"study_design_scores_gemma":[0.00064335304,0.0016183283,0.029313868,0.00036202004,0.00048534176,0.00746957,0.006374279,0.50848866,0.04033385,0.29831472,0.106187634,0.0004083746],"about_ca_topic_score_codex":0.002172298,"about_ca_topic_score_gemma":0.0011168666,"teacher_disagreement_score":0.0051817424,"about_ca_system_score_codex":0.00073715416,"about_ca_system_score_gemma":0.000608131,"threshold_uncertainty_score":0.023000121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052365907,0.022799857,0.8441606,0.010133786,0.001296796,0.0010693626,0.00048759885,0.0024014811,0.06528472],"genre_scores_gemma":[0.7947643,0.014758749,0.16791156,0.00075457775,0.001446703,0.0011654885,0.00046741453,0.0001654107,0.018565807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961235,0.0019066872,0.00024609605,0.0005433459,0.00092580065,0.00025472124],"domain_scores_gemma":[0.9938566,0.004121499,0.00055282237,0.00052890775,0.0005238934,0.00041628306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028224168,0.00083330536,0.00138259,0.0017102876,0.002771399,0.005152029,0.0019012629,0.0033776478,0.00480211],"category_scores_gemma":[0.010820969,0.0009439182,0.0005464908,0.0025334202,0.0041618072,0.0066499203,0.0029821286,0.0019310621,0.0013127552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000932655,0.00010460792,0.0015073089,0.000701162,0.00010257405,0.0010131268,0.0015347969,0.11421741,0.0019284945,0.8115066,0.010188283,0.057102345],"study_design_scores_gemma":[0.00009606911,0.0000967469,0.0007264542,0.0001546492,0.000060199294,0.00051107025,0.00060732284,0.19313054,0.001027009,0.7089479,0.09454786,0.000094200914],"about_ca_topic_score_codex":0.004221377,"about_ca_topic_score_gemma":0.0027133967,"teacher_disagreement_score":0.005152029,"about_ca_system_score_codex":0.0020579053,"about_ca_system_score_gemma":0.0018992996,"threshold_uncertainty_score":0.016064644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64722097,0.001198723,0.32352313,0.0024858627,0.00007730087,0.00019039937,0.00028743362,0.0009988686,0.024017373],"genre_scores_gemma":[0.9810143,0.00034630304,0.016692156,0.000061097555,0.000025576523,0.00005375109,0.00009172687,0.000051571526,0.001663601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.00026848496,0.00002557201,0.00015710655,0.000185519,0.0001596266],"domain_scores_gemma":[0.99684477,0.0013745995,0.00045844834,0.00032646363,0.0006484863,0.0003472812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009259,0.0006123109,0.0006150213,0.00075672916,0.0011314534,0.0015572542,0.0010111295,0.0010406466,0.0021927862],"category_scores_gemma":[0.007723378,0.00032232678,0.00026969146,0.0007268455,0.00079536607,0.004060107,0.0024322546,0.00061323977,0.00034855824],"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.0003079605,0.0006360153,0.030316666,0.000623304,0.00013032669,0.0011970398,0.00093474385,0.5102475,0.037958425,0.13273063,0.008268457,0.27664888],"study_design_scores_gemma":[0.00005489527,0.00026559658,0.0040153945,0.00003868307,0.00005509462,0.00047761275,0.0010588254,0.87304115,0.008941048,0.10117645,0.01084756,0.00002767403],"about_ca_topic_score_codex":0.0017565774,"about_ca_topic_score_gemma":0.0019304703,"teacher_disagreement_score":0.0021927862,"about_ca_system_score_codex":0.00089963543,"about_ca_system_score_gemma":0.0013902183,"threshold_uncertainty_score":0.0073356032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09251299,0.0009700495,0.9023978,0.00028756243,0.000060188246,0.00022866057,0.0002016397,0.0011640405,0.0021771013],"genre_scores_gemma":[0.7761318,0.00039948346,0.2200782,0.00008169971,0.00009895372,0.00018043225,0.00032592178,0.000071822695,0.00263164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980136,0.0006512254,0.00014730002,0.0003046477,0.00073099684,0.0001522744],"domain_scores_gemma":[0.99642605,0.0018196884,0.00031852376,0.00063724164,0.0006337889,0.00016456416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017686875,0.0003562224,0.001616075,0.00087232055,0.0011822399,0.0012965044,0.0016234793,0.0009889681,0.0013550351],"category_scores_gemma":[0.005494512,0.0004397553,0.00033917712,0.0015378227,0.0005977896,0.0029852986,0.0014383169,0.00045452928,0.00056774117],"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.0012225036,0.00037166622,0.004099563,0.0008200928,0.00022640184,0.0011178644,0.00081418746,0.5614268,0.06910341,0.04720712,0.0071168286,0.30647364],"study_design_scores_gemma":[0.00023674569,0.00026755364,0.000828892,0.00001408478,0.000045152177,0.00040044542,0.00021248155,0.95700103,0.010924937,0.024569292,0.005450773,0.000048595713],"about_ca_topic_score_codex":0.001911259,"about_ca_topic_score_gemma":0.002195232,"teacher_disagreement_score":0.001911259,"about_ca_system_score_codex":0.0007891666,"about_ca_system_score_gemma":0.0010793549,"threshold_uncertainty_score":0.009353876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027206432,0.0011777321,0.5098149,0.00080643734,0.0010604786,0.0010719657,0.005424327,0.43418837,0.01924938],"genre_scores_gemma":[0.35853007,0.002288972,0.5189119,0.00091366464,0.0014790465,0.0012361917,0.026999405,0.013405893,0.07623483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975647,0.0004738458,0.00016531188,0.00028137316,0.0012726265,0.00024217305],"domain_scores_gemma":[0.99490815,0.001369691,0.00030757958,0.0015054236,0.0013837868,0.00052543613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002931807,0.0013084112,0.0014448653,0.003744999,0.0011778146,0.0031511665,0.0032754133,0.0018132507,0.016735952],"category_scores_gemma":[0.011607053,0.0007529638,0.000627565,0.003253085,0.000656183,0.0027593905,0.0036720154,0.0015066371,0.02146765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030270698,0.00054862647,0.0028968325,0.00067525567,0.0002419556,0.0004898534,0.00034161517,0.013088127,0.049238395,0.012821628,0.30048668,0.616144],"study_design_scores_gemma":[0.0027494172,0.0013260623,0.004975006,0.00014665711,0.00033149484,0.0014554226,0.0003733326,0.49246415,0.13010225,0.017167442,0.34849647,0.0004123414],"about_ca_topic_score_codex":0.00367343,"about_ca_topic_score_gemma":0.0039495747,"teacher_disagreement_score":0.016735952,"about_ca_system_score_codex":0.0006400906,"about_ca_system_score_gemma":0.0016094283,"threshold_uncertainty_score":0.0559873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0640869,0.001184933,0.89276326,0.0010242595,0.00019291573,0.00045078018,0.00045494264,0.0064858845,0.033356],"genre_scores_gemma":[0.64552087,0.0006474743,0.34556028,0.00015063009,0.00008684559,0.0002406867,0.0007634629,0.00010654323,0.0069232183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.00008868351,0.000023290277,0.000058263933,0.00018665845,0.00007210867],"domain_scores_gemma":[0.99911684,0.00017275539,0.00005847554,0.00025158233,0.00027621927,0.00012417522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046858218,0.00019685682,0.000325519,0.0011322654,0.0013377048,0.00085641624,0.000918783,0.0007600471,0.0021772834],"category_scores_gemma":[0.002030157,0.00017247647,0.00030501635,0.0014552833,0.00047800393,0.0020393333,0.0013713901,0.0005036053,0.0008779747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004838295,0.0003695044,0.0049257535,0.00060130376,0.000096670665,0.0013929892,0.0009093571,0.076102674,0.06741088,0.31545138,0.03890832,0.49334735],"study_design_scores_gemma":[0.00011810027,0.000652036,0.004410132,0.00010263969,0.0001526934,0.0027688402,0.0006427032,0.59716225,0.029552594,0.11309883,0.2511519,0.00018732667],"about_ca_topic_score_codex":0.0053134975,"about_ca_topic_score_gemma":0.005487086,"teacher_disagreement_score":0.0053134975,"about_ca_system_score_codex":0.00081771536,"about_ca_system_score_gemma":0.0015910539,"threshold_uncertainty_score":0.010565102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005170923,0.00009897018,0.9853059,0.000510472,0.000092987895,0.00016881214,0.000019591977,0.0023661728,0.0062660403],"genre_scores_gemma":[0.10544033,0.0002905424,0.8853046,0.000248285,0.00008471384,0.00021955295,0.00018909869,0.00028229013,0.007940572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664515,0.0010049989,0.00042736653,0.000677419,0.00095002487,0.00029500932],"domain_scores_gemma":[0.99622995,0.0004854854,0.0002822119,0.0016899459,0.0008697731,0.00044257814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055168346,0.00044867385,0.00072758226,0.00090609596,0.0028546767,0.004080608,0.0023170775,0.002178845,0.0026674515],"category_scores_gemma":[0.0059347986,0.0008610734,0.001357938,0.0010607895,0.0018617405,0.008085305,0.004947915,0.002804064,0.0018509219],"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.00025225757,0.00023456258,0.0027193718,0.00026286204,0.00011045832,0.0014101499,0.003183441,0.029741673,0.030756418,0.74246824,0.012239788,0.17662086],"study_design_scores_gemma":[0.00017356077,0.0003801623,0.0012118043,0.00021970464,0.00038745886,0.002606098,0.0012616222,0.35615963,0.045129884,0.2426638,0.34958518,0.0002211094],"about_ca_topic_score_codex":0.0023136507,"about_ca_topic_score_gemma":0.0032543608,"teacher_disagreement_score":0.0055168346,"about_ca_system_score_codex":0.00080740894,"about_ca_system_score_gemma":0.002185964,"threshold_uncertainty_score":0.029176176},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15022705,0.00031228102,0.7071964,0.0017615508,0.0010071303,0.0015277187,0.000495951,0.08697353,0.05049835],"genre_scores_gemma":[0.44657677,0.0002722524,0.5178295,0.00035159275,0.00040263895,0.00072283193,0.0014065964,0.0027036853,0.029734116],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912983,0.00013325458,0.000061006354,0.000192458,0.00037022855,0.0001132754],"domain_scores_gemma":[0.9982736,0.000335133,0.00007000386,0.00051514263,0.0004223829,0.00038373529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020338877,0.00042393725,0.00047429558,0.000596343,0.0016780811,0.0020942867,0.0016013636,0.00095466163,0.0073222616],"category_scores_gemma":[0.003278003,0.00043959374,0.0003949687,0.00047203412,0.0005467857,0.004080829,0.0016921519,0.0020466333,0.0032483065],"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.0017362015,0.0028302777,0.01825854,0.00064290664,0.00023572336,0.0040390557,0.005740595,0.019716462,0.16320516,0.06688719,0.084417276,0.6322906],"study_design_scores_gemma":[0.0010755523,0.0018570148,0.011057276,0.00014796613,0.00028103587,0.0021286313,0.0012290851,0.30650926,0.1393397,0.037940625,0.49810463,0.00032927003],"about_ca_topic_score_codex":0.0015011758,"about_ca_topic_score_gemma":0.0009360201,"teacher_disagreement_score":0.0073222616,"about_ca_system_score_codex":0.00038287273,"about_ca_system_score_gemma":0.0009990281,"threshold_uncertainty_score":0.024495363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002769165,0.000091061294,0.99483055,0.00009292261,0.00003772178,0.000072425166,0.000018134751,0.00054509426,0.0015429409],"genre_scores_gemma":[0.3360603,0.00030110512,0.65922487,0.00008880827,0.0000611864,0.0006162649,0.00016698017,0.00018995187,0.0032905822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.00026179256,0.000052501262,0.00014258861,0.0003218605,0.000052378688],"domain_scores_gemma":[0.9985555,0.0007557342,0.00013171718,0.00021118842,0.0002643037,0.00008158276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015574486,0.0008011983,0.00097592495,0.001023627,0.0012131411,0.0016569163,0.0021725243,0.0011598765,0.0031849425],"category_scores_gemma":[0.0052811014,0.0003811807,0.0005097538,0.0011057667,0.0010518242,0.0022135612,0.0017075487,0.0012553822,0.0006557776],"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.00013842407,0.000077458564,0.00048475087,0.00010621625,0.00004345077,0.00009147597,0.00016533385,0.78572726,0.003954196,0.064736515,0.0027143634,0.14176057],"study_design_scores_gemma":[0.0000295931,0.000023853814,0.00002854492,0.000005046436,0.00000579268,0.000026701122,0.000009990372,0.98856527,0.0006466916,0.008611169,0.0020412006,0.000006144146],"about_ca_topic_score_codex":0.002424085,"about_ca_topic_score_gemma":0.002343062,"teacher_disagreement_score":0.0031849425,"about_ca_system_score_codex":0.0009927053,"about_ca_system_score_gemma":0.0009855054,"threshold_uncertainty_score":0.010654688},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001686707,0.04311049,0.6114453,0.06332503,0.09203139,0.009665121,0.00409137,0.051558796,0.123085715],"genre_scores_gemma":[0.018477215,0.05439066,0.56774753,0.019995244,0.05899877,0.0193297,0.007569717,0.0222012,0.23129003],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.88246274,0.040152945,0.024025207,0.010365732,0.04076848,0.0022249762],"domain_scores_gemma":[0.706575,0.11497771,0.027757617,0.055646423,0.07898045,0.016062861],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06921339,0.004406631,0.006445137,0.017711727,0.0046044798,0.02714652,0.008045512,0.0067175524,0.12184102],"category_scores_gemma":[0.17496575,0.0034728418,0.0025316193,0.013473618,0.013781664,0.02327201,0.011341929,0.0153871,0.19426689],"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.00014629115,0.00009389351,0.00020643584,0.00431083,0.00022975726,0.00033628597,0.0007960725,0.00037378742,0.0041459934,0.042341158,0.6599497,0.28706965],"study_design_scores_gemma":[0.000060175127,0.00008393837,0.00034555222,0.0008681319,0.00003852343,0.0006952258,0.00012232008,0.0006116164,0.0007881833,0.021068513,0.9752171,0.000100684076],"about_ca_topic_score_codex":0.00065407826,"about_ca_topic_score_gemma":0.0012506424,"teacher_disagreement_score":0.9307866,"about_ca_system_score_codex":0.004013704,"about_ca_system_score_gemma":0.016409796,"threshold_uncertainty_score":0.4075988},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077035967,0.0011270315,0.9611909,0.0016170962,0.00019484141,0.00018505343,0.0002095257,0.000720772,0.027051182],"genre_scores_gemma":[0.3699771,0.0036694712,0.60733193,0.00039305087,0.0008116321,0.000616027,0.000557365,0.00026947833,0.01637405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527293,0.00089678826,0.00042875172,0.00075202034,0.0021932719,0.0004562637],"domain_scores_gemma":[0.98868877,0.0052543194,0.0008622307,0.0028844422,0.0016371129,0.000673087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004922653,0.0006677398,0.0008989315,0.001670495,0.0026621367,0.006532834,0.004333201,0.0027409056,0.0061629605],"category_scores_gemma":[0.01566692,0.0013577563,0.0010403527,0.0020971799,0.0047055534,0.009619477,0.004990299,0.0039528552,0.002352927],"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.000028506778,0.000037505637,0.00013273234,0.00011523137,0.000013594837,0.00026482457,0.00031839986,0.016082074,0.0015343865,0.9630046,0.0020714062,0.016396707],"study_design_scores_gemma":[0.000044219832,0.00004624371,0.00015812641,0.00007485822,0.00003147676,0.00023663043,0.00010969246,0.12617555,0.0019826612,0.81812096,0.052978516,0.00004109221],"about_ca_topic_score_codex":0.0029058133,"about_ca_topic_score_gemma":0.001943935,"teacher_disagreement_score":0.006532834,"about_ca_system_score_codex":0.0023368283,"about_ca_system_score_gemma":0.0022760353,"threshold_uncertainty_score":0.026033819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057602458,0.00060218526,0.9239222,0.0011437685,0.00029023478,0.0002050006,0.00005806434,0.0027695217,0.013406606],"genre_scores_gemma":[0.4754237,0.0006127446,0.51474744,0.00030959275,0.00018860107,0.00019591434,0.00014270189,0.00013502216,0.008244291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975854,0.000056309018,0.00002058311,0.000027396381,0.00010459577,0.000032554835],"domain_scores_gemma":[0.9996358,0.000058308564,0.00004086385,0.00007310457,0.00013683896,0.00005505885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054632337,0.00024184468,0.00020959173,0.0003635166,0.0007466862,0.0008094701,0.001239126,0.0009334917,0.0012054427],"category_scores_gemma":[0.0010533019,0.00021457959,0.000301729,0.00034385978,0.00042635982,0.0010806749,0.0010942651,0.0008083124,0.00055768364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045495646,0.00044058228,0.0026685728,0.00047135053,0.0001126384,0.0010336493,0.0009362963,0.15033138,0.22156002,0.27200955,0.014022421,0.33595872],"study_design_scores_gemma":[0.00009574075,0.00043360103,0.00089891616,0.000047059828,0.000098351804,0.0005741865,0.000102477454,0.85918427,0.024454854,0.050078608,0.06397088,0.000060973514],"about_ca_topic_score_codex":0.0009519061,"about_ca_topic_score_gemma":0.0014287322,"teacher_disagreement_score":0.001239126,"about_ca_system_score_codex":0.00044788612,"about_ca_system_score_gemma":0.0005947472,"threshold_uncertainty_score":0.004032612},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07351426,0.00037681227,0.9185504,0.0005227476,0.00005646468,0.00008530923,0.000032257612,0.0002129346,0.0066487766],"genre_scores_gemma":[0.9556801,0.00026119075,0.041876473,0.00004999042,0.00003143333,0.000092744885,0.000020162352,0.00002958938,0.001958348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.00020540347,0.000019212568,0.00005648224,0.0001240824,0.000060698105],"domain_scores_gemma":[0.99920267,0.00042037616,0.0001216741,0.00005942399,0.00012383511,0.00007204622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821192,0.00029590013,0.0005803337,0.0003536334,0.0005856862,0.0011410948,0.00071405695,0.0005884037,0.00134366],"category_scores_gemma":[0.002550734,0.00024549867,0.00040627725,0.0003692408,0.0010621459,0.001575692,0.00085689384,0.00065315637,0.00009934343],"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.00004278186,0.00006231436,0.00043633423,0.00004665581,0.000025205913,0.00009350907,0.00008971933,0.8460549,0.0037411528,0.13616289,0.00067735906,0.012567198],"study_design_scores_gemma":[0.0000044106987,0.000012552061,0.000038017617,0.000001485292,0.00000193526,0.0000072543226,0.000009010218,0.9847151,0.00020293597,0.014655274,0.00034929672,0.0000026907555],"about_ca_topic_score_codex":0.002451438,"about_ca_topic_score_gemma":0.0025452261,"teacher_disagreement_score":0.002451438,"about_ca_system_score_codex":0.0013243045,"about_ca_system_score_gemma":0.001183406,"threshold_uncertainty_score":0.009608567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037114233,0.001224945,0.9547013,0.00092261366,0.00013131161,0.00008908659,0.000064438274,0.0011942263,0.004557846],"genre_scores_gemma":[0.73925304,0.0008867342,0.25698137,0.0002031402,0.00017318163,0.000081377715,0.00015000948,0.00021540267,0.0020557984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971187,0.0011633002,0.00014097287,0.00043066812,0.0009996169,0.00014670216],"domain_scores_gemma":[0.98667437,0.006653468,0.00089766923,0.0036422794,0.001910952,0.00022114822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002829941,0.0012364202,0.0011157098,0.0012013819,0.0016428737,0.0011084931,0.00215151,0.0023493413,0.0017882311],"category_scores_gemma":[0.021066617,0.00082546007,0.000508822,0.0017830271,0.0011325582,0.0037362527,0.0024885754,0.0013291136,0.0013130733],"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.00060698565,0.00009843375,0.0042269486,0.00026683143,0.00012655511,0.0002361553,0.00039391153,0.7488725,0.013959348,0.038686536,0.0022977106,0.19022804],"study_design_scores_gemma":[0.00009155214,0.00052054634,0.0018004696,0.000047678426,0.00009465661,0.0006698976,0.0001719542,0.9352004,0.015309729,0.037632205,0.00837501,0.00008596484],"about_ca_topic_score_codex":0.0023553083,"about_ca_topic_score_gemma":0.0020916665,"teacher_disagreement_score":0.002829941,"about_ca_system_score_codex":0.0007465236,"about_ca_system_score_gemma":0.0010421243,"threshold_uncertainty_score":0.014966309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103443004,0.0022747891,0.8712819,0.0023762593,0.00016364601,0.00022729817,0.00028991446,0.00035059603,0.019592555],"genre_scores_gemma":[0.88392496,0.0012658868,0.10810066,0.00024828422,0.00021939987,0.00031938936,0.00025147197,0.00017961234,0.005490393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896526,0.00041930223,0.00004789308,0.00017277796,0.00020967772,0.00018504451],"domain_scores_gemma":[0.9947568,0.0045101647,0.00017849833,0.00009369717,0.00029170598,0.0001691925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021452215,0.0011249583,0.0014333103,0.0006587411,0.000859409,0.0016831678,0.0014121151,0.0019384596,0.0026848568],"category_scores_gemma":[0.007507191,0.0008801642,0.00056022947,0.000983744,0.0010585997,0.0019851453,0.0019774851,0.0013144967,0.00020088864],"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.000036009325,0.000032181513,0.00019623886,0.00008465045,0.000017127335,0.00007766821,0.000037581325,0.9826952,0.0005480912,0.009178709,0.0006888892,0.0064076497],"study_design_scores_gemma":[0.000014777439,0.000011042792,0.00005055949,0.0000058290516,0.000004222066,0.000012226637,0.000023883593,0.99137515,0.0002656999,0.0079207355,0.00031091296,0.0000048742577],"about_ca_topic_score_codex":0.009120939,"about_ca_topic_score_gemma":0.0035858748,"teacher_disagreement_score":0.009120939,"about_ca_system_score_codex":0.0016820816,"about_ca_system_score_gemma":0.0014462688,"threshold_uncertainty_score":0.018135726},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20838694,0.0044006296,0.71907854,0.0033259855,0.0004358061,0.00025962043,0.00020917685,0.0016379053,0.062265422],"genre_scores_gemma":[0.9365362,0.001087805,0.055614915,0.000156482,0.000096481635,0.000046815705,0.000096496646,0.000060433293,0.006304466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948287,0.0001450553,0.000023129036,0.00008818276,0.00015624783,0.00010450043],"domain_scores_gemma":[0.9994281,0.0001668789,0.00006782651,0.00016425675,0.00009695494,0.00007591045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006207485,0.0002909634,0.0003287917,0.00035980644,0.00081193086,0.0011383806,0.0007625209,0.0006553646,0.002547714],"category_scores_gemma":[0.0016173797,0.00022058091,0.0003076633,0.0007860254,0.0005611639,0.0019609893,0.0010894482,0.00047117975,0.0005185683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046852103,0.00020220189,0.003292323,0.00028652957,0.00007583399,0.0009198935,0.000854711,0.19748566,0.029106896,0.43679073,0.008756979,0.32175976],"study_design_scores_gemma":[0.00003070562,0.00016773552,0.0015260519,0.000051550884,0.000036849906,0.00089859415,0.0005479638,0.7165328,0.0140320975,0.17652102,0.0896072,0.000047470934],"about_ca_topic_score_codex":0.0019430657,"about_ca_topic_score_gemma":0.001784682,"teacher_disagreement_score":0.002547714,"about_ca_system_score_codex":0.00069150823,"about_ca_system_score_gemma":0.0006648809,"threshold_uncertainty_score":0.008522928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05669194,0.0022100678,0.90810114,0.0033284656,0.0002584621,0.0005835096,0.00004993105,0.001870907,0.02690565],"genre_scores_gemma":[0.68321747,0.0020376747,0.30603966,0.00022372881,0.00017432478,0.0003640198,0.00012967896,0.00015095662,0.0076625445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982064,0.0006338311,0.00007339353,0.00024477157,0.00062287715,0.00021875139],"domain_scores_gemma":[0.9985071,0.00051847025,0.00009123767,0.00028312198,0.00036550747,0.00023448952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021486937,0.00034197705,0.00034002843,0.00055136054,0.0021893482,0.0023283614,0.0021670351,0.0011170487,0.0028456552],"category_scores_gemma":[0.0038430896,0.00033252977,0.00036596926,0.0006853254,0.0009878752,0.0058518746,0.0028696065,0.0012237962,0.0011180717],"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.0003564848,0.00068263686,0.003372654,0.00085989264,0.000092310256,0.0014665684,0.0047810464,0.048449527,0.042585887,0.44289774,0.018450156,0.43600512],"study_design_scores_gemma":[0.00016710957,0.00079035986,0.0019277789,0.0002191715,0.0000890083,0.0009772715,0.0026830712,0.43453515,0.020679021,0.29003602,0.24773732,0.00015872273],"about_ca_topic_score_codex":0.0032758461,"about_ca_topic_score_gemma":0.004061819,"teacher_disagreement_score":0.0032758461,"about_ca_system_score_codex":0.0011097774,"about_ca_system_score_gemma":0.0022434667,"threshold_uncertainty_score":0.011363506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010077853,0.00021435766,0.97972345,0.00009706038,0.00005249114,0.00009906832,0.00003594709,0.007431385,0.0022682606],"genre_scores_gemma":[0.40784493,0.0005198705,0.5788052,0.000300055,0.000082900515,0.0006866893,0.0005227675,0.0010472763,0.010190318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942183,0.00014631318,0.000037923026,0.000087123895,0.0002343304,0.00007253224],"domain_scores_gemma":[0.99923337,0.00021798591,0.000053815005,0.00020043307,0.00014482613,0.00014955044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096207,0.00059747114,0.0005362654,0.0006134795,0.00085693784,0.0016746442,0.0037753114,0.0011272937,0.0036096808],"category_scores_gemma":[0.002359298,0.00055588456,0.00050241884,0.00046198268,0.00084430043,0.0024672246,0.0039496273,0.0013124669,0.0011209185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015521996,0.00047235042,0.0033583147,0.00043346258,0.0003577344,0.0007951003,0.001597831,0.3092833,0.085435145,0.07332661,0.029835619,0.49355233],"study_design_scores_gemma":[0.000116467476,0.00024910478,0.00058138353,0.000035882807,0.000072723175,0.0002624152,0.00013795985,0.9130757,0.013658639,0.028643504,0.04306095,0.000105273],"about_ca_topic_score_codex":0.0027063799,"about_ca_topic_score_gemma":0.0029611546,"teacher_disagreement_score":0.0037753114,"about_ca_system_score_codex":0.0006978315,"about_ca_system_score_gemma":0.0007227823,"threshold_uncertainty_score":0.012075603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03278178,0.0006898616,0.95111394,0.0005326005,0.00014002762,0.00026182018,0.00015914219,0.0031049591,0.011215899],"genre_scores_gemma":[0.34114295,0.0007546663,0.64811677,0.00016229601,0.000103560844,0.0003196554,0.00057047786,0.00012293381,0.008706645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999699,0.00005639466,0.000017416052,0.000067182365,0.00013616275,0.000023878225],"domain_scores_gemma":[0.9996195,0.000041757456,0.000026145304,0.00011885657,0.00015901188,0.0000347718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035867267,0.00037982967,0.00029013376,0.00050942204,0.00089186523,0.0007020135,0.0011323921,0.0005847814,0.0017230748],"category_scores_gemma":[0.0007730798,0.00024800203,0.00022264529,0.00089763093,0.0003614694,0.0012601004,0.0006802742,0.0006058906,0.00075485907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032336786,0.00023942703,0.0015562432,0.0005470117,0.00017299755,0.0005459834,0.00037386254,0.26110283,0.13025956,0.18434773,0.028548561,0.39198238],"study_design_scores_gemma":[0.00008500236,0.00038198513,0.0009189856,0.00002860444,0.00009146038,0.00052821886,0.00012857796,0.8422144,0.035444614,0.045323104,0.074789695,0.000065336244],"about_ca_topic_score_codex":0.002304816,"about_ca_topic_score_gemma":0.0039752554,"teacher_disagreement_score":0.002304816,"about_ca_system_score_codex":0.0006025456,"about_ca_system_score_gemma":0.0009911126,"threshold_uncertainty_score":0.0057643056},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039687086,0.0017201981,0.9416301,0.0013912162,0.0002803234,0.00042582786,0.00032641742,0.0043167016,0.010222057],"genre_scores_gemma":[0.44300696,0.0022349537,0.51862544,0.00059695094,0.0004514532,0.0004549148,0.0014457576,0.0008426739,0.03234087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926509,0.0025358454,0.0012272203,0.00095825724,0.0021185374,0.00050927326],"domain_scores_gemma":[0.98552567,0.0094524585,0.0006505126,0.0026868433,0.0013263308,0.00035830642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00919866,0.00053390884,0.0015794828,0.0024203302,0.0018604154,0.006374585,0.0021498124,0.002551451,0.0055212737],"category_scores_gemma":[0.018910374,0.0013582691,0.0012855926,0.0036097893,0.0019366938,0.009942429,0.0021209377,0.0017249149,0.0024656819],"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.0011496535,0.0006019604,0.005666807,0.0006706682,0.00015789965,0.0006988039,0.0014677785,0.063601404,0.012038138,0.4802991,0.013170031,0.42047778],"study_design_scores_gemma":[0.00023024072,0.0002554834,0.0014831353,0.00012549444,0.00014918989,0.00060764974,0.0004421484,0.4963395,0.029922323,0.42493415,0.04539357,0.00011717811],"about_ca_topic_score_codex":0.0044328514,"about_ca_topic_score_gemma":0.002398268,"teacher_disagreement_score":0.00919866,"about_ca_system_score_codex":0.001902763,"about_ca_system_score_gemma":0.0021866893,"threshold_uncertainty_score":0.04864776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035766189,0.0029904281,0.96012926,0.0015097037,0.0006907028,0.00023316333,0.00043904723,0.00092054106,0.029510612],"genre_scores_gemma":[0.16560657,0.011826701,0.76093525,0.0011287404,0.0010232081,0.0012062876,0.0019580936,0.0011645127,0.055150643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977081,0.00056231645,0.00037878205,0.00042616838,0.00073748967,0.0001871259],"domain_scores_gemma":[0.99768937,0.0008271224,0.00011306582,0.0009151788,0.00035309544,0.000102171696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034206165,0.0013391032,0.001401152,0.001696924,0.0019274967,0.009417392,0.0026430024,0.0025186278,0.006810314],"category_scores_gemma":[0.0062079546,0.0008059181,0.0017021439,0.005191468,0.004056888,0.018772956,0.004451897,0.0037411598,0.0025118876],"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.000024333827,0.000017097798,0.000048124315,0.00013570003,0.000009640102,0.000052905958,0.00033441454,0.0016552401,0.0005564104,0.964307,0.0037528574,0.029106295],"study_design_scores_gemma":[0.000015248047,0.000018965844,0.000054466178,0.00013498095,0.000027757358,0.00035257096,0.0001580072,0.0154605005,0.0022616968,0.8737796,0.107712306,0.000023934546],"about_ca_topic_score_codex":0.0015686435,"about_ca_topic_score_gemma":0.0009817091,"teacher_disagreement_score":0.009417392,"about_ca_system_score_codex":0.0016682016,"about_ca_system_score_gemma":0.0019710015,"threshold_uncertainty_score":0.022782743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016212313,0.0007449719,0.97838336,0.00038538987,0.000059462716,0.00011144041,0.00007291307,0.0012192484,0.002810953],"genre_scores_gemma":[0.3540327,0.0012101864,0.6372788,0.0002781393,0.00015803876,0.00039598544,0.00036166926,0.00017828967,0.006106192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993374,0.00019718683,0.000056192028,0.00011880422,0.0002443931,0.000046069064],"domain_scores_gemma":[0.9983997,0.00079731806,0.00025070336,0.00019982325,0.00028505133,0.00006743381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869095,0.00059939874,0.001188322,0.0017952039,0.00094249024,0.0009461034,0.0018287608,0.0011064099,0.0026150506],"category_scores_gemma":[0.004478033,0.0003556052,0.0005442488,0.00231942,0.0011237363,0.0033276016,0.001463046,0.0007173014,0.0008551035],"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.00023925066,0.00008655305,0.0008034624,0.00036111678,0.00007811732,0.00015937893,0.0004098709,0.5298634,0.007514351,0.07998819,0.0053473487,0.375149],"study_design_scores_gemma":[0.000049363738,0.00008569608,0.00017910369,0.000021030752,0.00001996487,0.00010942439,0.000054329485,0.9522093,0.0024809071,0.04003043,0.004741677,0.000018785206],"about_ca_topic_score_codex":0.0030882352,"about_ca_topic_score_gemma":0.0033768034,"teacher_disagreement_score":0.0030882352,"about_ca_system_score_codex":0.0012775856,"about_ca_system_score_gemma":0.0010538333,"threshold_uncertainty_score":0.009269536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019301979,0.00064442353,0.9548588,0.001212822,0.0011798405,0.0007709357,0.0003774121,0.009492865,0.012160818],"genre_scores_gemma":[0.43919042,0.00088168215,0.5182117,0.00050170085,0.00096184417,0.0010401349,0.0015763363,0.00082365645,0.036812562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969283,0.00084841985,0.00063706934,0.00033557558,0.0010000137,0.000250523],"domain_scores_gemma":[0.992299,0.001016821,0.00041994924,0.0039804745,0.0014088496,0.00087489386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071099238,0.0006200449,0.0008071339,0.0014704382,0.0021500785,0.0041368,0.0032049029,0.0015500506,0.005133429],"category_scores_gemma":[0.0103825955,0.00057248573,0.0005988936,0.0011637543,0.00094969105,0.005489027,0.0037847958,0.0021387292,0.0036127265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018676913,0.0005709394,0.0026973777,0.000555726,0.0001305028,0.00047369834,0.0015597818,0.010154535,0.06856861,0.31805682,0.038810268,0.556554],"study_design_scores_gemma":[0.0008921882,0.0017527731,0.0023294496,0.00019677378,0.0004347154,0.0017583004,0.00065197516,0.29005113,0.07619204,0.12097694,0.504368,0.00039573174],"about_ca_topic_score_codex":0.000801985,"about_ca_topic_score_gemma":0.00083525537,"teacher_disagreement_score":0.0071099238,"about_ca_system_score_codex":0.0010229172,"about_ca_system_score_gemma":0.0015289969,"threshold_uncertainty_score":0.03760135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.893086,0.0009416414,0.086169705,0.0039006954,0.00010834893,0.00009820375,0.0001895342,0.0004836407,0.015022201],"genre_scores_gemma":[0.997523,0.00017533937,0.001674326,0.00005701912,0.000029799521,0.000020208547,0.0000248948,0.000018189887,0.0004771494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895227,0.00043897174,0.000056749355,0.00020776095,0.0002030535,0.0001411435],"domain_scores_gemma":[0.99184847,0.0050392626,0.0010308492,0.00070892414,0.00081015436,0.0005623642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020285153,0.00032453888,0.00045217015,0.00063034554,0.0012344356,0.0023419543,0.00078104116,0.001583731,0.0020950842],"category_scores_gemma":[0.018361578,0.0003353634,0.00028332204,0.0006101354,0.0017920057,0.005421346,0.0011326887,0.00082804484,0.00036161437],"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.00056501455,0.00022939256,0.039017268,0.0003649069,0.00020518618,0.00189383,0.005134439,0.7103676,0.029762814,0.14349182,0.009817442,0.0591503],"study_design_scores_gemma":[0.000041685147,0.0001711136,0.008969035,0.000031769752,0.00006161617,0.00040829697,0.002167905,0.91038334,0.0028675697,0.07115624,0.003677388,0.00006401815],"about_ca_topic_score_codex":0.003180365,"about_ca_topic_score_gemma":0.0012014186,"teacher_disagreement_score":0.003180365,"about_ca_system_score_codex":0.0011131719,"about_ca_system_score_gemma":0.00054539955,"threshold_uncertainty_score":0.010727942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18011737,0.00045108717,0.7098808,0.00036379232,0.000228082,0.00077223853,0.00043753965,0.099496394,0.008252729],"genre_scores_gemma":[0.86343,0.00010897614,0.12963058,0.00017803878,0.000057100042,0.00022912951,0.00040488315,0.0011648714,0.0047962815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988374,0.00019699085,0.00012716345,0.00029255333,0.0003448837,0.00020100952],"domain_scores_gemma":[0.9969753,0.0011860025,0.00025256,0.00075584796,0.0005140398,0.00031626713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017630383,0.0013548906,0.0008597772,0.0015078153,0.0008308776,0.0018601639,0.002676797,0.0009060265,0.0028534092],"category_scores_gemma":[0.0061391075,0.00050745514,0.0003787132,0.0005351102,0.0006414855,0.0020556238,0.0016564423,0.0009798257,0.00077768834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003818959,0.0023350571,0.031255312,0.0008062357,0.00040493495,0.00092678476,0.0021583787,0.12033104,0.20411019,0.018550444,0.030108793,0.5851939],"study_design_scores_gemma":[0.00019308979,0.00039460137,0.0056794696,0.000029036548,0.0000827943,0.00023496347,0.00020468037,0.89638877,0.07361833,0.0061980714,0.016871028,0.0001050476],"about_ca_topic_score_codex":0.007869585,"about_ca_topic_score_gemma":0.005998001,"teacher_disagreement_score":0.007869585,"about_ca_system_score_codex":0.0012554222,"about_ca_system_score_gemma":0.0012901569,"threshold_uncertainty_score":0.01564753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005823669,0.0021592956,0.9756672,0.0022325667,0.0005483782,0.00020628315,0.0001840091,0.0013364045,0.011842219],"genre_scores_gemma":[0.19484183,0.008933564,0.7775373,0.0011993648,0.0014529651,0.0003573321,0.00082447403,0.00075914536,0.014094089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933696,0.002411918,0.00040781894,0.0014026593,0.002124123,0.0002838441],"domain_scores_gemma":[0.9772076,0.013986227,0.00075827737,0.005252892,0.0020924404,0.0007026217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070948666,0.0010097567,0.0015950934,0.0033207578,0.0018236474,0.0062312884,0.0034745669,0.002143388,0.006988792],"category_scores_gemma":[0.02161872,0.0011860778,0.0022825936,0.0070779165,0.003287647,0.0124584455,0.002553713,0.0034997398,0.0023669165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014690703,0.00022442448,0.00076231983,0.00087695295,0.000165695,0.0002663925,0.00046669503,0.07471443,0.0049846335,0.7708394,0.008926037,0.13762625],"study_design_scores_gemma":[0.00009616766,0.00012794523,0.00031313708,0.000113597336,0.00014485061,0.00032558615,0.000210386,0.36310455,0.0060272324,0.5263377,0.10311025,0.000088591776],"about_ca_topic_score_codex":0.005060032,"about_ca_topic_score_gemma":0.0024929694,"teacher_disagreement_score":0.0070948666,"about_ca_system_score_codex":0.003393026,"about_ca_system_score_gemma":0.0026474872,"threshold_uncertainty_score":0.03752166},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06601563,0.005654727,0.72363806,0.0020550427,0.0011765092,0.0006729893,0.0036131106,0.14627874,0.050895166],"genre_scores_gemma":[0.47488484,0.0045988206,0.37316352,0.00114485,0.00026561832,0.00072248245,0.010276388,0.009016384,0.12592705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869365,0.00023671886,0.00013883997,0.00030209715,0.0004484618,0.00018025098],"domain_scores_gemma":[0.9984523,0.00023506147,0.00009745633,0.0006817861,0.0002445087,0.0002888574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015715424,0.00092076923,0.00067441154,0.0009959552,0.0010158167,0.0047221035,0.003300439,0.0010581334,0.012946065],"category_scores_gemma":[0.004242874,0.0007545857,0.0010737731,0.0013459226,0.00095582986,0.005729127,0.0058209226,0.0016885318,0.004154466],"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.0036566076,0.00038872988,0.008702172,0.0030422194,0.00064784946,0.0013053707,0.006442375,0.04160955,0.077931896,0.14705567,0.10954567,0.59967196],"study_design_scores_gemma":[0.0003235416,0.00075735827,0.002074213,0.0002355385,0.00024949244,0.0007244359,0.0013773984,0.07539164,0.03190802,0.02468334,0.86207414,0.00020086663],"about_ca_topic_score_codex":0.00534607,"about_ca_topic_score_gemma":0.0058626947,"teacher_disagreement_score":0.012946065,"about_ca_system_score_codex":0.0013966663,"about_ca_system_score_gemma":0.0027338879,"threshold_uncertainty_score":0.043308914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42286378,0.00054837007,0.5469946,0.0011391981,0.00019143654,0.00032779443,0.00086738064,0.0013012049,0.025766164],"genre_scores_gemma":[0.94488937,0.00026208177,0.0502752,0.00006338672,0.00002805078,0.00028484108,0.00025742772,0.000047546007,0.0038921023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997533,0.000111803034,0.000016197313,0.00003548516,0.00005298141,0.000030221168],"domain_scores_gemma":[0.99923694,0.0004521403,0.00006409512,0.00005639322,0.00013209032,0.000058333226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004130723,0.0004963978,0.0006693907,0.00049078814,0.00075138727,0.00087390793,0.0010823549,0.0012625325,0.0032028137],"category_scores_gemma":[0.0018699166,0.00032666585,0.00065836485,0.00035609797,0.00047482213,0.0010462686,0.0008627019,0.00066974317,0.00032722813],"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.00003334911,0.000028511762,0.0008695787,0.000025366893,0.000017310631,0.00006183741,0.00005229193,0.9916522,0.00087931147,0.004584471,0.00021341976,0.0015823706],"study_design_scores_gemma":[0.0000060272223,0.000007899555,0.000054458087,0.0000013423064,0.0000025885556,0.0000035932949,0.000008812969,0.99907243,0.00012437817,0.00048097866,0.00023542291,0.0000020076518],"about_ca_topic_score_codex":0.015005238,"about_ca_topic_score_gemma":0.0082876505,"teacher_disagreement_score":0.015005238,"about_ca_system_score_codex":0.00076396065,"about_ca_system_score_gemma":0.00078904786,"threshold_uncertainty_score":0.02983576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3738898,0.02673712,0.14989208,0.07018908,0.0026896275,0.00012491192,0.001674767,0.0025348612,0.37226775],"genre_scores_gemma":[0.9631967,0.006090699,0.009545919,0.0014969092,0.0014201493,0.0000708874,0.00041453223,0.00048591322,0.017278275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996908,0.0007010632,0.00019552042,0.0004386359,0.0013921785,0.0003646092],"domain_scores_gemma":[0.9817122,0.009538766,0.0013317869,0.0035532713,0.002766826,0.0010971406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002727407,0.00021395445,0.00033730266,0.0023209157,0.0018032264,0.010667462,0.0013743417,0.0025220262,0.007155603],"category_scores_gemma":[0.02125133,0.0004968364,0.00034155333,0.0025192292,0.004585979,0.022599557,0.0030745144,0.0029078962,0.0017168762],"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.00027332015,0.000103904335,0.0031483632,0.0003486045,0.000032443673,0.00021437304,0.0034738225,0.002175777,0.0061134845,0.7702439,0.020587351,0.1932846],"study_design_scores_gemma":[0.000041302268,0.00014107989,0.008907531,0.0007021148,0.000059016707,0.0004144066,0.0017837341,0.020760356,0.009128449,0.4614339,0.49647602,0.00015209036],"about_ca_topic_score_codex":0.0018294704,"about_ca_topic_score_gemma":0.0015416236,"teacher_disagreement_score":0.010667462,"about_ca_system_score_codex":0.0018754293,"about_ca_system_score_gemma":0.0013783795,"threshold_uncertainty_score":0.023937881},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012419936,0.00080332725,0.52011573,0.0009788802,0.0002694836,0.00055218604,0.005975198,0.40340516,0.055480085],"genre_scores_gemma":[0.19899134,0.0012659072,0.67501634,0.0010984975,0.0004832778,0.0015813333,0.03586513,0.021817401,0.063880794],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979202,0.0003552702,0.00009372606,0.00035193798,0.0010705654,0.0002083461],"domain_scores_gemma":[0.99785477,0.00033490546,0.000100688805,0.0006813926,0.0006597829,0.0003684976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342585,0.0011403924,0.0011644075,0.0016746257,0.0011883083,0.0030773894,0.004060894,0.0013635072,0.025104681],"category_scores_gemma":[0.0037642673,0.00061611074,0.0008474002,0.0014256645,0.00064485136,0.0029587522,0.0049822223,0.0021680312,0.011836149],"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.0020741192,0.00060266297,0.0043210466,0.0006396263,0.00022778884,0.00073893496,0.0010961856,0.023480225,0.039018404,0.023489026,0.49573666,0.40857524],"study_design_scores_gemma":[0.00096063473,0.0002874748,0.0029566109,0.00009919005,0.00010385517,0.0010624733,0.00023286403,0.29472357,0.028187085,0.02348542,0.64752483,0.00037586992],"about_ca_topic_score_codex":0.0057686716,"about_ca_topic_score_gemma":0.006626982,"teacher_disagreement_score":0.025104681,"about_ca_system_score_codex":0.0010530972,"about_ca_system_score_gemma":0.0021581354,"threshold_uncertainty_score":0.08398348},"labels":[],"label_agreement":null},{"id":"W2286153064","doi":"10.1007/s12083-016-0436-5","title":"A fault tolerant peer-to-peer spatial data structure","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Bank of Canada","funders":"","keywords":"Computer science; Hash function; Hash table; Redundancy (engineering); Distributed hash table; Backup; Node (physics); Range query (database); Theoretical computer science; Algorithm; Peer-to-peer; Distributed computing; Search engine","score_opus":0.02979607622787121,"score_gpt":0.28679192954184785,"score_spread":0.2569958533139766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286153064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019896662,0.00057021744,0.9641216,0.0007862073,0.0002899394,0.0004255516,0.0010228512,0.007781249,0.005105711],"genre_scores_gemma":[0.34875378,0.00068710657,0.6344247,0.00037242568,0.00018963897,0.00042598305,0.0027170528,0.00032205944,0.01210734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.00011650242,0.00010748358,0.00014599446,0.0006523796,0.00008147216],"domain_scores_gemma":[0.9977068,0.00031264068,0.0001984413,0.0008997266,0.0007075126,0.00017494471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084256893,0.00037943502,0.0010573892,0.0013203978,0.0015852058,0.0015873241,0.0030632303,0.0010880895,0.003408029],"category_scores_gemma":[0.0034842982,0.00036079276,0.00048221293,0.0021968035,0.0007983803,0.002393165,0.002659807,0.00097653596,0.0018593683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011218683,0.00044336886,0.0028950926,0.0007759475,0.00015530958,0.00062761665,0.00073215814,0.16363527,0.07557289,0.13446136,0.050089087,0.56949],"study_design_scores_gemma":[0.0002533046,0.0007771116,0.0010722171,0.000059009977,0.00013054407,0.00087740365,0.0003577368,0.7773067,0.062545605,0.05433424,0.102140464,0.00014578167],"about_ca_topic_score_codex":0.005387186,"about_ca_topic_score_gemma":0.004107309,"teacher_disagreement_score":0.005387186,"about_ca_system_score_codex":0.0010927613,"about_ca_system_score_gemma":0.002252127,"threshold_uncertainty_score":0.011400938},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60191303,0.004472504,0.35544714,0.0041717277,0.0009902242,0.00087012287,0.001257066,0.0027346518,0.028143557],"genre_scores_gemma":[0.92253864,0.0012646089,0.07314366,0.0005115545,0.00013623979,0.00049957784,0.0005502026,0.00015759602,0.0011979622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881655,0.008562419,0.0005139298,0.00064584805,0.0018990804,0.0002133043],"domain_scores_gemma":[0.9078377,0.07186293,0.0039450387,0.011223321,0.004147557,0.000983516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010866536,0.0016534132,0.0008780977,0.0011468574,0.0007537575,0.0028281221,0.0024666626,0.0020167602,0.0015994163],"category_scores_gemma":[0.059945703,0.00079706137,0.0006103846,0.0012267301,0.0016389763,0.0042668344,0.0015354296,0.0019411019,0.00066881167],"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.0011951802,0.0019160404,0.019351745,0.00097082206,0.00074626243,0.000068802474,0.0004489926,0.8294124,0.008432307,0.019319944,0.0049857534,0.113151774],"study_design_scores_gemma":[0.00020857173,0.0025523813,0.0055031623,0.00027195257,0.00014494844,0.000110324065,0.00046121594,0.93607897,0.011068333,0.03339345,0.010084966,0.00012177442],"about_ca_topic_score_codex":0.003934714,"about_ca_topic_score_gemma":0.003390239,"teacher_disagreement_score":0.010866536,"about_ca_system_score_codex":0.0011498453,"about_ca_system_score_gemma":0.0010490302,"threshold_uncertainty_score":0.057468414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07390517,0.00065634825,0.8971415,0.0006310466,0.00016599522,0.00043388733,0.00037790876,0.010598412,0.016089607],"genre_scores_gemma":[0.5626863,0.00037158545,0.42633104,0.00032473097,0.00006128866,0.00022842057,0.000978848,0.0001596667,0.008858077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993098,0.00012689871,0.00008897185,0.00013137981,0.00024268834,0.00010026622],"domain_scores_gemma":[0.99897397,0.0001324876,0.000064628264,0.00036449687,0.0003044942,0.00015988144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000780189,0.0002916797,0.00034362727,0.0009765518,0.001024956,0.0018473363,0.0016056601,0.00092623295,0.0019458308],"category_scores_gemma":[0.0013650267,0.00027134598,0.0004181901,0.0011945805,0.00056886504,0.0016850171,0.00203837,0.0009490914,0.0012135082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012075572,0.0006649871,0.007291891,0.00063358573,0.00018254665,0.0014022905,0.0015774483,0.12292286,0.11937532,0.16999051,0.031479895,0.54327106],"study_design_scores_gemma":[0.00015694606,0.00039931005,0.0033682443,0.00007080701,0.00013103434,0.00084464706,0.00045147777,0.8246488,0.03281011,0.043648683,0.093324505,0.00014549786],"about_ca_topic_score_codex":0.00690427,"about_ca_topic_score_gemma":0.00620769,"teacher_disagreement_score":0.00690427,"about_ca_system_score_codex":0.0011274499,"about_ca_system_score_gemma":0.0016894484,"threshold_uncertainty_score":0.013728201},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055329517,0.73970747,0.04086669,0.05140711,0.0024884187,0.00013002762,0.0005099278,0.00087009085,0.108690806],"genre_scores_gemma":[0.15528153,0.78609186,0.03001654,0.003083395,0.007026916,0.00009064286,0.0006975364,0.00020046045,0.01751113],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989604,0.000165941,0.00008003969,0.00013920285,0.0005778735,0.00007649139],"domain_scores_gemma":[0.99697304,0.0010927537,0.00023256749,0.00012479059,0.0013522898,0.00022451258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014212955,0.00045659565,0.0006253053,0.0019257683,0.00074167515,0.005090983,0.0011992228,0.0022903495,0.0032891207],"category_scores_gemma":[0.0028070055,0.00045409705,0.00018820632,0.0063924235,0.0009585068,0.00904825,0.00077129545,0.0017359358,0.0015760949],"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.00013259136,0.00018069886,0.007163011,0.0020680954,0.000020094756,0.0002810597,0.000914467,0.002395377,0.0039889268,0.08635814,0.033016603,0.863481],"study_design_scores_gemma":[0.000025199932,0.00039501608,0.012738155,0.0017183747,0.000101051424,0.0026585043,0.0042755483,0.029505022,0.0077750506,0.07496446,0.8657099,0.00013371649],"about_ca_topic_score_codex":0.0017715008,"about_ca_topic_score_gemma":0.0022538677,"teacher_disagreement_score":0.005090983,"about_ca_system_score_codex":0.0012250154,"about_ca_system_score_gemma":0.0010002762,"threshold_uncertainty_score":0.011003256},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031364728,0.002000618,0.052772805,0.001135837,0.00093690515,0.0006113536,0.045608725,0.3903987,0.50339854],"genre_scores_gemma":[0.023419578,0.002565247,0.029003097,0.0020383168,0.0006124107,0.0005544903,0.10947762,0.05522131,0.7771079],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912757,0.0000716245,0.000052145264,0.00015779157,0.00043444175,0.00015638427],"domain_scores_gemma":[0.9984869,0.00013210905,0.00003909649,0.0006469499,0.00039912146,0.00029585254],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074383226,0.0021579436,0.0012271941,0.0023028497,0.0013844373,0.0052152867,0.0019416118,0.0018469968,0.304189],"category_scores_gemma":[0.0026269534,0.0012025846,0.0008559574,0.0024202333,0.00037215327,0.0052775578,0.0038302923,0.0024992109,0.4463157],"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.00020945095,0.00014162825,0.00034782532,0.00027340674,0.000033423228,0.00015760133,0.00007371397,0.0002387891,0.005494051,0.004662505,0.8558266,0.13254097],"study_design_scores_gemma":[0.00008561971,0.000049761868,0.002082989,0.00012705708,0.000023705252,0.00040619142,0.00006929259,0.0018252748,0.0068019074,0.0067162416,0.98172015,0.00009184138],"about_ca_topic_score_codex":0.0031564012,"about_ca_topic_score_gemma":0.004633961,"teacher_disagreement_score":0.304189,"about_ca_system_score_codex":0.000470609,"about_ca_system_score_gemma":0.0010067036,"threshold_uncertainty_score":0.99248993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3650698,0.0032830231,0.6175129,0.0011057919,0.0002835995,0.0005975931,0.000092155875,0.0020837898,0.009971341],"genre_scores_gemma":[0.6053387,0.0014107177,0.3890595,0.00026721045,0.00014516956,0.00017526963,0.0002570397,0.00023666152,0.0031097033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977597,0.00082550925,0.00011662431,0.00035989858,0.00078696833,0.00015128349],"domain_scores_gemma":[0.9921401,0.004251743,0.00042068562,0.0014869679,0.0014405976,0.00025995195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051817945,0.00091102725,0.0013950631,0.0010346363,0.0009794617,0.0017156557,0.002927638,0.0013383924,0.0008820733],"category_scores_gemma":[0.01742373,0.00039963445,0.0005136952,0.0009034145,0.0006723172,0.0034797483,0.0013091878,0.0012362323,0.00046378424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008921085,0.0006661015,0.017848995,0.00035876568,0.00029530204,0.00013359358,0.00062792154,0.45159325,0.022464536,0.028458565,0.004247375,0.47241357],"study_design_scores_gemma":[0.000054108375,0.0002433615,0.0009261179,0.0000149722855,0.00003819615,0.000121648096,0.00009749293,0.98565245,0.0073648533,0.0032490145,0.002217983,0.000019792313],"about_ca_topic_score_codex":0.0030342182,"about_ca_topic_score_gemma":0.0033015122,"teacher_disagreement_score":0.0051817945,"about_ca_system_score_codex":0.0012086936,"about_ca_system_score_gemma":0.0012473399,"threshold_uncertainty_score":0.027404249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03597258,0.00052651024,0.95444375,0.00046942162,0.00017640629,0.00037247522,0.00015325332,0.0024230354,0.0054625273],"genre_scores_gemma":[0.70222455,0.0010254551,0.2892099,0.00020099114,0.0001816562,0.00082527514,0.00036115112,0.00029113333,0.005679947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985166,0.0005114898,0.00013576493,0.000166652,0.0005323864,0.00013693784],"domain_scores_gemma":[0.9968591,0.0014412964,0.0003520108,0.000636627,0.0005038947,0.00020720366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029812057,0.000422645,0.00073790096,0.0010245987,0.0011265111,0.002009355,0.0024277095,0.0012734107,0.0010071569],"category_scores_gemma":[0.006116711,0.00028661214,0.00036762407,0.0013408049,0.0014913476,0.004284467,0.0017431813,0.00093669683,0.0005409778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010078783,0.00039976442,0.0046548056,0.0010157702,0.00019342022,0.0012772523,0.0013956024,0.2278904,0.05726743,0.34944826,0.015194871,0.3402545],"study_design_scores_gemma":[0.00028860514,0.00041223058,0.00082285533,0.00011280101,0.00017203415,0.0011616376,0.00031615456,0.7493917,0.04936568,0.13029371,0.06746051,0.00020213593],"about_ca_topic_score_codex":0.0013182492,"about_ca_topic_score_gemma":0.0007782161,"teacher_disagreement_score":0.0029812057,"about_ca_system_score_codex":0.00061516167,"about_ca_system_score_gemma":0.001616566,"threshold_uncertainty_score":0.015766263},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13974936,0.000648861,0.8497175,0.0012654981,0.00021972328,0.00016757325,0.0009296459,0.00061172823,0.00669018],"genre_scores_gemma":[0.9525324,0.0010128476,0.028947853,0.0002262744,0.0002395856,0.00025987826,0.0010941889,0.0002040522,0.015482956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915373,0.00026676865,0.000033870092,0.00016433495,0.00016592945,0.00021542708],"domain_scores_gemma":[0.9971066,0.0016492512,0.00031363303,0.00015106468,0.0005798401,0.00019952486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145439,0.0011902273,0.0018837228,0.0017732573,0.0009542079,0.001619311,0.00357271,0.0022514155,0.0034348883],"category_scores_gemma":[0.0066159912,0.0009897051,0.0012588935,0.0016675196,0.0011753808,0.002194753,0.0012062191,0.0021306348,0.0008284671],"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.000040596453,0.000042296124,0.0007917171,0.000020567004,0.000022359642,0.00005107757,0.0000342613,0.96480566,0.00046188838,0.02872596,0.0012259851,0.003777701],"study_design_scores_gemma":[0.000001846402,0.0000041104436,0.0000728604,0.000001592928,0.0000029267044,0.0000062050103,0.0000032079215,0.99746156,0.00001967057,0.0023371482,0.00008551143,0.0000033459953],"about_ca_topic_score_codex":0.031449325,"about_ca_topic_score_gemma":0.019867161,"teacher_disagreement_score":0.031449325,"about_ca_system_score_codex":0.0026437594,"about_ca_system_score_gemma":0.0021976503,"threshold_uncertainty_score":0.062532544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010359956,0.00022093735,0.98687077,0.00019763318,0.0000399162,0.00009043467,0.000057265566,0.0003725837,0.0017904504],"genre_scores_gemma":[0.4505112,0.0009152344,0.5429781,0.00015375098,0.00021143645,0.00027012438,0.00034195487,0.00028381587,0.004334402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979595,0.0007287786,0.00009374781,0.0003890114,0.00057369063,0.00025529903],"domain_scores_gemma":[0.99756515,0.0012449143,0.00031150176,0.00034270948,0.00036874422,0.00016702405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015636731,0.0018026559,0.0014629972,0.0017431373,0.001419631,0.0017685461,0.0034022972,0.0013337854,0.004574309],"category_scores_gemma":[0.006213667,0.0007928205,0.00095382205,0.0026130502,0.0015609642,0.0032847936,0.0021175798,0.0015099576,0.0012502887],"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.00020158647,0.000115797804,0.0009490653,0.00013833353,0.000046371788,0.00020925426,0.00018781003,0.8508938,0.008292691,0.07357258,0.004011569,0.06138119],"study_design_scores_gemma":[0.000018035316,0.00010653961,0.0001656344,0.000007836751,0.000013579098,0.0001528109,0.00007084159,0.97030145,0.002317474,0.024265984,0.0025566006,0.000023295293],"about_ca_topic_score_codex":0.0019799503,"about_ca_topic_score_gemma":0.0024429602,"teacher_disagreement_score":0.004574309,"about_ca_system_score_codex":0.0021371169,"about_ca_system_score_gemma":0.0014790321,"threshold_uncertainty_score":0.01550591},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008383488,0.031089617,0.60413474,0.011452168,0.0049386653,0.0005441787,0.00030235984,0.004205348,0.33494955],"genre_scores_gemma":[0.2813241,0.031479284,0.4793952,0.00531272,0.0043042446,0.0011163148,0.0010238792,0.001100557,0.19494362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770063,0.00066934,0.00016573,0.00036901576,0.0009584489,0.00013681172],"domain_scores_gemma":[0.99926776,0.00021287578,0.00004591533,0.00021161475,0.00018875297,0.00007311982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475073,0.0009240663,0.0006203378,0.0011897843,0.0013967674,0.006050242,0.0011721837,0.0028209463,0.010308217],"category_scores_gemma":[0.001974319,0.0005248067,0.00074275734,0.00201363,0.0012021975,0.0063717677,0.0028300458,0.00301709,0.0061604083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017640999,0.00014126736,0.0005683429,0.0007813927,0.0001237442,0.00093358353,0.0005432303,0.00501139,0.0077270353,0.59948754,0.051239643,0.33326632],"study_design_scores_gemma":[0.00004144959,0.00011375482,0.0004173019,0.00020929298,0.0000980871,0.0009701011,0.00018313236,0.020331312,0.004562738,0.17482486,0.7981928,0.00005504392],"about_ca_topic_score_codex":0.0013564005,"about_ca_topic_score_gemma":0.0011416053,"teacher_disagreement_score":0.010308217,"about_ca_system_score_codex":0.0008722516,"about_ca_system_score_gemma":0.0013689082,"threshold_uncertainty_score":0.034484386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08570804,0.02504584,0.61471033,0.022319071,0.0017262225,0.00033603914,0.00086395914,0.0015085156,0.24778193],"genre_scores_gemma":[0.8492601,0.012155589,0.09693347,0.0007998884,0.0013545785,0.0004139586,0.0006475362,0.00017346823,0.0382614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99737644,0.0011354063,0.0001479646,0.00056736945,0.0006080371,0.0001648484],"domain_scores_gemma":[0.99098396,0.005613168,0.0012187577,0.0009554919,0.0006042282,0.00062434166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023076083,0.0005066567,0.00064336456,0.0020489292,0.0022535888,0.006345896,0.0009505357,0.0016623882,0.0070888125],"category_scores_gemma":[0.0109620225,0.00044378013,0.000385711,0.003088373,0.003969976,0.009837874,0.0033656736,0.0014001289,0.0010752267],"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.00003247099,0.000031840547,0.0007931032,0.00026081657,0.00003173078,0.00017526987,0.0007042333,0.008109232,0.00046264188,0.94156003,0.0051135733,0.042724997],"study_design_scores_gemma":[0.000027525708,0.000031110205,0.0010181176,0.00009325584,0.00002259005,0.00024277468,0.0005694413,0.02034666,0.00047439456,0.90190357,0.07524148,0.000029088029],"about_ca_topic_score_codex":0.002411832,"about_ca_topic_score_gemma":0.0020204412,"teacher_disagreement_score":0.0070888125,"about_ca_system_score_codex":0.001785027,"about_ca_system_score_gemma":0.0013687778,"threshold_uncertainty_score":0.023714423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023465391,0.00032146944,0.9530264,0.0010042778,0.00011637632,0.000090089525,0.00010139369,0.00017651243,0.021698102],"genre_scores_gemma":[0.95183957,0.00039896768,0.034807883,0.00011210574,0.000091363676,0.00014656976,0.00008615996,0.000042238822,0.012475163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00024607417,0.000048146623,0.00023499089,0.00045880536,0.0001805687],"domain_scores_gemma":[0.99858654,0.0005384845,0.00019483636,0.000128401,0.00043232812,0.00011932836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013214011,0.0006425027,0.0007229167,0.0005644837,0.00083163753,0.0024183288,0.0018341412,0.0013739929,0.005078755],"category_scores_gemma":[0.0044226027,0.0003161625,0.00069248956,0.00061255664,0.0012025492,0.0029429162,0.001320545,0.0014807379,0.00058819156],"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.00008564323,0.000055160905,0.0007154623,0.000088215915,0.000038478196,0.00042695345,0.00021401346,0.63601214,0.002669242,0.33766374,0.0029099043,0.019121],"study_design_scores_gemma":[0.0000072975163,0.000014775872,0.000059427686,0.0000043179402,0.000007070702,0.000031199037,0.000012135351,0.9794804,0.00015681003,0.019454801,0.00076588115,0.0000060088787],"about_ca_topic_score_codex":0.009226258,"about_ca_topic_score_gemma":0.003072979,"teacher_disagreement_score":0.009226258,"about_ca_system_score_codex":0.0018746626,"about_ca_system_score_gemma":0.0015988308,"threshold_uncertainty_score":0.018345118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068119295,0.00260402,0.85431856,0.0007497314,0.0009417123,0.0007082653,0.00094292685,0.031931862,0.0396836],"genre_scores_gemma":[0.6659794,0.0018139174,0.26453534,0.0004331075,0.00068323273,0.00054710195,0.0020829355,0.00087082724,0.06305417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913436,0.00009628678,0.000040078132,0.00016396702,0.0004691647,0.00009620425],"domain_scores_gemma":[0.99914145,0.00012529815,0.000033276785,0.00025058593,0.0003814251,0.00006801774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037461147,0.00055234204,0.00084984757,0.001384877,0.0011529087,0.0013109877,0.0020342148,0.0009770325,0.010354432],"category_scores_gemma":[0.00090225274,0.0002504548,0.00040375587,0.0012806405,0.00041736252,0.0028652046,0.0010812485,0.0007568114,0.0056647058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009226861,0.00056593004,0.0042140437,0.0009198574,0.00020670333,0.0014911691,0.00058464403,0.006257972,0.17973676,0.032649215,0.09654832,0.67590266],"study_design_scores_gemma":[0.0005896299,0.0012342782,0.0064622974,0.00012965809,0.0003098665,0.0092260875,0.00045740258,0.25423795,0.39755395,0.016952708,0.31250018,0.00034600197],"about_ca_topic_score_codex":0.0017998394,"about_ca_topic_score_gemma":0.0014787841,"teacher_disagreement_score":0.010354432,"about_ca_system_score_codex":0.00050482026,"about_ca_system_score_gemma":0.00061054726,"threshold_uncertainty_score":0.034639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01913899,0.0013405345,0.9698784,0.0012444387,0.00019398608,0.00024348203,0.0005316131,0.00074194546,0.006686638],"genre_scores_gemma":[0.73747236,0.0027924897,0.24262574,0.00045033224,0.00039369994,0.0005435065,0.00094879745,0.00016493462,0.014608184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849045,0.0003634733,0.00011980786,0.00028619627,0.00062288507,0.00011714161],"domain_scores_gemma":[0.99835736,0.0007809021,0.00012867467,0.0002147102,0.000417283,0.00010115561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012996274,0.00058092107,0.001332183,0.0013850802,0.001069025,0.0024523584,0.00331125,0.0018636723,0.0021911948],"category_scores_gemma":[0.004595875,0.00051766186,0.0008117962,0.0032446291,0.0009885371,0.008044162,0.0014403262,0.0011920484,0.00083784055],"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.000512997,0.00022375889,0.0018449329,0.00055585813,0.00013351832,0.0009298673,0.00070112554,0.5381434,0.0130818,0.26428717,0.014600231,0.16498534],"study_design_scores_gemma":[0.000044797824,0.00007790721,0.000105564985,0.000010203065,0.000025873145,0.00021391339,0.00005617507,0.96144253,0.0012738808,0.03221162,0.004510203,0.0000274114],"about_ca_topic_score_codex":0.007564,"about_ca_topic_score_gemma":0.0044833403,"teacher_disagreement_score":0.007564,"about_ca_system_score_codex":0.0017141005,"about_ca_system_score_gemma":0.001563852,"threshold_uncertainty_score":0.01503998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045132063,0.0015749092,0.8587257,0.0017747966,0.0006935432,0.0018155379,0.0014342112,0.046712954,0.042136345],"genre_scores_gemma":[0.5094176,0.0014410581,0.42873406,0.001041491,0.0006644805,0.0013072747,0.0032574562,0.00041156824,0.053724956],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992478,0.000100193465,0.000059185622,0.00021293489,0.0003237775,0.0000561511],"domain_scores_gemma":[0.9993622,0.00008064819,0.000029997906,0.00011570192,0.00032006402,0.00009135273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007495007,0.0005874828,0.0008898184,0.0010696377,0.0015330504,0.0016433031,0.0017066629,0.0015094746,0.008880667],"category_scores_gemma":[0.0013979331,0.000281113,0.00033776104,0.0014847798,0.00037107224,0.0021009874,0.0011555116,0.00073416345,0.006501386],"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.001449232,0.00073607167,0.0024239365,0.0007102494,0.00016268696,0.0019194857,0.00044145834,0.019273376,0.1456207,0.02173641,0.10708372,0.6984427],"study_design_scores_gemma":[0.0009146517,0.00128601,0.003126592,0.00008488323,0.00027244288,0.0039799525,0.0003113403,0.64776593,0.1007091,0.015476206,0.22576234,0.00031064823],"about_ca_topic_score_codex":0.004449372,"about_ca_topic_score_gemma":0.002004202,"teacher_disagreement_score":0.008880667,"about_ca_system_score_codex":0.00068868743,"about_ca_system_score_gemma":0.0013721406,"threshold_uncertainty_score":0.029708803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17319381,0.0011790867,0.7752985,0.00028314078,0.00033426055,0.0010783519,0.0005748389,0.035246693,0.012811316],"genre_scores_gemma":[0.91380244,0.0006884148,0.07723185,0.00018564213,0.00012703185,0.0004475352,0.0008101037,0.00026750524,0.00643945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998901,0.00017586113,0.00010569711,0.00025768022,0.0004704062,0.00008929052],"domain_scores_gemma":[0.9982672,0.00039356778,0.00020367597,0.0003392184,0.000645183,0.00015100259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008562543,0.00060559413,0.0007471293,0.0013135012,0.0005872966,0.0011549174,0.0011921796,0.0004595816,0.0015035986],"category_scores_gemma":[0.0020111334,0.00025024783,0.00017168201,0.00046159065,0.0002931159,0.0018140156,0.0007968449,0.00056475226,0.00046575084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004603364,0.0008992649,0.030592743,0.00067851593,0.0002829665,0.0015478448,0.0007356467,0.03960144,0.34399876,0.023229228,0.024370601,0.52945966],"study_design_scores_gemma":[0.0002807874,0.00073514023,0.012433021,0.00006516134,0.00029096802,0.0023598503,0.00008026769,0.6617462,0.29403841,0.006204086,0.021535346,0.00023073517],"about_ca_topic_score_codex":0.0013150483,"about_ca_topic_score_gemma":0.0012223836,"teacher_disagreement_score":0.0015035986,"about_ca_system_score_codex":0.00055662025,"about_ca_system_score_gemma":0.00073246285,"threshold_uncertainty_score":0.0050299764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020210259,0.00027915667,0.96555626,0.00027893923,0.00016031247,0.0006371415,0.00017882611,0.0042803064,0.008418734],"genre_scores_gemma":[0.5974817,0.00051018706,0.38944596,0.00023420746,0.00018393253,0.0006002793,0.0008145678,0.0002897592,0.010439428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982311,0.00026830778,0.000158968,0.00028223457,0.00087674713,0.0001826419],"domain_scores_gemma":[0.9987722,0.00025357274,0.000055043187,0.0003678437,0.00047651154,0.00007483467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013731277,0.00025476803,0.0005118764,0.0006098839,0.0005750763,0.00155386,0.0016372006,0.0005908106,0.0029468224],"category_scores_gemma":[0.0027928145,0.00025962145,0.00038657238,0.0005143081,0.00064814585,0.0015416105,0.0012303073,0.0007334897,0.00090152107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011215216,0.00045957367,0.008601564,0.0009813227,0.00014950983,0.0018053419,0.002776812,0.05906174,0.16607475,0.14542943,0.02426098,0.58927745],"study_design_scores_gemma":[0.00036568654,0.0007459522,0.0035446212,0.00007052494,0.00012330833,0.0013099124,0.0006493956,0.743267,0.12954547,0.023816573,0.09639757,0.0001638794],"about_ca_topic_score_codex":0.0023160528,"about_ca_topic_score_gemma":0.0008681188,"teacher_disagreement_score":0.0029468224,"about_ca_system_score_codex":0.0004873589,"about_ca_system_score_gemma":0.0010997086,"threshold_uncertainty_score":0.009858131},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043918237,0.0005867621,0.9472079,0.00045216666,0.000106783,0.00006218211,0.00001826434,0.0006908214,0.0069567775],"genre_scores_gemma":[0.7850197,0.00081538275,0.21137658,0.00014852524,0.00016067296,0.000045243025,0.000047051224,0.000050681094,0.0023362425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996407,0.0001316839,0.000017409326,0.00004139238,0.00013240105,0.000036400637],"domain_scores_gemma":[0.99959344,0.00019826915,0.000023925873,0.00005350641,0.00011138536,0.000019401003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044353143,0.00021096611,0.0003041191,0.00032250537,0.00051687274,0.00045483068,0.0004918894,0.0006700791,0.0010518563],"category_scores_gemma":[0.0011920314,0.00010158449,0.0002692121,0.00034055286,0.00023940868,0.0006511069,0.000494517,0.0004071617,0.00019671499],"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.00033192142,0.00019782978,0.0066027087,0.0004135697,0.000118316384,0.0016305496,0.00082833896,0.16000867,0.19793802,0.08930613,0.005139177,0.5374847],"study_design_scores_gemma":[0.000022255863,0.00018710554,0.001103557,0.000028369419,0.000058550555,0.0007317135,0.00015354801,0.9161711,0.044082373,0.020603765,0.016837187,0.000020540421],"about_ca_topic_score_codex":0.00044778024,"about_ca_topic_score_gemma":0.0004676014,"teacher_disagreement_score":0.0010518563,"about_ca_system_score_codex":0.0002669814,"about_ca_system_score_gemma":0.0001913928,"threshold_uncertainty_score":0.0035187602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027687682,0.0006160427,0.95810634,0.00039620942,0.0000910674,0.000109042165,0.00016651477,0.00061177986,0.012215248],"genre_scores_gemma":[0.8236247,0.0014031205,0.16402012,0.0000971226,0.00008781269,0.00027612117,0.00023236749,0.0000738588,0.010184776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996018,0.00008486866,0.000021526354,0.000106293235,0.00014363491,0.00004196646],"domain_scores_gemma":[0.999747,0.00006753654,0.00002622796,0.000053836917,0.000085965534,0.000019468096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036819244,0.0003978221,0.00038012274,0.0004074329,0.0005681122,0.0012491067,0.0017910489,0.0006520178,0.0016750547],"category_scores_gemma":[0.00075450126,0.00019917836,0.00039680587,0.000556179,0.00052096153,0.0027597004,0.00048323392,0.00050969794,0.00057059166],"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.00020615115,0.00005851899,0.0012396667,0.00027002685,0.000044190234,0.00045261584,0.0003922065,0.6373027,0.01805983,0.2971429,0.0031967189,0.041634515],"study_design_scores_gemma":[0.000016100123,0.00006143813,0.00013855597,0.000008722417,0.000017076916,0.00014645598,0.000042594707,0.96731746,0.0018970235,0.026789762,0.0035488636,0.000015854426],"about_ca_topic_score_codex":0.00376197,"about_ca_topic_score_gemma":0.0021297308,"teacher_disagreement_score":0.00376197,"about_ca_system_score_codex":0.0010141791,"about_ca_system_score_gemma":0.0010155007,"threshold_uncertainty_score":0.0074801445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28904432,0.00027666372,0.7057116,0.00026689566,0.00003676669,0.00014148223,0.0002444475,0.0012552186,0.0030226645],"genre_scores_gemma":[0.88435185,0.00011807396,0.11353276,0.000031896194,0.00001818722,0.0000975042,0.00026136264,0.000056971083,0.0015312722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892044,0.0003213288,0.000060266244,0.00022837508,0.00036461948,0.0001050608],"domain_scores_gemma":[0.99876356,0.0005117312,0.00013076229,0.00011966818,0.00041737955,0.00005692318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008090294,0.00045280764,0.00068400113,0.0019479601,0.0010181173,0.00083381525,0.0008160481,0.00063652504,0.0006327547],"category_scores_gemma":[0.0026517475,0.00025091632,0.00045912797,0.0017955942,0.0005614209,0.0012718369,0.00044441808,0.0003977686,0.00031473997],"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.00081966916,0.000452815,0.049249876,0.0003243744,0.00032596107,0.00043539816,0.0020814508,0.4912712,0.025989654,0.018480778,0.0075947177,0.4029741],"study_design_scores_gemma":[0.000006732189,0.00003862726,0.006993927,0.0000065013337,0.000018216808,0.00010624985,0.0002305111,0.9835957,0.004459113,0.0038091831,0.0007013072,0.00003394777],"about_ca_topic_score_codex":0.0141345225,"about_ca_topic_score_gemma":0.00926868,"teacher_disagreement_score":0.0141345225,"about_ca_system_score_codex":0.001028539,"about_ca_system_score_gemma":0.00076036295,"threshold_uncertainty_score":0.028104484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4792253,0.0021481814,0.5106863,0.0003273562,0.00005917158,0.00017127777,0.00010755109,0.0010494451,0.006225396],"genre_scores_gemma":[0.9699887,0.0004368165,0.028866332,0.000025585678,0.000016635173,0.000031599517,0.00004811087,0.000019545249,0.00056668435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950254,0.00014378414,0.000028053597,0.000078802914,0.00016587408,0.00008101398],"domain_scores_gemma":[0.9992822,0.000345681,0.00006026036,0.0000847108,0.0001915812,0.000035585403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053812587,0.0004082789,0.00049263414,0.0005271153,0.00042504628,0.00055034825,0.00096520537,0.00055837614,0.000512986],"category_scores_gemma":[0.0026533208,0.00013760135,0.0001878379,0.00065658527,0.00035930396,0.0023165166,0.00043901792,0.00030362082,0.00013927756],"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.00089592405,0.00038934615,0.011026383,0.00054028456,0.000120541255,0.000997807,0.0007270171,0.41678417,0.19493201,0.037502,0.0045752698,0.3315093],"study_design_scores_gemma":[0.000046838242,0.0001996189,0.0015651494,0.000008454874,0.00004711318,0.00042503807,0.00012551155,0.9631772,0.02932098,0.0034140816,0.001644526,0.000025371772],"about_ca_topic_score_codex":0.004007548,"about_ca_topic_score_gemma":0.002202613,"teacher_disagreement_score":0.004007548,"about_ca_system_score_codex":0.00045904267,"about_ca_system_score_gemma":0.0006856093,"threshold_uncertainty_score":0.007968426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012273635,0.00058195466,0.9716744,0.00019524891,0.00018770978,0.0005262772,0.00016185529,0.008541882,0.00585711],"genre_scores_gemma":[0.30083618,0.000679388,0.68322974,0.00028679892,0.00010141108,0.0006445949,0.000978078,0.0013309518,0.011912815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868745,0.00019858823,0.00013424114,0.0002492007,0.00052904896,0.00020143969],"domain_scores_gemma":[0.9990558,0.00011854024,0.00005720474,0.00034135632,0.00032292414,0.00010424222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017258183,0.0004567404,0.0006476661,0.00071843294,0.0010110894,0.0020754386,0.0041282396,0.0009420866,0.0033056291],"category_scores_gemma":[0.0023150172,0.0007029484,0.00077913544,0.00053961074,0.00086167495,0.0042237127,0.0019665333,0.0014824013,0.0009522448],"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.0010520733,0.00029354522,0.0029485926,0.0016856265,0.00034133776,0.0010163423,0.0018678481,0.042061105,0.060637273,0.37910497,0.027096665,0.48189464],"study_design_scores_gemma":[0.0006063572,0.000875312,0.0012353582,0.00022012887,0.00039454384,0.0016856504,0.00047331763,0.38905525,0.11754853,0.063337125,0.4241799,0.00038854478],"about_ca_topic_score_codex":0.0031527877,"about_ca_topic_score_gemma":0.0032363092,"teacher_disagreement_score":0.0041282396,"about_ca_system_score_codex":0.0014202211,"about_ca_system_score_gemma":0.0022069928,"threshold_uncertainty_score":0.011058509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1518945,0.00071745727,0.8118511,0.0009542693,0.00037244006,0.00081842317,0.0001271482,0.007463364,0.025801297],"genre_scores_gemma":[0.8619829,0.00028043645,0.12688413,0.00017269955,0.00009909578,0.00021173664,0.0002533213,0.000118760574,0.009996986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992386,0.00017078861,0.000058767182,0.00012065675,0.0002871568,0.0001240657],"domain_scores_gemma":[0.9994424,0.00007710822,0.000043597152,0.00014857232,0.00020152603,0.00008682542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007803519,0.00018838674,0.0003399641,0.0004540419,0.00062059617,0.0012524973,0.0012094894,0.0005209471,0.0024681767],"category_scores_gemma":[0.0012567646,0.0001878927,0.00021089935,0.0002864791,0.00034710765,0.0015973268,0.0005724336,0.00076327776,0.0006617261],"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.0007219393,0.00070167653,0.006858218,0.00038180282,0.00011861045,0.0011139122,0.0014171553,0.010164746,0.2914805,0.08099504,0.010951946,0.5950945],"study_design_scores_gemma":[0.00047563677,0.0023267053,0.008568414,0.00013624078,0.0003010215,0.0022426092,0.00080228853,0.43722653,0.33476755,0.012752014,0.20019062,0.00021038811],"about_ca_topic_score_codex":0.0014882669,"about_ca_topic_score_gemma":0.00066023035,"teacher_disagreement_score":0.0024681767,"about_ca_system_score_codex":0.0006136944,"about_ca_system_score_gemma":0.0009353078,"threshold_uncertainty_score":0.008256853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012183153,0.0019628962,0.9805895,0.000350649,0.00013917805,0.00008249802,0.000044665107,0.00036830167,0.0042791083],"genre_scores_gemma":[0.4528428,0.00816405,0.53245467,0.00028646996,0.0004073862,0.00027109808,0.00044462795,0.00017905857,0.004949837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997338,0.00091864914,0.00016638053,0.0005941707,0.0008344477,0.00014835369],"domain_scores_gemma":[0.9960085,0.0018978432,0.00028834093,0.0007867327,0.0008872636,0.00013131434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025702508,0.00058349007,0.0010420176,0.0020923186,0.0010000631,0.0017351417,0.0019063097,0.0013914707,0.0020084535],"category_scores_gemma":[0.013184713,0.0004260454,0.0006859982,0.004104772,0.00096239086,0.0073793964,0.0014818212,0.0009535154,0.0005263604],"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.00017164896,0.00013218178,0.0027931973,0.0005187425,0.0001448099,0.00023889921,0.00043983053,0.25791222,0.007715745,0.19344477,0.004283013,0.532205],"study_design_scores_gemma":[0.000051329745,0.00020078782,0.00069638796,0.00005445124,0.00007174477,0.0006683876,0.0002507367,0.8552051,0.009997153,0.10738465,0.025371138,0.000048076385],"about_ca_topic_score_codex":0.0019524419,"about_ca_topic_score_gemma":0.00078165275,"teacher_disagreement_score":0.0025702508,"about_ca_system_score_codex":0.0011731973,"about_ca_system_score_gemma":0.00085039425,"threshold_uncertainty_score":0.013592958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061800636,0.0006646238,0.92731345,0.00079945306,0.00011820204,0.00031062096,0.000062166626,0.0055372566,0.0033936389],"genre_scores_gemma":[0.5429815,0.00048466853,0.44896856,0.00039966727,0.00014704114,0.00030661735,0.00022058612,0.00032153944,0.006169761],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974886,0.0007509689,0.00018355894,0.00042040632,0.00076547475,0.00039099384],"domain_scores_gemma":[0.9957349,0.00053793803,0.0006503727,0.0018005647,0.0009848236,0.00029144387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018246545,0.0010438026,0.0012319678,0.0018562742,0.0026966007,0.0012702527,0.003330231,0.0017453873,0.0015488754],"category_scores_gemma":[0.0047187163,0.0005539577,0.0006498741,0.001413375,0.0013720883,0.0038740695,0.0030292417,0.0013263728,0.0008802397],"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.0012908335,0.0007275886,0.006507127,0.00092106394,0.00025878625,0.0013138435,0.0022753992,0.101949,0.15529646,0.0625037,0.01846527,0.64849097],"study_design_scores_gemma":[0.00030423384,0.0013008656,0.0025058023,0.000115790295,0.00035121932,0.0032998975,0.0007412667,0.75705975,0.15278721,0.033247642,0.04795532,0.00033094737],"about_ca_topic_score_codex":0.0033121204,"about_ca_topic_score_gemma":0.002670277,"teacher_disagreement_score":0.003330231,"about_ca_system_score_codex":0.0009590874,"about_ca_system_score_gemma":0.0014507069,"threshold_uncertainty_score":0.009649754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21099427,0.005539234,0.7327706,0.003095649,0.0006930315,0.00055680436,0.00017016444,0.00018639496,0.04599381],"genre_scores_gemma":[0.96246785,0.002071223,0.029881053,0.00018718894,0.00028838185,0.00015404557,0.000043011223,0.000026137881,0.004881228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659204,0.0017178,0.0001330287,0.0004056224,0.0006946099,0.00045684143],"domain_scores_gemma":[0.994514,0.0030414974,0.0004898909,0.00058815785,0.0010090702,0.00035747755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048189,0.00048615347,0.0010700959,0.0013130197,0.0011882993,0.0020956774,0.0021459616,0.001609725,0.003998278],"category_scores_gemma":[0.013414623,0.0004008808,0.0014506999,0.0012484565,0.0014525993,0.0061137457,0.0010499652,0.0018938719,0.00022825757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019631498,0.00021641985,0.0023892068,0.00030304914,0.00009776824,0.00028617075,0.00046792318,0.04425506,0.0042679757,0.9159671,0.0021262967,0.029426804],"study_design_scores_gemma":[0.000221333,0.0005755169,0.0030140784,0.00018230558,0.00017402042,0.0009270102,0.00046594135,0.6118896,0.004007867,0.3590923,0.01933164,0.00011843825],"about_ca_topic_score_codex":0.0017735629,"about_ca_topic_score_gemma":0.0004915506,"teacher_disagreement_score":0.0048189,"about_ca_system_score_codex":0.001953495,"about_ca_system_score_gemma":0.0022044217,"threshold_uncertainty_score":0.025485098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04030253,0.0011300369,0.93869704,0.0006007245,0.00037770363,0.0008291641,0.0002442334,0.0054243794,0.0123941675],"genre_scores_gemma":[0.65882224,0.0008389362,0.32832333,0.00028811232,0.00029346606,0.00065435906,0.00058828405,0.0000862834,0.010104993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.00008689789,0.00004060675,0.00012311543,0.00017421435,0.000050094797],"domain_scores_gemma":[0.999653,0.00006256049,0.000024095607,0.00006319467,0.00014677433,0.000050326616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055833673,0.00027187608,0.0006262353,0.0005254896,0.0008714188,0.0013660399,0.0014987655,0.0005286769,0.0017247193],"category_scores_gemma":[0.00067846815,0.00026880222,0.00022762209,0.00060806895,0.00034600217,0.0012809956,0.00064578035,0.0003996487,0.0006398473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094993255,0.00049899664,0.006280641,0.0012539498,0.00031506998,0.0016595976,0.0008922778,0.059266657,0.1520372,0.12890309,0.0389946,0.608948],"study_design_scores_gemma":[0.00046137912,0.00078339136,0.0030820358,0.00004671595,0.00028771572,0.0018042685,0.00039734918,0.74847,0.102007635,0.026234675,0.11627478,0.00015004464],"about_ca_topic_score_codex":0.0013769364,"about_ca_topic_score_gemma":0.0009636534,"teacher_disagreement_score":0.0017247193,"about_ca_system_score_codex":0.00048282716,"about_ca_system_score_gemma":0.0008789423,"threshold_uncertainty_score":0.005769789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06287907,0.00026454625,0.93332124,0.00017515665,0.00010217597,0.0001317369,0.000051354473,0.0010870773,0.0019876235],"genre_scores_gemma":[0.7786914,0.00025622678,0.21790819,0.00006359543,0.000091986,0.00017203351,0.0001458454,0.00007908105,0.0025916786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996258,0.00006315241,0.000036614525,0.00006473103,0.00016881339,0.000040822622],"domain_scores_gemma":[0.99932694,0.00017391791,0.00007205779,0.000052047893,0.00031472679,0.000060315324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007377509,0.0005380382,0.0005345076,0.00060048257,0.0007124922,0.0006581095,0.00096946367,0.0003600801,0.0007781438],"category_scores_gemma":[0.001406787,0.00021034428,0.00023732372,0.00046143777,0.00028248617,0.00083815394,0.00044381965,0.00044772087,0.0002103122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008982683,0.00030370223,0.004779668,0.00028366531,0.000106215746,0.00020470264,0.00047510842,0.3794578,0.08121535,0.01620099,0.0066244737,0.50945],"study_design_scores_gemma":[0.00004550709,0.000097547316,0.0004101668,0.0000031666302,0.00001705156,0.000051820578,0.000037180365,0.9880851,0.00855095,0.0015852802,0.0011028541,0.000013419172],"about_ca_topic_score_codex":0.0033391884,"about_ca_topic_score_gemma":0.002342449,"teacher_disagreement_score":0.0033391884,"about_ca_system_score_codex":0.00057282386,"about_ca_system_score_gemma":0.0009442776,"threshold_uncertainty_score":0.00663954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065807537,0.0006657446,0.9822704,0.00040025153,0.00007174486,0.00006417493,0.000068561865,0.00011950141,0.00975878],"genre_scores_gemma":[0.57728046,0.0018888911,0.4006187,0.0004130682,0.00023259717,0.0007475238,0.00038786643,0.00024225695,0.018188613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994956,0.00019906004,0.000019810072,0.00009128237,0.0001338708,0.00006026932],"domain_scores_gemma":[0.9994597,0.00032003724,0.000047271944,0.000025447998,0.00012506536,0.000022470183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009371784,0.0008171619,0.00072784367,0.0008451391,0.0005018706,0.0009548204,0.0008694524,0.0008375407,0.004262412],"category_scores_gemma":[0.0024477374,0.00031965703,0.00046262675,0.00087006396,0.00057295815,0.001264237,0.00085778383,0.00070047646,0.0003891499],"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.00006460671,0.00004991111,0.0007344403,0.00021024405,0.00005483017,0.00012736267,0.00008736295,0.8397842,0.0016100958,0.10260617,0.0049028643,0.0497679],"study_design_scores_gemma":[0.000010840397,0.000017647393,0.00008597844,0.0000101816095,0.00000905193,0.000019953244,0.000015234782,0.97996557,0.00027852738,0.017599368,0.0019826707,0.000005010252],"about_ca_topic_score_codex":0.003134298,"about_ca_topic_score_gemma":0.0017155919,"teacher_disagreement_score":0.004262412,"about_ca_system_score_codex":0.0010690285,"about_ca_system_score_gemma":0.0010051501,"threshold_uncertainty_score":0.014259219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030841436,0.0003563828,0.93826395,0.00056259707,0.00025910023,0.0014236523,0.00025543867,0.014792075,0.01324537],"genre_scores_gemma":[0.4506265,0.0006096287,0.52136034,0.0005523134,0.00017644842,0.0010133977,0.001362726,0.0006179906,0.023680616],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990075,0.00017069606,0.000121946876,0.00016802721,0.000394548,0.00013726045],"domain_scores_gemma":[0.99908113,0.00012637567,0.00005807758,0.00012478391,0.00046911064,0.00014044333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015593865,0.0003674694,0.0005458187,0.0009805617,0.00083313783,0.0020309174,0.0021380484,0.00095150166,0.0033676238],"category_scores_gemma":[0.002403707,0.0003106185,0.0004019511,0.0008106155,0.00049398036,0.0014872886,0.0007255649,0.00076117425,0.0017438957],"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.0017862259,0.001218518,0.010146867,0.0012155432,0.00019679635,0.0014625549,0.002773473,0.027266836,0.18925022,0.10457962,0.035351858,0.62475145],"study_design_scores_gemma":[0.0005371722,0.0007589117,0.004436033,0.00011087253,0.00039407262,0.0011743297,0.00057261274,0.4924906,0.24741901,0.012153483,0.2397645,0.00018844141],"about_ca_topic_score_codex":0.006023416,"about_ca_topic_score_gemma":0.0035465606,"teacher_disagreement_score":0.006023416,"about_ca_system_score_codex":0.0016178049,"about_ca_system_score_gemma":0.002391565,"threshold_uncertainty_score":0.011976719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008291244,0.001628632,0.93399656,0.0022819627,0.0006843499,0.00056345266,0.00006690567,0.000833648,0.051653158],"genre_scores_gemma":[0.3426287,0.0031899058,0.56018484,0.002295449,0.00065375166,0.0016464422,0.00017561564,0.0003715639,0.08885374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990238,0.00025648743,0.000057058744,0.00018258275,0.00037129596,0.000108801614],"domain_scores_gemma":[0.9995565,0.00009385423,0.000031995427,0.000054385164,0.00021543152,0.000047738282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010495291,0.00051628804,0.00032248875,0.0005442138,0.0011416151,0.0022517347,0.0015351803,0.0025054752,0.0064876485],"category_scores_gemma":[0.0012935633,0.00048403288,0.00073331076,0.0004567265,0.00095885166,0.0030544405,0.00074694346,0.0013336404,0.0027710528],"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.000160124,0.00009162095,0.0012593677,0.0008975579,0.00006707576,0.0010609643,0.0014653103,0.009673544,0.04283401,0.8008366,0.010118309,0.13153547],"study_design_scores_gemma":[0.00011204311,0.0007699707,0.0017972226,0.0004133119,0.00023454164,0.004762661,0.00062642636,0.11539573,0.075777166,0.12542777,0.6745029,0.00018017058],"about_ca_topic_score_codex":0.0009241425,"about_ca_topic_score_gemma":0.00062080624,"teacher_disagreement_score":0.0064876485,"about_ca_system_score_codex":0.0009602513,"about_ca_system_score_gemma":0.00080856885,"threshold_uncertainty_score":0.021703303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011506249,0.0011777263,0.82718337,0.001611115,0.00079638127,0.0011229363,0.001307262,0.0053761606,0.14991872],"genre_scores_gemma":[0.2558889,0.004931619,0.64497477,0.0011607656,0.00050829805,0.0029366796,0.005561782,0.0010142755,0.08302293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833447,0.00035766285,0.00023621276,0.0003136939,0.00061578106,0.00014225338],"domain_scores_gemma":[0.99950445,0.00006528382,0.000038234404,0.00013612781,0.0001952788,0.00006055452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013679275,0.0006208888,0.0004223329,0.0015929147,0.0019148509,0.004347411,0.0018017534,0.0020804398,0.007234164],"category_scores_gemma":[0.0011630711,0.00047839116,0.0009271027,0.0012677526,0.0013665687,0.005331973,0.0014978024,0.0017284876,0.0038169753],"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.000089069,0.00008483459,0.0012022458,0.00030808954,0.000036498765,0.0014992979,0.001464057,0.0060501164,0.008374775,0.88569427,0.021701956,0.07349479],"study_design_scores_gemma":[0.00008938551,0.00015889588,0.0016016031,0.00033968012,0.000105344865,0.0044095824,0.0011469299,0.09271336,0.01751118,0.17447723,0.7072508,0.0001960348],"about_ca_topic_score_codex":0.004477897,"about_ca_topic_score_gemma":0.0022697668,"teacher_disagreement_score":0.007234164,"about_ca_system_score_codex":0.0013018047,"about_ca_system_score_gemma":0.0023506638,"threshold_uncertainty_score":0.024200678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3412405,0.00063101697,0.59931815,0.00040687236,0.00012769937,0.00019685412,0.000031215688,0.0012140844,0.05683356],"genre_scores_gemma":[0.9525712,0.0002063785,0.03323624,0.00004592511,0.000019010946,0.0001304904,0.00003821075,0.000028399041,0.013724168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993337,0.00027806507,0.000027000577,0.0000973253,0.00016982465,0.000093974355],"domain_scores_gemma":[0.99953175,0.00017149658,0.000036002322,0.000060504284,0.00009519695,0.00010508319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000705299,0.0003064829,0.0003248258,0.000377504,0.0006597838,0.0011478651,0.00093137415,0.0004941085,0.0032387313],"category_scores_gemma":[0.0011454746,0.0001727932,0.00025399626,0.00021235216,0.0006379937,0.0015827202,0.001041765,0.00038761762,0.00045426417],"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.0016268397,0.00076008897,0.012646877,0.00068508944,0.00017271157,0.0025662328,0.014962232,0.043800514,0.18861322,0.43713897,0.0065619317,0.2904653],"study_design_scores_gemma":[0.0002410762,0.0021046821,0.008496471,0.00014596905,0.00019696624,0.0033763365,0.0034238703,0.7780334,0.07967598,0.042450726,0.08167225,0.00018223959],"about_ca_topic_score_codex":0.0009448459,"about_ca_topic_score_gemma":0.0005180928,"teacher_disagreement_score":0.0032387313,"about_ca_system_score_codex":0.0003720541,"about_ca_system_score_gemma":0.00047168063,"threshold_uncertainty_score":0.010834634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014644316,0.00057680876,0.9773685,0.00026941567,0.00020900911,0.00015155412,0.00014072345,0.0013526642,0.005287101],"genre_scores_gemma":[0.5045865,0.0012086265,0.479622,0.00026413536,0.00044051625,0.00048127776,0.00066111697,0.00027162608,0.012464197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900633,0.00018980111,0.000052282736,0.00018517554,0.00048263627,0.00008379382],"domain_scores_gemma":[0.99930215,0.00015163631,0.000048020935,0.00013937271,0.00030517398,0.0000536362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075190404,0.0003663883,0.0005809463,0.0010570297,0.0014511261,0.0011364227,0.0015067209,0.0006550758,0.0029891306],"category_scores_gemma":[0.0015852939,0.000225194,0.0003812803,0.0015322214,0.0004608916,0.0019057456,0.001011938,0.0005841809,0.0008364923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005079978,0.00019990034,0.001970736,0.00040296387,0.00015590763,0.0002900995,0.00066193956,0.12708512,0.044233948,0.08079409,0.021410145,0.7222871],"study_design_scores_gemma":[0.00015483066,0.00013367734,0.00093811395,0.00002788769,0.000055334232,0.00033476512,0.00017591238,0.91413903,0.018383514,0.03197909,0.033608228,0.000069668145],"about_ca_topic_score_codex":0.0033640843,"about_ca_topic_score_gemma":0.002784409,"teacher_disagreement_score":0.0033640843,"about_ca_system_score_codex":0.0008545573,"about_ca_system_score_gemma":0.0008968692,"threshold_uncertainty_score":0.009999692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010959884,0.0007951923,0.9805022,0.0004742205,0.00021035984,0.00031882626,0.0010665088,0.003941944,0.0017309546],"genre_scores_gemma":[0.22574948,0.0009660774,0.7610428,0.0003567396,0.00028080892,0.0006981476,0.0051356223,0.0003939175,0.005376469],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743015,0.00032085276,0.00043429222,0.000353902,0.0012775946,0.0001832236],"domain_scores_gemma":[0.99433196,0.0009313441,0.000563208,0.0029520434,0.000914913,0.00030648962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021595478,0.0005886066,0.0015356469,0.0022173505,0.0021388198,0.00263241,0.0043564714,0.0014934721,0.0033189561],"category_scores_gemma":[0.0070072687,0.0008923443,0.00079118385,0.0035512298,0.0014624638,0.005930108,0.004415195,0.0018145916,0.0020293032],"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.0012047571,0.00043765898,0.0049068145,0.0013361764,0.00020283808,0.00077763794,0.001008423,0.09020073,0.044803128,0.17486195,0.038458854,0.6418011],"study_design_scores_gemma":[0.00045327554,0.0016574928,0.0026235878,0.00018845235,0.00023119609,0.0030352355,0.0006022492,0.50904495,0.074723914,0.17179346,0.23522699,0.00041925453],"about_ca_topic_score_codex":0.0013715494,"about_ca_topic_score_gemma":0.0011356074,"teacher_disagreement_score":0.0043564714,"about_ca_system_score_codex":0.0012947725,"about_ca_system_score_gemma":0.0014839711,"threshold_uncertainty_score":0.011420906},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022851784,0.35940862,0.13213226,0.28699744,0.0057688584,0.00019952949,0.00038895497,0.00067046186,0.19158214],"genre_scores_gemma":[0.48846337,0.33606052,0.097822234,0.028413706,0.017330414,0.0006974346,0.00034710098,0.00092461973,0.02994053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9844364,0.0069473186,0.00061699667,0.0028550893,0.0043799854,0.00076411426],"domain_scores_gemma":[0.95142394,0.03575703,0.0011163622,0.004884469,0.005014617,0.001803555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019230094,0.0012138798,0.0025063416,0.0036456299,0.0040940517,0.014793933,0.0034419405,0.008656335,0.006562403],"category_scores_gemma":[0.04778759,0.0012915166,0.0010058192,0.003893252,0.033292964,0.045127597,0.007107605,0.013201393,0.0029851783],"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.0000721945,0.000047885922,0.0004087625,0.0004892452,0.000027872564,0.00012620362,0.0015657482,0.0015178784,0.00024223853,0.93043786,0.009399499,0.05566453],"study_design_scores_gemma":[0.000034139153,0.000079156765,0.00044980284,0.0010460683,0.000019936906,0.00017440824,0.001246314,0.0047373325,0.00036392757,0.7169992,0.2747823,0.000067352936],"about_ca_topic_score_codex":0.0038203218,"about_ca_topic_score_gemma":0.0017667187,"teacher_disagreement_score":0.019230094,"about_ca_system_score_codex":0.0074145156,"about_ca_system_score_gemma":0.005794939,"threshold_uncertainty_score":0.10169971},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5074871,0.0018916335,0.4117158,0.0023402816,0.0008474556,0.0012396878,0.0013973434,0.015386779,0.057693835],"genre_scores_gemma":[0.94104207,0.0005205327,0.047577944,0.00021463273,0.00019660301,0.00014101595,0.0007092283,0.00044917595,0.0091488175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983589,0.00041154365,0.0001314189,0.00020719979,0.0006669974,0.00022401138],"domain_scores_gemma":[0.9946936,0.0020710116,0.0004154245,0.0011486587,0.0007155628,0.0009557808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024854974,0.00064085244,0.000746414,0.0009911932,0.0014418014,0.003170827,0.0016535508,0.0009721641,0.0084129535],"category_scores_gemma":[0.01449746,0.00041437635,0.00034791068,0.0011712856,0.00043612169,0.0036425362,0.0019667635,0.0015231547,0.0025318689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031860273,0.0029942237,0.036840364,0.0006649494,0.00017314804,0.0021914837,0.0017969307,0.1283167,0.070880316,0.10713622,0.04002237,0.6057972],"study_design_scores_gemma":[0.00019187765,0.0003486077,0.008613391,0.00003013207,0.0000722553,0.0009289425,0.00051474886,0.8945729,0.012543973,0.04782915,0.0342879,0.00006617172],"about_ca_topic_score_codex":0.0027171967,"about_ca_topic_score_gemma":0.004013412,"teacher_disagreement_score":0.0084129535,"about_ca_system_score_codex":0.0007985808,"about_ca_system_score_gemma":0.0010135566,"threshold_uncertainty_score":0.028144121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82883537,0.00032925865,0.124224946,0.0015974616,0.00023345185,0.0015276879,0.00086887984,0.009056967,0.03332596],"genre_scores_gemma":[0.94924265,0.00023091608,0.04221703,0.00018844592,0.000046138703,0.00028885077,0.0007412093,0.000475567,0.0065691373],"study_design_codex":"design_other","study_design_gemma":"case_report","domain_scores_codex":[0.9957712,0.0013770883,0.00040391312,0.0005865495,0.0012260311,0.00063514797],"domain_scores_gemma":[0.99450195,0.002151358,0.0003279839,0.0010802434,0.0012056303,0.00073278474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019477654,0.000876212,0.0004603491,0.001036653,0.0013042166,0.0016642072,0.0021974558,0.001777113,0.0032552273],"category_scores_gemma":[0.005600946,0.00054655795,0.0005259414,0.0010664718,0.0009740346,0.002326838,0.001523412,0.0015070747,0.0019062355],"study_design_candidate":"case_report","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027838172,0.006780956,0.09039485,0.0029588994,0.00035669917,0.049088307,0.018706953,0.22747608,0.119653426,0.043251134,0.061169636,0.37737933],"study_design_scores_gemma":[0.00067791285,0.0037003504,0.056675404,0.00032934482,0.0002327891,0.014187821,0.009945615,0.54664046,0.14154127,0.009437805,0.21635059,0.00028058473],"about_ca_topic_score_codex":0.005861808,"about_ca_topic_score_gemma":0.0058410517,"teacher_disagreement_score":0.005861808,"about_ca_system_score_codex":0.0013490123,"about_ca_system_score_gemma":0.00100231,"threshold_uncertainty_score":0.01165539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06298145,0.00022219667,0.9146108,0.00050693675,0.00007487864,0.00047657304,0.00054011174,0.0022828062,0.018304281],"genre_scores_gemma":[0.55844027,0.0003421368,0.43550953,0.00007232868,0.0000137895395,0.00027793646,0.00081163313,0.00033693496,0.0041954336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906427,0.00029709752,0.00005111862,0.00018345869,0.00025833503,0.00014578472],"domain_scores_gemma":[0.99857914,0.00076705375,0.00010038535,0.0002925159,0.00015235778,0.000108525455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094965263,0.00073928543,0.00044708396,0.00072576373,0.0010656406,0.0010855354,0.0014209576,0.00084149453,0.004465178],"category_scores_gemma":[0.004148903,0.00051136,0.00077396916,0.00070222194,0.0013314049,0.0020600106,0.0021560274,0.0012138607,0.0006588745],"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.000080556165,0.00008833032,0.0013901737,0.00016544222,0.000030076932,0.0005549556,0.0004648175,0.85090125,0.007675343,0.05672847,0.0042758137,0.077644795],"study_design_scores_gemma":[0.000018065055,0.000047341935,0.0002478835,0.000018831752,0.000017192255,0.00013524987,0.00036415688,0.9392936,0.0046320586,0.044214748,0.010993514,0.000017353206],"about_ca_topic_score_codex":0.006951734,"about_ca_topic_score_gemma":0.011748214,"teacher_disagreement_score":0.006951734,"about_ca_system_score_codex":0.0010850809,"about_ca_system_score_gemma":0.0018080996,"threshold_uncertainty_score":0.01493758},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013752745,0.0007124526,0.9663476,0.0006496922,0.00011820506,0.00040154785,0.00013988237,0.005624224,0.012253697],"genre_scores_gemma":[0.42595118,0.0012792257,0.55692697,0.00026971422,0.00014146227,0.0006427227,0.0012899138,0.00050561724,0.012993199],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657357,0.0007183298,0.00028244662,0.0008561339,0.0012410773,0.00032851266],"domain_scores_gemma":[0.9970594,0.0005513349,0.0002641416,0.0013925586,0.00046838218,0.00026414613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039591193,0.00066196744,0.0006852128,0.00093716185,0.0015446071,0.004085244,0.0028196215,0.001069219,0.0029049378],"category_scores_gemma":[0.0051388624,0.0005981634,0.00073061127,0.0013759225,0.0009183042,0.0035059198,0.0038379233,0.0018414259,0.0018017602],"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.00038307722,0.0005472744,0.0027858687,0.00033163547,0.00016798502,0.0005843905,0.0011404237,0.09933001,0.03941126,0.16776313,0.019048128,0.6685069],"study_design_scores_gemma":[0.0001775052,0.00015317905,0.0013165032,0.00010042873,0.00007514609,0.00048139153,0.00034043836,0.6195727,0.026836682,0.19931611,0.15154876,0.00008108881],"about_ca_topic_score_codex":0.001713629,"about_ca_topic_score_gemma":0.001597844,"teacher_disagreement_score":0.004085244,"about_ca_system_score_codex":0.0012748981,"about_ca_system_score_gemma":0.002124669,"threshold_uncertainty_score":0.020938098},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12518501,0.00053211744,0.86799306,0.00047096395,0.00012827784,0.00022550464,0.00016754217,0.001457983,0.003839501],"genre_scores_gemma":[0.9331962,0.00035546397,0.06364584,0.000047744874,0.000058281636,0.00009235562,0.00013394724,0.000042923308,0.0024271258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778444,0.00052422745,0.00021166244,0.0003464205,0.00093826745,0.0001951029],"domain_scores_gemma":[0.993244,0.0032459383,0.00075437006,0.0014996856,0.00093115814,0.0003249232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032437074,0.0004591967,0.0009833116,0.0011456318,0.001826881,0.0024675394,0.0012237075,0.00091424334,0.0012161493],"category_scores_gemma":[0.009357079,0.00034926273,0.0004446482,0.001119647,0.0008429158,0.0025459041,0.002199529,0.00073719636,0.0003574428],"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.0014312008,0.00043496472,0.010202675,0.000569657,0.00026725643,0.0032437162,0.002777431,0.43296623,0.06581533,0.16024342,0.004691286,0.3173568],"study_design_scores_gemma":[0.00007238107,0.00013625945,0.00066645694,0.000019058918,0.00008520485,0.00036994627,0.0002900065,0.92930996,0.021026848,0.040349107,0.007630135,0.000044618973],"about_ca_topic_score_codex":0.0021136748,"about_ca_topic_score_gemma":0.001636374,"teacher_disagreement_score":0.0032437074,"about_ca_system_score_codex":0.0010485662,"about_ca_system_score_gemma":0.0014509527,"threshold_uncertainty_score":0.017154634},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05528905,0.6580767,0.1957702,0.005152378,0.0004730399,0.00044527114,0.00026783173,0.0009664915,0.08355904],"genre_scores_gemma":[0.18993156,0.71794087,0.08178824,0.0012812191,0.00054237735,0.00027815398,0.0006760799,0.00021559894,0.007345886],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957474,0.001002578,0.0005798119,0.00055613526,0.0017568567,0.00035712286],"domain_scores_gemma":[0.991277,0.0053796424,0.0006580693,0.0005875196,0.0018010929,0.0002966535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044683567,0.0008306511,0.00084227667,0.0081780255,0.0008762877,0.004412886,0.0016054712,0.0014177543,0.0017815281],"category_scores_gemma":[0.007865885,0.00079724524,0.00076657435,0.013464887,0.0011569776,0.008832899,0.0013952857,0.0019968648,0.0010297691],"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.00008971351,0.0003014681,0.008235065,0.005881682,0.00006988828,0.00031248268,0.0021925557,0.003610603,0.0039202557,0.061516736,0.007677912,0.90619165],"study_design_scores_gemma":[0.000025953103,0.0005871757,0.023490926,0.010016989,0.00023031438,0.0047521084,0.009873434,0.021485656,0.0093949055,0.043059263,0.87689537,0.00018790615],"about_ca_topic_score_codex":0.002044164,"about_ca_topic_score_gemma":0.0014547291,"teacher_disagreement_score":0.0081780255,"about_ca_system_score_codex":0.0017749893,"about_ca_system_score_gemma":0.002224757,"threshold_uncertainty_score":0.023631155},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036570858,0.035482302,0.20232053,0.0013953637,0.0029294125,0.00021431148,0.0007262157,0.0055617047,0.747713],"genre_scores_gemma":[0.051861785,0.027675856,0.08317306,0.00099545,0.0007990302,0.0002057007,0.0010063814,0.0005886571,0.83369404],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999699,0.000046550736,0.000012252859,0.000059913065,0.00014102987,0.00004127039],"domain_scores_gemma":[0.99972135,0.00006642111,0.000008674987,0.00008709043,0.000075418015,0.00004100203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022309218,0.0009397142,0.0005720848,0.0011263845,0.0007934421,0.0027997273,0.0015765264,0.0011031543,0.09409834],"category_scores_gemma":[0.0007950966,0.00024577876,0.0003389851,0.0026742457,0.0005475362,0.003047586,0.0016221529,0.0011543026,0.054484442],"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.00008016461,0.00005196351,0.00011705291,0.00064515363,0.000022689057,0.00029496988,0.00029864366,0.0011605597,0.006610759,0.09740823,0.1892383,0.7040716],"study_design_scores_gemma":[0.000009520623,0.000049159284,0.00014995172,0.00016765312,0.0000102634085,0.0006685882,0.000081887025,0.0028374041,0.002789051,0.01633473,0.9768794,0.000022403752],"about_ca_topic_score_codex":0.00062127,"about_ca_topic_score_gemma":0.0010478107,"teacher_disagreement_score":0.09409834,"about_ca_system_score_codex":0.00052460085,"about_ca_system_score_gemma":0.0003772687,"threshold_uncertainty_score":0.31479025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01249079,0.0052199056,0.91229546,0.0014649676,0.00041699523,0.00015424058,0.00035766067,0.00185451,0.06574549],"genre_scores_gemma":[0.4202832,0.015841695,0.4641968,0.0008073464,0.00063366623,0.0004155564,0.0013036354,0.0005490426,0.09596901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863344,0.00041809902,0.00012511353,0.00020411867,0.0005358781,0.000083349856],"domain_scores_gemma":[0.99907947,0.0005666294,0.000042731695,0.00017432195,0.000094188734,0.000042564618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017889802,0.00046130808,0.0005438552,0.0005819441,0.00080528134,0.0043707965,0.0010085885,0.0011985924,0.0073125497],"category_scores_gemma":[0.003666606,0.0005250428,0.00051418314,0.002179292,0.0014352136,0.0058580805,0.00197908,0.0017641381,0.0019124892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004322819,0.000031960208,0.000272776,0.00021945298,0.000013072936,0.00026947676,0.000795079,0.015609132,0.0018084614,0.9007837,0.006528161,0.07362543],"study_design_scores_gemma":[0.000041361454,0.000044451615,0.0003102322,0.00013455331,0.000034931425,0.00044621874,0.0005064001,0.083182044,0.003363836,0.5702685,0.34162995,0.00003752584],"about_ca_topic_score_codex":0.0017671442,"about_ca_topic_score_gemma":0.0015099015,"teacher_disagreement_score":0.0073125497,"about_ca_system_score_codex":0.0013875029,"about_ca_system_score_gemma":0.0008058728,"threshold_uncertainty_score":0.024462879},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015732432,0.004462333,0.89569485,0.001499189,0.0006025002,0.00037315168,0.001109519,0.012732908,0.06779308],"genre_scores_gemma":[0.26002365,0.007702625,0.6047515,0.0009373807,0.00065036403,0.00038116195,0.0057964576,0.0018177822,0.11793904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992424,0.00018510202,0.000052072788,0.00011844473,0.00036149952,0.00004050076],"domain_scores_gemma":[0.99882036,0.0004180315,0.00005509968,0.00040131944,0.0002573161,0.00004784117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010284627,0.0004346512,0.0004388627,0.0011420045,0.00048103856,0.0020839374,0.0015401887,0.00096606597,0.009635545],"category_scores_gemma":[0.0031266047,0.00025769568,0.00032611506,0.0019042033,0.0004242981,0.0024834764,0.001549048,0.0008074901,0.003966324],"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.00017966545,0.00012443603,0.0005189945,0.00062700734,0.000045065935,0.0002711282,0.0004266434,0.011904127,0.048079573,0.097159885,0.06499103,0.77567244],"study_design_scores_gemma":[0.00014653504,0.00014774603,0.0010907422,0.00017323396,0.00008736716,0.000959196,0.00023063346,0.17191607,0.070771016,0.07989202,0.6745176,0.00006785279],"about_ca_topic_score_codex":0.0008664065,"about_ca_topic_score_gemma":0.00071618496,"teacher_disagreement_score":0.009635545,"about_ca_system_score_codex":0.0007335089,"about_ca_system_score_gemma":0.0005782866,"threshold_uncertainty_score":0.032234073},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03847074,0.020327833,0.7528072,0.004479998,0.0013079168,0.0005461894,0.00040264992,0.008620191,0.17303729],"genre_scores_gemma":[0.45126674,0.018803151,0.3770418,0.00064815814,0.0010520323,0.0004966303,0.000841727,0.0007162302,0.14913367],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999663,0.00006394584,0.000021882994,0.0000522617,0.00017068413,0.00002819353],"domain_scores_gemma":[0.9997936,0.00008359683,0.00001394643,0.000045113284,0.000038129623,0.000025620022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042500472,0.00041171093,0.00040546226,0.00042158357,0.0008827935,0.0022222733,0.00133019,0.0011359429,0.0074559273],"category_scores_gemma":[0.0008920294,0.0003677655,0.00031211908,0.0010775889,0.0003625951,0.002204345,0.0009656722,0.001028138,0.004214439],"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.00025068803,0.00016348604,0.00094500376,0.0010475802,0.000055839213,0.0019735645,0.0009366282,0.016114926,0.0552995,0.14557198,0.07086616,0.7067746],"study_design_scores_gemma":[0.000085149884,0.00020195602,0.0012457924,0.00024821292,0.000102859754,0.002685766,0.00032719874,0.12939379,0.020487955,0.06266087,0.78246516,0.00009522811],"about_ca_topic_score_codex":0.0008755916,"about_ca_topic_score_gemma":0.0009876507,"teacher_disagreement_score":0.0074559273,"about_ca_system_score_codex":0.00050780474,"about_ca_system_score_gemma":0.00055378664,"threshold_uncertainty_score":0.024942517},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023685139,0.004736941,0.54657036,0.0007178038,0.0014134342,0.00042346367,0.0007893203,0.026536092,0.3951274],"genre_scores_gemma":[0.19596377,0.00527841,0.24876417,0.00025066192,0.0011472458,0.00040204707,0.004193158,0.0031789183,0.5408217],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984921,0.00025674456,0.00007205185,0.00029087425,0.00074235845,0.00014588643],"domain_scores_gemma":[0.9975228,0.0004783109,0.000084008076,0.0013901134,0.00033090747,0.00019394474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012456622,0.0011688381,0.0011604549,0.0019011155,0.0013426432,0.0034732034,0.0023550717,0.0018258152,0.037706684],"category_scores_gemma":[0.0025992882,0.0007114531,0.00081285485,0.002521735,0.0004551239,0.004862701,0.0044039832,0.0011509883,0.027625237],"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.00020753207,0.00026985654,0.00055586256,0.00035760278,0.00005255575,0.0004042598,0.0005520488,0.0056764414,0.018539438,0.040891375,0.102287486,0.83020556],"study_design_scores_gemma":[0.000072947216,0.00030368657,0.0020906627,0.00026396677,0.00011716134,0.002546663,0.0005306001,0.09521341,0.03244298,0.07023275,0.7960612,0.00012392704],"about_ca_topic_score_codex":0.0006302348,"about_ca_topic_score_gemma":0.0009780616,"teacher_disagreement_score":0.037706684,"about_ca_system_score_codex":0.00045178348,"about_ca_system_score_gemma":0.00057894643,"threshold_uncertainty_score":0.12614137},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005255481,0.05753101,0.45443535,0.002647335,0.0031530496,0.0008332124,0.00037903877,0.0071677063,0.46859783],"genre_scores_gemma":[0.042093918,0.058371194,0.35666427,0.0014244261,0.0014987827,0.0006442104,0.0011666466,0.0019383652,0.53619814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995459,0.00003781811,0.00001372304,0.00005233887,0.00032046463,0.000029888526],"domain_scores_gemma":[0.99981207,0.00006696319,0.000011807764,0.000035459307,0.000047166013,0.0000265716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775693,0.0007834918,0.0004345777,0.0008594139,0.0009163722,0.0021045583,0.0014145876,0.0013672424,0.03088442],"category_scores_gemma":[0.000774775,0.00046734518,0.00044025716,0.0017013428,0.0004660453,0.0042148395,0.0015127525,0.0019356118,0.020526657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046790097,0.00010684418,0.00011426699,0.0010839924,0.000026083597,0.0005469808,0.0006009569,0.0049321624,0.013340842,0.27469084,0.19688396,0.5076263],"study_design_scores_gemma":[0.00001108775,0.000038399616,0.00016628922,0.00018905388,0.000008937255,0.00073857344,0.00008139819,0.006877172,0.0014235106,0.03487915,0.9555638,0.000022562563],"about_ca_topic_score_codex":0.0007529229,"about_ca_topic_score_gemma":0.0016184202,"teacher_disagreement_score":0.03088442,"about_ca_system_score_codex":0.0007575849,"about_ca_system_score_gemma":0.00088220864,"threshold_uncertainty_score":0.10331863},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00215108,0.0023753608,0.9841622,0.00054983806,0.00018851981,0.00014982984,0.00014012729,0.00043687486,0.009846165],"genre_scores_gemma":[0.14903484,0.009255063,0.8161578,0.00032091475,0.0004221665,0.0006868327,0.000593041,0.00020582562,0.023323605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986808,0.00041785152,0.00011678587,0.00017424459,0.00053762755,0.00007263387],"domain_scores_gemma":[0.9987208,0.00082808733,0.00011618677,0.00017415754,0.00011707279,0.000043649765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027114965,0.0012842604,0.0012340724,0.0012749819,0.0010688285,0.0038427864,0.002725164,0.0024021366,0.005992968],"category_scores_gemma":[0.003046689,0.0007901369,0.0012484529,0.0032596441,0.0017494672,0.0051588914,0.0015495303,0.0023972269,0.0017214458],"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.000047994,0.000074483156,0.00025694715,0.0004941228,0.00006469845,0.0005068734,0.00041291188,0.12933053,0.0021323303,0.79184306,0.0052863434,0.06954965],"study_design_scores_gemma":[0.000042200234,0.000051404895,0.000117847565,0.00010722102,0.00007080142,0.00032082837,0.00010255631,0.518769,0.0019772488,0.41067994,0.0677155,0.000045477373],"about_ca_topic_score_codex":0.0033796066,"about_ca_topic_score_gemma":0.0025282635,"teacher_disagreement_score":0.005992968,"about_ca_system_score_codex":0.001491753,"about_ca_system_score_gemma":0.0014819645,"threshold_uncertainty_score":0.0200485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10480452,0.0048150476,0.7450314,0.0017454021,0.0012598166,0.0010534864,0.0016865036,0.05704026,0.08256351],"genre_scores_gemma":[0.6032397,0.002456607,0.33480865,0.00052596605,0.0004718269,0.0003722377,0.00460827,0.001929139,0.051587585],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823654,0.00026089285,0.00012202266,0.000297138,0.00090398535,0.00017937522],"domain_scores_gemma":[0.9965563,0.00063131977,0.00018486432,0.0015793496,0.0008917456,0.00015646855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082482083,0.0010099376,0.0012402129,0.002913375,0.0019977174,0.0031554564,0.0024941664,0.0017959627,0.0035745555],"category_scores_gemma":[0.0044866805,0.00057140744,0.00066556624,0.00327023,0.0005623692,0.0033173207,0.0026628724,0.0012089332,0.0039757164],"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.00051280885,0.00051449245,0.0034502984,0.0010004047,0.00018584204,0.0013967481,0.00046103506,0.03776359,0.039419785,0.025541468,0.08641259,0.803341],"study_design_scores_gemma":[0.00009536408,0.00026780443,0.0029561748,0.000116505806,0.00016036011,0.004112982,0.0004026483,0.7895729,0.060500927,0.040466473,0.101255044,0.00009281622],"about_ca_topic_score_codex":0.0023210933,"about_ca_topic_score_gemma":0.0033339951,"teacher_disagreement_score":0.0035745555,"about_ca_system_score_codex":0.0005753831,"about_ca_system_score_gemma":0.001071547,"threshold_uncertainty_score":0.011958063},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026523615,0.64018375,0.16579817,0.0138645405,0.014659491,0.00035191604,0.0021948488,0.0055520376,0.15474294],"genre_scores_gemma":[0.014061779,0.3558588,0.07100584,0.0015963917,0.005528939,0.0002133201,0.0044550966,0.0014069598,0.5458728],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986657,0.0001336659,0.00008194517,0.00018973765,0.00082917005,0.000099797995],"domain_scores_gemma":[0.99815553,0.00052390853,0.00006737118,0.00023326364,0.00074814406,0.00027187043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019680301,0.0018667846,0.00193226,0.0021782375,0.0012090172,0.0068334076,0.0020238622,0.0014991602,0.03348879],"category_scores_gemma":[0.0025247158,0.0016981362,0.0006173692,0.007597732,0.0018726029,0.008231923,0.0021080321,0.002914949,0.025243899],"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.000073843956,0.000045319175,0.00018336298,0.0012911345,0.00003720218,0.00011629191,0.00027713465,0.00110885,0.002854567,0.027000507,0.70084697,0.26616475],"study_design_scores_gemma":[0.000014732441,0.000030571773,0.00041149298,0.00025136638,0.000021142043,0.00044300163,0.00011392357,0.001585465,0.00088432635,0.012034232,0.9841905,0.000019318299],"about_ca_topic_score_codex":0.014884296,"about_ca_topic_score_gemma":0.028983966,"teacher_disagreement_score":0.03348879,"about_ca_system_score_codex":0.003324216,"about_ca_system_score_gemma":0.0051390235,"threshold_uncertainty_score":0.1120311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05483918,0.0017693148,0.8831419,0.00084376364,0.0011288053,0.0010399856,0.0008009904,0.044610173,0.011825911],"genre_scores_gemma":[0.42262864,0.0008808172,0.5542516,0.0005354454,0.00047875138,0.0007284509,0.0013518692,0.0013140921,0.017830258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984555,0.00036279325,0.00011540651,0.00022329377,0.00069173676,0.00015118973],"domain_scores_gemma":[0.9982247,0.00037286858,0.00010255803,0.0003747691,0.0004684953,0.00045660159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013623273,0.00092507503,0.0022535587,0.0012012533,0.0015092008,0.0021000279,0.0040930444,0.0013693509,0.009834618],"category_scores_gemma":[0.0036193666,0.00081214716,0.0003877834,0.0015152632,0.00087927905,0.0026913506,0.0037405023,0.0012382222,0.0050622295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008729037,0.0011194977,0.002220612,0.0013180922,0.00047278497,0.0010159723,0.0010456434,0.14929818,0.0944605,0.035354633,0.11501618,0.5899489],"study_design_scores_gemma":[0.0013435971,0.0012141805,0.00085911853,0.000066757,0.00021639664,0.00072582485,0.00023415113,0.8532068,0.031033613,0.028029116,0.082815096,0.0002553499],"about_ca_topic_score_codex":0.0032896197,"about_ca_topic_score_gemma":0.0033158737,"teacher_disagreement_score":0.009834618,"about_ca_system_score_codex":0.0005990435,"about_ca_system_score_gemma":0.0014307922,"threshold_uncertainty_score":0.032900095},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33852324,0.00031302028,0.6515958,0.0009008495,0.00007045838,0.00047364758,0.000090865076,0.003926562,0.0041056215],"genre_scores_gemma":[0.89763576,0.00011241288,0.10039191,0.00012086567,0.000054952896,0.000104855,0.00008152062,0.0000657628,0.0014318051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801046,0.0007242208,0.00013043845,0.00039950592,0.0006123295,0.00012305673],"domain_scores_gemma":[0.9932308,0.0034673586,0.00074848393,0.0013735698,0.0008273114,0.00035239858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003742443,0.0006310621,0.0008407455,0.0009891386,0.0014021358,0.0018706965,0.0013841355,0.0009928136,0.0006476402],"category_scores_gemma":[0.00980414,0.00029616346,0.00042647205,0.0008638531,0.00072465447,0.0032768364,0.0013741913,0.0009461787,0.00023251938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002081115,0.0023996027,0.03392918,0.00037152853,0.00028496733,0.0011681197,0.0047644284,0.15229708,0.11605004,0.03798178,0.008305615,0.6403666],"study_design_scores_gemma":[0.0001572592,0.00062608323,0.0062888414,0.00002254552,0.00010257106,0.00038343453,0.00056156755,0.9386492,0.02529452,0.019839643,0.008005066,0.00006926578],"about_ca_topic_score_codex":0.0037611106,"about_ca_topic_score_gemma":0.0026980003,"teacher_disagreement_score":0.0037611106,"about_ca_system_score_codex":0.0007808261,"about_ca_system_score_gemma":0.0012754902,"threshold_uncertainty_score":0.01979214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37383568,0.0010178668,0.609258,0.001726578,0.0001886082,0.0002529114,0.0003909186,0.00041515517,0.012914443],"genre_scores_gemma":[0.95498854,0.0009459887,0.03536365,0.00011739133,0.00009478006,0.00024086976,0.00014869105,0.000051686355,0.008048311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928397,0.00024163107,0.00003659265,0.00012871096,0.00017861996,0.00013058285],"domain_scores_gemma":[0.99719536,0.0019505132,0.00034614798,0.00011274707,0.0002794405,0.00011572256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011107313,0.00072627503,0.00073113956,0.00089273084,0.00096233445,0.0013900058,0.0017260876,0.0029068815,0.0013300445],"category_scores_gemma":[0.007023638,0.0006875074,0.00074477564,0.00077723194,0.0013826895,0.0021472648,0.0012650555,0.00108493,0.0003215331],"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.000011320414,0.000019571806,0.001074946,0.000018435945,0.000012580378,0.00010879943,0.00008005934,0.975365,0.00065287005,0.020533811,0.00023917037,0.0018834233],"study_design_scores_gemma":[0.0000044963886,0.0000070993783,0.00008766324,0.000002187064,0.000003319295,0.000016896298,0.0000138491905,0.9945227,0.00007912443,0.005030276,0.00022821581,0.0000041536914],"about_ca_topic_score_codex":0.019959388,"about_ca_topic_score_gemma":0.007874162,"teacher_disagreement_score":0.019959388,"about_ca_system_score_codex":0.0017116667,"about_ca_system_score_gemma":0.0013275065,"threshold_uncertainty_score":0.03968644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03841105,0.0014461582,0.9503278,0.0011208009,0.00012974704,0.00015712035,0.000028853296,0.00066011376,0.0077184243],"genre_scores_gemma":[0.86287594,0.0011252653,0.1296814,0.00019554068,0.0002944041,0.00027238642,0.00006059763,0.000059962513,0.005434523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986394,0.00057214906,0.000071006514,0.00022935616,0.00036986565,0.00011822276],"domain_scores_gemma":[0.99627894,0.001999187,0.00048014868,0.000760127,0.0002699394,0.00021160851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023746272,0.00032918065,0.0006137687,0.00066274387,0.0017016261,0.0023297765,0.0013770971,0.001338047,0.0015162525],"category_scores_gemma":[0.004782484,0.00034517684,0.00023985787,0.0012913463,0.0022006354,0.0042593023,0.0024605116,0.0011341139,0.0003702166],"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.00023957585,0.0002531883,0.0022158178,0.00037313008,0.00006793972,0.0008451474,0.0016982761,0.24882561,0.013800115,0.445867,0.007928114,0.2778861],"study_design_scores_gemma":[0.00005267196,0.00018430698,0.0005843979,0.00004354125,0.00003737039,0.00030827956,0.0004867025,0.73804164,0.0051752003,0.23491837,0.020121247,0.00004626163],"about_ca_topic_score_codex":0.000929014,"about_ca_topic_score_gemma":0.0009732002,"teacher_disagreement_score":0.0023746272,"about_ca_system_score_codex":0.0010357457,"about_ca_system_score_gemma":0.00073580415,"threshold_uncertainty_score":0.012558401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01041877,0.0038361899,0.74538857,0.0050964174,0.0023536866,0.0024111245,0.009933438,0.05993923,0.16062261],"genre_scores_gemma":[0.21571371,0.0073109623,0.40172243,0.0055739274,0.0022262926,0.0034216042,0.05074577,0.014384819,0.29890046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99564254,0.0004763762,0.0005609172,0.0009473041,0.0018972182,0.0004755469],"domain_scores_gemma":[0.9903486,0.001306605,0.00043898355,0.004378647,0.0028248276,0.0007024587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004731319,0.0010426193,0.0012092026,0.0037073707,0.0028300984,0.009533641,0.005173213,0.0014792066,0.038958356],"category_scores_gemma":[0.013529902,0.00065649825,0.00084410777,0.00492334,0.0010821662,0.008222909,0.0070756483,0.0022433598,0.027814573],"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.00039840757,0.0002753608,0.0032092133,0.00062484166,0.00007366672,0.00032571453,0.00095556694,0.004277009,0.008304703,0.13036191,0.291367,0.55982655],"study_design_scores_gemma":[0.000045448174,0.000060201983,0.00076459156,0.00015747528,0.000038408092,0.00046011346,0.00032283505,0.013222572,0.01438338,0.029657176,0.94082135,0.000066446446],"about_ca_topic_score_codex":0.0028044265,"about_ca_topic_score_gemma":0.0011355722,"teacher_disagreement_score":0.038958356,"about_ca_system_score_codex":0.0024424444,"about_ca_system_score_gemma":0.004019331,"threshold_uncertainty_score":0.13032866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010830927,0.04646094,0.56940913,0.0082507115,0.005663632,0.00046678155,0.0007909545,0.0047880164,0.35333896],"genre_scores_gemma":[0.23708579,0.12958711,0.21404773,0.0016379119,0.008535692,0.0010083192,0.0024703117,0.0016054547,0.40402165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884975,0.00025470398,0.00009429162,0.00014904489,0.0005436828,0.00010854689],"domain_scores_gemma":[0.9987791,0.000653556,0.00005592638,0.00023666033,0.00020450816,0.0000701387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013461559,0.00059842033,0.0008791513,0.0011999907,0.0014004662,0.005045898,0.0010824982,0.0013941898,0.02301774],"category_scores_gemma":[0.0035777586,0.0009091114,0.0005530677,0.0034258692,0.0012758061,0.0068771797,0.0014237352,0.0023577588,0.008928908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006319933,0.000075769145,0.00038898364,0.0006303936,0.000023777466,0.0002564665,0.00043876434,0.0072374796,0.0024153616,0.72481763,0.061341386,0.20231083],"study_design_scores_gemma":[0.00003718468,0.000042026284,0.0003462998,0.00027132695,0.000046165653,0.00040771905,0.00020686613,0.03129097,0.002745233,0.3050878,0.6594724,0.000045977333],"about_ca_topic_score_codex":0.0015997163,"about_ca_topic_score_gemma":0.0010068829,"teacher_disagreement_score":0.02301774,"about_ca_system_score_codex":0.0012800352,"about_ca_system_score_gemma":0.0011586308,"threshold_uncertainty_score":0.07700199},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147009725,0.013982248,0.5314549,0.010935882,0.0038604068,0.00086291897,0.002742772,0.0066265287,0.41483325],"genre_scores_gemma":[0.45775852,0.025284803,0.29270247,0.005673988,0.0021998088,0.0020110267,0.0069310493,0.00047536488,0.20696306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988606,0.00026374756,0.000057183745,0.00027570743,0.00038418474,0.00015871684],"domain_scores_gemma":[0.9986199,0.000330831,0.00014474454,0.00039949894,0.00038548387,0.00011954215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548649,0.00068950147,0.0005490638,0.001321622,0.0016616011,0.0035503441,0.0019824859,0.0014038286,0.02167036],"category_scores_gemma":[0.003305987,0.0003304005,0.00048486135,0.0016069999,0.0009087342,0.004560805,0.0040787347,0.0016159575,0.0072130444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000176618,0.00008075973,0.00054928556,0.00053352484,0.00005342109,0.0004198954,0.00023876096,0.010915991,0.005751602,0.5647992,0.13527544,0.28120553],"study_design_scores_gemma":[0.000040932347,0.00009576289,0.00028164507,0.00019551656,0.00003724218,0.0005446016,0.00015438693,0.06457929,0.00358504,0.16474903,0.76567304,0.00006355235],"about_ca_topic_score_codex":0.002240142,"about_ca_topic_score_gemma":0.0022673307,"teacher_disagreement_score":0.02167036,"about_ca_system_score_codex":0.00184219,"about_ca_system_score_gemma":0.0013691619,"threshold_uncertainty_score":0.072494626},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048339445,0.0005478851,0.9093643,0.0014212183,0.00016777654,0.0015572773,0.00033241068,0.015984949,0.022284849],"genre_scores_gemma":[0.30362073,0.0014094991,0.66688293,0.00019441881,0.00014099166,0.00073032,0.002202539,0.0013538996,0.02346483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99342394,0.002771332,0.0006186504,0.0005678536,0.0021175635,0.0005006726],"domain_scores_gemma":[0.98629874,0.006459935,0.0006442278,0.004501814,0.0014573713,0.0006379592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01029805,0.0005608981,0.0009416277,0.0019470054,0.0016637889,0.0064568543,0.0017589972,0.0013166072,0.0047748056],"category_scores_gemma":[0.021974863,0.0010923102,0.0008862114,0.00249984,0.0009806022,0.007005066,0.0040759696,0.0018028591,0.004558803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001170645,0.0015878238,0.0071257926,0.00070934574,0.00011293021,0.0009782583,0.0041723377,0.033196833,0.04861787,0.29569003,0.036210038,0.57042813],"study_design_scores_gemma":[0.0008197084,0.00052577484,0.0032387588,0.0004250424,0.00022864825,0.001145365,0.0022837748,0.48988387,0.12619579,0.12314943,0.25188032,0.0002234997],"about_ca_topic_score_codex":0.0045857853,"about_ca_topic_score_gemma":0.0047487165,"teacher_disagreement_score":0.01029805,"about_ca_system_score_codex":0.0011271923,"about_ca_system_score_gemma":0.0047523053,"threshold_uncertainty_score":0.054461896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046774484,0.0002607779,0.9317737,0.00095685973,0.00013630759,0.0004324878,0.00020067143,0.0003288208,0.019135876],"genre_scores_gemma":[0.8950659,0.00036834963,0.08543457,0.00019696959,0.00010188695,0.0004732207,0.000119342265,0.000058612968,0.018181087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997785,0.0009923727,0.00009776203,0.0003614159,0.00043525043,0.0003281669],"domain_scores_gemma":[0.99800104,0.0010519479,0.00015879699,0.00020944775,0.0003299469,0.0002488414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022167081,0.0009880799,0.0017699004,0.00082766067,0.0012051602,0.0025489307,0.0044851303,0.0028064235,0.007920289],"category_scores_gemma":[0.0054808236,0.00058601197,0.0011343154,0.0011775324,0.0015521366,0.004717451,0.002297524,0.0020765935,0.00064047077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029928947,0.00023121409,0.0003664882,0.00023942106,0.000067156354,0.0004755253,0.00031971096,0.2215321,0.0055577788,0.74180377,0.0054353303,0.023672247],"study_design_scores_gemma":[0.00011811643,0.000121153535,0.000096184165,0.000019433246,0.000027476031,0.00013201394,0.000044552176,0.8330973,0.00062356266,0.16309157,0.0025962384,0.000032432188],"about_ca_topic_score_codex":0.0029314726,"about_ca_topic_score_gemma":0.0021408184,"teacher_disagreement_score":0.007920289,"about_ca_system_score_codex":0.0020590257,"about_ca_system_score_gemma":0.0025239356,"threshold_uncertainty_score":0.026496053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10037342,0.0009788431,0.89310896,0.00041973672,0.00009657361,0.00025099458,0.00006370197,0.0024107697,0.0022970173],"genre_scores_gemma":[0.5336355,0.00038347289,0.46197772,0.00009426364,0.00009856038,0.00021200016,0.00017123739,0.00022866538,0.00319855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876285,0.00035793905,0.00013208005,0.0002753215,0.00030996502,0.00016193053],"domain_scores_gemma":[0.99553204,0.002102487,0.00062702165,0.00063397974,0.00088587176,0.00021862228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002770212,0.0009773951,0.0014538912,0.0014186112,0.0010513584,0.001453067,0.0022878805,0.0010671213,0.0017256209],"category_scores_gemma":[0.0074234097,0.00052051403,0.00039771816,0.0013297589,0.0007203553,0.0023480756,0.00094539695,0.0007531163,0.00059684453],"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.0005438321,0.00040816065,0.0038398786,0.00023958673,0.000093075265,0.00010061637,0.00042377302,0.57380146,0.02202947,0.010391335,0.004653286,0.38347545],"study_design_scores_gemma":[0.00014444401,0.00017320574,0.0005720097,0.000008259291,0.00004691204,0.00012276071,0.00013738351,0.9817441,0.0104199285,0.004561782,0.002045647,0.000023405843],"about_ca_topic_score_codex":0.0020253363,"about_ca_topic_score_gemma":0.002598664,"teacher_disagreement_score":0.002770212,"about_ca_system_score_codex":0.0017907028,"about_ca_system_score_gemma":0.001845597,"threshold_uncertainty_score":0.014650464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15765466,0.0017553149,0.7709743,0.0065325545,0.00043412505,0.00050239556,0.000731916,0.00044412178,0.060970582],"genre_scores_gemma":[0.9139704,0.000786756,0.04364477,0.00039569856,0.00030654384,0.0002916196,0.00018731538,0.000114775925,0.040301964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793684,0.00090535125,0.000074826305,0.00027484103,0.00048271977,0.00032543507],"domain_scores_gemma":[0.9944833,0.0038849278,0.00040558563,0.0002793574,0.00050983444,0.00043690187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874305,0.0012133688,0.0013927056,0.00091996504,0.0008982667,0.0036577883,0.004224196,0.0034478093,0.013780529],"category_scores_gemma":[0.014844272,0.0009404585,0.0012751016,0.0011049776,0.0019464588,0.0058345785,0.0023436842,0.0028422663,0.0013227497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026397264,0.00019562211,0.0006963626,0.0001360922,0.000042694086,0.00039740693,0.0002930426,0.41247344,0.0013845371,0.56126595,0.005962574,0.016888283],"study_design_scores_gemma":[0.00004599999,0.000067629735,0.00020839373,0.000013351482,0.000013660598,0.00008868955,0.000053154155,0.9349653,0.00008644375,0.06284587,0.0015915696,0.000019993542],"about_ca_topic_score_codex":0.005730958,"about_ca_topic_score_gemma":0.003183936,"teacher_disagreement_score":0.013780529,"about_ca_system_score_codex":0.004068035,"about_ca_system_score_gemma":0.00130631,"threshold_uncertainty_score":0.046100497},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3730128,0.00073407614,0.51191413,0.00068728894,0.00017509253,0.0008038464,0.0021956174,0.09764038,0.012836783],"genre_scores_gemma":[0.86651707,0.0003064318,0.12714371,0.000121060104,0.000038801918,0.00025977404,0.0009779761,0.00095050485,0.0036846446],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989077,0.00033219808,0.000072576695,0.00021476977,0.00040963638,0.0000632031],"domain_scores_gemma":[0.996005,0.002370251,0.00034961972,0.00075998495,0.00024201567,0.00027310618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016350999,0.00064867025,0.00051740755,0.0010088052,0.00039615823,0.0015744106,0.0015529534,0.0007777932,0.0037808104],"category_scores_gemma":[0.005450945,0.0004435716,0.00027227087,0.0006195327,0.0004991609,0.002603606,0.0011907087,0.0012511308,0.000614416],"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.0027203783,0.0021232283,0.05187521,0.002248509,0.00046877077,0.0014996101,0.0042396723,0.13088574,0.20561293,0.037124027,0.033899195,0.52730286],"study_design_scores_gemma":[0.00039407995,0.0012970411,0.01571295,0.000079749,0.00014280528,0.0007280378,0.00037008277,0.82369083,0.10775381,0.012345244,0.037338596,0.00014676902],"about_ca_topic_score_codex":0.0013629828,"about_ca_topic_score_gemma":0.001547987,"teacher_disagreement_score":0.0037808104,"about_ca_system_score_codex":0.00038665693,"about_ca_system_score_gemma":0.0005223719,"threshold_uncertainty_score":0.012648106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26959264,0.0017427835,0.7079922,0.0023355666,0.00028887094,0.0004905729,0.00091875385,0.00055264955,0.016085962],"genre_scores_gemma":[0.9759435,0.00065192545,0.0126328925,0.00013639477,0.00008411288,0.00022292191,0.00023387875,0.000054834283,0.010039579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986308,0.00034106718,0.000085316045,0.0003125279,0.00036919693,0.0002610559],"domain_scores_gemma":[0.9966384,0.0016392313,0.0006190809,0.00013531843,0.0007195854,0.00024832538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015462891,0.0014170489,0.001641314,0.000937604,0.0010869607,0.001955854,0.0034115547,0.0033941146,0.0033797175],"category_scores_gemma":[0.0058401325,0.0007933979,0.0009864203,0.00075924245,0.00162622,0.00283049,0.0014681303,0.0018926726,0.0005058711],"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.000073553674,0.00006336021,0.001462934,0.00008650639,0.00003644753,0.000522408,0.00020575178,0.96764666,0.0021877633,0.024117583,0.0010665262,0.0025306165],"study_design_scores_gemma":[0.0000055011374,0.000014435533,0.00012067582,0.0000038131836,0.0000063824596,0.000028268496,0.000023828537,0.99775094,0.000086279804,0.0017600543,0.00019320112,0.00000653336],"about_ca_topic_score_codex":0.021794826,"about_ca_topic_score_gemma":0.008552332,"teacher_disagreement_score":0.021794826,"about_ca_system_score_codex":0.0017528272,"about_ca_system_score_gemma":0.0012692225,"threshold_uncertainty_score":0.043335915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8864343,0.0002695047,0.10639878,0.000117641255,0.00003892405,0.00020902696,0.0012566454,0.0010992144,0.0041759824],"genre_scores_gemma":[0.99344,0.000120038734,0.0049609095,0.000015017719,0.00001901826,0.000049539027,0.0007870719,0.00004011001,0.00056836905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995608,0.00005568626,0.000025989495,0.00012114885,0.00016701968,0.00006930981],"domain_scores_gemma":[0.99858177,0.0006255592,0.00015762508,0.0001054483,0.0004713105,0.000058331127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067798625,0.0005519891,0.00038928867,0.0015505214,0.00042185548,0.00064935465,0.00040738605,0.00050158147,0.0007938944],"category_scores_gemma":[0.0035058148,0.00022035831,0.0003083751,0.0012533194,0.00027326483,0.001383597,0.00019440509,0.00043890977,0.00023571943],"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.00082945667,0.00044438048,0.13146067,0.00031957537,0.00019811082,0.0017610698,0.00087952655,0.56544113,0.1535564,0.010200182,0.0026554514,0.13225412],"study_design_scores_gemma":[0.000008665261,0.00011592875,0.043121077,0.000009673418,0.000035077042,0.0005321555,0.00017052273,0.9338006,0.016740754,0.0038584159,0.001571613,0.000035574183],"about_ca_topic_score_codex":0.00439605,"about_ca_topic_score_gemma":0.0019197699,"teacher_disagreement_score":0.00439605,"about_ca_system_score_codex":0.0006032412,"about_ca_system_score_gemma":0.0004222697,"threshold_uncertainty_score":0.008740902},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01918827,0.007707321,0.55865586,0.04462055,0.002769939,0.00022772446,0.00009028443,0.0013037443,0.3654362],"genre_scores_gemma":[0.6661139,0.013279189,0.22337218,0.0120650185,0.004798492,0.00059051596,0.00027919895,0.0003826211,0.0791189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811137,0.0006298644,0.000072190385,0.0003522517,0.0006189915,0.00021532674],"domain_scores_gemma":[0.99816483,0.0005385657,0.0001913628,0.00034997365,0.00041218413,0.00034311603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033191436,0.00062037766,0.0004710511,0.0007618709,0.0013816113,0.006801019,0.0013703052,0.0025181726,0.0069834925],"category_scores_gemma":[0.0048557096,0.00039978133,0.0004940538,0.000807721,0.0026313649,0.008064688,0.0041761217,0.003690317,0.0025707323],"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.000040511637,0.00009148456,0.00078341505,0.00015932716,0.00002923381,0.00012190632,0.0006190064,0.005874061,0.0013485188,0.8850549,0.01143074,0.094446905],"study_design_scores_gemma":[0.000020280591,0.00006615542,0.00059475924,0.00014218721,0.000014947413,0.000175077,0.0004440902,0.02598568,0.00070648914,0.7310048,0.24081919,0.000026373775],"about_ca_topic_score_codex":0.0006032648,"about_ca_topic_score_gemma":0.0005778868,"teacher_disagreement_score":0.0069834925,"about_ca_system_score_codex":0.0013799841,"about_ca_system_score_gemma":0.0015051565,"threshold_uncertainty_score":0.0233621},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032012186,0.0020247311,0.06202408,0.004395788,0.0031607428,0.00041005263,0.022383135,0.12455632,0.77784395],"genre_scores_gemma":[0.027922992,0.001628058,0.034111954,0.0026863546,0.00054628705,0.00050231814,0.050093636,0.027101055,0.8554073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846184,0.00027240394,0.0000915473,0.0003398558,0.00059168716,0.0002426999],"domain_scores_gemma":[0.99727803,0.0004128303,0.00012346829,0.00086720765,0.0009148731,0.00040363416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017854765,0.0013871758,0.0009489245,0.0023784167,0.0018598675,0.006289172,0.0030893323,0.0032404957,0.57408226],"category_scores_gemma":[0.0071175992,0.00087773876,0.0008264372,0.002348948,0.0008047294,0.007416769,0.0047471793,0.0019759706,0.5159126],"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.00039176544,0.0000767151,0.00063505565,0.00032999332,0.000016464504,0.00018712152,0.00018830717,0.00035668656,0.0015770614,0.029246889,0.74988484,0.21710894],"study_design_scores_gemma":[0.000024199226,0.000022103859,0.00018825944,0.000057386653,0.0000040123455,0.00010969217,0.000040946226,0.0004685359,0.00059456594,0.0037274533,0.99474925,0.000013512808],"about_ca_topic_score_codex":0.0029645197,"about_ca_topic_score_gemma":0.002858208,"teacher_disagreement_score":0.57408226,"about_ca_system_score_codex":0.0013348629,"about_ca_system_score_gemma":0.0013295726,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01476669,0.00533712,0.45753652,0.030267091,0.011360437,0.011069706,0.021880407,0.06416993,0.3836122],"genre_scores_gemma":[0.15757172,0.010851405,0.22891651,0.0024361545,0.0080988435,0.005397813,0.025338292,0.010992004,0.5503972],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99230206,0.0018175597,0.0013118375,0.0010174562,0.003062171,0.00048885425],"domain_scores_gemma":[0.95601815,0.013889088,0.0029881361,0.011683411,0.009832753,0.005588441],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0076665706,0.0022009935,0.0037837406,0.013973104,0.003641932,0.013139511,0.005297609,0.005645387,0.31169757],"category_scores_gemma":[0.066183835,0.0014407391,0.0018511068,0.021290308,0.0017657779,0.020580875,0.008270084,0.0022437645,0.36149722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006576102,0.0003834418,0.0015774292,0.0025946323,0.00021224971,0.001312962,0.0004811817,0.004166871,0.0064630485,0.044239435,0.57134885,0.36656222],"study_design_scores_gemma":[0.00065514626,0.000309209,0.0009271692,0.00050279545,0.00017006892,0.0013869043,0.0003737296,0.04375917,0.0033530982,0.059441574,0.8888378,0.00028338996],"about_ca_topic_score_codex":0.001764925,"about_ca_topic_score_gemma":0.0015682253,"teacher_disagreement_score":0.31169757,"about_ca_system_score_codex":0.0023638469,"about_ca_system_score_gemma":0.0080001475,"threshold_uncertainty_score":0.9817799},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022495263,0.0052397335,0.8120716,0.0014414792,0.005057154,0.0011015286,0.0040567247,0.026662348,0.14211985],"genre_scores_gemma":[0.06090362,0.01684147,0.5823462,0.0016976605,0.0036561182,0.0012792362,0.010293691,0.007124647,0.31585735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996732,0.00036437906,0.00037700517,0.00047744036,0.0017864743,0.00026270354],"domain_scores_gemma":[0.9929817,0.0019229697,0.0002681945,0.0031529241,0.0014027281,0.0002714369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00364363,0.0016428462,0.002791852,0.0034147028,0.0020185085,0.010221527,0.004879322,0.0022037474,0.068400696],"category_scores_gemma":[0.008883052,0.0020042858,0.0014730219,0.006343311,0.0021183456,0.012427905,0.0034773513,0.0038108556,0.06507995],"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.00031621903,0.00023252431,0.00025815604,0.0014348467,0.00009677224,0.00027755354,0.00027055063,0.004201404,0.009706505,0.29284066,0.20101616,0.48934856],"study_design_scores_gemma":[0.00015070982,0.000086767344,0.00016176022,0.00024717717,0.00012842657,0.0010488492,0.000087199194,0.024705896,0.015388514,0.207555,0.7503019,0.00013767101],"about_ca_topic_score_codex":0.001078881,"about_ca_topic_score_gemma":0.0011199052,"teacher_disagreement_score":0.068400696,"about_ca_system_score_codex":0.001590885,"about_ca_system_score_gemma":0.0019383664,"threshold_uncertainty_score":0.22882313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15034677,0.0041175107,0.78832805,0.0015529004,0.00090125314,0.0007579341,0.0009836706,0.037453976,0.015558053],"genre_scores_gemma":[0.8424023,0.0011020487,0.14779451,0.00022904803,0.0002480178,0.00017528642,0.00074134214,0.0009506534,0.0063567962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841535,0.00021827094,0.00009614621,0.0002842623,0.0007449267,0.00024104513],"domain_scores_gemma":[0.99612385,0.0010486023,0.00046849457,0.0013378402,0.0006066428,0.00041462426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018745948,0.0011596334,0.0011051128,0.00090613915,0.0012368655,0.002595961,0.0033593313,0.0008565701,0.0026589052],"category_scores_gemma":[0.0049827425,0.00044112382,0.00041212753,0.0015136437,0.0006315783,0.004137825,0.003232858,0.0012182797,0.0008950735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018215632,0.001083725,0.00716236,0.0011436171,0.00033113928,0.0010111874,0.0005973245,0.2648377,0.13587433,0.034073565,0.043599855,0.5084637],"study_design_scores_gemma":[0.00019767672,0.0004087238,0.0021213656,0.000025171785,0.000117855496,0.0005102413,0.00035044455,0.9075263,0.049182855,0.014684799,0.024774205,0.0001004674],"about_ca_topic_score_codex":0.003531675,"about_ca_topic_score_gemma":0.004324719,"teacher_disagreement_score":0.003531675,"about_ca_system_score_codex":0.0014308548,"about_ca_system_score_gemma":0.0019808044,"threshold_uncertainty_score":0.010381639},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060179926,0.001599459,0.910563,0.0011640107,0.00040092,0.00039612915,0.00041927394,0.0047189374,0.020558344],"genre_scores_gemma":[0.6356127,0.0026068417,0.31420222,0.0003738946,0.0004890486,0.00050206826,0.0014234374,0.0007437889,0.04404602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980305,0.0005585071,0.0002572733,0.00024794287,0.0007507161,0.00015515307],"domain_scores_gemma":[0.9961201,0.0022942473,0.00017931902,0.00062410865,0.0006696903,0.00011258286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023503588,0.00049388735,0.0008026356,0.001093205,0.0011995358,0.0043229572,0.001332267,0.0011300839,0.0062439623],"category_scores_gemma":[0.006703244,0.00071576535,0.000678841,0.0015577927,0.0009011681,0.004124323,0.0012466724,0.0010155854,0.002264379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011904113,0.00041248978,0.0028931587,0.000912914,0.00019150716,0.0012885814,0.0018474156,0.16711289,0.04545143,0.44209856,0.020640794,0.3159598],"study_design_scores_gemma":[0.0003228593,0.00025757018,0.00091258704,0.00008333634,0.00011213606,0.00039520336,0.00034258162,0.71155375,0.035058536,0.2029004,0.047973122,0.000087945205],"about_ca_topic_score_codex":0.0030185764,"about_ca_topic_score_gemma":0.0018981192,"teacher_disagreement_score":0.0062439623,"about_ca_system_score_codex":0.00095345086,"about_ca_system_score_gemma":0.00092620566,"threshold_uncertainty_score":0.02088815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06345431,0.0011588759,0.91845644,0.0022211343,0.00017056886,0.00023503423,0.00014950144,0.0004433977,0.01371083],"genre_scores_gemma":[0.89703476,0.002031129,0.0917711,0.00029743195,0.0003767674,0.0003893101,0.00011927877,0.0001011065,0.007879036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977076,0.00051325775,0.00014079404,0.00035543035,0.00097103626,0.00031191963],"domain_scores_gemma":[0.98999804,0.0062112506,0.0013659899,0.0011409512,0.0009847713,0.00029890155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697178,0.00064108946,0.0010421502,0.000985578,0.0012079196,0.0024441853,0.002599873,0.002014063,0.001683809],"category_scores_gemma":[0.0169825,0.00064886163,0.00091318216,0.0010670023,0.0025342011,0.0055128857,0.0025675285,0.0018142737,0.00048091498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000884658,0.00008003645,0.0006833627,0.00035037554,0.000045897556,0.0006747472,0.0006002222,0.2534181,0.009168173,0.71142745,0.004007634,0.01945558],"study_design_scores_gemma":[0.000043527358,0.00008209286,0.00024248572,0.00004059255,0.000028292583,0.00031247645,0.00010495422,0.8428004,0.0013847003,0.15081063,0.004117538,0.00003233223],"about_ca_topic_score_codex":0.0014968379,"about_ca_topic_score_gemma":0.0007014992,"teacher_disagreement_score":0.002697178,"about_ca_system_score_codex":0.0013636863,"about_ca_system_score_gemma":0.0016764004,"threshold_uncertainty_score":0.014264226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07404126,0.0016337142,0.802115,0.0055531184,0.0005664291,0.0003021952,0.0003674646,0.001476163,0.11394462],"genre_scores_gemma":[0.81520224,0.0008849294,0.14214624,0.00039595173,0.0005519522,0.00033410185,0.00037444796,0.00042264568,0.039687414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975126,0.001175112,0.00008869724,0.00046796093,0.00047620796,0.00027943717],"domain_scores_gemma":[0.98496705,0.010690013,0.00065241,0.0017960637,0.0007840889,0.0011103908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004048464,0.0006820354,0.001147525,0.0010319935,0.0027051806,0.0047851694,0.0027711461,0.0031901181,0.018906556],"category_scores_gemma":[0.01956604,0.0007322776,0.0011056946,0.0021020412,0.0017663639,0.008679316,0.0054558893,0.0026070075,0.003132628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058545044,0.00035798145,0.0015009918,0.00045920117,0.00019555286,0.00045255985,0.0033256842,0.038911995,0.0044915816,0.6914124,0.027042788,0.23126382],"study_design_scores_gemma":[0.00013637714,0.000102945036,0.00047157166,0.000074794814,0.00007339601,0.00016951769,0.00094404945,0.1296384,0.0012999567,0.83436805,0.032672863,0.000048072172],"about_ca_topic_score_codex":0.0015781056,"about_ca_topic_score_gemma":0.00194911,"teacher_disagreement_score":0.018906556,"about_ca_system_score_codex":0.0011534953,"about_ca_system_score_gemma":0.0017307616,"threshold_uncertainty_score":0.06324875},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030354474,0.0004083361,0.30806968,0.000843448,0.000615241,0.0021943583,0.0065086386,0.6251924,0.025813384],"genre_scores_gemma":[0.41380695,0.0007814397,0.4299313,0.0010001826,0.00037917405,0.0046115103,0.03673451,0.081953876,0.030801054],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985103,0.00045707778,0.000116559,0.0002657143,0.00042196194,0.00022843484],"domain_scores_gemma":[0.9944616,0.001205886,0.00028597817,0.0021065571,0.0006757882,0.0012642037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031842329,0.0009930445,0.000804212,0.0010370383,0.0011131422,0.0018392194,0.0026588456,0.00078189606,0.013526549],"category_scores_gemma":[0.007514364,0.00077749934,0.0006943171,0.0011071528,0.0009572465,0.0030866296,0.0037629749,0.0020398234,0.010284549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005487836,0.0015930939,0.00970273,0.0019446262,0.00036708135,0.0016093123,0.0021610917,0.018052077,0.051342696,0.03897816,0.60517657,0.26358473],"study_design_scores_gemma":[0.002174392,0.0010409616,0.01153952,0.00027291902,0.00019250381,0.0010913688,0.00064978463,0.3002297,0.04545197,0.07043559,0.56642735,0.0004938622],"about_ca_topic_score_codex":0.0021168937,"about_ca_topic_score_gemma":0.0015237812,"teacher_disagreement_score":0.013526549,"about_ca_system_score_codex":0.00048005302,"about_ca_system_score_gemma":0.0014140421,"threshold_uncertainty_score":0.045250833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031211546,0.00068820576,0.84572417,0.0006307831,0.0004931141,0.00028058246,0.000506367,0.11095789,0.0095073255],"genre_scores_gemma":[0.4732237,0.0009544169,0.48655522,0.00073483086,0.0002582349,0.0004550058,0.002864678,0.012547069,0.022406928],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987717,0.00015805881,0.00013242479,0.00020186999,0.00057105883,0.00016494762],"domain_scores_gemma":[0.9986584,0.0002550929,0.00015012811,0.00056932314,0.0001515742,0.0002154653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016534975,0.0007516899,0.0006746623,0.00057850155,0.0005982957,0.0019656015,0.0023232012,0.0010198307,0.002394748],"category_scores_gemma":[0.002894655,0.00071287487,0.00088267616,0.00037842878,0.0009088382,0.0030163557,0.0031282548,0.002093639,0.0017001373],"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.0016805956,0.00077905593,0.0083054975,0.0012834382,0.00044037317,0.0021197968,0.00204364,0.12882075,0.2810479,0.10000605,0.09923206,0.37424085],"study_design_scores_gemma":[0.00034096758,0.00039296344,0.004375642,0.00014501534,0.000215307,0.0010541757,0.00022230626,0.571992,0.1180534,0.035876155,0.26710096,0.00023115311],"about_ca_topic_score_codex":0.00075054716,"about_ca_topic_score_gemma":0.0010829845,"teacher_disagreement_score":0.002394748,"about_ca_system_score_codex":0.00054520444,"about_ca_system_score_gemma":0.0011100052,"threshold_uncertainty_score":0.008744597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7281253,0.00094934314,0.2629937,0.00087500055,0.000056662004,0.00022527661,0.00044352873,0.0017034921,0.0046277153],"genre_scores_gemma":[0.9770387,0.00024412143,0.02209548,0.000039200484,0.000012880038,0.00004974117,0.00022224434,0.000031246793,0.0002663727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989912,0.00019725224,0.000047622823,0.00018344613,0.0004596121,0.00012088691],"domain_scores_gemma":[0.99840754,0.00044345972,0.00022943875,0.0003013598,0.00048842904,0.00012972702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273518,0.0007726932,0.00056967273,0.0009770488,0.00062577415,0.0013996416,0.0014179136,0.00093110703,0.00035648464],"category_scores_gemma":[0.0032428438,0.0003385436,0.00037210365,0.002041784,0.0005102618,0.0012208464,0.00065294746,0.001269217,0.0002444229],"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.00036871934,0.0009814664,0.07059897,0.0002121716,0.000092634866,0.0002602309,0.0004027033,0.8223865,0.032353964,0.0117362235,0.0021423872,0.058464013],"study_design_scores_gemma":[0.0000037813186,0.000026679814,0.0028300926,0.0000036409035,0.0000050884078,0.000019334086,0.000030480755,0.9938294,0.0023759264,0.0005511943,0.00031755952,0.000006747476],"about_ca_topic_score_codex":0.02328143,"about_ca_topic_score_gemma":0.008012005,"teacher_disagreement_score":0.02328143,"about_ca_system_score_codex":0.0018057431,"about_ca_system_score_gemma":0.0013166537,"threshold_uncertainty_score":0.04629183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96133155,0.0011108925,0.02420538,0.00041712157,0.000257543,0.0004065926,0.0008374931,0.0012297005,0.010203724],"genre_scores_gemma":[0.985218,0.00018647303,0.013627056,0.000028291965,0.000016082302,0.000036932208,0.00040183178,0.000033952623,0.00045130978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829,0.00067442714,0.00012169159,0.000194063,0.0004904663,0.00022932184],"domain_scores_gemma":[0.99169475,0.0055007464,0.00038677143,0.0006513781,0.0012589647,0.00050742057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029038328,0.0008298576,0.0006180492,0.0010923523,0.00075680995,0.0011071713,0.0013400153,0.0007569329,0.0009944016],"category_scores_gemma":[0.0098952595,0.00017668719,0.00026792873,0.0011709521,0.0007100912,0.0019669272,0.0011121236,0.00052715396,0.00018138195],"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.0018947904,0.00039196154,0.007719271,0.00046622133,0.00013515852,0.0002855516,0.00018711615,0.93958086,0.008643,0.0040258886,0.0021106834,0.03455951],"study_design_scores_gemma":[0.00015425019,0.0015896831,0.0022096247,0.00001584892,0.000045629113,0.00011676586,0.00030033963,0.9859896,0.0062698945,0.0019787098,0.0013018152,0.000027864044],"about_ca_topic_score_codex":0.011500904,"about_ca_topic_score_gemma":0.008964595,"teacher_disagreement_score":0.011500904,"about_ca_system_score_codex":0.0018290099,"about_ca_system_score_gemma":0.0009906802,"threshold_uncertainty_score":0.022867918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03790537,0.002269899,0.92509705,0.0017376306,0.00062545924,0.0008883564,0.00049550977,0.008424573,0.02255623],"genre_scores_gemma":[0.6040642,0.0018977067,0.3777273,0.0011135708,0.00027910844,0.00048502357,0.0011240221,0.00036368388,0.012945361],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905056,0.00013179067,0.00006753379,0.00017370076,0.00034511625,0.00023131458],"domain_scores_gemma":[0.9993111,0.00005133328,0.00004154322,0.000119497876,0.0003136916,0.00016284414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006687052,0.0005244014,0.00067391654,0.00070255966,0.001816134,0.0026295197,0.002773031,0.0012802979,0.0031788882],"category_scores_gemma":[0.00095120113,0.00038904307,0.0005927128,0.0011822404,0.00046535366,0.0019437639,0.0020442768,0.0017051444,0.0017036459],"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.0012673918,0.000907545,0.005652675,0.000981144,0.00036833555,0.0029083316,0.00091132545,0.14851256,0.15012275,0.20128219,0.10727183,0.3798139],"study_design_scores_gemma":[0.00006566768,0.00022156267,0.0019545802,0.00010681456,0.000111374306,0.00095232105,0.00017420584,0.8751756,0.02313742,0.013385262,0.08457587,0.00013935204],"about_ca_topic_score_codex":0.009484302,"about_ca_topic_score_gemma":0.009596406,"teacher_disagreement_score":0.009484302,"about_ca_system_score_codex":0.0020681059,"about_ca_system_score_gemma":0.003234953,"threshold_uncertainty_score":0.018858194},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053888023,0.0009143873,0.29126477,0.0014983542,0.0013410893,0.0022942468,0.008559184,0.58909595,0.051144015],"genre_scores_gemma":[0.55304366,0.0011973211,0.29014805,0.0013478646,0.00040565908,0.0021496029,0.03518769,0.06203078,0.054489385],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989807,0.00019762242,0.00006480003,0.00018774791,0.0003715966,0.00019755891],"domain_scores_gemma":[0.9975497,0.0004146112,0.00008377504,0.0008585021,0.0003374916,0.0007559453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016758213,0.0009346576,0.00078214385,0.00086102786,0.001034282,0.0019704548,0.0023203073,0.0008483762,0.012565138],"category_scores_gemma":[0.0051469016,0.00075123046,0.00063791766,0.0007877489,0.000668739,0.0035442563,0.0041606533,0.0018575549,0.007028871],"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.006563885,0.0015171308,0.0062265866,0.0017872471,0.0004471396,0.0016583428,0.0017193173,0.011414174,0.08867842,0.038738213,0.5411172,0.3001323],"study_design_scores_gemma":[0.0018523843,0.0009250495,0.009880783,0.00024058559,0.00028237153,0.0014279486,0.00078437285,0.24141085,0.06110117,0.068076745,0.61352587,0.00049183244],"about_ca_topic_score_codex":0.0036703565,"about_ca_topic_score_gemma":0.0032536509,"teacher_disagreement_score":0.012565138,"about_ca_system_score_codex":0.0005385818,"about_ca_system_score_gemma":0.0016342844,"threshold_uncertainty_score":0.042034566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05379844,0.0063555324,0.9070646,0.005010141,0.0005579409,0.00062497734,0.00060327107,0.0010064777,0.02497865],"genre_scores_gemma":[0.75524056,0.0073498474,0.22317266,0.00046579516,0.0004655318,0.00076979504,0.0007982343,0.00013039046,0.011607144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983084,0.00090787275,0.00008316919,0.00016162347,0.0004334754,0.000105515384],"domain_scores_gemma":[0.9973334,0.0015846217,0.00029930798,0.00026083633,0.0003858825,0.00013602164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018360731,0.0006859178,0.0008214907,0.0016802881,0.001809559,0.0022232938,0.0011531207,0.0015332447,0.0021588719],"category_scores_gemma":[0.007988834,0.0004918548,0.0005369464,0.0022415314,0.0015285201,0.0040066666,0.0016888855,0.0008694018,0.00068745145],"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.000072839,0.00009081331,0.0026263609,0.0006461741,0.00013556563,0.0006205235,0.00077699596,0.46902096,0.0031278497,0.38844055,0.014107753,0.12033355],"study_design_scores_gemma":[0.000046837882,0.00007925567,0.0006592749,0.00006917307,0.000032792952,0.00033394116,0.00047287424,0.6947436,0.00078424666,0.2646072,0.038131323,0.0000395186],"about_ca_topic_score_codex":0.0033952326,"about_ca_topic_score_gemma":0.004732114,"teacher_disagreement_score":0.0033952326,"about_ca_system_score_codex":0.0014304515,"about_ca_system_score_gemma":0.0011024316,"threshold_uncertainty_score":0.010378718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3162855,0.0016622654,0.66949135,0.0018307673,0.00011666918,0.00023994318,0.00029757165,0.0012775856,0.008798383],"genre_scores_gemma":[0.9844945,0.00026655878,0.014039684,0.00005531072,0.00005115191,0.000085409796,0.000051184164,0.000028961445,0.00092727016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706227,0.00126112,0.00014213825,0.000492204,0.0007656808,0.00027659425],"domain_scores_gemma":[0.9845145,0.010946692,0.0019086928,0.0011444547,0.0010034587,0.0004822437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031763252,0.0005505111,0.0007603648,0.0010696286,0.002431919,0.0016295407,0.0016474624,0.0012743117,0.0012031513],"category_scores_gemma":[0.013278042,0.00054037507,0.00039627514,0.0011176969,0.0019246514,0.0039029708,0.0020639866,0.0009129816,0.00023663459],"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.00058084616,0.0002336413,0.012065356,0.0005922693,0.00016599738,0.002739946,0.0019109756,0.70761627,0.017888775,0.1565131,0.0046583745,0.095034525],"study_design_scores_gemma":[0.000028468457,0.00009948985,0.0016450366,0.000020638763,0.000029281919,0.00049643713,0.0004237965,0.9150065,0.0020565821,0.077032804,0.0031248422,0.00003604129],"about_ca_topic_score_codex":0.0051993723,"about_ca_topic_score_gemma":0.002688016,"teacher_disagreement_score":0.0051993723,"about_ca_system_score_codex":0.0016088049,"about_ca_system_score_gemma":0.0010191901,"threshold_uncertainty_score":0.016798258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024117691,0.00267049,0.71782935,0.014659903,0.002559339,0.0008591238,0.000502471,0.0031605624,0.23364106],"genre_scores_gemma":[0.6399557,0.0041805133,0.21329348,0.003905091,0.002269571,0.0012740535,0.0014012705,0.0009690218,0.13275129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666923,0.0013436772,0.00012474996,0.0005929685,0.0007995026,0.0004698837],"domain_scores_gemma":[0.99094814,0.0018019779,0.00047715634,0.0034510004,0.0014476496,0.0018739974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003618617,0.0005308016,0.0006076206,0.00074049574,0.0022259017,0.0043078535,0.0026037884,0.0013115597,0.01892681],"category_scores_gemma":[0.010923127,0.00031056727,0.00058713515,0.0014664186,0.0013826815,0.0060301977,0.005621676,0.0013746165,0.0071692546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032902573,0.00023357722,0.0027104334,0.00049596425,0.0000668192,0.00037114584,0.0012331911,0.0070492253,0.0031322357,0.5418467,0.16882771,0.27370396],"study_design_scores_gemma":[0.00007950806,0.00017815459,0.00079026486,0.00016526617,0.00003686609,0.00071024033,0.000764076,0.04122733,0.001959068,0.35440132,0.5996333,0.000054689663],"about_ca_topic_score_codex":0.0009827839,"about_ca_topic_score_gemma":0.00145335,"teacher_disagreement_score":0.01892681,"about_ca_system_score_codex":0.0009425733,"about_ca_system_score_gemma":0.0018850269,"threshold_uncertainty_score":0.063316464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030192297,0.0007090555,0.9608974,0.0006192855,0.00011270361,0.0002387351,0.00017762551,0.002361619,0.004691338],"genre_scores_gemma":[0.7210356,0.00091025763,0.27199805,0.00030599252,0.0001597123,0.0002855597,0.00064700824,0.00014071059,0.0045172656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902093,0.0001976939,0.00005973925,0.0002394333,0.00037828126,0.000103891325],"domain_scores_gemma":[0.9990933,0.0002668515,0.00008293981,0.00022146662,0.00024641678,0.00008906293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095703587,0.00067643984,0.00088434253,0.00080306095,0.001958187,0.0017655167,0.0026208202,0.0008738571,0.0013124201],"category_scores_gemma":[0.0020850375,0.0003682623,0.00048335444,0.0019477949,0.00062677276,0.0027010902,0.0021885294,0.00077023223,0.0005601528],"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.0005974115,0.00038358854,0.0054502003,0.00077477563,0.00030307678,0.003068988,0.0017418459,0.48972797,0.06736348,0.07416395,0.036476944,0.31994784],"study_design_scores_gemma":[0.000022223854,0.00005534934,0.00040713986,0.000011645272,0.000030273624,0.0002062458,0.0001923295,0.96211606,0.0034700595,0.024622537,0.008838299,0.00002781643],"about_ca_topic_score_codex":0.008655897,"about_ca_topic_score_gemma":0.009710928,"teacher_disagreement_score":0.008655897,"about_ca_system_score_codex":0.0008808525,"about_ca_system_score_gemma":0.001419249,"threshold_uncertainty_score":0.01721102},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2909281,0.061547864,0.47396645,0.021973815,0.001811905,0.0003104881,0.0008168204,0.0012101175,0.14743438],"genre_scores_gemma":[0.96218854,0.005552553,0.019846858,0.0003321062,0.0008186443,0.00010589524,0.00011577773,0.000075550975,0.010964089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793637,0.0009824631,0.00008368308,0.00051134743,0.0003462544,0.00013988295],"domain_scores_gemma":[0.9807473,0.012789878,0.0020796354,0.0017871842,0.0010578708,0.001538184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034245262,0.00048763977,0.00068648637,0.0011348353,0.0024632309,0.0030217983,0.0014764393,0.0018572243,0.0030235744],"category_scores_gemma":[0.02529369,0.0004703886,0.00041167438,0.0012536484,0.0028295293,0.010956704,0.0024925002,0.0016240599,0.00074550527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028446014,0.00012768884,0.013001719,0.00040983636,0.00013040101,0.0011076181,0.0053043463,0.018802825,0.0029910968,0.7909502,0.014660734,0.15222907],"study_design_scores_gemma":[0.00005402436,0.0003927443,0.008275446,0.0002734269,0.0003442027,0.003166775,0.0033960547,0.10856935,0.0033880968,0.7402243,0.13174811,0.00016750123],"about_ca_topic_score_codex":0.0011861993,"about_ca_topic_score_gemma":0.0013623118,"teacher_disagreement_score":0.0034245262,"about_ca_system_score_codex":0.0009629151,"about_ca_system_score_gemma":0.00057679974,"threshold_uncertainty_score":0.018110812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03327308,0.0098069385,0.5375912,0.0017798294,0.0011657027,0.0010462119,0.0030913656,0.015858954,0.39638665],"genre_scores_gemma":[0.29267922,0.0050618127,0.28273535,0.0006414332,0.00083622086,0.0005084576,0.009950419,0.001749702,0.40583736],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970644,0.0006493106,0.00015528814,0.0005480949,0.0013287112,0.00025425112],"domain_scores_gemma":[0.996822,0.0011292164,0.00011158914,0.0011937686,0.0005384206,0.00020500168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018407659,0.0010850267,0.0016829402,0.0037121964,0.0017435198,0.0044422178,0.0030995023,0.0025395197,0.060088642],"category_scores_gemma":[0.0061151055,0.0007681224,0.0010750209,0.0051888023,0.0006016934,0.0063686864,0.0035081261,0.0011217111,0.034352653],"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.00048239532,0.0007412952,0.0011451553,0.00089116255,0.0002251491,0.0003719839,0.0005251615,0.0072032497,0.0138962865,0.06424304,0.14683273,0.7634424],"study_design_scores_gemma":[0.00023819804,0.00050219253,0.00319169,0.00029130885,0.00033429154,0.002983119,0.0007552187,0.21267441,0.026888436,0.1348276,0.6170995,0.00021397087],"about_ca_topic_score_codex":0.002594131,"about_ca_topic_score_gemma":0.0044122366,"teacher_disagreement_score":0.060088642,"about_ca_system_score_codex":0.0007933419,"about_ca_system_score_gemma":0.0012187706,"threshold_uncertainty_score":0.20101649},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005305906,0.00029111796,0.71728146,0.0005013167,0.0004506572,0.0011266859,0.0024537933,0.25810835,0.014480796],"genre_scores_gemma":[0.09217788,0.0012097609,0.774517,0.001202996,0.00025251205,0.0045790705,0.025731787,0.07858812,0.0217408],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762934,0.00049137115,0.00033985265,0.00036018802,0.0008100004,0.00036927563],"domain_scores_gemma":[0.9938886,0.0011320224,0.0004342861,0.0024835933,0.0008984075,0.0011630459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070483573,0.0020349545,0.0011881392,0.0024871957,0.0013444818,0.0033293085,0.0063515906,0.0017036622,0.016509578],"category_scores_gemma":[0.012268611,0.0023766896,0.00242585,0.0012275284,0.0015304908,0.008664515,0.0077393525,0.0052077645,0.013754962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033902456,0.001249658,0.009314904,0.003065406,0.00080284534,0.0023791743,0.0036592227,0.046467073,0.10172552,0.1544389,0.39536366,0.2781435],"study_design_scores_gemma":[0.000683888,0.00061037135,0.0036573417,0.0005342839,0.0002803106,0.001092951,0.0004566888,0.15553609,0.049331155,0.060415905,0.7268917,0.00050933205],"about_ca_topic_score_codex":0.002824087,"about_ca_topic_score_gemma":0.0028271866,"teacher_disagreement_score":0.016509578,"about_ca_system_score_codex":0.0017132572,"about_ca_system_score_gemma":0.002592196,"threshold_uncertainty_score":0.055229962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055249777,0.0004977493,0.9201698,0.00072849216,0.00014128163,0.0003504837,0.00013157724,0.0058323387,0.01689847],"genre_scores_gemma":[0.7460723,0.0005952556,0.23675668,0.00021699858,0.0001759431,0.00034163325,0.00025148498,0.00070279726,0.014886957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907197,0.0028045203,0.00079092116,0.0009003419,0.0035448826,0.001239607],"domain_scores_gemma":[0.9839782,0.003922748,0.0015161078,0.008659577,0.0012922564,0.00063108746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008836862,0.00064210384,0.0011275708,0.00088549097,0.0026089784,0.0057235155,0.00182149,0.0011695854,0.004923265],"category_scores_gemma":[0.012302501,0.0011224262,0.0009022592,0.0012136729,0.003085069,0.009769847,0.00521244,0.0026263227,0.0022314843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014330697,0.00041895773,0.0027958257,0.00039643128,0.00010305229,0.0014033428,0.0018237404,0.06581299,0.014716172,0.8066529,0.007932725,0.096510746],"study_design_scores_gemma":[0.0004262327,0.0002805507,0.00047805137,0.0001189687,0.00011892117,0.00080902723,0.00030659602,0.44803777,0.04301166,0.45224133,0.05406074,0.00011016235],"about_ca_topic_score_codex":0.0012082764,"about_ca_topic_score_gemma":0.0012598652,"teacher_disagreement_score":0.008836862,"about_ca_system_score_codex":0.0014752236,"about_ca_system_score_gemma":0.0036682647,"threshold_uncertainty_score":0.046734393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96082264,0.0010881353,0.010238423,0.0029658154,0.00009483995,0.00022923542,0.0035110768,0.00030904476,0.02074083],"genre_scores_gemma":[0.98842525,0.000370467,0.0074068285,0.0002839605,0.00005225919,0.0000460678,0.0015060274,0.000076499266,0.0018326071],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9966786,0.0009538038,0.00020272622,0.00036561032,0.0014341668,0.0003650896],"domain_scores_gemma":[0.98241454,0.009228476,0.0022821275,0.0007766258,0.0045695184,0.0007286466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002534587,0.00038777821,0.0003490557,0.0034469098,0.0008872848,0.0032052516,0.0005456697,0.0009523791,0.0021834725],"category_scores_gemma":[0.023634216,0.00017908892,0.0003398136,0.0054357555,0.00067139714,0.004133371,0.0010133408,0.0011888575,0.001010607],"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.0008241163,0.0010124645,0.7327289,0.00058158307,0.00020555806,0.0010672747,0.010352732,0.003957039,0.01289949,0.009386377,0.015648983,0.21133544],"study_design_scores_gemma":[0.000025997151,0.0011396537,0.8913615,0.00023381154,0.000106347376,0.0014702639,0.0270515,0.024884626,0.009729256,0.003875704,0.039995752,0.00012562863],"about_ca_topic_score_codex":0.016858762,"about_ca_topic_score_gemma":0.021341508,"teacher_disagreement_score":0.016858762,"about_ca_system_score_codex":0.0013734199,"about_ca_system_score_gemma":0.000752622,"threshold_uncertainty_score":0.033521235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34261453,0.0011199914,0.644625,0.0006762498,0.000080215825,0.00020413061,0.00015917871,0.00051895704,0.010001858],"genre_scores_gemma":[0.9839326,0.0005736362,0.012471234,0.00003133108,0.000025125484,0.00006035078,0.000059176047,0.00002503634,0.0028214625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994641,0.00013363722,0.0000230001,0.00008146859,0.00020342758,0.00009442505],"domain_scores_gemma":[0.9987255,0.0006091,0.00019402699,0.00006538304,0.0003499914,0.000055907483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072446285,0.0006425474,0.0005385605,0.00081620127,0.00062952697,0.0008566452,0.0008232504,0.0013038571,0.00079010235],"category_scores_gemma":[0.00262359,0.00029905615,0.0006414008,0.0005703559,0.0008732766,0.001386318,0.0007240088,0.00088475004,0.00016681734],"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.000048741913,0.000048932547,0.0029048268,0.00006238884,0.000029149292,0.00030130474,0.0002031719,0.9717907,0.0048692045,0.011548798,0.00046809218,0.0077247038],"study_design_scores_gemma":[8.107037e-7,0.000007860079,0.00015614984,0.0000013398097,0.0000025877555,0.00001730231,0.0000150939495,0.9988894,0.00020821855,0.0005961029,0.00010279529,0.0000023224356],"about_ca_topic_score_codex":0.014331931,"about_ca_topic_score_gemma":0.0040299105,"teacher_disagreement_score":0.014331931,"about_ca_system_score_codex":0.0011817709,"about_ca_system_score_gemma":0.00080754556,"threshold_uncertainty_score":0.02849704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05863968,0.009193632,0.40807998,0.1386334,0.004185738,0.00072529237,0.0010697844,0.0016711501,0.3778014],"genre_scores_gemma":[0.68913025,0.004263822,0.233899,0.009264651,0.0040216697,0.00058936386,0.0005600283,0.0006213553,0.057649918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9891011,0.0031498487,0.0007107373,0.0013392947,0.0035524024,0.0021466154],"domain_scores_gemma":[0.96456915,0.016265286,0.0020071208,0.011742034,0.003305045,0.0021114054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007060478,0.00055494835,0.0008569848,0.0023755422,0.007291928,0.013487595,0.0042637964,0.016616257,0.015715646],"category_scores_gemma":[0.062652744,0.0011906996,0.0013074097,0.0044928035,0.012755217,0.032376613,0.008272713,0.006935183,0.0034973794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009825615,0.000048074286,0.0011995132,0.000064416505,0.000009228158,0.0024483586,0.0006003403,0.0012498113,0.00034612333,0.9615542,0.017838545,0.0145430565],"study_design_scores_gemma":[0.00007038174,0.000045130135,0.0005333282,0.00016905808,0.000026170732,0.007869643,0.0012861672,0.020002773,0.0014984237,0.8549166,0.11352711,0.000055246684],"about_ca_topic_score_codex":0.0063831653,"about_ca_topic_score_gemma":0.004749086,"teacher_disagreement_score":0.016616257,"about_ca_system_score_codex":0.0030818398,"about_ca_system_score_gemma":0.0033969285,"threshold_uncertainty_score":0.052574098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115550734,0.00036667232,0.87947005,0.00018320185,0.00007582877,0.00017278535,0.000027137969,0.0021636442,0.0019899565],"genre_scores_gemma":[0.93775433,0.000080094636,0.061125275,0.000056190147,0.000024516496,0.0000496518,0.000021311394,0.00003484802,0.000853817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982582,0.00042481368,0.000099168035,0.0003325214,0.0007160235,0.00016931491],"domain_scores_gemma":[0.9943151,0.0018234471,0.00094567443,0.0017500476,0.00082682486,0.00033885188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018801885,0.0006273602,0.00074551767,0.0008172503,0.0006679135,0.0010026777,0.002104454,0.0010655645,0.0006054349],"category_scores_gemma":[0.0051135253,0.00027020517,0.00039249763,0.00037036082,0.00090643833,0.0016790056,0.0016645249,0.0010643805,0.00023639823],"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.0011505454,0.00061104714,0.009218325,0.00052362913,0.00029763873,0.0021744017,0.0011726461,0.45776606,0.24622089,0.06378549,0.0035130316,0.2135663],"study_design_scores_gemma":[0.000029193427,0.00035828416,0.00082851446,0.000011462998,0.0000394609,0.00065865804,0.000043637767,0.96551305,0.025362445,0.004699845,0.0024192382,0.000036243142],"about_ca_topic_score_codex":0.0006390218,"about_ca_topic_score_gemma":0.0005578176,"teacher_disagreement_score":0.002104454,"about_ca_system_score_codex":0.0004497592,"about_ca_system_score_gemma":0.0007315633,"threshold_uncertainty_score":0.009943485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14283541,0.00046201656,0.84861124,0.00018484618,0.000033195596,0.00006457377,0.0004959589,0.0009053449,0.0064073848],"genre_scores_gemma":[0.68107486,0.00035367522,0.3146712,0.00006328982,0.00003680733,0.00013422704,0.0011383909,0.00022047215,0.0023070725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994505,0.00011869536,0.000026831789,0.00009249648,0.00023034483,0.000081162805],"domain_scores_gemma":[0.9983266,0.0011719367,0.00013417074,0.00014660096,0.00013120075,0.000089551715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048405805,0.0005229513,0.00096236926,0.0019860656,0.0010506191,0.0018175937,0.0010919018,0.0007499551,0.0028216937],"category_scores_gemma":[0.0038294971,0.00050142803,0.0008153707,0.0017108073,0.0015783221,0.002663488,0.0024367603,0.0011102575,0.0004385965],"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.00010808923,0.000056107623,0.0027791269,0.00018433898,0.000041769752,0.00042565694,0.00072687195,0.71785074,0.004069533,0.21676283,0.0027030404,0.054291833],"study_design_scores_gemma":[0.000018812178,0.000021256008,0.0010645138,0.000020150059,0.000007845666,0.00013449723,0.00023853588,0.8077169,0.0014573238,0.18545243,0.0038469424,0.000020731006],"about_ca_topic_score_codex":0.0046841074,"about_ca_topic_score_gemma":0.0048962035,"teacher_disagreement_score":0.0046841074,"about_ca_system_score_codex":0.00085048954,"about_ca_system_score_gemma":0.00038541752,"threshold_uncertainty_score":0.009439468},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020705601,0.001536843,0.9218756,0.007785145,0.00544533,0.0005035845,0.00032139593,0.011210458,0.030616043],"genre_scores_gemma":[0.19640122,0.0021250402,0.69311094,0.0026957402,0.0017663297,0.00030017196,0.0019010716,0.0028740126,0.09882548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00015189967,0.00007127954,0.00018233836,0.00037823475,0.00014331487],"domain_scores_gemma":[0.9981388,0.00012971446,0.000051817082,0.00038938402,0.00065197324,0.0006384283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002078436,0.0005061014,0.00034831642,0.0004566653,0.0011249342,0.002970314,0.002262881,0.0018097097,0.009954673],"category_scores_gemma":[0.0023825148,0.000398962,0.00079424697,0.000416647,0.00055430364,0.0031455338,0.0034452837,0.0021045473,0.007393703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010451345,0.00082867226,0.0049095573,0.0010219424,0.00022863937,0.001366765,0.0014915809,0.026038503,0.17519806,0.108967446,0.2083923,0.47051138],"study_design_scores_gemma":[0.0001917909,0.00061404903,0.0022623462,0.00021394373,0.00014896119,0.0012011455,0.0005197165,0.1743646,0.07334474,0.038029715,0.70894265,0.00016635771],"about_ca_topic_score_codex":0.0011312125,"about_ca_topic_score_gemma":0.0011757968,"teacher_disagreement_score":0.009954673,"about_ca_system_score_codex":0.0006172377,"about_ca_system_score_gemma":0.0013070499,"threshold_uncertainty_score":0.03330165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10394849,0.0036723423,0.8758481,0.0015956432,0.0007515461,0.0006018005,0.00008359424,0.0022759696,0.011222369],"genre_scores_gemma":[0.9274782,0.00067706587,0.066557966,0.00029729182,0.0001966505,0.00021142999,0.00009650262,0.000032044347,0.0044527138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998086,0.00054830103,0.00012269666,0.00028867298,0.0006873485,0.00026707153],"domain_scores_gemma":[0.99847275,0.000310331,0.00016235397,0.00031433723,0.0005470531,0.00019315438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012711829,0.0007049953,0.0011692513,0.0010195762,0.0018140527,0.0014809297,0.0018525638,0.0014207142,0.0013532857],"category_scores_gemma":[0.0025794758,0.00030017615,0.0006706518,0.0005395812,0.0010313464,0.0033150464,0.0024545768,0.0015835185,0.00044446427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002126537,0.0009575711,0.003198997,0.00088238635,0.0005295007,0.0020791914,0.0017798299,0.111484095,0.216226,0.2344867,0.030063948,0.39618525],"study_design_scores_gemma":[0.00027119863,0.00091370987,0.00071576267,0.000060492173,0.00014869815,0.0018963172,0.00019045139,0.896696,0.036267303,0.031775568,0.030911654,0.0001528947],"about_ca_topic_score_codex":0.00078774284,"about_ca_topic_score_gemma":0.00061581546,"teacher_disagreement_score":0.0018525638,"about_ca_system_score_codex":0.0009884952,"about_ca_system_score_gemma":0.0012982195,"threshold_uncertainty_score":0.0071721077},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013643113,0.18389311,0.52493274,0.08292917,0.072057016,0.0021866218,0.0030713207,0.006109277,0.11117762],"genre_scores_gemma":[0.07636706,0.13504635,0.376506,0.013784485,0.032586887,0.001782492,0.015496835,0.002928157,0.34550172],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9915713,0.0035441457,0.0008580584,0.001005809,0.0024147998,0.00060593244],"domain_scores_gemma":[0.9877093,0.0048907762,0.000370904,0.0019165628,0.0036344244,0.0014781265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013186034,0.0017804023,0.0038776316,0.0031678604,0.0026641847,0.0122181475,0.004856544,0.0043258155,0.038868923],"category_scores_gemma":[0.019921185,0.0012607217,0.0017166188,0.0046078768,0.0027562482,0.020319317,0.0037581068,0.00670967,0.01983629],"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.0003441155,0.00024141342,0.0006285397,0.0008770068,0.00017063765,0.0003742263,0.001219614,0.0015373508,0.0030648957,0.02373925,0.73409605,0.2337069],"study_design_scores_gemma":[0.00006303458,0.00011647951,0.00081834313,0.00043024778,0.00008061346,0.0004592685,0.00060644257,0.006573534,0.0012938139,0.02094881,0.9685342,0.00007524335],"about_ca_topic_score_codex":0.006985461,"about_ca_topic_score_gemma":0.01033078,"teacher_disagreement_score":0.038868923,"about_ca_system_score_codex":0.0034078541,"about_ca_system_score_gemma":0.0043553626,"threshold_uncertainty_score":0.13002956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018304143,0.00034246757,0.96393514,0.0021488615,0.0001820614,0.00008423031,0.00016125331,0.00034876054,0.014493042],"genre_scores_gemma":[0.6845359,0.0016271466,0.26231351,0.0010692227,0.00056920067,0.0008506233,0.0005490848,0.00079183216,0.0476935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947509,0.002151289,0.00024503106,0.0011899653,0.0011640005,0.0004988846],"domain_scores_gemma":[0.9807551,0.012768458,0.0013261649,0.0026167398,0.0016519034,0.00088170514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006626862,0.0010503213,0.0018238358,0.0018437664,0.0034898524,0.0068398505,0.004657143,0.004664131,0.008619385],"category_scores_gemma":[0.030538954,0.001470009,0.0023934734,0.0019426051,0.007179808,0.017655268,0.0053337207,0.0061684656,0.0020545686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050988358,0.000018879824,0.0003087015,0.00003718663,0.000017181033,0.000121382545,0.0005300684,0.026355885,0.00041813304,0.9662448,0.0011822277,0.004714491],"study_design_scores_gemma":[0.000055208387,0.000053279182,0.00009231357,0.0000300322,0.000024209925,0.00022348676,0.00018883223,0.26773986,0.0005487465,0.72072244,0.010281974,0.000039711143],"about_ca_topic_score_codex":0.0059859594,"about_ca_topic_score_gemma":0.0035354057,"teacher_disagreement_score":0.008619385,"about_ca_system_score_codex":0.003159764,"about_ca_system_score_gemma":0.0025133814,"threshold_uncertainty_score":0.035046577},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08801617,0.050028857,0.54881537,0.007624441,0.004362258,0.00036624252,0.0007616033,0.0013561383,0.29866895],"genre_scores_gemma":[0.66745293,0.018047722,0.088231295,0.00059730175,0.0021039422,0.00031029538,0.000995903,0.00036488997,0.22189572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925846,0.00026250107,0.000044095123,0.000115501294,0.000242631,0.00007678754],"domain_scores_gemma":[0.9986908,0.00086032104,0.000076417906,0.00012411825,0.00011373947,0.00013471495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007961975,0.0007336267,0.00084735296,0.00047635418,0.000860911,0.003324489,0.00141368,0.0012402696,0.021603428],"category_scores_gemma":[0.0035491753,0.00037177032,0.00044340122,0.0010997076,0.0009120782,0.003984071,0.0015957541,0.0018061255,0.0032877377],"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.00035158277,0.0002723426,0.0013320094,0.0006146572,0.00007915167,0.00035058803,0.0008720774,0.03487458,0.0030097633,0.66550523,0.06545526,0.22728279],"study_design_scores_gemma":[0.000056368077,0.000104090184,0.0010891506,0.0002302755,0.000038684433,0.0005507789,0.0006267261,0.18072356,0.0015538462,0.71643656,0.09854995,0.000039992],"about_ca_topic_score_codex":0.0015627393,"about_ca_topic_score_gemma":0.0021433553,"teacher_disagreement_score":0.021603428,"about_ca_system_score_codex":0.0007111317,"about_ca_system_score_gemma":0.0006678174,"threshold_uncertainty_score":0.07227069},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025349535,0.0013082434,0.30614585,0.0016457491,0.0018137776,0.0010607701,0.010722733,0.39243546,0.25951797],"genre_scores_gemma":[0.26843435,0.001914314,0.28553683,0.0023318895,0.00055276626,0.0020003552,0.05192365,0.08952708,0.29777876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991109,0.0001183219,0.000045778976,0.0002461975,0.00033259857,0.00014624103],"domain_scores_gemma":[0.99850863,0.00025355225,0.00008279852,0.00051744486,0.00033443564,0.000303075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011524876,0.00090178224,0.0006030112,0.0008609298,0.0010217061,0.0024380104,0.002178412,0.0008377703,0.055530865],"category_scores_gemma":[0.003286933,0.00065083976,0.0007235794,0.0006649291,0.0007742159,0.003364992,0.0034412765,0.0014666637,0.032471932],"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.0023177199,0.00048479417,0.0059368717,0.001014964,0.00011059733,0.0007711868,0.0009059216,0.004846645,0.028271269,0.0728621,0.52358353,0.3588944],"study_design_scores_gemma":[0.00022842617,0.00019313332,0.0019504062,0.00011439115,0.000051261104,0.00075667736,0.00012936752,0.022775793,0.010988255,0.020195447,0.94252783,0.00008903101],"about_ca_topic_score_codex":0.0023767734,"about_ca_topic_score_gemma":0.0025985194,"teacher_disagreement_score":0.055530865,"about_ca_system_score_codex":0.0005719973,"about_ca_system_score_gemma":0.0015733714,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06817114,0.00067453267,0.7726362,0.000977085,0.0006972494,0.0011610709,0.0033431076,0.1229738,0.029365811],"genre_scores_gemma":[0.538873,0.00053574535,0.4232237,0.00027382906,0.00011922285,0.0005908751,0.0065623308,0.0047730342,0.025048343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939096,0.00012287594,0.000033859626,0.000084277606,0.00027328197,0.00009473689],"domain_scores_gemma":[0.9986083,0.00027748244,0.000056416622,0.00057510496,0.00021552437,0.00026719473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010057152,0.00046542106,0.0005830803,0.00095132395,0.00095516205,0.0013007543,0.0017100745,0.0008057991,0.010765955],"category_scores_gemma":[0.0037218677,0.0002907479,0.00047949055,0.0011820326,0.000346299,0.0017400607,0.0024915198,0.00083537045,0.0035099036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023006417,0.00100635,0.0037080864,0.00062539056,0.0002811398,0.0013850398,0.00080619025,0.11846083,0.04149613,0.03276674,0.18378265,0.6133808],"study_design_scores_gemma":[0.0002889402,0.0002232333,0.0014787272,0.000055950568,0.000060238493,0.00038222587,0.00029713125,0.8489127,0.0152901495,0.028774062,0.104139134,0.00009752825],"about_ca_topic_score_codex":0.0070831766,"about_ca_topic_score_gemma":0.009710228,"teacher_disagreement_score":0.010765955,"about_ca_system_score_codex":0.0007636553,"about_ca_system_score_gemma":0.001529503,"threshold_uncertainty_score":0.03601563},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19993797,0.0023311616,0.01097125,0.019782841,0.00060988456,0.0002136569,0.0008966419,0.00028829137,0.7649682],"genre_scores_gemma":[0.8507174,0.0009389495,0.0026590116,0.00068176223,0.00024304741,0.000068534726,0.00043708456,0.000053060445,0.14420113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99915373,0.00013542651,0.00001760596,0.00010795279,0.00023789295,0.00034744252],"domain_scores_gemma":[0.99569327,0.0006912346,0.00042611305,0.00034913188,0.00068083353,0.0021594802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783419,0.0002723958,0.0002348676,0.00095938763,0.0030708644,0.0038380001,0.00052431616,0.0012067793,0.05019738],"category_scores_gemma":[0.005656019,0.00020369988,0.00014342074,0.0006970203,0.0010362531,0.0021389888,0.002194783,0.00092139456,0.00972397],"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.0005042283,0.00067761703,0.053724576,0.00033579333,0.00006265119,0.0010519869,0.0019778628,0.0023536854,0.0066964566,0.3429868,0.26680732,0.32282096],"study_design_scores_gemma":[0.0001171814,0.0003969295,0.10470633,0.0003614491,0.000059902424,0.0017873851,0.021568926,0.008265396,0.0042198002,0.31839755,0.5400222,0.000096939395],"about_ca_topic_score_codex":0.0028820976,"about_ca_topic_score_gemma":0.012118851,"teacher_disagreement_score":0.05019738,"about_ca_system_score_codex":0.0013507812,"about_ca_system_score_gemma":0.0031402553,"threshold_uncertainty_score":0.16792697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014668525,0.0006107953,0.9853076,0.00065100065,0.00034803426,0.00016077486,0.00047318032,0.0018710541,0.009110648],"genre_scores_gemma":[0.098780386,0.002697117,0.86572456,0.0006645888,0.0005201663,0.0009789414,0.003929527,0.0015282991,0.0251764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99407357,0.0014476026,0.00085694686,0.0009714213,0.0022795128,0.00037095541],"domain_scores_gemma":[0.99419075,0.0013302834,0.00026857152,0.0020745674,0.0018768358,0.0002590094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057805753,0.001311964,0.0022977183,0.002960694,0.002757709,0.008858209,0.007548245,0.005352278,0.0096841995],"category_scores_gemma":[0.016129708,0.001118913,0.0016591374,0.0057110144,0.002454236,0.017237186,0.0049026506,0.003517918,0.00750598],"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.000092002054,0.00004810902,0.00013820709,0.00026246315,0.000026904074,0.00023216606,0.00044825327,0.024348304,0.0010385351,0.8960375,0.014191296,0.06313622],"study_design_scores_gemma":[0.00005553574,0.00006343935,0.000071037255,0.00020607737,0.000083257146,0.0003195883,0.00018840484,0.18074562,0.0026753093,0.6470781,0.16843529,0.00007834619],"about_ca_topic_score_codex":0.0070674717,"about_ca_topic_score_gemma":0.0068088826,"teacher_disagreement_score":0.0096841995,"about_ca_system_score_codex":0.0025148464,"about_ca_system_score_gemma":0.002924779,"threshold_uncertainty_score":0.032396913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21047822,0.0005226143,0.76315105,0.00039468418,0.00012263905,0.00064877997,0.00055951404,0.0118561415,0.012266432],"genre_scores_gemma":[0.8348386,0.00026177964,0.15950763,0.00009254604,0.00006491121,0.00026290122,0.00085323333,0.00031966803,0.0037986815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702555,0.00081930007,0.00014093336,0.00084433984,0.0009936688,0.00017628317],"domain_scores_gemma":[0.99391913,0.002036269,0.0007103391,0.0017061142,0.001070579,0.00055755366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021235612,0.00075549167,0.0008452329,0.0017359969,0.0009819312,0.0027828894,0.0023030776,0.0007904582,0.0021022302],"category_scores_gemma":[0.008693023,0.00056043454,0.00027210012,0.0012286719,0.0006660815,0.0032830515,0.00327348,0.0009416802,0.00070020114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014758375,0.0007643766,0.036058925,0.00048605574,0.00025974135,0.00061454804,0.0033508015,0.0730291,0.07495649,0.022608273,0.011286685,0.77510923],"study_design_scores_gemma":[0.00022232746,0.0007392668,0.021736301,0.000107053216,0.00016617656,0.0008360055,0.0016885503,0.8173358,0.06982996,0.034090064,0.053091597,0.00015701025],"about_ca_topic_score_codex":0.001705682,"about_ca_topic_score_gemma":0.0017693192,"teacher_disagreement_score":0.0027828894,"about_ca_system_score_codex":0.00062987895,"about_ca_system_score_gemma":0.0006652606,"threshold_uncertainty_score":0.011230588},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082071766,0.0012688857,0.843516,0.0012722451,0.00043026707,0.00086707965,0.00033156798,0.05717294,0.0130692525],"genre_scores_gemma":[0.61405283,0.00057603413,0.3681864,0.00031715786,0.00018176681,0.0003589091,0.0010671233,0.0017692917,0.013490477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971187,0.0006024662,0.00017340091,0.00034400358,0.0014534572,0.00030797123],"domain_scores_gemma":[0.99507195,0.0007676694,0.00035785176,0.0026308792,0.0007662405,0.00040525215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003554515,0.0008719072,0.0010153706,0.0014679723,0.001933569,0.0023434858,0.0032215621,0.001456771,0.0046594245],"category_scores_gemma":[0.008140779,0.00089554524,0.00036695617,0.0013064246,0.0014342968,0.0063424306,0.0057229106,0.0017630996,0.0026236535],"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.003171319,0.0008235685,0.006561013,0.000628387,0.00032797648,0.0012567817,0.0021137258,0.06670139,0.089670636,0.104296334,0.10587503,0.6185737],"study_design_scores_gemma":[0.00070071436,0.000990471,0.00209531,0.000081756,0.00017293141,0.0011689393,0.00035662754,0.7445439,0.074155584,0.07205034,0.10341088,0.0002725119],"about_ca_topic_score_codex":0.002980921,"about_ca_topic_score_gemma":0.0031639978,"teacher_disagreement_score":0.0046594245,"about_ca_system_score_codex":0.0011421448,"about_ca_system_score_gemma":0.0015129765,"threshold_uncertainty_score":0.018798232},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13727774,0.0006896754,0.85625964,0.00071748684,0.000059845792,0.00011287739,0.00013965827,0.00034912603,0.0043939394],"genre_scores_gemma":[0.8534468,0.00027107453,0.14418972,0.00008919648,0.00003634,0.0000864362,0.000098015866,0.000050040988,0.0017323904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936575,0.00023235235,0.000032200853,0.00012151629,0.00011563648,0.00013259963],"domain_scores_gemma":[0.9963147,0.0026955798,0.00025928832,0.00019817236,0.00034381222,0.00018839879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016320632,0.0005017431,0.0010516514,0.00049319724,0.0007628916,0.00096291915,0.0017157086,0.0009971419,0.0013638046],"category_scores_gemma":[0.0061793025,0.00043043666,0.0002897553,0.00080102345,0.0006765662,0.0012477867,0.001053233,0.0007966616,0.00019741303],"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.00020832785,0.00006928448,0.00069660804,0.00010474982,0.000022145305,0.000063361826,0.00014633658,0.9475434,0.0031316765,0.018864017,0.0014771945,0.027672963],"study_design_scores_gemma":[0.00002240878,0.000018036431,0.00005103307,0.0000030484498,0.0000044092817,0.000008441953,0.000024160194,0.9959655,0.00038413084,0.003354314,0.00016126262,0.0000031876568],"about_ca_topic_score_codex":0.007770265,"about_ca_topic_score_gemma":0.006921859,"teacher_disagreement_score":0.007770265,"about_ca_system_score_codex":0.001986333,"about_ca_system_score_gemma":0.0015669849,"threshold_uncertainty_score":0.01545006},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05141314,0.00084955,0.49658918,0.0025930884,0.00088121375,0.0019632727,0.016418947,0.25545287,0.17383869],"genre_scores_gemma":[0.6116079,0.0013186914,0.2603649,0.0007677754,0.0003722817,0.0010744985,0.031134944,0.0054611997,0.087897845],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860954,0.0001688022,0.00013748843,0.00020817351,0.00070922007,0.00016665702],"domain_scores_gemma":[0.99777955,0.00031248672,0.00015171632,0.0007882767,0.0005742508,0.00039359953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519633,0.00074484164,0.0006275633,0.0013175871,0.0018561338,0.0035668402,0.0021887524,0.0011475458,0.022613702],"category_scores_gemma":[0.0040554353,0.0005617464,0.0004857715,0.0020207143,0.0016725567,0.0032938232,0.0024323438,0.0012329022,0.007606518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020071934,0.00028389582,0.005514563,0.0009990346,0.00013794692,0.0013660752,0.0021774399,0.03161636,0.030686568,0.27695394,0.38751802,0.260739],"study_design_scores_gemma":[0.00041722794,0.0001923374,0.0026857292,0.00010291869,0.00013024094,0.0005046369,0.0005585779,0.24370375,0.029825274,0.05086109,0.6708215,0.00019674632],"about_ca_topic_score_codex":0.1143828,"about_ca_topic_score_gemma":0.10252645,"teacher_disagreement_score":0.1143828,"about_ca_system_score_codex":0.0050294227,"about_ca_system_score_gemma":0.009200733,"threshold_uncertainty_score":0.22743404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1208045,0.007258879,0.7756097,0.00810182,0.0005845244,0.0004801064,0.0008045785,0.001559565,0.08479627],"genre_scores_gemma":[0.9076566,0.0029825093,0.061700933,0.0014216412,0.0006701577,0.00067775993,0.000538331,0.00038424693,0.023967776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613416,0.0011621639,0.00021073077,0.0007062273,0.0010482597,0.00073838665],"domain_scores_gemma":[0.9734631,0.018070735,0.0024581118,0.0023124793,0.0024221959,0.0012733388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055649406,0.0012620372,0.0022333835,0.004516438,0.0033250025,0.0047966237,0.0043506795,0.0031293181,0.011263821],"category_scores_gemma":[0.047960527,0.0009904479,0.0020248352,0.0023868813,0.00490983,0.012202096,0.003676554,0.0038481457,0.0024707078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049336708,0.000024542005,0.00046356456,0.00011445317,0.000019292986,0.00011263276,0.00024860314,0.01631203,0.000518605,0.97234523,0.004471433,0.0053202505],"study_design_scores_gemma":[0.000040863728,0.000048100865,0.00032775782,0.00008062988,0.00004464498,0.00027710406,0.0001384047,0.33977315,0.00066865276,0.65257233,0.005959381,0.00006898836],"about_ca_topic_score_codex":0.0045940275,"about_ca_topic_score_gemma":0.0027283463,"teacher_disagreement_score":0.011263821,"about_ca_system_score_codex":0.005408711,"about_ca_system_score_gemma":0.0028038213,"threshold_uncertainty_score":0.039243102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026180297,0.0003583979,0.9583003,0.00032954593,0.00013551417,0.0000922456,0.0000718065,0.00076210045,0.013769779],"genre_scores_gemma":[0.79395676,0.00036797917,0.19069412,0.00017365951,0.00007452474,0.00011851091,0.00010736045,0.000070793976,0.014436284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997838,0.000057609806,0.00000762393,0.000034363566,0.00007954415,0.00003711529],"domain_scores_gemma":[0.99975985,0.000119009834,0.00002229047,0.000018665709,0.00004756239,0.000032668424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000516479,0.0003628731,0.00024358073,0.00029912256,0.00043325138,0.0007576885,0.0011349071,0.0004923154,0.0025700561],"category_scores_gemma":[0.0005906209,0.000109419336,0.00017826026,0.00029384284,0.0004510053,0.00094147783,0.0010672981,0.0005254165,0.0003082487],"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.00031015225,0.00022322623,0.0012447094,0.00020942635,0.000069290894,0.00041690734,0.00014617019,0.5509085,0.03111496,0.17326856,0.008513673,0.2335744],"study_design_scores_gemma":[0.0000073381634,0.000030893407,0.00007127293,0.0000043565874,0.000003590086,0.000042512078,0.000014418323,0.9871629,0.0012605652,0.008959148,0.0024370842,0.0000058258292],"about_ca_topic_score_codex":0.0027246315,"about_ca_topic_score_gemma":0.004403979,"teacher_disagreement_score":0.0027246315,"about_ca_system_score_codex":0.000677941,"about_ca_system_score_gemma":0.00047693463,"threshold_uncertainty_score":0.008597732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04573062,0.00019167537,0.9452809,0.0002316489,0.000059858747,0.00015545246,0.0000755052,0.004495572,0.0037787473],"genre_scores_gemma":[0.5837685,0.00012041647,0.40834534,0.000081599326,0.00007378799,0.0004779253,0.00027727158,0.0002851193,0.0065700887],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837947,0.00040228316,0.00010264938,0.0003370901,0.0005957131,0.00018283549],"domain_scores_gemma":[0.9978941,0.00038239357,0.0002091808,0.0009751259,0.00037455672,0.00016471892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001474737,0.0005656473,0.0007967333,0.0009993146,0.0023278045,0.0012280693,0.003173808,0.0011321875,0.002434954],"category_scores_gemma":[0.0041558533,0.00037636084,0.00049215043,0.0010796027,0.0006167717,0.0021560264,0.0035601803,0.00071287184,0.0007736436],"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.001244975,0.0006098375,0.005824329,0.00047444482,0.0002178681,0.0006452818,0.0017777459,0.1643294,0.10889609,0.14466298,0.022270605,0.54904646],"study_design_scores_gemma":[0.00015021155,0.00034934026,0.0010593618,0.000022855987,0.000078862075,0.000300437,0.00026280538,0.8922075,0.044521138,0.03714035,0.02383334,0.00007379896],"about_ca_topic_score_codex":0.0016676227,"about_ca_topic_score_gemma":0.0021480813,"teacher_disagreement_score":0.003173808,"about_ca_system_score_codex":0.0007210009,"about_ca_system_score_gemma":0.001064991,"threshold_uncertainty_score":0.00814569},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30111548,0.0015513464,0.67106754,0.0011860467,0.00028577718,0.00029607696,0.0003019747,0.004339066,0.019856676],"genre_scores_gemma":[0.95055187,0.00034411324,0.042518727,0.00012235346,0.000057957073,0.00008004249,0.00023854879,0.00005437641,0.006032085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.00006076185,0.00001836977,0.000082561346,0.00008812681,0.00005240267],"domain_scores_gemma":[0.9997782,0.000041161627,0.000014732893,0.00003327628,0.00010223603,0.000030322042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025158873,0.0003385683,0.00043447348,0.0005070505,0.0008309199,0.0013027404,0.0011062783,0.0007078646,0.0018090896],"category_scores_gemma":[0.0003965026,0.00023396844,0.000251262,0.0005799212,0.00036031185,0.0012706938,0.0009126155,0.0003445612,0.00048753657],"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.0014898096,0.000647675,0.0068920935,0.00059106306,0.00028565835,0.0026080403,0.0010334081,0.37201068,0.20001486,0.07175266,0.02553138,0.3171427],"study_design_scores_gemma":[0.000028719216,0.00015399381,0.00073196256,0.000009739031,0.000031535208,0.00027898804,0.00013920132,0.9773902,0.007310842,0.008421383,0.005474939,0.000028494986],"about_ca_topic_score_codex":0.00492775,"about_ca_topic_score_gemma":0.0036349765,"teacher_disagreement_score":0.00492775,"about_ca_system_score_codex":0.0008488423,"about_ca_system_score_gemma":0.0004569534,"threshold_uncertainty_score":0.009798169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99350256,0.00018160035,0.000888663,0.0002743679,0.000010952352,0.00004354013,0.00006785521,0.000006477195,0.0050241267],"genre_scores_gemma":[0.9995109,0.000040483945,0.00020004889,0.000007935906,0.0000041826106,0.000024876681,0.00002408375,7.581667e-7,0.00018671376],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9956053,0.0027699738,0.00021351821,0.00029479765,0.0008269074,0.0002894632],"domain_scores_gemma":[0.95567226,0.029474499,0.009248728,0.0012268615,0.0014837842,0.002893817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004981766,0.00023394749,0.0002764026,0.0015388062,0.0011456356,0.0021607925,0.0005678494,0.0005989407,0.002358406],"category_scores_gemma":[0.039472494,0.00022339166,0.0002783312,0.0013185361,0.0012224808,0.002444449,0.0023938743,0.00097269035,0.00014219817],"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.00039543762,0.0014221771,0.90512615,0.00017002491,0.00019001671,0.00022548759,0.027205052,0.00074404513,0.00037231858,0.0044917846,0.0004974363,0.05916002],"study_design_scores_gemma":[0.000041714324,0.00043777924,0.9575864,0.00011473459,0.0001241353,0.0002458927,0.028717734,0.0049345773,0.00033370013,0.005446877,0.001981099,0.00003536038],"about_ca_topic_score_codex":0.0040041385,"about_ca_topic_score_gemma":0.0055545378,"teacher_disagreement_score":0.004981766,"about_ca_system_score_codex":0.0012142163,"about_ca_system_score_gemma":0.0010887282,"threshold_uncertainty_score":0.026346445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33358034,0.0006049376,0.6430989,0.00041723443,0.00013432787,0.0003746516,0.00018716641,0.014090852,0.0075116204],"genre_scores_gemma":[0.7071478,0.00019485778,0.28920603,0.0001272794,0.00002976869,0.00023312417,0.00038238065,0.0006987992,0.0019799978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983797,0.00046854842,0.0001387602,0.00025914126,0.00053123274,0.000222502],"domain_scores_gemma":[0.9969348,0.0009762198,0.00019743541,0.0011837882,0.00050219195,0.0002055217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326346,0.0010982644,0.0006340366,0.0004973763,0.0007257927,0.0018947518,0.0034735205,0.0006165498,0.0027510538],"category_scores_gemma":[0.0055548116,0.0006947056,0.0006823003,0.0007289762,0.00093605183,0.0030371335,0.0024708114,0.0017826002,0.00055290194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00513316,0.0014413736,0.012121368,0.00087323703,0.00047347342,0.00073186215,0.0015662779,0.30578706,0.17587404,0.043258894,0.014990851,0.43774843],"study_design_scores_gemma":[0.00021488525,0.00027485503,0.00075453875,0.000015303287,0.000041647872,0.00008396101,0.00013547564,0.94452786,0.040728997,0.009384742,0.0038126414,0.000025157862],"about_ca_topic_score_codex":0.004570483,"about_ca_topic_score_gemma":0.004653853,"teacher_disagreement_score":0.004570483,"about_ca_system_score_codex":0.0008110892,"about_ca_system_score_gemma":0.0013793167,"threshold_uncertainty_score":0.009203196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02338773,0.0013109953,0.967749,0.0007336739,0.00008047962,0.00019099051,0.000043818818,0.00025835616,0.0062449053],"genre_scores_gemma":[0.7272895,0.0022940799,0.26436496,0.00026629283,0.0001900704,0.00069244567,0.000092020964,0.00010718024,0.0047035296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972594,0.0011556318,0.0001505097,0.0003917183,0.00085263705,0.00019010974],"domain_scores_gemma":[0.99585706,0.0022590833,0.0004003368,0.0005020467,0.0007547987,0.00022670429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033732315,0.0006907623,0.0009465489,0.00066981086,0.000993441,0.0023565432,0.001981913,0.0015260653,0.0021450897],"category_scores_gemma":[0.0106835775,0.0007341064,0.0005264425,0.0007757727,0.0017588919,0.0039037347,0.0023367873,0.001042613,0.0006492034],"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.00016365261,0.000095464195,0.0010779289,0.00052830484,0.00010596177,0.00043283537,0.0006298462,0.5424349,0.011944052,0.39403206,0.0026025558,0.045952473],"study_design_scores_gemma":[0.00006770277,0.00015177357,0.00017589425,0.000047289042,0.000042737083,0.00020934884,0.000113512906,0.8703713,0.0016782571,0.115527704,0.01158957,0.000024963247],"about_ca_topic_score_codex":0.0007738261,"about_ca_topic_score_gemma":0.0005955969,"teacher_disagreement_score":0.0033732315,"about_ca_system_score_codex":0.001242915,"about_ca_system_score_gemma":0.0009636479,"threshold_uncertainty_score":0.01783961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007891212,0.00017688755,0.99015,0.000158899,0.000099631805,0.0001521808,0.000020998155,0.00016996595,0.0011802344],"genre_scores_gemma":[0.49882787,0.00040800162,0.49627346,0.00014703987,0.00021343237,0.00048731547,0.00006436254,0.00006187089,0.0035165802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967512,0.0015589333,0.00019394615,0.00050300476,0.00081986946,0.00017308857],"domain_scores_gemma":[0.9936572,0.0034416209,0.00073929515,0.0009503272,0.0008953379,0.0003162389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051675765,0.0007116029,0.0014680513,0.00089697645,0.001380339,0.0012954738,0.0034128926,0.001788288,0.0021852092],"category_scores_gemma":[0.0129435845,0.0005572421,0.000752623,0.001327935,0.0012650099,0.0025909534,0.0018695234,0.0016269138,0.0004717714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006013995,0.00046352734,0.0012647618,0.00045165076,0.00017187755,0.0005051601,0.00048992364,0.35805732,0.022867052,0.3796789,0.005248723,0.23019971],"study_design_scores_gemma":[0.00017851149,0.00045659562,0.00021483736,0.000026781128,0.000045747183,0.00036283172,0.00004090771,0.9285819,0.0041371295,0.05810277,0.0077958684,0.00005628664],"about_ca_topic_score_codex":0.00061634,"about_ca_topic_score_gemma":0.00063084683,"teacher_disagreement_score":0.0051675765,"about_ca_system_score_codex":0.0010526372,"about_ca_system_score_gemma":0.0020174398,"threshold_uncertainty_score":0.027329087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52039695,0.0016247458,0.45875362,0.0020867323,0.00008437165,0.00039293716,0.00046499498,0.0006440237,0.015551663],"genre_scores_gemma":[0.9770552,0.0008469794,0.0188769,0.00008483629,0.00003072649,0.00012594015,0.00015564056,0.00006997229,0.0027538226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889416,0.0004186361,0.000035883168,0.00007661408,0.00046193256,0.00011288024],"domain_scores_gemma":[0.9935173,0.0043824576,0.0005911662,0.00036012963,0.0009902484,0.00015876509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023782514,0.00074909866,0.0007864985,0.0008505495,0.00056803395,0.001174486,0.0013844525,0.0009791851,0.0014847041],"category_scores_gemma":[0.013873848,0.00044518086,0.0006414904,0.0005373143,0.0008350867,0.0022120357,0.0007013498,0.0011017071,0.0002260211],"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.000056787045,0.000065768545,0.0007597157,0.000093889605,0.000032263568,0.00010051313,0.00013997077,0.9417982,0.0039236704,0.045828145,0.0011273873,0.006073597],"study_design_scores_gemma":[0.00000244398,0.000014308602,0.00011923272,0.0000035812361,0.0000038087246,0.000019538747,0.000017676097,0.9959894,0.00041892842,0.0032501954,0.00015715875,0.000003720879],"about_ca_topic_score_codex":0.0073562087,"about_ca_topic_score_gemma":0.003067506,"teacher_disagreement_score":0.0073562087,"about_ca_system_score_codex":0.0028488352,"about_ca_system_score_gemma":0.0017941702,"threshold_uncertainty_score":0.020669818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008188648,0.00059072196,0.9744271,0.00080131204,0.00033882784,0.00046770708,0.0005381479,0.0035069988,0.011140554],"genre_scores_gemma":[0.479186,0.0025619126,0.46889064,0.0011856612,0.0008450644,0.002181734,0.0023729466,0.00091510854,0.04186094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806374,0.0003373885,0.00023443303,0.00039032137,0.00082749675,0.00014670443],"domain_scores_gemma":[0.99800533,0.0006659312,0.00014881922,0.00062293105,0.00043874845,0.00011817745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022985623,0.0007890144,0.00074675627,0.0010518008,0.0009780355,0.0028224075,0.00343234,0.0018225888,0.005752458],"category_scores_gemma":[0.0036668605,0.00040133964,0.00096677867,0.0011633171,0.00073927105,0.004390758,0.0011032479,0.0015247936,0.0029397206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095447,0.0007207804,0.0028279892,0.0013940509,0.00019338842,0.0017745752,0.0011159428,0.14888598,0.06544602,0.52210826,0.04276126,0.21181732],"study_design_scores_gemma":[0.00012616676,0.00025123317,0.00057949155,0.000052255607,0.000108428656,0.00074342935,0.00011465156,0.8001528,0.014190906,0.0714575,0.1121504,0.0000727657],"about_ca_topic_score_codex":0.003193688,"about_ca_topic_score_gemma":0.0026778753,"teacher_disagreement_score":0.005752458,"about_ca_system_score_codex":0.0016515589,"about_ca_system_score_gemma":0.0018963749,"threshold_uncertainty_score":0.019243836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054478236,0.00076732534,0.98281187,0.00091489864,0.00018605756,0.00020173988,0.00008839271,0.00077927887,0.008802586],"genre_scores_gemma":[0.25853935,0.00246345,0.72515744,0.0004991284,0.00029109255,0.0004567536,0.00022927753,0.000117139585,0.0122463815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999313,0.0002081329,0.000037397404,0.00011436938,0.00028101975,0.000046086225],"domain_scores_gemma":[0.9996118,0.00012992413,0.00004078699,0.00011614002,0.000071416194,0.000030017216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074684527,0.00050072756,0.00037105032,0.00069866906,0.0011427314,0.0014151596,0.0013779432,0.001066065,0.0022956696],"category_scores_gemma":[0.0016513271,0.00033496448,0.0004509279,0.0011674761,0.0009614221,0.0023449287,0.0014625974,0.0010462262,0.00081832614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011289474,0.0001514969,0.001040213,0.0007225831,0.00015152608,0.0009676421,0.0006911691,0.250199,0.02849743,0.410014,0.021106932,0.28634503],"study_design_scores_gemma":[0.00006735121,0.0003320943,0.0004707824,0.0000824615,0.00009595743,0.00093885115,0.00036144847,0.5808957,0.014196699,0.2529128,0.14956054,0.00008529814],"about_ca_topic_score_codex":0.0019103168,"about_ca_topic_score_gemma":0.002464207,"teacher_disagreement_score":0.0022956696,"about_ca_system_score_codex":0.0005735964,"about_ca_system_score_gemma":0.0008585476,"threshold_uncertainty_score":0.00767982},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45360482,0.00028351255,0.541577,0.00036169487,0.000028489223,0.000094616764,0.00009066134,0.0006704498,0.0032888358],"genre_scores_gemma":[0.9656109,0.000108921726,0.033299197,0.000027962076,0.000006659334,0.000034091478,0.000045591518,0.00004540481,0.0008211868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989182,0.00033810528,0.00007535527,0.00016649466,0.00025267288,0.0002492036],"domain_scores_gemma":[0.9972772,0.0013132577,0.0003428802,0.00048992754,0.0004195207,0.00015720462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025660624,0.0005983579,0.0008511993,0.000474936,0.00076863164,0.0010758588,0.0009309403,0.0005044369,0.0010222022],"category_scores_gemma":[0.005219923,0.0002928634,0.00025055007,0.0006021512,0.0008294907,0.0028089,0.001514912,0.0007623865,0.00017674715],"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.0002580524,0.00011944729,0.0017478818,0.00008848871,0.00003573685,0.00013162353,0.00014172602,0.9138408,0.025455894,0.010256152,0.00053794024,0.04738623],"study_design_scores_gemma":[0.000015091409,0.00011130038,0.00026205613,0.0000042584165,0.000011181941,0.000032113956,0.0001226072,0.98051834,0.010213712,0.008338758,0.00036339927,0.0000072107546],"about_ca_topic_score_codex":0.002135708,"about_ca_topic_score_gemma":0.0028918777,"teacher_disagreement_score":0.0025660624,"about_ca_system_score_codex":0.0008493808,"about_ca_system_score_gemma":0.0014108415,"threshold_uncertainty_score":0.013570845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021419436,0.002740478,0.6432117,0.011119642,0.0019822037,0.0008656394,0.000623819,0.0043938244,0.31364322],"genre_scores_gemma":[0.5320861,0.0042010536,0.24694453,0.0041546174,0.0014898028,0.0014692479,0.0018693871,0.002071531,0.20571378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958865,0.0016498421,0.0001927138,0.0008236059,0.00091764465,0.00052972115],"domain_scores_gemma":[0.99203616,0.0020616823,0.00042889686,0.0032225342,0.0011244891,0.0011261988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004335199,0.0006425667,0.0005890249,0.000976302,0.0026462688,0.0044401367,0.0024244506,0.0015324813,0.034742933],"category_scores_gemma":[0.014042406,0.00045441312,0.000856535,0.0013490656,0.002349973,0.0071223457,0.0076690307,0.0019994436,0.009486246],"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.00016618248,0.00011396497,0.002046507,0.0003956457,0.000035319048,0.00026667566,0.0018550607,0.0054746373,0.0013076278,0.73594105,0.07777627,0.17462099],"study_design_scores_gemma":[0.00004413937,0.00008842135,0.00054733077,0.00023982169,0.000025555313,0.0005071966,0.0008623953,0.02105792,0.0015950998,0.3333909,0.64159614,0.00004505624],"about_ca_topic_score_codex":0.0016712229,"about_ca_topic_score_gemma":0.0018838474,"teacher_disagreement_score":0.034742933,"about_ca_system_score_codex":0.0017483758,"about_ca_system_score_gemma":0.0026088085,"threshold_uncertainty_score":0.11622667},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06492229,0.003794184,0.89506984,0.0025031548,0.0001777202,0.00014033227,0.00055277563,0.00049496815,0.032344706],"genre_scores_gemma":[0.888729,0.0044395374,0.08717843,0.00040360258,0.00065172266,0.00032268997,0.00062989636,0.00023162848,0.017413426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987503,0.00037821883,0.000045002773,0.0002453456,0.00041629357,0.00016485287],"domain_scores_gemma":[0.99080503,0.006821239,0.0006584893,0.0005291264,0.00085826166,0.0003279501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002219694,0.0005849436,0.0009990361,0.0029697164,0.0018985306,0.0032875156,0.002118887,0.0014057993,0.005637678],"category_scores_gemma":[0.0157121,0.0006176614,0.0009883849,0.0024755453,0.0024656246,0.00540346,0.0020267053,0.0015424385,0.0007836299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042774653,0.000017498105,0.0015971379,0.00013957167,0.000029703882,0.00013159348,0.00037162166,0.120981395,0.0010852275,0.8572185,0.003913774,0.0144711835],"study_design_scores_gemma":[0.00000765643,0.00002495554,0.00096148485,0.00005304828,0.000024043404,0.00019599126,0.00013120976,0.6795237,0.00043230588,0.31103295,0.0075770887,0.00003558037],"about_ca_topic_score_codex":0.0061472417,"about_ca_topic_score_gemma":0.0048472797,"teacher_disagreement_score":0.0061472417,"about_ca_system_score_codex":0.0031108311,"about_ca_system_score_gemma":0.0014132499,"threshold_uncertainty_score":0.02257073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9180534,0.002983355,0.019960502,0.012452798,0.00019860173,0.00008091945,0.0009525831,0.0012562183,0.04406167],"genre_scores_gemma":[0.96401614,0.0016232467,0.02374418,0.00046860919,0.00004959353,0.000027897266,0.0013638689,0.00034144038,0.008365018],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967643,0.0010149255,0.00021241479,0.00042268506,0.0011744981,0.00041121716],"domain_scores_gemma":[0.9765082,0.011676744,0.0014356092,0.0014324371,0.00559326,0.003353777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013958435,0.00032737106,0.00037336486,0.0013637512,0.0014415613,0.0070574977,0.0021431034,0.0018203156,0.0035853004],"category_scores_gemma":[0.026095128,0.00040430707,0.00017468604,0.002607227,0.0011544224,0.009468596,0.0022357693,0.0017286637,0.0008970021],"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.0051219934,0.0018180548,0.083094776,0.0008389849,0.00010680126,0.00085652183,0.018657787,0.024719616,0.029953163,0.27412957,0.05867238,0.50203043],"study_design_scores_gemma":[0.0010629024,0.0023217893,0.061223846,0.0005490221,0.00029071327,0.0013937864,0.058592875,0.22602238,0.101206936,0.1036343,0.44330072,0.00040060983],"about_ca_topic_score_codex":0.014163235,"about_ca_topic_score_gemma":0.016526347,"teacher_disagreement_score":0.014163235,"about_ca_system_score_codex":0.004397818,"about_ca_system_score_gemma":0.004531305,"threshold_uncertainty_score":0.073820174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15248644,0.0011782418,0.8268658,0.002463371,0.00016186618,0.00071246835,0.00013317085,0.003720626,0.012278089],"genre_scores_gemma":[0.95804274,0.00012452381,0.03913355,0.00015343913,0.000066038425,0.00011584954,0.000037967402,0.000057859044,0.002268013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9883499,0.004647684,0.00076370867,0.0014879622,0.0036681728,0.0010824609],"domain_scores_gemma":[0.9657601,0.017690636,0.0043101627,0.0074632275,0.0034885532,0.0012872268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009252316,0.0011823925,0.0019024197,0.0016401535,0.0029528136,0.003826297,0.003226969,0.0034435422,0.001723421],"category_scores_gemma":[0.037335705,0.0010901453,0.00058022246,0.001123671,0.004623124,0.0069789244,0.0061038965,0.002530163,0.0007476464],"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.0021718473,0.0014029135,0.01813111,0.00062204414,0.00026830912,0.002549617,0.0026641935,0.41233534,0.022067113,0.23708716,0.0110291615,0.28967118],"study_design_scores_gemma":[0.0000641181,0.00023613535,0.0008141804,0.00002633935,0.000033489072,0.00052685686,0.00026026467,0.8940528,0.004286939,0.097448714,0.0022112762,0.00003879654],"about_ca_topic_score_codex":0.002766784,"about_ca_topic_score_gemma":0.0019209692,"teacher_disagreement_score":0.009252316,"about_ca_system_score_codex":0.0015496137,"about_ca_system_score_gemma":0.0028738147,"threshold_uncertainty_score":0.04893148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031913057,0.00006908784,0.9654745,0.00022775396,0.00002053838,0.00005758681,0.000011403858,0.0004414229,0.0017846224],"genre_scores_gemma":[0.73269916,0.000099763536,0.26562962,0.00006505012,0.0000251891,0.00011671028,0.00004093202,0.00009484832,0.0012287396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904317,0.00036408711,0.000056558278,0.00012422907,0.00032370657,0.000088180364],"domain_scores_gemma":[0.99835485,0.00056014984,0.00017297348,0.00043274192,0.00028243547,0.00019693005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014527307,0.0003707623,0.00040482153,0.00044120455,0.00088151207,0.0015839437,0.00177307,0.0006804778,0.00071545807],"category_scores_gemma":[0.004836341,0.000458096,0.00047576337,0.00039821345,0.0010869234,0.001982382,0.002293911,0.0013784465,0.00015559257],"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.00028672838,0.0002703048,0.0036552222,0.0001221349,0.00011229425,0.0002422682,0.0013402738,0.7186367,0.05725074,0.12025789,0.0012047276,0.096620806],"study_design_scores_gemma":[0.00004447426,0.00006146638,0.0002726063,0.0000073811834,0.000023851624,0.000053910993,0.00006162721,0.9684899,0.008805658,0.018259736,0.003894321,0.000025114996],"about_ca_topic_score_codex":0.002294332,"about_ca_topic_score_gemma":0.003367515,"teacher_disagreement_score":0.002294332,"about_ca_system_score_codex":0.000818573,"about_ca_system_score_gemma":0.0011691209,"threshold_uncertainty_score":0.00768286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14097013,0.00052486325,0.83726716,0.00034630785,0.00020776478,0.00029931456,0.00015775343,0.008393472,0.01183316],"genre_scores_gemma":[0.86245656,0.0001557199,0.13234845,0.000067928304,0.000066902474,0.000121890014,0.000259639,0.00032771073,0.004195129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995204,0.00006867224,0.000030958556,0.00008553199,0.0002196483,0.000074747106],"domain_scores_gemma":[0.9991246,0.00018453208,0.00008539617,0.00017505455,0.00023730459,0.00019313823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044836433,0.00073055626,0.00079140294,0.0010090705,0.0013765272,0.001269185,0.0032025485,0.00058516196,0.0036043925],"category_scores_gemma":[0.0019109752,0.00036617913,0.00028072117,0.00085972395,0.00046237386,0.0015331833,0.0022153144,0.0006769839,0.001213333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012711989,0.0008200857,0.0052942657,0.00026942632,0.00013679538,0.00042191794,0.000979947,0.35186586,0.12347639,0.020808646,0.014011667,0.48064375],"study_design_scores_gemma":[0.000039004288,0.00007005014,0.0006323891,0.0000046051005,0.000012458579,0.00006333527,0.00008218633,0.98346543,0.0074716765,0.00452941,0.0036028048,0.0000266793],"about_ca_topic_score_codex":0.005812614,"about_ca_topic_score_gemma":0.0087935105,"teacher_disagreement_score":0.005812614,"about_ca_system_score_codex":0.00067850854,"about_ca_system_score_gemma":0.00066900416,"threshold_uncertainty_score":0.012057841},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023454694,0.0021946782,0.9654993,0.0005621677,0.00016910232,0.00044656466,0.0004070955,0.0034295104,0.003836994],"genre_scores_gemma":[0.4870344,0.0017968679,0.5032444,0.00017821357,0.00018436319,0.0008538342,0.0011366762,0.00028209062,0.0052890936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957989,0.0013246406,0.00041491928,0.00070874643,0.0013796523,0.00037320395],"domain_scores_gemma":[0.9962999,0.0009558436,0.0006303423,0.001091016,0.0007765282,0.00024640813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035460938,0.0009091439,0.0011068839,0.0025463377,0.0015386721,0.00298947,0.0035061764,0.0013694462,0.002270756],"category_scores_gemma":[0.007106942,0.00049149996,0.0009108555,0.0033898253,0.0008506528,0.0036569126,0.003160799,0.0011021533,0.0010831006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00098607,0.00049485615,0.006062706,0.0016436514,0.00035314832,0.000824894,0.0009703294,0.24264258,0.07811309,0.1974453,0.02454976,0.44591355],"study_design_scores_gemma":[0.0002504856,0.00052429654,0.0027872028,0.00008142351,0.00019580772,0.0014292637,0.00046155855,0.8050109,0.049380116,0.07322354,0.06642646,0.00022904688],"about_ca_topic_score_codex":0.0029548767,"about_ca_topic_score_gemma":0.002405369,"teacher_disagreement_score":0.0035460938,"about_ca_system_score_codex":0.0011173206,"about_ca_system_score_gemma":0.0026820658,"threshold_uncertainty_score":0.018753707},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023077405,0.00017797234,0.98568314,0.000458313,0.00038836716,0.0010123336,0.00021590237,0.0047122464,0.0050440715],"genre_scores_gemma":[0.17262167,0.00058674486,0.7811941,0.00086496887,0.00039201637,0.0064973254,0.0015274176,0.0012096416,0.035106115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410325,0.0011647769,0.00082058256,0.001026581,0.0024277656,0.0004571069],"domain_scores_gemma":[0.99143445,0.0020052684,0.0006808162,0.0032238953,0.0019900142,0.00066555495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005301616,0.0013769645,0.0013844498,0.0017241201,0.0031481155,0.0037511704,0.0041451766,0.0027604864,0.016416255],"category_scores_gemma":[0.012325124,0.0013509839,0.0009723665,0.0014120868,0.002365335,0.005811333,0.008763073,0.0050367443,0.0060640546],"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.00121639,0.0005752097,0.0010660415,0.0008539039,0.0002331682,0.00073612656,0.0014174057,0.02444033,0.06858184,0.55845463,0.055115163,0.28730986],"study_design_scores_gemma":[0.00086263515,0.0008849956,0.0006426233,0.00015727433,0.00018788945,0.0014583202,0.0003397213,0.36492223,0.07186147,0.21232608,0.34592152,0.00043523844],"about_ca_topic_score_codex":0.0015233771,"about_ca_topic_score_gemma":0.0013509459,"teacher_disagreement_score":0.016416255,"about_ca_system_score_codex":0.0015095134,"about_ca_system_score_gemma":0.003146051,"threshold_uncertainty_score":0.054917812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032699753,0.00019208132,0.94011104,0.00017192561,0.00014040885,0.0008301736,0.00009093324,0.010587333,0.0151764555],"genre_scores_gemma":[0.3233199,0.00027532893,0.64509094,0.00022473962,0.000085340274,0.000925626,0.00023607851,0.0012501018,0.028592093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990565,0.00020572923,0.00005836209,0.00018295023,0.00037278287,0.00012365391],"domain_scores_gemma":[0.9986646,0.0005116022,0.0001242916,0.0002912615,0.00021213625,0.00019608004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124855,0.0013012114,0.000668264,0.00036501576,0.00093082414,0.0018239913,0.003054857,0.0009843854,0.01083062],"category_scores_gemma":[0.003440897,0.00047163566,0.0005991825,0.00018252787,0.0013148179,0.002784662,0.0026466413,0.0016738231,0.0013916297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037044652,0.0014205616,0.0034052944,0.001446527,0.00032456982,0.0010608683,0.005133768,0.04942822,0.2997113,0.17483795,0.017187461,0.44233894],"study_design_scores_gemma":[0.0007118127,0.0026499752,0.002278863,0.00024982175,0.00040479907,0.0011465817,0.00067838683,0.5480874,0.22004405,0.036062516,0.18745346,0.00023231692],"about_ca_topic_score_codex":0.002068353,"about_ca_topic_score_gemma":0.0029438734,"teacher_disagreement_score":0.01083062,"about_ca_system_score_codex":0.0007215191,"about_ca_system_score_gemma":0.00075543905,"threshold_uncertainty_score":0.036231995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31939015,0.010061649,0.6447985,0.004170658,0.0002642438,0.00034035096,0.0002921578,0.0004460235,0.020236256],"genre_scores_gemma":[0.96808696,0.003404057,0.025335869,0.00011951587,0.00039061363,0.00015588192,0.00010042768,0.000048526614,0.0023582361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9969408,0.0012254927,0.0001425019,0.00050127076,0.000911813,0.0002781155],"domain_scores_gemma":[0.9823,0.013242104,0.0014581819,0.0011811234,0.0010763602,0.00074223505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002693836,0.0007069113,0.0011960639,0.00179925,0.002445204,0.0026268999,0.0017111413,0.0019879437,0.0019311045],"category_scores_gemma":[0.021692542,0.0005758294,0.0005485558,0.0018141001,0.003217885,0.007543246,0.002793881,0.0017127743,0.00045945655],"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.0002679945,0.00029424627,0.009486314,0.00062100636,0.00014350595,0.0020084614,0.00295371,0.4430702,0.0086942585,0.46007589,0.0038125166,0.06857194],"study_design_scores_gemma":[0.000029282171,0.00017042675,0.0020264268,0.000051871946,0.000049892136,0.00050186407,0.00044674403,0.8415965,0.001130442,0.14848842,0.005448564,0.00005957627],"about_ca_topic_score_codex":0.0029718038,"about_ca_topic_score_gemma":0.0019687957,"teacher_disagreement_score":0.0029718038,"about_ca_system_score_codex":0.0016603156,"about_ca_system_score_gemma":0.00084320415,"threshold_uncertainty_score":0.014246523},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43274444,0.00031418272,0.56229395,0.00040528577,0.00003330337,0.00010046107,0.00010258913,0.00068571354,0.0033201054],"genre_scores_gemma":[0.966475,0.0001120643,0.03238462,0.00003194213,0.0000073738397,0.00003679761,0.000049757546,0.00004832284,0.0008540815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883884,0.0003633578,0.00007945972,0.00018642707,0.00026015576,0.00027175754],"domain_scores_gemma":[0.99715084,0.0013752105,0.0003489258,0.00051802385,0.00043798084,0.00016906484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026843806,0.000643997,0.00090818846,0.00047376263,0.0007874885,0.0011198305,0.00096387335,0.0005403998,0.0010926385],"category_scores_gemma":[0.005459319,0.00031047018,0.00027064013,0.0006160708,0.00087085273,0.002906641,0.0015971093,0.0008321282,0.00018921628],"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.00027183662,0.00011881009,0.0015819871,0.00009000034,0.00003721064,0.00013415348,0.00013586445,0.9211639,0.021694336,0.010512699,0.0005939445,0.043665238],"study_design_scores_gemma":[0.000014882524,0.00010619474,0.00022919192,0.0000041646726,0.000010602519,0.000030060772,0.00011453571,0.9826347,0.00820025,0.008309906,0.0003385887,0.000006847067],"about_ca_topic_score_codex":0.0021919478,"about_ca_topic_score_gemma":0.0028564893,"teacher_disagreement_score":0.0026843806,"about_ca_system_score_codex":0.00088743796,"about_ca_system_score_gemma":0.0014470808,"threshold_uncertainty_score":0.014196575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053621687,0.0012520752,0.83772063,0.004592278,0.00037358623,0.00071543653,0.00040722147,0.0009928585,0.100324236],"genre_scores_gemma":[0.88653547,0.0010058343,0.08662932,0.00047395806,0.00033852315,0.00067758886,0.00048120375,0.0001022576,0.023755904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635905,0.0013735408,0.00015557629,0.000672925,0.0011300107,0.00030879022],"domain_scores_gemma":[0.99419457,0.0018772153,0.0004126726,0.00220552,0.00084780814,0.00046224013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003170768,0.0003397025,0.0006638071,0.0009211221,0.0021714412,0.0025202264,0.0015212108,0.0008988866,0.006142792],"category_scores_gemma":[0.008341819,0.00034785483,0.00061595073,0.001088387,0.0016803816,0.0030049514,0.004710328,0.0009526073,0.001469217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020210087,0.00020139515,0.0018262796,0.00033289168,0.00014998968,0.00026130464,0.0012277091,0.04646735,0.007454223,0.80402464,0.016849125,0.12100305],"study_design_scores_gemma":[0.00012561855,0.00012674657,0.001064896,0.00007322836,0.000057487687,0.00028225305,0.0004234127,0.19843712,0.0043599694,0.6939275,0.10107558,0.000046240788],"about_ca_topic_score_codex":0.0009073496,"about_ca_topic_score_gemma":0.00097607414,"teacher_disagreement_score":0.006142792,"about_ca_system_score_codex":0.0012570537,"about_ca_system_score_gemma":0.0025312111,"threshold_uncertainty_score":0.020549715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017840734,0.00048971816,0.97866863,0.0001234009,0.00007568364,0.00005452458,0.000039977753,0.0010397827,0.0016675781],"genre_scores_gemma":[0.6175173,0.00082871626,0.37622073,0.00010904156,0.000053635118,0.00010718674,0.00015035413,0.00026904605,0.0047440063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996505,0.00006635929,0.00002320322,0.00008709514,0.00014069138,0.000032139484],"domain_scores_gemma":[0.9992754,0.0002510386,0.00011000165,0.00013289222,0.00018211149,0.000048558173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994008,0.00084410614,0.00088311615,0.0007969995,0.0006114854,0.0011307503,0.002139794,0.00081529643,0.0007380828],"category_scores_gemma":[0.002168382,0.00055341044,0.00056949304,0.0008296868,0.0005571287,0.0021554304,0.0010451917,0.0008204327,0.0003781992],"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.0002134054,0.000119965574,0.0027575644,0.00022947279,0.00012473317,0.00032660758,0.00043448736,0.70372105,0.012336379,0.015348816,0.0028135781,0.261574],"study_design_scores_gemma":[0.000022887543,0.000032681968,0.00027138335,0.000010437072,0.000018909643,0.00011004791,0.00003227147,0.98896325,0.0033908233,0.0046379208,0.0024883747,0.000020865855],"about_ca_topic_score_codex":0.010993277,"about_ca_topic_score_gemma":0.009815659,"teacher_disagreement_score":0.010993277,"about_ca_system_score_codex":0.0004966782,"about_ca_system_score_gemma":0.00087798137,"threshold_uncertainty_score":0.021858573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012088771,0.00053872174,0.92079175,0.004955921,0.0007640426,0.00017297028,0.000373825,0.008763443,0.051550467],"genre_scores_gemma":[0.32968137,0.0012424934,0.57764596,0.001459311,0.00046270958,0.0004921273,0.00066797185,0.0062663383,0.08208175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729925,0.0010182768,0.00016767511,0.00044250596,0.0008108065,0.0002614904],"domain_scores_gemma":[0.99533904,0.0014296607,0.0004201898,0.0012932307,0.0010180203,0.00049981935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033084971,0.0006245908,0.0005213728,0.0007240736,0.0013582011,0.004068582,0.0020074714,0.0012868899,0.023824481],"category_scores_gemma":[0.011970423,0.0006900839,0.00055459276,0.0007259038,0.0021943946,0.008517212,0.002405678,0.0026045996,0.0055579203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000543399,0.00022104662,0.002512865,0.0004395949,0.00005564554,0.0004184084,0.0023588033,0.020917315,0.005268148,0.54069996,0.07996268,0.34660223],"study_design_scores_gemma":[0.00019204059,0.0002573851,0.0014273145,0.00037048155,0.000082986226,0.00067629694,0.000811123,0.16574544,0.02014968,0.34521797,0.4648882,0.00018109444],"about_ca_topic_score_codex":0.0061690975,"about_ca_topic_score_gemma":0.0049656862,"teacher_disagreement_score":0.023824481,"about_ca_system_score_codex":0.0011653301,"about_ca_system_score_gemma":0.0017282193,"threshold_uncertainty_score":0.07970083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5439789,0.0006266074,0.43048763,0.0010612389,0.00020251019,0.0006592173,0.0002335739,0.008151792,0.014598506],"genre_scores_gemma":[0.94264245,0.00014708306,0.05562066,0.00011778389,0.000045592027,0.000102702565,0.00016794738,0.0001128787,0.0010427737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988636,0.00019419895,0.000080898906,0.00025340496,0.0003223276,0.00028559423],"domain_scores_gemma":[0.9974141,0.0005679915,0.00019125588,0.00068150176,0.00062312995,0.00052184303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189523,0.00090397336,0.0009821085,0.00066782784,0.0010123594,0.0017770504,0.0031059978,0.0007037172,0.0016334855],"category_scores_gemma":[0.0038551455,0.00042275264,0.00042906983,0.0010435769,0.00069457316,0.0031634746,0.0024020942,0.0011660063,0.0007189795],"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.0024752498,0.0031444177,0.02045287,0.00023988828,0.00022795764,0.0010253772,0.0006185266,0.5393024,0.087471046,0.024476565,0.016886529,0.3036793],"study_design_scores_gemma":[0.00007621133,0.000104594284,0.0012888004,0.0000053408007,0.000021856451,0.000092700924,0.000116735784,0.9854977,0.005997221,0.004987576,0.0017915718,0.000019716417],"about_ca_topic_score_codex":0.0123867,"about_ca_topic_score_gemma":0.0075867386,"teacher_disagreement_score":0.0123867,"about_ca_system_score_codex":0.0013406895,"about_ca_system_score_gemma":0.0011745257,"threshold_uncertainty_score":0.024629235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4116639,0.0018518536,0.5409067,0.00053445675,0.0005625201,0.0007974357,0.00033861163,0.022613337,0.020731077],"genre_scores_gemma":[0.8751759,0.0003604288,0.11636744,0.0001888059,0.00007001973,0.0001902546,0.00043469502,0.00025513422,0.0069572534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993851,0.00006624279,0.000034687848,0.00013255705,0.00025724297,0.00012413858],"domain_scores_gemma":[0.9987929,0.0001867931,0.00012164252,0.0004010471,0.00026999312,0.00022753855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006394906,0.000729317,0.00050359307,0.0011528867,0.00065598695,0.0013650918,0.0026441969,0.00077947264,0.0019414529],"category_scores_gemma":[0.0018647477,0.00035162945,0.00042815253,0.00060379884,0.00090164825,0.0021061632,0.0027997352,0.0009225405,0.0005196101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022950373,0.0016990695,0.011299669,0.0005081672,0.00031567822,0.0026764052,0.001399126,0.119098514,0.30927703,0.04312717,0.031023966,0.4772802],"study_design_scores_gemma":[0.00024167328,0.0011792956,0.0025294714,0.00006473118,0.00009493395,0.0011191657,0.00034057206,0.7564409,0.1870818,0.0060362746,0.044662572,0.00020855626],"about_ca_topic_score_codex":0.0035504338,"about_ca_topic_score_gemma":0.0027997834,"teacher_disagreement_score":0.0035504338,"about_ca_system_score_codex":0.00069567387,"about_ca_system_score_gemma":0.0008689488,"threshold_uncertainty_score":0.007059574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11739581,0.0005948311,0.8501128,0.0051400834,0.00016972274,0.00020875537,0.00011458274,0.0016912401,0.024572091],"genre_scores_gemma":[0.9508649,0.00025556923,0.045243222,0.0002057685,0.0000813254,0.00007882051,0.000078364574,0.00011345834,0.0030786253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946524,0.002423863,0.00036825603,0.0007388389,0.0013554458,0.0004611681],"domain_scores_gemma":[0.9797666,0.007067294,0.0021681695,0.007954134,0.001716415,0.0013273177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006077012,0.0004419429,0.00082359684,0.0014087181,0.003187278,0.006393141,0.0018337893,0.001852107,0.0017409066],"category_scores_gemma":[0.020567462,0.0005729593,0.0007277476,0.0013193198,0.0041802484,0.013569782,0.01008571,0.002243629,0.00057163247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046772434,0.0005782522,0.013264457,0.00026475958,0.00016630538,0.0018003641,0.0071502575,0.104741745,0.00833864,0.6735013,0.0072723874,0.18245377],"study_design_scores_gemma":[0.000060287028,0.00009778535,0.001614311,0.00006531289,0.00007195197,0.00039421968,0.0013049523,0.4064653,0.003339531,0.55905056,0.02745554,0.00008035078],"about_ca_topic_score_codex":0.0039451555,"about_ca_topic_score_gemma":0.0028571996,"teacher_disagreement_score":0.006393141,"about_ca_system_score_codex":0.0013991925,"about_ca_system_score_gemma":0.002450166,"threshold_uncertainty_score":0.032138646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8996453,0.00027545946,0.060627062,0.00052216375,0.000058265097,0.00024510766,0.0005384,0.002740643,0.03534763],"genre_scores_gemma":[0.9845926,0.000044784832,0.0080316495,0.000016638354,0.0000038339513,0.000007929698,0.00021186363,0.00002008349,0.007070522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9995472,0.00004170707,0.000010827803,0.00008447016,0.00021111107,0.00010456776],"domain_scores_gemma":[0.9995654,0.0000854354,0.000034406094,0.00005454272,0.00020654408,0.000053640204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049591844,0.00023472389,0.00023776287,0.00044039567,0.001079449,0.0010539879,0.00074414595,0.00025867464,0.003373185],"category_scores_gemma":[0.00093379547,0.000151199,0.00014152021,0.00082184427,0.00084669515,0.00074258953,0.0006322014,0.00025824562,0.0004308895],"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.0026311188,0.0006168514,0.040973768,0.00021991911,0.00007803374,0.0012854129,0.0006414209,0.4340616,0.05318413,0.03579773,0.014188746,0.41632134],"study_design_scores_gemma":[0.00013015977,0.00024633412,0.016134847,0.000013934406,0.000026449008,0.00016045416,0.00071397616,0.92902213,0.02776702,0.0065583778,0.019192854,0.000033505537],"about_ca_topic_score_codex":0.33380046,"about_ca_topic_score_gemma":0.42780128,"teacher_disagreement_score":0.66619956,"about_ca_system_score_codex":0.0054661757,"about_ca_system_score_gemma":0.005664292,"threshold_uncertainty_score":0.66371506},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00734276,0.009996586,0.002088128,0.88981766,0.03343897,0.0000802541,0.00035257326,0.00075051584,0.056132652],"genre_scores_gemma":[0.0872456,0.009727488,0.0026677377,0.7456633,0.011068886,0.00013029126,0.00033298432,0.0006808974,0.14248286],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941062,0.0021791134,0.00023669499,0.00049176463,0.0021648707,0.0008214032],"domain_scores_gemma":[0.98039585,0.0051115947,0.0019271602,0.00091698644,0.006638629,0.005009855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00547087,0.00077493745,0.000849412,0.00079190155,0.0055031506,0.008031637,0.0013722511,0.00845359,0.07634435],"category_scores_gemma":[0.05222792,0.00027046446,0.0010536636,0.00074983254,0.0047136713,0.0077630845,0.0031338288,0.010645699,0.044827934],"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.000098816454,0.00005504036,0.0029592216,0.00019927598,0.000051433857,0.0008478906,0.0020888385,0.000051194656,0.00037242757,0.0036693257,0.92209214,0.06751443],"study_design_scores_gemma":[0.000035626574,0.0001017666,0.0017631631,0.00054006866,0.000045241715,0.002032471,0.0148300165,0.00014866606,0.00028458927,0.006949575,0.9731785,0.00009028203],"about_ca_topic_score_codex":0.0037430604,"about_ca_topic_score_gemma":0.0066464124,"teacher_disagreement_score":0.07634435,"about_ca_system_score_codex":0.0022336948,"about_ca_system_score_gemma":0.0030883334,"threshold_uncertainty_score":0.25539726},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049511413,0.0073926845,0.3984664,0.0021859452,0.0024822964,0.00078408845,0.0053772484,0.10909085,0.46926928],"genre_scores_gemma":[0.06408857,0.014573374,0.33502987,0.0026402585,0.0018783445,0.001300035,0.019646954,0.0068022474,0.5540404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987411,0.00020087881,0.00012600825,0.00021495769,0.00062131713,0.00009579485],"domain_scores_gemma":[0.9990995,0.0001863376,0.000042301865,0.00033192016,0.00023895483,0.00010110402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012870812,0.0010094667,0.00095368846,0.001801135,0.0011215914,0.0049046353,0.0027140793,0.0015308099,0.047945343],"category_scores_gemma":[0.0027445273,0.0009729795,0.0007185284,0.0020451644,0.0006624982,0.0046651624,0.0024450703,0.0019023382,0.064246155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022107112,0.0001131213,0.00026826558,0.0009531926,0.000048660055,0.0005981968,0.00024160797,0.0042197863,0.008791102,0.1607766,0.38181448,0.44195393],"study_design_scores_gemma":[0.000022226739,0.00003250551,0.00008769,0.000050442646,0.000015496164,0.0004005843,0.000032093918,0.0065281997,0.0039448426,0.012622629,0.97622675,0.00003640781],"about_ca_topic_score_codex":0.00080567045,"about_ca_topic_score_gemma":0.00080295315,"teacher_disagreement_score":0.047945343,"about_ca_system_score_codex":0.00080500747,"about_ca_system_score_gemma":0.0015168996,"threshold_uncertainty_score":0.16039318},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015817058,0.0011634312,0.00043226444,0.09628999,0.0067234994,0.000033848173,0.00081698544,0.0004884087,0.8924699],"genre_scores_gemma":[0.020989582,0.00069416524,0.00044547213,0.0059227413,0.00078473636,0.00002882893,0.0003986837,0.00037510492,0.9703607],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99720794,0.00023605877,0.000079625206,0.00020937253,0.0012835241,0.0009834609],"domain_scores_gemma":[0.993119,0.0010355437,0.00014793419,0.00059337105,0.003829278,0.0012747819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002939911,0.000792242,0.00048095122,0.003955817,0.017561879,0.01661599,0.0016669014,0.004294779,0.17394497],"category_scores_gemma":[0.01744394,0.0003121286,0.0005204277,0.0048881397,0.005291025,0.0091621,0.0031894054,0.0049047885,0.041389912],"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.000021648095,0.000009137672,0.00019103184,0.000039507682,0.0000026234031,0.00006688699,0.0022223287,0.000019755076,0.00009059498,0.09187626,0.8868046,0.018655574],"study_design_scores_gemma":[0.0000032794549,0.0000020906402,0.0003094375,0.000047530237,0.0000020486655,0.000021318818,0.0011079134,0.000019441017,0.00008284497,0.0023411608,0.996053,0.000009813677],"about_ca_topic_score_codex":0.6709847,"about_ca_topic_score_gemma":0.7272899,"teacher_disagreement_score":0.3290153,"about_ca_system_score_codex":0.024328198,"about_ca_system_score_gemma":0.029339772,"threshold_uncertainty_score":0.6619059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012034388,0.0010441255,0.6070007,0.0015710028,0.00075352954,0.0037990978,0.005840982,0.32972842,0.03822773],"genre_scores_gemma":[0.49384913,0.0016363363,0.3645695,0.003074403,0.0008190687,0.008470327,0.03565249,0.018578565,0.07335024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982278,0.00039355338,0.0001969016,0.00032252632,0.00056335784,0.00029583392],"domain_scores_gemma":[0.9983053,0.00041092822,0.0001034685,0.00044596754,0.00034090807,0.00039334357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004110866,0.001136123,0.0009289432,0.001034377,0.00081734103,0.002238723,0.0044508595,0.0015065474,0.056640502],"category_scores_gemma":[0.0054126573,0.00064986234,0.0006843513,0.00065092725,0.00073272997,0.0036830727,0.0051637907,0.0017882736,0.019688053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054879156,0.0013655865,0.0056750947,0.0013563749,0.0003352014,0.0011270248,0.001073847,0.022590993,0.02623733,0.055619463,0.42732036,0.45181087],"study_design_scores_gemma":[0.0019316623,0.0010301016,0.004450819,0.00040370834,0.00019083767,0.0005263201,0.00046581504,0.5127689,0.014744378,0.052073937,0.41108587,0.0003277512],"about_ca_topic_score_codex":0.005547341,"about_ca_topic_score_gemma":0.0030716516,"teacher_disagreement_score":0.056640502,"about_ca_system_score_codex":0.0011938483,"about_ca_system_score_gemma":0.0016478185,"threshold_uncertainty_score":0.18948138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89979327,0.00089114014,0.08483475,0.00024089268,0.00006742443,0.000105123756,0.0020167946,0.001832933,0.010217641],"genre_scores_gemma":[0.9719596,0.000369753,0.024867624,0.00004318822,0.000013493025,0.00004965021,0.0010371854,0.000054324286,0.0016052878],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996166,0.000036573532,0.000011280691,0.00011968852,0.00014118027,0.00007453319],"domain_scores_gemma":[0.99922216,0.0001648622,0.00015098049,0.00008454962,0.0002922892,0.00008501875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024911278,0.00030464176,0.00018945764,0.001551451,0.00041944813,0.0006971051,0.00053205685,0.00049220887,0.0022171354],"category_scores_gemma":[0.0020093436,0.00023454693,0.0001584477,0.0010559517,0.00028582654,0.0009064966,0.0008995145,0.00034903953,0.00054577866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006792669,0.00008803941,0.0690167,0.0004450026,0.000112954316,0.0016946791,0.0010180412,0.04033405,0.75206363,0.009570771,0.003272914,0.121703975],"study_design_scores_gemma":[0.000028440958,0.00032498268,0.0974008,0.00011645122,0.00014139531,0.0017335924,0.0025705122,0.59129715,0.27698317,0.00877417,0.020538663,0.00009074171],"about_ca_topic_score_codex":0.007470455,"about_ca_topic_score_gemma":0.009982557,"teacher_disagreement_score":0.007470455,"about_ca_system_score_codex":0.00064317905,"about_ca_system_score_gemma":0.00042412124,"threshold_uncertainty_score":0.014853954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5862026,0.0022191168,0.3501738,0.00092113647,0.00046840572,0.00053994416,0.00037061013,0.00407753,0.055026777],"genre_scores_gemma":[0.97216874,0.00022140099,0.019399596,0.000049710274,0.000038369733,0.00007532897,0.00009447757,0.00007380198,0.007878573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987124,0.00037365803,0.000043844986,0.00016731599,0.0002624407,0.0004403754],"domain_scores_gemma":[0.9976405,0.001387482,0.00014273702,0.00025857182,0.00034593607,0.0002247904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010328385,0.0015445336,0.0010059136,0.00091555185,0.0011490061,0.0016172649,0.0016613354,0.00065774797,0.009284609],"category_scores_gemma":[0.0043895408,0.00039666783,0.00041720062,0.00073345436,0.0005724776,0.0019855667,0.0021443684,0.0007322148,0.0010188853],"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.005523841,0.0014780218,0.0025547685,0.00037758827,0.00020286463,0.0002707147,0.0004210253,0.62769073,0.02177101,0.033831056,0.012426429,0.29345196],"study_design_scores_gemma":[0.00006463889,0.0003692607,0.0003373054,0.000012271295,0.000030184723,0.000041176725,0.00008894647,0.98873514,0.0021199463,0.0074423603,0.0007448431,0.000013879231],"about_ca_topic_score_codex":0.0078058857,"about_ca_topic_score_gemma":0.010980546,"teacher_disagreement_score":0.009284609,"about_ca_system_score_codex":0.0012521019,"about_ca_system_score_gemma":0.0015079468,"threshold_uncertainty_score":0.03106016},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009634957,0.0010564928,0.9764717,0.00017183712,0.00041606696,0.00014501343,0.0002541967,0.0020500284,0.009799625],"genre_scores_gemma":[0.32903567,0.0021029192,0.6480726,0.00012308604,0.00041651385,0.00024134426,0.0015705312,0.00035131795,0.01808598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.00012907604,0.00005195555,0.000099838835,0.00025981886,0.00006573976],"domain_scores_gemma":[0.9989795,0.0002713581,0.000058024012,0.0003604805,0.0002712215,0.00005952409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009545657,0.00032990135,0.0008134464,0.0012623095,0.0007607202,0.0014804637,0.0015648745,0.0004512874,0.0036659578],"category_scores_gemma":[0.0027768696,0.00035627725,0.00024217418,0.0019867234,0.00048304096,0.0020368777,0.0011477481,0.0009053887,0.0015287662],"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.00039662677,0.0001546405,0.0010250716,0.00034674435,0.000059337086,0.00014502824,0.00036577112,0.06769899,0.032370433,0.1324288,0.025065338,0.73994327],"study_design_scores_gemma":[0.000120717814,0.00029310898,0.0012370384,0.0000841515,0.000104816056,0.00076033856,0.00025945922,0.76018906,0.031519804,0.09246747,0.11288066,0.00008330534],"about_ca_topic_score_codex":0.0008910253,"about_ca_topic_score_gemma":0.0011855897,"teacher_disagreement_score":0.0036659578,"about_ca_system_score_codex":0.0006546835,"about_ca_system_score_gemma":0.0005469713,"threshold_uncertainty_score":0.0122638345},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18298958,0.019862235,0.33909383,0.085292235,0.0036935434,0.00009595373,0.0005551038,0.0018214246,0.36659613],"genre_scores_gemma":[0.91486555,0.008249359,0.039496545,0.0033451782,0.0012731233,0.00007995228,0.00029335276,0.000438997,0.03195783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.00013174838,0.000018684577,0.00012004491,0.00011065448,0.000064409156],"domain_scores_gemma":[0.9979291,0.00063141435,0.00020508026,0.00074978766,0.00023318047,0.00025145608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122815,0.00023900089,0.00051132345,0.0006666826,0.0012532591,0.0033488667,0.0012378956,0.0015496026,0.0049921554],"category_scores_gemma":[0.008303542,0.00034468278,0.00030058742,0.0009001546,0.009204438,0.009169359,0.0017768525,0.0030392408,0.0012589481],"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.000016888756,0.0000068875243,0.00035121953,0.00004992843,0.000007869446,0.000080839134,0.0005823549,0.0015504803,0.00052416394,0.9628071,0.007310176,0.02671203],"study_design_scores_gemma":[0.0000067313767,0.000012146106,0.00036422687,0.00004186678,0.0000052521596,0.00030056326,0.0003106281,0.0033533808,0.0002939689,0.9609303,0.034367453,0.000013427024],"about_ca_topic_score_codex":0.0014403489,"about_ca_topic_score_gemma":0.0014643478,"teacher_disagreement_score":0.0049921554,"about_ca_system_score_codex":0.0008265085,"about_ca_system_score_gemma":0.0005960319,"threshold_uncertainty_score":0.016700447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685787,0.0006603333,0.021511912,0.00019387197,0.0000339585,0.00016826435,0.000077397286,0.000609707,0.008165889],"genre_scores_gemma":[0.9935569,0.00012963601,0.005517365,0.000015305674,0.00001382916,0.000029339217,0.00004739648,0.00002224307,0.0006679524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997361,0.0009746934,0.000117176496,0.0003025178,0.0009391421,0.00030534496],"domain_scores_gemma":[0.9915863,0.005147871,0.00060181617,0.0009606984,0.0012937045,0.00040968068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594157,0.00054811605,0.00067342375,0.001241963,0.0013590455,0.001762035,0.0010786508,0.0008909625,0.0012135486],"category_scores_gemma":[0.012645114,0.00029114625,0.00030007228,0.0011609165,0.000834157,0.0036378494,0.0013912905,0.00043037225,0.00037240968],"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.0020029196,0.002222997,0.05160391,0.0008611821,0.00040488498,0.0014953141,0.0028492145,0.47599682,0.09171282,0.02565514,0.004716275,0.34047857],"study_design_scores_gemma":[0.000077461955,0.0012947768,0.016367441,0.000037686004,0.00011755395,0.00075982435,0.0016434744,0.9041655,0.058184393,0.0126616815,0.004598166,0.00009200396],"about_ca_topic_score_codex":0.0038006394,"about_ca_topic_score_gemma":0.0022786898,"teacher_disagreement_score":0.0038006394,"about_ca_system_score_codex":0.0010000604,"about_ca_system_score_gemma":0.00072786835,"threshold_uncertainty_score":0.01371938},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12022013,0.014030489,0.52338517,0.008087019,0.0015146808,0.00047717852,0.00059314485,0.0065116016,0.32518056],"genre_scores_gemma":[0.6761274,0.006823608,0.1305142,0.00044630186,0.0009836867,0.00034955214,0.0013621977,0.0009051734,0.18248796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00022701509,0.00003588189,0.00015769298,0.0003414766,0.00007363258],"domain_scores_gemma":[0.9979557,0.0007616655,0.000084428364,0.00052156503,0.00035271203,0.00032386035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529685,0.00040899607,0.00065118476,0.001570141,0.0019060757,0.0034240298,0.0010701917,0.0012289522,0.010279099],"category_scores_gemma":[0.0037867038,0.0004983506,0.0003947485,0.001932179,0.0011120113,0.0058378847,0.003434172,0.0011631509,0.0034972562],"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.00022511196,0.00021747012,0.0013619008,0.00041956423,0.00006915571,0.00050854514,0.0015728783,0.016719487,0.0068326565,0.6033929,0.05019095,0.3184894],"study_design_scores_gemma":[0.00009157598,0.00007994349,0.00094123953,0.00013029545,0.000038960232,0.0004473278,0.0006530479,0.0650486,0.003095045,0.7015566,0.22788,0.000037335216],"about_ca_topic_score_codex":0.0013478178,"about_ca_topic_score_gemma":0.0015714706,"teacher_disagreement_score":0.010279099,"about_ca_system_score_codex":0.00058835663,"about_ca_system_score_gemma":0.0007676226,"threshold_uncertainty_score":0.034386992},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90740055,0.00092228205,0.073181,0.0010451812,0.00020914889,0.0003876616,0.007915344,0.00096659263,0.007972119],"genre_scores_gemma":[0.9742613,0.00020659735,0.018027332,0.00007326206,0.00008092536,0.0001594627,0.005503172,0.000054103373,0.0016337197],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878603,0.00019478945,0.0001291576,0.00029530824,0.0004054,0.00018929201],"domain_scores_gemma":[0.9932601,0.00325535,0.0012999711,0.00056922727,0.0012677761,0.0003475252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017582799,0.0007071229,0.0004185971,0.004525795,0.0005690424,0.0012398361,0.00075618096,0.00064083625,0.0016497438],"category_scores_gemma":[0.012823448,0.00016114212,0.00057867495,0.002806669,0.00031926995,0.0016977199,0.000659631,0.0011204612,0.000728724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007579393,0.00079777156,0.58203197,0.0002794379,0.00022249027,0.00025379908,0.00047338646,0.15876208,0.004933576,0.0051998897,0.010987106,0.23530062],"study_design_scores_gemma":[0.00001590713,0.00026982804,0.21204427,0.000043941352,0.000034344426,0.0002803029,0.0004038938,0.7739667,0.0029285662,0.0047867633,0.0051792706,0.000046202345],"about_ca_topic_score_codex":0.014767582,"about_ca_topic_score_gemma":0.014536829,"teacher_disagreement_score":0.014767582,"about_ca_system_score_codex":0.0021250348,"about_ca_system_score_gemma":0.00077414216,"threshold_uncertainty_score":0.029363275},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09817502,0.013287721,0.3482462,0.030371455,0.08510307,0.011628606,0.0069544823,0.017683644,0.38854986],"genre_scores_gemma":[0.30267152,0.008396224,0.15761578,0.0030749126,0.010644694,0.0023246312,0.010190425,0.002825769,0.502256],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940653,0.0010100445,0.00031678603,0.0005613252,0.0036515682,0.00039509457],"domain_scores_gemma":[0.975293,0.0028128026,0.00083054113,0.0027390951,0.016825432,0.0014991559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049849963,0.00055769854,0.0010600731,0.0022554542,0.0031489143,0.0026097961,0.0017319741,0.0012683197,0.040048532],"category_scores_gemma":[0.021626558,0.00031244004,0.0006465769,0.0016571379,0.0006772449,0.0019885406,0.001979907,0.0009748947,0.025886664],"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.0003370633,0.000108515575,0.0039998963,0.0015923209,0.0000643464,0.000955778,0.0003374641,0.0018572982,0.014122672,0.02068937,0.5173843,0.438551],"study_design_scores_gemma":[0.000078476245,0.00016357147,0.003233546,0.00015426216,0.00005872982,0.00077639456,0.00024912268,0.015196993,0.016370375,0.006047062,0.95760006,0.000071396484],"about_ca_topic_score_codex":0.002318351,"about_ca_topic_score_gemma":0.005715516,"teacher_disagreement_score":0.040048532,"about_ca_system_score_codex":0.0009025047,"about_ca_system_score_gemma":0.0059760544,"threshold_uncertainty_score":0.13397568},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036922595,0.07985804,0.7367525,0.017407961,0.021128712,0.0006775863,0.0010308424,0.005281375,0.13417077],"genre_scores_gemma":[0.14816616,0.14448507,0.28043213,0.0030252119,0.033479948,0.0010441213,0.0033991418,0.0017292321,0.38423887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985707,0.00014329831,0.00007486447,0.00031388036,0.000770796,0.00012651291],"domain_scores_gemma":[0.9981323,0.00054657354,0.000059119717,0.00036220258,0.00072536094,0.0001745373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00197863,0.0010759373,0.0013135299,0.0010678351,0.000991864,0.0037223944,0.0025369339,0.001609152,0.036080457],"category_scores_gemma":[0.004470595,0.0004727519,0.00044380483,0.0022360107,0.0011289374,0.007301945,0.0017781816,0.0018553848,0.01870651],"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.00007371855,0.000082688035,0.0001245536,0.0011632675,0.000029397806,0.000070349706,0.00015125357,0.0057547325,0.004808784,0.15320782,0.18403013,0.6505032],"study_design_scores_gemma":[0.000026482146,0.00009759018,0.00024905152,0.00030046163,0.000028897879,0.00017459026,0.00012603564,0.01826391,0.0056030266,0.14085668,0.8342334,0.000039904222],"about_ca_topic_score_codex":0.001156327,"about_ca_topic_score_gemma":0.0010137642,"teacher_disagreement_score":0.036080457,"about_ca_system_score_codex":0.0018521951,"about_ca_system_score_gemma":0.0016064331,"threshold_uncertainty_score":0.120701134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07741563,0.022723798,0.77061975,0.007670481,0.0019838733,0.0018108595,0.003462065,0.011517996,0.10279559],"genre_scores_gemma":[0.75366724,0.01040013,0.19380257,0.00058150775,0.0011844579,0.0011390571,0.0032027503,0.00075136026,0.03527098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987998,0.00032207687,0.000074854666,0.000088203546,0.0005215136,0.000193528],"domain_scores_gemma":[0.99688333,0.0012256161,0.00013872463,0.0009882179,0.0006124972,0.00015167259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001924166,0.00060684537,0.0009154811,0.0011924863,0.0012584805,0.0011786075,0.0019780612,0.0010974904,0.011622208],"category_scores_gemma":[0.004701593,0.00034889637,0.00042541148,0.0014769385,0.00044540368,0.0029599215,0.002221288,0.0011756271,0.0019037783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020225386,0.00049545366,0.001574924,0.0015107106,0.00023540076,0.00048394926,0.00027971144,0.08793529,0.036589056,0.14178917,0.13904747,0.58803636],"study_design_scores_gemma":[0.0006286201,0.0009855444,0.0025033294,0.00040567265,0.00035575958,0.0009587242,0.00027635647,0.6653387,0.025260758,0.14306098,0.16011475,0.00011085048],"about_ca_topic_score_codex":0.0021093464,"about_ca_topic_score_gemma":0.0024597768,"teacher_disagreement_score":0.011622208,"about_ca_system_score_codex":0.0011955462,"about_ca_system_score_gemma":0.00091060257,"threshold_uncertainty_score":0.03888023},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21954718,0.0005836033,0.47696388,0.006122862,0.0005444555,0.00009844398,0.00005776025,0.0010022381,0.29507953],"genre_scores_gemma":[0.8963316,0.00024014036,0.06451942,0.00029812963,0.00007627515,0.000078572426,0.000047948623,0.0005619896,0.03784595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986688,0.00068228715,0.000024074754,0.00013957037,0.0003571465,0.00012814638],"domain_scores_gemma":[0.9980934,0.0008551693,0.00009613501,0.00050770753,0.0002097284,0.00023783866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024280364,0.0003638604,0.00017580004,0.00061386346,0.0036159137,0.004867489,0.0008917574,0.0010751244,0.005352364],"category_scores_gemma":[0.004889394,0.00021174055,0.00025883352,0.000321284,0.009508747,0.007047169,0.0073708477,0.0024347086,0.000982804],"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.00009669277,0.000040971594,0.0016252332,0.000099704026,0.000012917205,0.00090046565,0.16760328,0.0058071683,0.017317964,0.72580105,0.00640843,0.07428605],"study_design_scores_gemma":[0.000024718098,0.00013563562,0.0020249006,0.00018899285,0.000026779398,0.0022580149,0.07039582,0.032007564,0.012976441,0.39920703,0.4806398,0.00011429478],"about_ca_topic_score_codex":0.0007637008,"about_ca_topic_score_gemma":0.0014027595,"teacher_disagreement_score":0.005352364,"about_ca_system_score_codex":0.0011342495,"about_ca_system_score_gemma":0.0007554254,"threshold_uncertainty_score":0.017905474},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09739077,0.00040942495,0.8888741,0.00057110906,0.00035556278,0.00033492368,0.000104422375,0.0039180373,0.0080417385],"genre_scores_gemma":[0.89161414,0.00013034763,0.10464451,0.0001265559,0.00014934316,0.0001873685,0.00015709647,0.000098412114,0.0028922115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990778,0.00021506996,0.000075730146,0.00021206944,0.00030549243,0.00011386584],"domain_scores_gemma":[0.99894494,0.00018647053,0.000115900286,0.00027659506,0.0003186834,0.00015744874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506455,0.0006018752,0.00076166214,0.0009932631,0.0018622023,0.0011967511,0.0018380388,0.00082704733,0.0017905964],"category_scores_gemma":[0.0018593727,0.0002307662,0.00027415992,0.0009972887,0.00062614854,0.0013378699,0.0013762055,0.0007362966,0.0006035704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013262741,0.0007602984,0.002255011,0.000297603,0.0001523393,0.00090967905,0.00076488376,0.34523576,0.15839656,0.061884347,0.02238685,0.4056304],"study_design_scores_gemma":[0.00007945251,0.00013956391,0.00035216904,0.000006606589,0.000024519177,0.00018838496,0.0000574454,0.9736018,0.010273598,0.0072801025,0.007964355,0.000032004726],"about_ca_topic_score_codex":0.0017236146,"about_ca_topic_score_gemma":0.0013402565,"teacher_disagreement_score":0.0018622023,"about_ca_system_score_codex":0.00094749586,"about_ca_system_score_gemma":0.0011194284,"threshold_uncertainty_score":0.0068745613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16101354,0.0011758852,0.8278956,0.0014233764,0.00014546086,0.0003740141,0.00014034548,0.00067827397,0.007153518],"genre_scores_gemma":[0.92701817,0.00035602853,0.06912886,0.000070563234,0.000098713026,0.0001920802,0.000115364186,0.000044722445,0.0029754364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962543,0.0016286683,0.00019478067,0.00053539075,0.0010788849,0.0003080072],"domain_scores_gemma":[0.9870188,0.006884704,0.001565996,0.0015036056,0.0018752118,0.0011517649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035997252,0.00042641553,0.0010091618,0.0010680448,0.0028917182,0.002119595,0.0023864475,0.0020248727,0.0011641885],"category_scores_gemma":[0.02173623,0.00051764754,0.0005962177,0.0011711585,0.0020520946,0.004316524,0.0031022707,0.0011157794,0.0004073389],"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.00072979886,0.00045987646,0.0094972635,0.00058905536,0.00024039616,0.0019361597,0.0041122264,0.53267026,0.014580405,0.2825272,0.0076519544,0.14500548],"study_design_scores_gemma":[0.00010421707,0.00015205359,0.001073296,0.00003488109,0.00005308728,0.00037257557,0.00045294617,0.8511177,0.0034327833,0.13654588,0.0065987683,0.000061770595],"about_ca_topic_score_codex":0.004143012,"about_ca_topic_score_gemma":0.0025808737,"teacher_disagreement_score":0.004143012,"about_ca_system_score_codex":0.0014342355,"about_ca_system_score_gemma":0.0014036162,"threshold_uncertainty_score":0.019037366},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08187475,0.0007523925,0.91048414,0.00042732432,0.0002335567,0.0005926851,0.00008411226,0.0012544462,0.004296706],"genre_scores_gemma":[0.74309456,0.0006891589,0.24798463,0.0001035045,0.00017961847,0.00034135612,0.0001287977,0.000071054805,0.0074072666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927634,0.00022271417,0.000044489763,0.00015445301,0.00024071224,0.00006132506],"domain_scores_gemma":[0.9993241,0.0002044906,0.000053770025,0.00009088384,0.00025838992,0.00006847304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010522512,0.00042686128,0.0008542015,0.0004863189,0.001739053,0.0009821347,0.0013975286,0.0010027684,0.002509789],"category_scores_gemma":[0.0022399866,0.00022312431,0.0003484315,0.0005860804,0.00049182004,0.001849248,0.0009434746,0.0007391467,0.00062193524],"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.0009412625,0.0005867147,0.002878901,0.0008790063,0.00018840346,0.0018795293,0.0016304136,0.41146868,0.13547687,0.13660432,0.010732675,0.29673326],"study_design_scores_gemma":[0.00007982662,0.00042893196,0.00054313015,0.000018202461,0.00007395454,0.00044628207,0.00014850561,0.957368,0.015269143,0.009334466,0.016225498,0.00006399133],"about_ca_topic_score_codex":0.0027899053,"about_ca_topic_score_gemma":0.0017203506,"teacher_disagreement_score":0.0027899053,"about_ca_system_score_codex":0.0008897315,"about_ca_system_score_gemma":0.0011885088,"threshold_uncertainty_score":0.008396149},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005776024,0.000052174983,0.99180096,0.00008507887,0.000018567902,0.00006253109,0.00004318937,0.0007779026,0.0013836246],"genre_scores_gemma":[0.19321607,0.00014461325,0.8032623,0.00006494601,0.000032809276,0.00019086545,0.0002347777,0.00010679894,0.0027468053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999374,0.0001599281,0.00004720365,0.00009398711,0.00027908717,0.000045881294],"domain_scores_gemma":[0.99943286,0.0001658913,0.000048011418,0.00013640108,0.00016978935,0.00004706286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009040301,0.00042033734,0.0004814223,0.0006644498,0.000843725,0.0009174131,0.0013789507,0.00058830087,0.0017154875],"category_scores_gemma":[0.0017659578,0.0002532283,0.00035837668,0.00070168375,0.0005408543,0.0016718331,0.0012683208,0.00065348035,0.0007025807],"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.00023270406,0.00023198083,0.0008023013,0.00019091049,0.00005273131,0.00075999193,0.0005230621,0.32872432,0.07095535,0.30153638,0.01293918,0.28305113],"study_design_scores_gemma":[0.000028442291,0.00006465128,0.00011222239,0.0000063489115,0.000010108216,0.00017467687,0.00007354721,0.9460399,0.00839101,0.035462048,0.009609835,0.000027103484],"about_ca_topic_score_codex":0.0015178967,"about_ca_topic_score_gemma":0.001971843,"teacher_disagreement_score":0.0017154875,"about_ca_system_score_codex":0.00049602386,"about_ca_system_score_gemma":0.0009986582,"threshold_uncertainty_score":0.0057388544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22732528,0.001245172,0.76293284,0.0008890335,0.0001653118,0.00019074799,0.00039986803,0.0011663778,0.005685331],"genre_scores_gemma":[0.89403546,0.00025853343,0.100505434,0.00014008363,0.00009187478,0.00023783621,0.0002713723,0.00012725407,0.0043320013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996384,0.0016401387,0.00016196707,0.0005134531,0.0008172276,0.00048315068],"domain_scores_gemma":[0.98459506,0.010844151,0.0010283283,0.0021417204,0.0008502341,0.000540484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003921335,0.0005693014,0.0011825558,0.0010812408,0.0010944918,0.0021641902,0.0024431124,0.0016219444,0.0041596084],"category_scores_gemma":[0.012728982,0.0007449247,0.0008590651,0.0021689858,0.0027746733,0.0055752704,0.0029911902,0.0014810172,0.0008817465],"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.0011850026,0.00015673654,0.0047569512,0.00024839715,0.00014169382,0.00059173815,0.0003956384,0.54150337,0.0062637096,0.39187613,0.0035695226,0.04931104],"study_design_scores_gemma":[0.00016493404,0.0001791575,0.00037360864,0.000027652288,0.000033577413,0.0002552948,0.00009204279,0.8039824,0.0036962905,0.18828511,0.0028724847,0.000037563805],"about_ca_topic_score_codex":0.00057726586,"about_ca_topic_score_gemma":0.00057827996,"teacher_disagreement_score":0.0041596084,"about_ca_system_score_codex":0.0014077346,"about_ca_system_score_gemma":0.00092496484,"threshold_uncertainty_score":0.020738244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16129202,0.0011235375,0.81022424,0.0006037689,0.00019164427,0.0001932721,0.000074946416,0.00059853925,0.02569801],"genre_scores_gemma":[0.90685654,0.0005717816,0.07753223,0.00009354807,0.00015176908,0.0000980065,0.00004740451,0.00006106744,0.014587643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959904,0.00012713607,0.00001675448,0.000112039364,0.0000993575,0.000045648412],"domain_scores_gemma":[0.9995517,0.00013617631,0.000033442582,0.000063937136,0.00015643334,0.00005822914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003660577,0.00037645517,0.00041216364,0.00021829034,0.0005800616,0.0012345744,0.0007409913,0.0005909396,0.003437062],"category_scores_gemma":[0.0009176185,0.00020526804,0.0003201908,0.00028378027,0.0003862519,0.00088604586,0.0006578881,0.0005585457,0.00054357405],"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.0007804795,0.00040699026,0.002070375,0.00033892383,0.00020284796,0.0010790882,0.0011773144,0.37848926,0.22952478,0.12924863,0.008178383,0.24850287],"study_design_scores_gemma":[0.000032643187,0.00028502854,0.00035500023,0.000013185468,0.00005679575,0.00021605717,0.00008706585,0.9753528,0.011365144,0.005203106,0.0070182607,0.000014963653],"about_ca_topic_score_codex":0.0028684172,"about_ca_topic_score_gemma":0.0044142166,"teacher_disagreement_score":0.003437062,"about_ca_system_score_codex":0.0007701119,"about_ca_system_score_gemma":0.00065549545,"threshold_uncertainty_score":0.011498153},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003578519,0.037455343,0.19699302,0.0013821494,0.0030031928,0.00020629377,0.00070332555,0.005297153,0.7513811],"genre_scores_gemma":[0.051096674,0.028896952,0.080363065,0.0009823836,0.000816378,0.00020103765,0.00095219375,0.00057816104,0.8361131],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996996,0.000046510562,0.000012328092,0.00006077702,0.00013977868,0.000041078554],"domain_scores_gemma":[0.99972624,0.00006655941,0.000008614688,0.00008586788,0.00007320292,0.000039585713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022126654,0.0009379976,0.00057483744,0.0011215354,0.0007895108,0.0027711962,0.0015628001,0.0010913413,0.09096994],"category_scores_gemma":[0.0007865855,0.0002462885,0.00033819393,0.00269249,0.0005607174,0.0030643807,0.0016141544,0.001166494,0.05295265],"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.0000795266,0.000050160343,0.00011433792,0.0006540355,0.000022948854,0.0002925188,0.0003026418,0.0011747489,0.006541337,0.098284,0.18848181,0.70400196],"study_design_scores_gemma":[0.000009183464,0.000047687303,0.00014903682,0.00017108288,0.000010031614,0.00066266925,0.00008085068,0.00275315,0.0026564633,0.016153065,0.97728455,0.000022232727],"about_ca_topic_score_codex":0.0006211142,"about_ca_topic_score_gemma":0.0010115269,"teacher_disagreement_score":0.09096994,"about_ca_system_score_codex":0.00052772433,"about_ca_system_score_gemma":0.00037312912,"threshold_uncertainty_score":0.3043248},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028027454,0.00021897002,0.9647505,0.00020417961,0.00010728381,0.0007451448,0.000039142597,0.0019820714,0.0039252597],"genre_scores_gemma":[0.2742592,0.00033283184,0.7160673,0.00024501863,0.00007596117,0.0008173888,0.00015887614,0.00031826374,0.0077252584],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936014,0.00012949338,0.00006438203,0.00009942058,0.00028011738,0.00006659077],"domain_scores_gemma":[0.99937904,0.00011317255,0.000059171496,0.00006356135,0.00030871909,0.00007630782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010783585,0.00041268187,0.0004293159,0.0003758042,0.00057015754,0.0010383975,0.0014549867,0.0011137812,0.0010305566],"category_scores_gemma":[0.0009885931,0.00047330762,0.0004043242,0.00018095304,0.00033135476,0.0006957687,0.00055977545,0.0010498676,0.0006194964],"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.0006414833,0.00044378178,0.0027790219,0.0006249207,0.0001722861,0.0016174937,0.0008279826,0.04424325,0.71327,0.040521104,0.004748215,0.19011052],"study_design_scores_gemma":[0.00022270833,0.0012903347,0.0017915395,0.00006651383,0.0003177906,0.0017843696,0.00015072188,0.5216446,0.39749148,0.0042104013,0.07090447,0.00012512383],"about_ca_topic_score_codex":0.00067059015,"about_ca_topic_score_gemma":0.0006383915,"teacher_disagreement_score":0.0014549867,"about_ca_system_score_codex":0.00041763936,"about_ca_system_score_gemma":0.0007671568,"threshold_uncertainty_score":0.005702913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10997046,0.0020184885,0.8720815,0.00068606547,0.00054337655,0.000350131,0.00024302349,0.005148186,0.008958709],"genre_scores_gemma":[0.8467551,0.0005224475,0.14164285,0.00017825307,0.00039548415,0.00026557705,0.00034562938,0.00048590716,0.0094088325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982755,0.0003904954,0.00013454648,0.000298022,0.0006708194,0.00023058825],"domain_scores_gemma":[0.9957164,0.0024701767,0.00020723711,0.00064481254,0.00073084014,0.00023056395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027225423,0.00075562554,0.0021447395,0.001294664,0.0021231591,0.002825368,0.0033710536,0.0011885178,0.0038909877],"category_scores_gemma":[0.005752537,0.00087657705,0.00040544174,0.0023557362,0.00096934964,0.0028722372,0.0017447243,0.0011714536,0.001063286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025918384,0.0012305637,0.0025415188,0.00060114183,0.00020849406,0.0004178912,0.0006501192,0.39005303,0.042609487,0.053562142,0.01944761,0.48608613],"study_design_scores_gemma":[0.00010734406,0.00008377833,0.0003124121,0.000009645848,0.00003739456,0.00009728128,0.00006775524,0.9700014,0.006130757,0.020626979,0.0025040219,0.000021218751],"about_ca_topic_score_codex":0.0020862482,"about_ca_topic_score_gemma":0.0028416663,"teacher_disagreement_score":0.0038909877,"about_ca_system_score_codex":0.0012954768,"about_ca_system_score_gemma":0.0009777346,"threshold_uncertainty_score":0.014398396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024853495,0.00064849766,0.9697434,0.0012231919,0.00020119203,0.0001060355,0.000037906866,0.00009353871,0.025460865],"genre_scores_gemma":[0.5475511,0.0025666011,0.40977165,0.0010400249,0.0006925473,0.0007102598,0.00008190847,0.0002218673,0.037363973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998451,0.00071127,0.000053388307,0.00022822378,0.00040987495,0.00014612828],"domain_scores_gemma":[0.99863964,0.0009086713,0.00009241702,0.0001120146,0.00014101955,0.00010625839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022894188,0.0013775707,0.0013402292,0.0005687485,0.0010046345,0.0035653894,0.002968724,0.002459571,0.006715345],"category_scores_gemma":[0.0050607882,0.00057211047,0.0009786013,0.0010267568,0.0041039614,0.0050556865,0.0024142575,0.003650639,0.00067354634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014876329,0.000025217965,0.000039264054,0.000054476048,0.000015145484,0.000027530557,0.000094996234,0.03370941,0.00034474474,0.954039,0.0017741,0.009861263],"study_design_scores_gemma":[0.000020959671,0.000031909854,0.000036019523,0.000032104417,0.000015090783,0.000040363775,0.000037656955,0.21092668,0.00032580848,0.7809001,0.007614154,0.000019028748],"about_ca_topic_score_codex":0.0020024497,"about_ca_topic_score_gemma":0.001841544,"teacher_disagreement_score":0.006715345,"about_ca_system_score_codex":0.0017652812,"about_ca_system_score_gemma":0.0017164528,"threshold_uncertainty_score":0.02246511},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14391743,0.001618894,0.82415986,0.003967303,0.0015998121,0.00029985196,0.001193346,0.01095153,0.012292066],"genre_scores_gemma":[0.7376981,0.0005809548,0.24941477,0.00078147196,0.00025480925,0.0004245231,0.0013870363,0.002295108,0.007163251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98321265,0.0042969477,0.001314093,0.004064282,0.0058223004,0.0012896806],"domain_scores_gemma":[0.8178767,0.11783949,0.009019476,0.034102574,0.017246207,0.003915523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016478837,0.0013893639,0.0011102442,0.002303552,0.001333671,0.004061945,0.0035248166,0.002414779,0.0066025387],"category_scores_gemma":[0.17948951,0.0010790012,0.0007606789,0.0020708072,0.0014787659,0.005821193,0.0025642493,0.0055278437,0.0025871585],"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.0023284806,0.000663879,0.03231121,0.0005069789,0.00029232816,0.00058410544,0.0008179873,0.43681884,0.040680546,0.12954172,0.028596792,0.32685718],"study_design_scores_gemma":[0.00009732437,0.00036326956,0.0056823893,0.00013369345,0.00007433104,0.00059340114,0.00021947217,0.88442886,0.036137745,0.065693974,0.006440449,0.00013500261],"about_ca_topic_score_codex":0.0031858257,"about_ca_topic_score_gemma":0.005273737,"teacher_disagreement_score":0.016478837,"about_ca_system_score_codex":0.00287631,"about_ca_system_score_gemma":0.0049271258,"threshold_uncertainty_score":0.08714944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08187475,0.0007523925,0.91048414,0.00042732432,0.0002335567,0.0005926851,0.00008411226,0.0012544462,0.004296706],"genre_scores_gemma":[0.74309456,0.0006891589,0.24798463,0.0001035045,0.00017961847,0.00034135612,0.0001287977,0.000071054805,0.0074072666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927634,0.00022271417,0.000044489763,0.00015445301,0.00024071224,0.00006132506],"domain_scores_gemma":[0.9993241,0.0002044906,0.000053770025,0.00009088384,0.00025838992,0.00006847304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010522512,0.00042686128,0.0008542015,0.0004863189,0.001739053,0.0009821347,0.0013975286,0.0010027684,0.002509789],"category_scores_gemma":[0.0022399866,0.00022312431,0.0003484315,0.0005860804,0.00049182004,0.001849248,0.0009434746,0.0007391467,0.00062193524],"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.0009412625,0.0005867147,0.002878901,0.0008790063,0.00018840346,0.0018795293,0.0016304136,0.41146868,0.13547687,0.13660432,0.010732675,0.29673326],"study_design_scores_gemma":[0.00007982662,0.00042893196,0.00054313015,0.000018202461,0.00007395454,0.00044628207,0.00014850561,0.957368,0.015269143,0.009334466,0.016225498,0.00006399133],"about_ca_topic_score_codex":0.0027899053,"about_ca_topic_score_gemma":0.0017203506,"teacher_disagreement_score":0.0027899053,"about_ca_system_score_codex":0.0008897315,"about_ca_system_score_gemma":0.0011885088,"threshold_uncertainty_score":0.008396149},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020549416,0.013338894,0.08066949,0.001596768,0.002144103,0.000080265534,0.00023835,0.0011102702,0.89876693],"genre_scores_gemma":[0.047293637,0.033623535,0.041948996,0.0013618916,0.0018481124,0.00019601543,0.0008144357,0.0005439525,0.8723696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997601,0.000038848557,0.0000070552946,0.000055014465,0.000112532056,0.000026467918],"domain_scores_gemma":[0.9997485,0.0000814155,0.000012255942,0.00007754095,0.000051769402,0.00002852382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021663781,0.0007237128,0.00034236853,0.0007721124,0.0006995858,0.0033419493,0.0009780169,0.0012165642,0.039442763],"category_scores_gemma":[0.0009019253,0.0003246413,0.00024176123,0.0014189448,0.00073687884,0.0065891384,0.0017074756,0.001464253,0.020041648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151240265,0.000036456953,0.000065820575,0.0003236728,0.00001022578,0.0000934356,0.00017486876,0.0017821022,0.0021540984,0.58385485,0.12682469,0.28466466],"study_design_scores_gemma":[0.0000027778763,0.000012236454,0.00008413982,0.00014008954,0.000005087358,0.00023581942,0.00006208686,0.0024684558,0.00088766625,0.14414443,0.85194844,0.000008832283],"about_ca_topic_score_codex":0.0003911923,"about_ca_topic_score_gemma":0.0006183653,"teacher_disagreement_score":0.039442763,"about_ca_system_score_codex":0.00062567694,"about_ca_system_score_gemma":0.0004392251,"threshold_uncertainty_score":0.13194913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.213678,0.0007588346,0.7610557,0.0016353821,0.000073674324,0.0005621614,0.00021066812,0.0011222749,0.020903343],"genre_scores_gemma":[0.7704062,0.0004424608,0.21807854,0.000086967964,0.00005570957,0.0002455154,0.00038726223,0.00008137435,0.010215989],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973853,0.00096480566,0.00016866522,0.00049662136,0.0007884862,0.00019602562],"domain_scores_gemma":[0.99072766,0.0058948495,0.0005343366,0.0014849678,0.00075448747,0.0006037543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028262576,0.00034106037,0.00067484623,0.0016117815,0.002923015,0.0039269337,0.0022423847,0.0020409692,0.0037895811],"category_scores_gemma":[0.012088257,0.00043549002,0.0006875008,0.002003565,0.0015589664,0.0063988375,0.0045097433,0.00087342015,0.0010773953],"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.0011594289,0.0013361755,0.011992176,0.0007744305,0.00029053623,0.003816198,0.014485243,0.20240703,0.034178253,0.23430231,0.008689011,0.4865693],"study_design_scores_gemma":[0.00016932821,0.0003064042,0.0030166805,0.00012122063,0.0001677636,0.0010695658,0.004213723,0.76987165,0.017278293,0.16851987,0.03514861,0.00011680264],"about_ca_topic_score_codex":0.004606296,"about_ca_topic_score_gemma":0.0036288418,"teacher_disagreement_score":0.004606296,"about_ca_system_score_codex":0.0011128141,"about_ca_system_score_gemma":0.0020337396,"threshold_uncertainty_score":0.014946878},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007312757,0.00031148648,0.96414375,0.0009470128,0.00023090848,0.00034700448,0.00035616054,0.013034597,0.013316295],"genre_scores_gemma":[0.20239697,0.0014276323,0.737659,0.0012833818,0.00018422671,0.0008675882,0.0025833868,0.0041484567,0.04944927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.00037799295,0.00016204065,0.00022109144,0.0005935992,0.00018255263],"domain_scores_gemma":[0.9982211,0.00028280832,0.00011784248,0.0006355561,0.0004683145,0.00027434915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029587762,0.00084699824,0.0006083455,0.0011371326,0.0012092441,0.0058154864,0.0031443613,0.0016613314,0.0067507424],"category_scores_gemma":[0.0043713734,0.0008978068,0.00079194084,0.0008441053,0.0011877539,0.006975799,0.003672966,0.0031820466,0.0036377597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009837723,0.00048120218,0.004224699,0.0010336254,0.00023681024,0.00093976385,0.0032464815,0.07199661,0.03687824,0.46243837,0.06452764,0.35301283],"study_design_scores_gemma":[0.00013382103,0.00029093787,0.0011218678,0.00032967486,0.00019804474,0.0006754974,0.0005918506,0.48688495,0.02383222,0.10660803,0.37914062,0.0001924448],"about_ca_topic_score_codex":0.0053340746,"about_ca_topic_score_gemma":0.0076574166,"teacher_disagreement_score":0.0067507424,"about_ca_system_score_codex":0.0016843299,"about_ca_system_score_gemma":0.0030159212,"threshold_uncertainty_score":0.022583425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40310636,0.014266861,0.17155893,0.009747687,0.00087466656,0.0012258228,0.0015560724,0.0032864406,0.39437714],"genre_scores_gemma":[0.88218564,0.0064250175,0.07185491,0.0008404945,0.00021413885,0.00016044945,0.00078087824,0.00024153829,0.03729695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990761,0.0002184579,0.000044636083,0.00009899954,0.0005010789,0.000060683185],"domain_scores_gemma":[0.9991466,0.00036986123,0.00004744965,0.000080482525,0.00027062115,0.00008509587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082495523,0.00016454468,0.00019853807,0.001205178,0.0010723359,0.0024195127,0.000584879,0.0005866949,0.0019906207],"category_scores_gemma":[0.0024972067,0.0002086512,0.0001817124,0.0010135391,0.0008645811,0.0024509635,0.001268571,0.001033403,0.00034321705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006548022,0.0003828136,0.02331921,0.002066542,0.0000413669,0.002966423,0.0104839485,0.035916768,0.039416667,0.40537474,0.035457768,0.44391897],"study_design_scores_gemma":[0.000081531194,0.0006230781,0.016241886,0.0004844586,0.00004003349,0.0022519797,0.0049288124,0.12291473,0.016342623,0.030713433,0.805298,0.00007942726],"about_ca_topic_score_codex":0.007350007,"about_ca_topic_score_gemma":0.0068119853,"teacher_disagreement_score":0.007350007,"about_ca_system_score_codex":0.002691321,"about_ca_system_score_gemma":0.0012086343,"threshold_uncertainty_score":0.019526958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8875852,0.00008091494,0.10493438,0.00010664834,0.00004062351,0.000404606,0.00006364553,0.00046178311,0.0063221706],"genre_scores_gemma":[0.9731617,0.000042511925,0.02528685,0.000022594326,0.000006305999,0.00012866157,0.000051348416,0.000055607885,0.0012444024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980934,0.00054246554,0.00009352043,0.0002868291,0.00060830393,0.00037540443],"domain_scores_gemma":[0.9896408,0.006680409,0.00072347635,0.0013441141,0.0010448208,0.000566513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016755635,0.00085386174,0.00048313977,0.00047269714,0.00052472384,0.0012624417,0.0025114731,0.0005467461,0.005620394],"category_scores_gemma":[0.013677,0.00030301817,0.00043032342,0.00027138297,0.0011239354,0.003956117,0.0017932694,0.0009705954,0.00040141804],"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.018656934,0.0077474564,0.028357362,0.0016195349,0.00042790046,0.0012900569,0.003905302,0.29254162,0.2871329,0.09297244,0.0020203057,0.26332808],"study_design_scores_gemma":[0.0007332173,0.009435397,0.006836158,0.000059833033,0.00017641087,0.0004732131,0.0014442793,0.8166478,0.13988738,0.01943399,0.0047417306,0.00013062805],"about_ca_topic_score_codex":0.0031454142,"about_ca_topic_score_gemma":0.0022313655,"teacher_disagreement_score":0.005620394,"about_ca_system_score_codex":0.00065382675,"about_ca_system_score_gemma":0.0010443834,"threshold_uncertainty_score":0.018802106},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000491027,0.0011612799,0.015995609,0.0010812753,0.0014258942,0.0002476661,0.07074779,0.0549014,0.853948],"genre_scores_gemma":[0.0022101365,0.0014154244,0.009409021,0.000940158,0.00043841527,0.0002881033,0.06798208,0.026178239,0.89113843],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993253,0.00007610016,0.000060536917,0.00009833048,0.00037393635,0.000065819826],"domain_scores_gemma":[0.9975321,0.00064393465,0.00011656181,0.0004937103,0.00082706707,0.00038666083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065486075,0.0017122298,0.0012442464,0.005731958,0.0009988729,0.0056355214,0.0020140938,0.0011390364,0.72106004],"category_scores_gemma":[0.0050463025,0.00086728286,0.0009080721,0.0069531593,0.00042144553,0.00472777,0.0027638779,0.0015218563,0.7394787],"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.000018643133,0.000022245491,0.000068569374,0.00018506688,0.0000043877726,0.00003264594,0.000034591587,0.00006811361,0.0003140073,0.004028966,0.9250642,0.07015855],"study_design_scores_gemma":[0.00000610856,0.0000040344935,0.0001885813,0.000055896508,0.000002904754,0.00004346086,0.000016190805,0.000084585095,0.00018033104,0.0021692144,0.99723995,0.000008800144],"about_ca_topic_score_codex":0.0029463377,"about_ca_topic_score_gemma":0.0055799964,"teacher_disagreement_score":0.72106004,"about_ca_system_score_codex":0.00073255535,"about_ca_system_score_gemma":0.0011009192,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015755912,0.006338065,0.90572923,0.006375962,0.00065734045,0.00033535715,0.000049486556,0.00043354675,0.06432511],"genre_scores_gemma":[0.55005485,0.02139185,0.38298017,0.00093239173,0.0011805266,0.00086276396,0.00012726484,0.00028473476,0.042185474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974138,0.0007556253,0.0001486879,0.0002798989,0.0011700426,0.00023196047],"domain_scores_gemma":[0.9971934,0.0011135826,0.000178706,0.0009760651,0.00044769293,0.00009061364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027879302,0.00086402346,0.0006209677,0.0010072087,0.0018358303,0.004572104,0.001593617,0.0022228812,0.003800432],"category_scores_gemma":[0.0058708964,0.00078717596,0.00059383124,0.0012233615,0.0036679667,0.010604779,0.0040550274,0.0048510022,0.001689158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051468123,0.00005429009,0.0002288451,0.00021448714,0.000026308613,0.00012260929,0.0004580358,0.009963294,0.0029868567,0.9094795,0.0023705342,0.074043706],"study_design_scores_gemma":[0.000049318638,0.00018832457,0.0002942507,0.00042174553,0.000059729708,0.00058324734,0.0006958188,0.102272235,0.012372973,0.7464435,0.13655366,0.00006517876],"about_ca_topic_score_codex":0.0005730041,"about_ca_topic_score_gemma":0.000508117,"teacher_disagreement_score":0.004572104,"about_ca_system_score_codex":0.0013453248,"about_ca_system_score_gemma":0.0015816151,"threshold_uncertainty_score":0.014744163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037019,0.000705336,0.9379358,0.0005270304,0.0002991943,0.00035492898,0.00033111442,0.008671096,0.014156579],"genre_scores_gemma":[0.7782594,0.0006094336,0.20835312,0.000096853524,0.00017830305,0.00019019905,0.0005584341,0.00025193076,0.011502409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985795,0.00036460318,0.00013171005,0.00023231262,0.0005598758,0.0001320553],"domain_scores_gemma":[0.9958215,0.001590632,0.00039323437,0.0010259423,0.00095423544,0.00021442826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002138959,0.0006312552,0.00088277203,0.0020008932,0.0012499677,0.0029246232,0.0012792241,0.00095493917,0.00505607],"category_scores_gemma":[0.010191228,0.00041741008,0.0004631344,0.001263161,0.00048454874,0.0026912687,0.0025637664,0.0009872415,0.0017606356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013418188,0.0004680885,0.005685058,0.0005773312,0.00014477836,0.0005409495,0.0017292984,0.13109747,0.062079772,0.10640198,0.017217489,0.67271596],"study_design_scores_gemma":[0.00016462187,0.00036613684,0.0022288116,0.000073951094,0.00012299474,0.00025157223,0.0004137887,0.9280113,0.027893102,0.017384168,0.022996677,0.00009287779],"about_ca_topic_score_codex":0.0066726343,"about_ca_topic_score_gemma":0.007397014,"teacher_disagreement_score":0.0066726343,"about_ca_system_score_codex":0.0011376982,"about_ca_system_score_gemma":0.0017852393,"threshold_uncertainty_score":0.016914308},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006794157,0.0009551847,0.020709407,0.0046060234,0.0073413746,0.0006208405,0.14803334,0.09880772,0.71824664],"genre_scores_gemma":[0.006765614,0.00084107206,0.008482919,0.0026172695,0.0015652624,0.00063228956,0.15291148,0.020588815,0.8055953],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985738,0.00018031617,0.00009895316,0.00023469132,0.0007257254,0.00018653995],"domain_scores_gemma":[0.9908881,0.0015349463,0.00022183123,0.0027214203,0.0032075099,0.001426199],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015702813,0.001413371,0.0019345215,0.0037959577,0.0018351567,0.005305203,0.004417424,0.0027628674,0.907533],"category_scores_gemma":[0.013722456,0.0008070132,0.0010661163,0.003016707,0.0006090367,0.0051795333,0.004141295,0.0028381085,0.8724396],"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.00004233208,0.000020608884,0.000040799987,0.00013101671,0.0000050206404,0.00003397403,0.000014769775,0.000129205,0.00022899242,0.0015613305,0.9711476,0.0266443],"study_design_scores_gemma":[0.000042355274,0.000013968579,0.00013741666,0.00008566067,0.0000062996573,0.000072509545,0.000022885724,0.00037429124,0.0004369042,0.004186619,0.99459535,0.000025819998],"about_ca_topic_score_codex":0.0029916356,"about_ca_topic_score_gemma":0.003644861,"teacher_disagreement_score":0.907533,"about_ca_system_score_codex":0.0008687455,"about_ca_system_score_gemma":0.0016228718,"threshold_uncertainty_score":0.13189298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009625519,0.002302657,0.9679616,0.0013321788,0.000608031,0.0003490608,0.00025157726,0.0015018675,0.01606749],"genre_scores_gemma":[0.1952523,0.006406757,0.76167876,0.0007001695,0.0006397739,0.0005365276,0.0013255292,0.00028362352,0.033176627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947995,0.00009106236,0.00004333283,0.00007227806,0.00026861677,0.000044821325],"domain_scores_gemma":[0.9996797,0.000059584385,0.000026349364,0.00008592196,0.000119203265,0.000029274404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006888709,0.00032784205,0.00030473297,0.0007442101,0.0008248558,0.0010081817,0.0012868696,0.00075286545,0.0034002652],"category_scores_gemma":[0.0014047272,0.00025413942,0.00040662367,0.00095175183,0.00046336488,0.0021275238,0.0012371029,0.00092371594,0.0012268026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015331875,0.00016524752,0.0007289151,0.00081464293,0.000102305625,0.00034957624,0.0007524579,0.063505344,0.040466405,0.24566159,0.035863742,0.6114364],"study_design_scores_gemma":[0.00017856463,0.00054833374,0.00088568346,0.0002319318,0.00013192273,0.0010937257,0.00065679953,0.34106195,0.03703255,0.11319719,0.50485694,0.00012439812],"about_ca_topic_score_codex":0.0009445475,"about_ca_topic_score_gemma":0.0011206714,"teacher_disagreement_score":0.0034002652,"about_ca_system_score_codex":0.0006602508,"about_ca_system_score_gemma":0.00089865486,"threshold_uncertainty_score":0.01137501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22128028,0.0020030811,0.7627248,0.00088652066,0.00013492176,0.00012043079,0.00030895034,0.001065552,0.011475385],"genre_scores_gemma":[0.95328254,0.0005524712,0.044372924,0.00008013551,0.00005005798,0.00005438315,0.00012415324,0.000069432244,0.0014140377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992194,0.00020266992,0.000039906325,0.00016058893,0.0002231626,0.00015435013],"domain_scores_gemma":[0.99722004,0.0017800311,0.00016080572,0.00025175355,0.00043378602,0.00015357614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001181314,0.00056379405,0.00073228,0.0006323056,0.00075757696,0.0012188937,0.0012828069,0.0009610686,0.001982867],"category_scores_gemma":[0.0047640884,0.00028744515,0.00033407693,0.0008613048,0.0006878731,0.002645695,0.0016105045,0.0007994054,0.0002623641],"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.00023508168,0.00015142461,0.0009261156,0.00019153772,0.000060176855,0.0002691508,0.0001568886,0.87097615,0.028311273,0.02101848,0.0026723929,0.0750313],"study_design_scores_gemma":[0.000010258566,0.000047389418,0.0001866986,0.0000064864116,0.000009803403,0.000035914803,0.000039450828,0.9892047,0.0033946265,0.0062745283,0.0007821599,0.0000080073805],"about_ca_topic_score_codex":0.003158189,"about_ca_topic_score_gemma":0.0018871902,"teacher_disagreement_score":0.003158189,"about_ca_system_score_codex":0.001196285,"about_ca_system_score_gemma":0.0007008103,"threshold_uncertainty_score":0.008679688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010779295,0.013705794,0.96869266,0.00035165504,0.00025828424,0.000090118374,0.000067023895,0.0011308601,0.014625691],"genre_scores_gemma":[0.11256072,0.04015493,0.8037099,0.0005717927,0.0010733303,0.0009366794,0.0007496412,0.0008749963,0.039367974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998776,0.0003352745,0.00006084167,0.00021850853,0.0005423359,0.000066963374],"domain_scores_gemma":[0.9987815,0.0006769507,0.000054470223,0.00031253512,0.000133972,0.000040707622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012628916,0.0013375188,0.0014233543,0.0010746834,0.00082633947,0.0027430046,0.0031054737,0.0010549532,0.009285236],"category_scores_gemma":[0.0026640983,0.00058333436,0.0006577179,0.002813647,0.0015370855,0.004520874,0.001974536,0.0025327406,0.0046916786],"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.000045328154,0.00008675729,0.00019328385,0.0012624238,0.00007477021,0.00010122352,0.0003398257,0.082267135,0.002248082,0.34677255,0.030809479,0.5357992],"study_design_scores_gemma":[0.00008231029,0.00013522072,0.0002111291,0.00035834656,0.000064107655,0.0004270558,0.0002014583,0.3545521,0.003423604,0.4334748,0.20701966,0.00005014048],"about_ca_topic_score_codex":0.0005599107,"about_ca_topic_score_gemma":0.0008585828,"teacher_disagreement_score":0.009285236,"about_ca_system_score_codex":0.0011420964,"about_ca_system_score_gemma":0.00064448826,"threshold_uncertainty_score":0.031062245},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049279532,0.0037229941,0.008181527,0.052898955,0.010865113,0.00016186746,0.002256429,0.00067118596,0.916314],"genre_scores_gemma":[0.09400588,0.005666946,0.007062701,0.053462904,0.003491231,0.0002509326,0.0044887797,0.0008907147,0.83067995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976158,0.00039941896,0.00007218634,0.0005137036,0.0010342913,0.00036464876],"domain_scores_gemma":[0.99555343,0.0007273111,0.00015053997,0.00050758524,0.002377682,0.0006834625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026395218,0.00060224475,0.00037384874,0.0010427109,0.001814786,0.0054142056,0.0016214595,0.0019395552,0.2733134],"category_scores_gemma":[0.010478772,0.00016606491,0.00072604703,0.00081347703,0.0011154748,0.0034112518,0.0021569098,0.002230905,0.0920119],"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.0002713411,0.000097575525,0.0028472082,0.0006561644,0.000038519636,0.00035820267,0.0011081643,0.00031917964,0.0011100365,0.13976029,0.60861,0.24482332],"study_design_scores_gemma":[0.000017760945,0.000021151813,0.001229247,0.00034195263,0.000016329695,0.0001756207,0.0010805799,0.00008271916,0.00068374386,0.01766982,0.9786725,0.000008592926],"about_ca_topic_score_codex":0.0068194997,"about_ca_topic_score_gemma":0.007002714,"teacher_disagreement_score":0.2733134,"about_ca_system_score_codex":0.0029904565,"about_ca_system_score_gemma":0.0041164085,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004555541,0.0010753113,0.98434997,0.00047092017,0.00044919277,0.001052883,0.00020573291,0.0007592503,0.0070811906],"genre_scores_gemma":[0.38144925,0.00221522,0.5926465,0.0007179866,0.00038895712,0.0034825765,0.0010825023,0.0002081874,0.017808804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950348,0.0019151793,0.00047716405,0.0006764828,0.0016263707,0.00026996946],"domain_scores_gemma":[0.9965257,0.001382848,0.00025341727,0.0006924132,0.0008569235,0.0002887604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032363,0.0011098931,0.0019790952,0.0011186139,0.002728398,0.0023876103,0.004115787,0.0019540137,0.0043143746],"category_scores_gemma":[0.0075327647,0.00043058806,0.00086734566,0.002006017,0.0016042298,0.0025691446,0.0033552467,0.0021454124,0.001876415],"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.0007174109,0.00025210943,0.00048750493,0.0013570673,0.00031994295,0.0010301128,0.0011981749,0.24468523,0.025938455,0.45915046,0.040285222,0.22457826],"study_design_scores_gemma":[0.0003542879,0.0006351206,0.00026668052,0.00011373529,0.00015567818,0.0011949068,0.00020760919,0.7477476,0.010281181,0.11766892,0.12115192,0.00022239341],"about_ca_topic_score_codex":0.0018835373,"about_ca_topic_score_gemma":0.002841083,"teacher_disagreement_score":0.0043143746,"about_ca_system_score_codex":0.001824033,"about_ca_system_score_gemma":0.002873177,"threshold_uncertainty_score":0.017115355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001300432,0.0020917482,0.027917039,0.0024352204,0.0009601673,0.00006567374,0.00019279258,0.00024478463,0.96479225],"genre_scores_gemma":[0.05688718,0.0050347582,0.011720769,0.0010203108,0.0005077734,0.00025844137,0.00048804947,0.00023907208,0.9238437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996307,0.00009613719,0.000010355938,0.00006232316,0.00014917123,0.000051281182],"domain_scores_gemma":[0.9997038,0.00011182811,0.00001446525,0.000048664173,0.00006179936,0.00005934956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035624806,0.0011386084,0.00043296505,0.0007206842,0.001082125,0.0028203388,0.0012743628,0.0011867966,0.08836616],"category_scores_gemma":[0.0016521512,0.00027275155,0.00034334976,0.0006262022,0.001124443,0.0032918984,0.0018463456,0.0017931031,0.019392937],"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.000017359329,0.00004291246,0.00004646067,0.00009554636,0.000007660146,0.000036818845,0.00013978544,0.00230993,0.0002441787,0.79274064,0.13133734,0.0729814],"study_design_scores_gemma":[0.000009653102,0.000016503984,0.00009183368,0.00013016857,0.0000048255683,0.00007566195,0.00013063305,0.003952734,0.00026397035,0.4349244,0.5603914,0.0000082548695],"about_ca_topic_score_codex":0.0017513636,"about_ca_topic_score_gemma":0.003228009,"teacher_disagreement_score":0.08836616,"about_ca_system_score_codex":0.0016626146,"about_ca_system_score_gemma":0.0010337904,"threshold_uncertainty_score":0.29561424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023445194,0.002582822,0.98295665,0.00058900856,0.00019783362,0.00019499639,0.00018696424,0.0005335566,0.010413652],"genre_scores_gemma":[0.1507878,0.009614561,0.8120918,0.00032714094,0.00037992303,0.0007987682,0.0007405414,0.00026063676,0.024998829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850875,0.00048018538,0.00012997273,0.00020177546,0.0005987869,0.00008053614],"domain_scores_gemma":[0.99866414,0.0008501399,0.0001198519,0.00018827051,0.00013109975,0.000046539415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030461026,0.0012886168,0.0012651514,0.0015251748,0.001252511,0.0041467617,0.0027930988,0.0024523186,0.0068192966],"category_scores_gemma":[0.0036331532,0.00085685664,0.0013141262,0.0036518343,0.0017760415,0.0055068317,0.0017721311,0.0025156287,0.0018956718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005142012,0.00008194264,0.00030400735,0.0004904594,0.00007341475,0.00049478764,0.00047498816,0.13722217,0.0019301083,0.78586525,0.0059101456,0.06710116],"study_design_scores_gemma":[0.000041638872,0.00004440414,0.0001193804,0.000105471954,0.00006958073,0.00027376108,0.00011654513,0.58694255,0.0017203913,0.34402812,0.06649609,0.000042127005],"about_ca_topic_score_codex":0.004346619,"about_ca_topic_score_gemma":0.003562304,"teacher_disagreement_score":0.0068192966,"about_ca_system_score_codex":0.001620208,"about_ca_system_score_gemma":0.0017005338,"threshold_uncertainty_score":0.022812843},"labels":[],"label_agreement":null},{"id":"W4244036065","doi":"10.1007/s12083-010-0071-5","title":"Editorial: Peer-to-peer networking and applications, volume 3, issue 2","year":2010,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Volume (thermodynamics); Peer-to-peer; Peer review; Computer science; World Wide Web; Political science; Physics","score_opus":0.00851742400309461,"score_gpt":0.26893828925758206,"score_spread":0.26042086525448743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244036065","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050937655,0.0045491443,0.00020838877,0.008327155,0.98460877,0.000031129337,0.000042449865,0.00012265425,0.0020593307],"genre_scores_gemma":[0.0006933064,0.006343867,0.00023052112,0.0089878095,0.95340335,0.000044805358,0.00008826877,0.000112795016,0.03009523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99518317,0.00057442713,0.00049944303,0.00064416096,0.0026989144,0.00039981227],"domain_scores_gemma":[0.9800669,0.0039051415,0.0013460063,0.000539002,0.010548473,0.0035944227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055642463,0.0065982896,0.008206142,0.0065730116,0.0035753457,0.010643856,0.0041240156,0.015105615,0.0356168],"category_scores_gemma":[0.0147957755,0.0019442822,0.0038186056,0.0024839102,0.002300015,0.0047240066,0.0017161065,0.01649509,0.03256266],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067074245,0.000029147717,0.00002353221,0.00023765942,0.000029634804,0.0001338522,0.0000035435435,0.000043477252,0.00013276385,0.00010714805,0.9916829,0.0075093275],"study_design_scores_gemma":[0.00018191857,0.000083109866,0.000538162,0.00033771552,0.0001308738,0.0006187963,0.000025268973,0.00061640766,0.00036037643,0.00067293737,0.99640024,0.000034153465],"about_ca_topic_score_codex":0.0011742108,"about_ca_topic_score_gemma":0.0036115455,"teacher_disagreement_score":0.0356168,"about_ca_system_score_codex":0.002751084,"about_ca_system_score_gemma":0.002385316,"threshold_uncertainty_score":0.11915004},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17968735,0.0006535253,0.8106265,0.0010367432,0.000036657366,0.00029589713,0.00011677451,0.00071616843,0.00683042],"genre_scores_gemma":[0.9303617,0.00035637544,0.067906946,0.00012843484,0.000034563578,0.00016909445,0.00007055617,0.000054674354,0.00091764773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519145,0.0018957383,0.00034204466,0.0004698882,0.0014747068,0.00062618766],"domain_scores_gemma":[0.9784737,0.014270458,0.002253832,0.0030620226,0.0014567713,0.00048324635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006855747,0.00086885394,0.0020050013,0.001116981,0.001197409,0.0023012878,0.0027982832,0.002118104,0.0017367343],"category_scores_gemma":[0.02858088,0.0007999544,0.0006316123,0.0018275838,0.0016139562,0.0060437773,0.0028826883,0.001554424,0.0005529665],"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.00042471665,0.00037720168,0.0028169234,0.00045545335,0.00014867385,0.00044582912,0.00080602634,0.7236843,0.0264707,0.18169336,0.0027557742,0.059920996],"study_design_scores_gemma":[0.00010006511,0.00012126183,0.00034041496,0.000015843596,0.00003580021,0.0001923306,0.00013065359,0.9204113,0.0056859055,0.07078193,0.002158331,0.000026231588],"about_ca_topic_score_codex":0.0015197304,"about_ca_topic_score_gemma":0.00093286566,"teacher_disagreement_score":0.006855747,"about_ca_system_score_codex":0.001219404,"about_ca_system_score_gemma":0.0022074054,"threshold_uncertainty_score":0.03625703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018483012,0.00035728622,0.9710163,0.0006222497,0.00038215474,0.00048080174,0.00026852274,0.020676887,0.004347472],"genre_scores_gemma":[0.08079938,0.0012171116,0.88995755,0.0007874332,0.0005924944,0.0013858579,0.0021141223,0.0041895886,0.018956471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99458945,0.000929573,0.001019255,0.0005144305,0.0023238384,0.0006233678],"domain_scores_gemma":[0.9948585,0.0014905756,0.00032728334,0.0016924272,0.0008609937,0.0007701545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012173273,0.0013314696,0.0023928918,0.0025117071,0.0034995053,0.013297429,0.0068578934,0.0043415017,0.0073351213],"category_scores_gemma":[0.009896232,0.0024875624,0.0022161554,0.0025777367,0.0026908913,0.010056085,0.0059965686,0.006801435,0.0051051727],"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.00065839064,0.0009770422,0.0012943418,0.0007187407,0.0002963761,0.00091982837,0.0016581278,0.03280802,0.018595528,0.61864626,0.069067016,0.2543603],"study_design_scores_gemma":[0.00035830535,0.00019022322,0.00048595777,0.00030555172,0.00036844224,0.0006359718,0.00032805747,0.35684946,0.030548241,0.30544513,0.3041532,0.00033137828],"about_ca_topic_score_codex":0.006037341,"about_ca_topic_score_gemma":0.0048243157,"teacher_disagreement_score":0.013297429,"about_ca_system_score_codex":0.0026830658,"about_ca_system_score_gemma":0.0044478583,"threshold_uncertainty_score":0.064379215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40310636,0.014266861,0.17155893,0.009747687,0.00087466656,0.0012258228,0.0015560724,0.0032864406,0.39437714],"genre_scores_gemma":[0.88218564,0.0064250175,0.07185491,0.0008404945,0.00021413885,0.00016044945,0.00078087824,0.00024153829,0.03729695],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990761,0.0002184579,0.000044636083,0.00009899954,0.0005010789,0.000060683185],"domain_scores_gemma":[0.9991466,0.00036986123,0.00004744965,0.000080482525,0.00027062115,0.00008509587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082495523,0.00016454468,0.00019853807,0.001205178,0.0010723359,0.0024195127,0.000584879,0.0005866949,0.0019906207],"category_scores_gemma":[0.0024972067,0.0002086512,0.0001817124,0.0010135391,0.0008645811,0.0024509635,0.001268571,0.001033403,0.00034321705],"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.0006548022,0.0003828136,0.02331921,0.002066542,0.0000413669,0.002966423,0.0104839485,0.035916768,0.039416667,0.40537474,0.035457768,0.44391897],"study_design_scores_gemma":[0.000081531194,0.0006230781,0.016241886,0.0004844586,0.00004003349,0.0022519797,0.0049288124,0.12291473,0.016342623,0.030713433,0.805298,0.00007942726],"about_ca_topic_score_codex":0.007350007,"about_ca_topic_score_gemma":0.0068119853,"teacher_disagreement_score":0.007350007,"about_ca_system_score_codex":0.002691321,"about_ca_system_score_gemma":0.0012086343,"threshold_uncertainty_score":0.019526958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17959806,0.00047651553,0.725827,0.0003658114,0.00021865313,0.0007167166,0.00040347312,0.08484524,0.0075486],"genre_scores_gemma":[0.863469,0.000109883484,0.13044713,0.00017096961,0.00005506709,0.00021136203,0.0003636326,0.000976948,0.004195993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.00020382603,0.00012047637,0.0002942763,0.00034091604,0.00020089117],"domain_scores_gemma":[0.9968155,0.0013067301,0.00026088595,0.0007783269,0.0005216457,0.00031693833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018210696,0.0012994678,0.0008746964,0.0014509334,0.000820792,0.0017889438,0.0025879708,0.0009652527,0.0025772243],"category_scores_gemma":[0.006391045,0.00048202564,0.00037886377,0.00052197726,0.00063393934,0.0020770857,0.001584811,0.000988345,0.00073069654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003496047,0.0021270628,0.02872822,0.0007927502,0.0003782824,0.00088147685,0.0019865714,0.13661659,0.20290259,0.018366857,0.02633242,0.57739115],"study_design_scores_gemma":[0.00017357933,0.0003561807,0.004961651,0.000026168475,0.00007429949,0.00022267677,0.00019709092,0.9051752,0.067628175,0.006021485,0.015070578,0.00009298461],"about_ca_topic_score_codex":0.0074788495,"about_ca_topic_score_gemma":0.0055568027,"teacher_disagreement_score":0.0074788495,"about_ca_system_score_codex":0.0012236894,"about_ca_system_score_gemma":0.0012671358,"threshold_uncertainty_score":0.014870644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95200217,0.00061290874,0.041505754,0.00048780607,0.000056966408,0.00021144829,0.00010149154,0.001106927,0.0039145295],"genre_scores_gemma":[0.987976,0.00008907972,0.011554255,0.000023005621,0.00001009381,0.000029149222,0.00007661027,0.000024276727,0.00021755097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687827,0.0014368433,0.00024611398,0.00022216402,0.0009700315,0.0002465199],"domain_scores_gemma":[0.9868693,0.007866592,0.00066999154,0.001930331,0.0020351217,0.0006287295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056301607,0.0006648521,0.0006762716,0.00081908953,0.0009104164,0.00078751135,0.00095396704,0.00071237644,0.00072226825],"category_scores_gemma":[0.014114814,0.00023760085,0.00022895986,0.0012001438,0.0009579267,0.0014744723,0.00094909826,0.00068122306,0.000119211465],"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.002097769,0.001257831,0.019633846,0.00037843816,0.00020438858,0.00030719017,0.0008255112,0.7832114,0.07352017,0.0065693683,0.0027438349,0.10925012],"study_design_scores_gemma":[0.00012589275,0.0005378985,0.0043239295,0.000010938529,0.00004158877,0.00008621101,0.00020676863,0.9730402,0.020256713,0.00069510436,0.0006494866,0.000025238724],"about_ca_topic_score_codex":0.0069609205,"about_ca_topic_score_gemma":0.00348937,"teacher_disagreement_score":0.0069609205,"about_ca_system_score_codex":0.0015962534,"about_ca_system_score_gemma":0.0008143247,"threshold_uncertainty_score":0.0297755},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006431148,0.004295212,0.007383424,0.0026533576,0.008287666,0.00046779678,0.020120338,0.003953127,0.952196],"genre_scores_gemma":[0.0021837759,0.0036974426,0.0024439152,0.0011820954,0.0015376757,0.00019503263,0.014339433,0.0009619189,0.9734588],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999383,0.000073102674,0.00003980528,0.00009806513,0.00036108107,0.00004494307],"domain_scores_gemma":[0.9979469,0.00038582925,0.00008158888,0.0002971022,0.0008708086,0.00041769462],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005203709,0.001207456,0.0017052451,0.0048742797,0.0015575064,0.0053303745,0.0016838626,0.0014662127,0.7625382],"category_scores_gemma":[0.004407156,0.00032046382,0.00048172247,0.006032847,0.0005613426,0.0038156935,0.0019186629,0.0012726537,0.75897986],"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.000021356067,0.000044567805,0.0000866387,0.00025246275,0.0000044704766,0.00002331633,0.000016865966,0.00015828937,0.00025762265,0.0033062247,0.88911027,0.106717944],"study_design_scores_gemma":[0.000009220392,0.000013652897,0.00019541875,0.00016426836,0.000005925412,0.00004089104,0.000026580381,0.00027835593,0.00021114617,0.0035824312,0.99546355,0.000008587607],"about_ca_topic_score_codex":0.004532817,"about_ca_topic_score_gemma":0.0059689684,"teacher_disagreement_score":0.2374618,"about_ca_system_score_codex":0.0013922321,"about_ca_system_score_gemma":0.0014992759,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685787,0.0006603333,0.021511912,0.00019387197,0.0000339585,0.00016826435,0.000077397286,0.000609707,0.008165889],"genre_scores_gemma":[0.9935569,0.00012963601,0.005517365,0.000015305674,0.00001382916,0.000029339217,0.00004739648,0.00002224307,0.0006679524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997361,0.0009746934,0.000117176496,0.0003025178,0.0009391421,0.00030534496],"domain_scores_gemma":[0.9915863,0.005147871,0.00060181617,0.0009606984,0.0012937045,0.00040968068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594157,0.00054811605,0.00067342375,0.001241963,0.0013590455,0.001762035,0.0010786508,0.0008909625,0.0012135486],"category_scores_gemma":[0.012645114,0.00029114625,0.00030007228,0.0011609165,0.000834157,0.0036378494,0.0013912905,0.00043037225,0.00037240968],"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.0020029196,0.002222997,0.05160391,0.0008611821,0.00040488498,0.0014953141,0.0028492145,0.47599682,0.09171282,0.02565514,0.004716275,0.34047857],"study_design_scores_gemma":[0.000077461955,0.0012947768,0.016367441,0.000037686004,0.00011755395,0.00075982435,0.0016434744,0.9041655,0.058184393,0.0126616815,0.004598166,0.00009200396],"about_ca_topic_score_codex":0.0038006394,"about_ca_topic_score_gemma":0.0022786898,"teacher_disagreement_score":0.0038006394,"about_ca_system_score_codex":0.0010000604,"about_ca_system_score_gemma":0.00072786835,"threshold_uncertainty_score":0.01371938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048004996,0.0007707027,0.73143595,0.0012248025,0.00065317407,0.00206626,0.0010432393,0.19804455,0.016756264],"genre_scores_gemma":[0.59110713,0.0007133992,0.37053388,0.0017100155,0.0002572603,0.0012306817,0.0035788948,0.0078021446,0.023066532],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99855286,0.00024942818,0.00016883336,0.00030891868,0.0004655898,0.0002544418],"domain_scores_gemma":[0.99710566,0.00074720965,0.0002569714,0.0007881817,0.0004320902,0.00066986843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017768458,0.001013152,0.0007259695,0.0010155457,0.0010756381,0.0021704622,0.004002912,0.0011850157,0.0070155477],"category_scores_gemma":[0.0064759674,0.0006721337,0.00060089596,0.0006263655,0.0007130787,0.0032114782,0.0037925295,0.0022096478,0.0019573262],"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.0048048617,0.0022941332,0.017742682,0.0025343613,0.00060611113,0.0019971847,0.0032470357,0.043910358,0.17487612,0.046495117,0.15114067,0.5503514],"study_design_scores_gemma":[0.00088011444,0.0009400515,0.008017226,0.00020634197,0.00029654586,0.0008052831,0.0008648156,0.6169744,0.075398594,0.0141809,0.28100154,0.00043416748],"about_ca_topic_score_codex":0.009180516,"about_ca_topic_score_gemma":0.0075055533,"teacher_disagreement_score":0.009180516,"about_ca_system_score_codex":0.0016469291,"about_ca_system_score_gemma":0.0025237412,"threshold_uncertainty_score":0.023469388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010602994,0.00065387285,0.8684391,0.0003303878,0.0004165375,0.00021247384,0.000365426,0.10945567,0.009523506],"genre_scores_gemma":[0.22184934,0.0015254123,0.69338316,0.00069608126,0.00036465144,0.0005635358,0.0050885226,0.02436276,0.052166518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859923,0.0001617742,0.00014858521,0.00017245229,0.00064859627,0.0002694675],"domain_scores_gemma":[0.99785197,0.00037058428,0.00014672577,0.0010416345,0.00032776262,0.00026140487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021796373,0.0010082494,0.0009745994,0.0010956462,0.001068115,0.0030549995,0.004250133,0.0013585673,0.008351173],"category_scores_gemma":[0.004304858,0.0013793842,0.00087606936,0.0009903399,0.00071171485,0.0050272997,0.0043145344,0.002548943,0.0038511464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014685445,0.00042080905,0.0023398567,0.001076042,0.00029334624,0.0005743928,0.0012464569,0.0154291345,0.098010235,0.102098964,0.13856366,0.6384785],"study_design_scores_gemma":[0.00041887208,0.00046301022,0.002398816,0.000248149,0.00033884728,0.0010388646,0.0003643648,0.23911382,0.14488429,0.071741946,0.53864664,0.00034243634],"about_ca_topic_score_codex":0.0025842304,"about_ca_topic_score_gemma":0.0031576212,"teacher_disagreement_score":0.008351173,"about_ca_system_score_codex":0.0012110169,"about_ca_system_score_gemma":0.001783944,"threshold_uncertainty_score":0.027937472},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020856808,0.00932586,0.07233929,0.0009234917,0.001489775,0.00014807394,0.00086797966,0.004858801,0.907961],"genre_scores_gemma":[0.010194092,0.0060442826,0.0085536605,0.00028680125,0.00047933077,0.00006846274,0.0009839159,0.00078841025,0.97260106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984396,0.000010676173,0.0000043798714,0.00002916384,0.000097761986,0.000014065117],"domain_scores_gemma":[0.99981743,0.000039902265,0.0000069159246,0.000048986913,0.00006705661,0.000019695983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001704952,0.0007676789,0.0005339689,0.0020935684,0.00062303484,0.0017404999,0.0008164502,0.0005984814,0.13119943],"category_scores_gemma":[0.0005191559,0.00033171824,0.00023365435,0.0031795716,0.00036474754,0.0022014314,0.00096352765,0.0008577274,0.072299145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041618106,0.00005810545,0.00006568249,0.0001803701,0.0000074873633,0.00007126687,0.00006680706,0.0009014692,0.0064538433,0.032458346,0.3062414,0.65345365],"study_design_scores_gemma":[0.000008640418,0.00002601612,0.00039328207,0.00010794947,0.000009838219,0.00029258284,0.000043166754,0.0041335155,0.0041373335,0.012815589,0.9780207,0.00001144475],"about_ca_topic_score_codex":0.00078456686,"about_ca_topic_score_gemma":0.0011088881,"teacher_disagreement_score":0.13119943,"about_ca_system_score_codex":0.0006268158,"about_ca_system_score_gemma":0.00034106622,"threshold_uncertainty_score":0.43890584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076373294,0.0005945816,0.86801654,0.0006634195,0.0005453129,0.001123706,0.0035822655,0.030453807,0.018647183],"genre_scores_gemma":[0.40181974,0.00068406464,0.578888,0.00026865196,0.000075750395,0.0012751034,0.0052201543,0.0014639134,0.010304628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993375,0.00015697078,0.000054356864,0.00009006846,0.00030420703,0.0000568678],"domain_scores_gemma":[0.99805546,0.00080972456,0.000102598555,0.00045156322,0.00040467872,0.00017608618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012814361,0.00057355623,0.00073184015,0.00047546052,0.00062647206,0.0011104156,0.0032351913,0.000937838,0.0051331837],"category_scores_gemma":[0.004770785,0.00051271095,0.0005624694,0.0005798764,0.00046415796,0.0015465858,0.0013669704,0.0013780199,0.0013581915],"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.00025379725,0.00019885166,0.0015848054,0.0002356812,0.00011096233,0.00015360322,0.00015520456,0.91449404,0.01390126,0.014263834,0.010206491,0.044441544],"study_design_scores_gemma":[0.000056504374,0.00004190116,0.000106747124,0.000005755553,0.0000120254745,0.000024503956,0.000011823094,0.99050236,0.0019457847,0.0021368503,0.005144635,0.000011131795],"about_ca_topic_score_codex":0.0071396786,"about_ca_topic_score_gemma":0.00772662,"teacher_disagreement_score":0.0071396786,"about_ca_system_score_codex":0.00091354764,"about_ca_system_score_gemma":0.0022178455,"threshold_uncertainty_score":0.017172217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023445194,0.002582822,0.98295665,0.00058900856,0.00019783362,0.00019499639,0.00018696424,0.0005335566,0.010413652],"genre_scores_gemma":[0.1507878,0.009614561,0.8120918,0.00032714094,0.00037992303,0.0007987682,0.0007405414,0.00026063676,0.024998829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850875,0.00048018538,0.00012997273,0.00020177546,0.0005987869,0.00008053614],"domain_scores_gemma":[0.99866414,0.0008501399,0.0001198519,0.00018827051,0.00013109975,0.000046539415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030461026,0.0012886168,0.0012651514,0.0015251748,0.001252511,0.0041467617,0.0027930988,0.0024523186,0.0068192966],"category_scores_gemma":[0.0036331532,0.00085685664,0.0013141262,0.0036518343,0.0017760415,0.0055068317,0.0017721311,0.0025156287,0.0018956718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005142012,0.00008194264,0.00030400735,0.0004904594,0.00007341475,0.00049478764,0.00047498816,0.13722217,0.0019301083,0.78586525,0.0059101456,0.06710116],"study_design_scores_gemma":[0.000041638872,0.00004440414,0.0001193804,0.000105471954,0.00006958073,0.00027376108,0.00011654513,0.58694255,0.0017203913,0.34402812,0.06649609,0.000042127005],"about_ca_topic_score_codex":0.004346619,"about_ca_topic_score_gemma":0.003562304,"teacher_disagreement_score":0.0068192966,"about_ca_system_score_codex":0.001620208,"about_ca_system_score_gemma":0.0017005338,"threshold_uncertainty_score":0.022812843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014689422,0.002009007,0.032915425,0.0021591764,0.0007966604,0.00007196938,0.0001927908,0.00024352502,0.96014255],"genre_scores_gemma":[0.064315975,0.0049422584,0.01367389,0.0009396372,0.00043755255,0.0002753785,0.0004951814,0.0002297133,0.9146904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964046,0.000095289965,0.000010742964,0.000060143233,0.00014369609,0.00004968681],"domain_scores_gemma":[0.9997267,0.00010389059,0.000013745853,0.000045686604,0.000058581863,0.000051365212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033990317,0.0010997734,0.00043693482,0.00071719,0.00103714,0.002635598,0.0012181927,0.0011133496,0.081305705],"category_scores_gemma":[0.0015424679,0.0002695403,0.00033517912,0.00061557867,0.0011095939,0.0031073934,0.0017500486,0.0016583517,0.016232945],"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.00001723335,0.000041047235,0.00004722436,0.0000901404,0.000008014895,0.000037355476,0.00013451825,0.002526157,0.0002579303,0.80899966,0.11291725,0.07492353],"study_design_scores_gemma":[0.0000106735,0.000017404986,0.00009764285,0.00012767556,0.000005317026,0.00008289528,0.00013208318,0.0048930286,0.00030130017,0.48789176,0.5064312,0.0000089360565],"about_ca_topic_score_codex":0.00179959,"about_ca_topic_score_gemma":0.0033126022,"teacher_disagreement_score":0.081305705,"about_ca_system_score_codex":0.001591547,"about_ca_system_score_gemma":0.0010174375,"threshold_uncertainty_score":0.2719947},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048256406,0.0047017843,0.0077984864,0.0052821403,0.0114795305,0.00019986709,0.00260295,0.0015204144,0.9659322],"genre_scores_gemma":[0.0016309749,0.0026811678,0.0021733542,0.001980555,0.0014425247,0.000098054676,0.0020236983,0.00035965812,0.98761],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999154,0.000087350105,0.00003289365,0.00017997292,0.00045012482,0.000095681855],"domain_scores_gemma":[0.998713,0.00015958685,0.000042618285,0.0001828024,0.0005756647,0.0003263215],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00083925243,0.00094836106,0.0006117296,0.0015664083,0.0013479962,0.004986285,0.0019674273,0.0019690776,0.6118608],"category_scores_gemma":[0.0029229966,0.00032252536,0.0006287286,0.0014771165,0.0006503217,0.003956029,0.003165925,0.0019510653,0.5260618],"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.000030479418,0.000038401493,0.00009433106,0.00020627724,0.0000029105015,0.000055093915,0.00012115188,0.00011693184,0.000505136,0.029072845,0.7598518,0.20990475],"study_design_scores_gemma":[0.0000017240562,0.0000060977313,0.000052125262,0.000057600588,8.14848e-7,0.000034605517,0.00002876166,0.000017507396,0.000075118805,0.002637527,0.9970855,0.0000025777324],"about_ca_topic_score_codex":0.0018426856,"about_ca_topic_score_gemma":0.002767851,"teacher_disagreement_score":0.3881392,"about_ca_system_score_codex":0.0011974912,"about_ca_system_score_gemma":0.0020234394,"threshold_uncertainty_score":0.55363345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038093407,0.00089560414,0.9507985,0.00020401475,0.00011712286,0.00008246377,0.00007296513,0.0010706167,0.0086653195],"genre_scores_gemma":[0.72437674,0.0012702062,0.26320484,0.000075832606,0.00019480618,0.00009605001,0.00025849894,0.00021639754,0.0103065735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955815,0.000109468725,0.000019837364,0.00008715048,0.00016923978,0.000056278568],"domain_scores_gemma":[0.99873,0.00068117946,0.00006421981,0.0002898181,0.00017970367,0.000055173616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066223496,0.00040071268,0.0007379439,0.0007728909,0.00054327026,0.00097198586,0.00152824,0.00079685746,0.0014774153],"category_scores_gemma":[0.0028864366,0.00038052918,0.00030677347,0.0011501461,0.00056759425,0.0020179872,0.0010573434,0.00071172125,0.00039767573],"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.00030887345,0.00012188281,0.0011370933,0.00035814097,0.00009760208,0.00040132727,0.00035319358,0.50147957,0.055052094,0.13569935,0.008900274,0.29609057],"study_design_scores_gemma":[0.000014263467,0.00004178001,0.0003328934,0.000009972986,0.00002130114,0.00022286361,0.000036671794,0.9432367,0.005102737,0.04719976,0.0037675349,0.000013511902],"about_ca_topic_score_codex":0.0008170035,"about_ca_topic_score_gemma":0.0011066868,"teacher_disagreement_score":0.00152824,"about_ca_system_score_codex":0.0005911568,"about_ca_system_score_gemma":0.00025677597,"threshold_uncertainty_score":0.0049424767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027633754,0.00023004871,0.9878792,0.00020290114,0.000102081845,0.00018491315,0.00013318262,0.0066356463,0.0018687024],"genre_scores_gemma":[0.07208786,0.00050816964,0.9198536,0.00018598605,0.00014995108,0.0005707068,0.00088877487,0.0005108662,0.005244039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949144,0.0008483362,0.0006658893,0.0006961261,0.0023052276,0.00057009864],"domain_scores_gemma":[0.9907782,0.0032110075,0.0004333434,0.0028846734,0.0024025172,0.00029025707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059346803,0.0011211977,0.0015683358,0.0029116382,0.0027924187,0.0069341613,0.005942703,0.0031318031,0.010097185],"category_scores_gemma":[0.017275922,0.0014252451,0.0015421315,0.004657581,0.0013867458,0.0077312896,0.002335577,0.0024946586,0.006779351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008830143,0.00052462757,0.0027451843,0.0006135188,0.00025266357,0.00027882057,0.0006243823,0.11282192,0.01688608,0.18353517,0.031412147,0.64942247],"study_design_scores_gemma":[0.00028860327,0.00017725037,0.00063609483,0.000094835035,0.000113261,0.00029852227,0.00019723592,0.7942119,0.019216858,0.13419175,0.050443925,0.00012974559],"about_ca_topic_score_codex":0.008979181,"about_ca_topic_score_gemma":0.006601335,"teacher_disagreement_score":0.010097185,"about_ca_system_score_codex":0.003037913,"about_ca_system_score_gemma":0.0032699301,"threshold_uncertainty_score":0.03377843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10800112,0.06870872,0.6163394,0.026410682,0.004688824,0.0021360633,0.00045662554,0.009012867,0.16424574],"genre_scores_gemma":[0.83293223,0.017108217,0.11537218,0.00081223587,0.001083986,0.00047566363,0.00029691588,0.0004010592,0.031517494],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958762,0.0016978455,0.00016318935,0.0003995809,0.0016203921,0.00024277005],"domain_scores_gemma":[0.9821915,0.0055445596,0.001605867,0.0028665187,0.0067401677,0.0010514292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055336035,0.00043561563,0.0004660475,0.0010427953,0.0012361258,0.0019482019,0.0012079593,0.0010853151,0.01360924],"category_scores_gemma":[0.027833527,0.00014810711,0.00021376931,0.0011969706,0.00090599834,0.005409142,0.0018137842,0.0008281596,0.0029077248],"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.00016648769,0.00020350117,0.0018977443,0.0018189993,0.00008048477,0.000387538,0.00079256814,0.017024837,0.017260777,0.10392413,0.049568404,0.8068745],"study_design_scores_gemma":[0.00015321052,0.0009643944,0.0053026397,0.0010297813,0.00015079898,0.0010872002,0.0014634803,0.058519777,0.0304536,0.12607303,0.7746982,0.0001039257],"about_ca_topic_score_codex":0.001020774,"about_ca_topic_score_gemma":0.001605722,"teacher_disagreement_score":0.01360924,"about_ca_system_score_codex":0.0008511259,"about_ca_system_score_gemma":0.0021438764,"threshold_uncertainty_score":0.0455274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15942375,0.00049642473,0.8347829,0.00031224356,0.00007797819,0.00019372368,0.00042926366,0.0016880848,0.0025956219],"genre_scores_gemma":[0.8247379,0.0002500297,0.17265959,0.00003286229,0.000037429298,0.00014261284,0.0004985777,0.000065550215,0.0015754438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995492,0.00009887409,0.00003700685,0.00012843157,0.00014516525,0.00004128916],"domain_scores_gemma":[0.9984285,0.0008620976,0.00017701811,0.00013495909,0.00028944563,0.000107965316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054194056,0.0008003222,0.00061327283,0.0011183737,0.00046228443,0.0005951228,0.0010770649,0.0004452806,0.0015931574],"category_scores_gemma":[0.004557567,0.00037265563,0.0003194228,0.00084775675,0.00030873166,0.00094700395,0.00080718094,0.00071235775,0.0003939162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005810761,0.00042330683,0.03357602,0.0002043512,0.0001059297,0.00018126315,0.00037411496,0.3723987,0.00821863,0.009459888,0.0034955472,0.57098114],"study_design_scores_gemma":[0.0000045790734,0.000026765969,0.0016833998,0.0000045703914,0.000005157059,0.000022624357,0.000027222495,0.99536467,0.0007541251,0.0018595059,0.00024209384,0.000005256577],"about_ca_topic_score_codex":0.009249432,"about_ca_topic_score_gemma":0.010272286,"teacher_disagreement_score":0.009249432,"about_ca_system_score_codex":0.00057321385,"about_ca_system_score_gemma":0.00049053814,"threshold_uncertainty_score":0.018391192},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05607546,0.0017660481,0.87027866,0.0007425966,0.0018206816,0.0025059157,0.0034337414,0.027249075,0.036127858],"genre_scores_gemma":[0.22226274,0.0013860845,0.66970676,0.00083157024,0.0003689995,0.0021253994,0.0066053537,0.0025515268,0.09416163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992417,0.00015187461,0.00009467307,0.00014560414,0.00026442905,0.000101725454],"domain_scores_gemma":[0.997866,0.00025676592,0.0001534574,0.00058432884,0.0008391928,0.00030029402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008332712,0.0006520809,0.00089889375,0.0016490897,0.0014782983,0.0021524264,0.0017705138,0.0011813528,0.017629337],"category_scores_gemma":[0.00242303,0.0005477241,0.00044605185,0.0018394802,0.0004899713,0.002299387,0.0014535777,0.0014785278,0.008427979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024238736,0.000977967,0.0014889721,0.0015151774,0.00015342276,0.001208475,0.0011208972,0.009761359,0.32802448,0.055685353,0.07460132,0.52303874],"study_design_scores_gemma":[0.0009127117,0.0040496164,0.0034563297,0.0004047294,0.00026574612,0.0037558307,0.000719202,0.18850003,0.34183,0.015104648,0.44052434,0.0004768232],"about_ca_topic_score_codex":0.0013185856,"about_ca_topic_score_gemma":0.0022694676,"teacher_disagreement_score":0.017629337,"about_ca_system_score_codex":0.000720136,"about_ca_system_score_gemma":0.0012049439,"threshold_uncertainty_score":0.058975995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077772796,0.001219777,0.51210606,0.0013930982,0.001118595,0.0024124354,0.0080436105,0.2762111,0.119722486],"genre_scores_gemma":[0.4278009,0.0015754281,0.42184693,0.0027296476,0.00027444932,0.0031762759,0.029188372,0.022602145,0.09080592],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991026,0.00022929169,0.00007496288,0.000124543,0.0003326085,0.0001360723],"domain_scores_gemma":[0.9980903,0.00051889487,0.00011866672,0.0004417975,0.0006151821,0.00021516456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145659,0.0010141482,0.00073673745,0.000998286,0.00075372227,0.0014639393,0.0028002772,0.0013257324,0.022109773],"category_scores_gemma":[0.0047692275,0.00067933835,0.000687288,0.00057806174,0.00056528405,0.0024520888,0.0018689167,0.0018164841,0.011613306],"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.0023894897,0.0014479567,0.017224127,0.001483716,0.00035730336,0.0007513114,0.00081125577,0.15193771,0.0334581,0.082740314,0.39719787,0.31020084],"study_design_scores_gemma":[0.0005369645,0.0005967504,0.0021062493,0.00009421638,0.00014210046,0.00040802313,0.00009473481,0.46371952,0.042154647,0.012442014,0.4776003,0.00010444878],"about_ca_topic_score_codex":0.0024387052,"about_ca_topic_score_gemma":0.0022680429,"teacher_disagreement_score":0.022109773,"about_ca_system_score_codex":0.0009023268,"about_ca_system_score_gemma":0.0015102201,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038529758,0.021842405,0.12225511,0.0032858318,0.0022853895,0.00016406275,0.0003524534,0.00103043,0.8449313],"genre_scores_gemma":[0.0813525,0.04499148,0.04989495,0.0008449725,0.0018999964,0.00035232378,0.0010616857,0.00041717026,0.8191849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996644,0.00007223889,0.000011305722,0.000052755222,0.00017530972,0.000023962762],"domain_scores_gemma":[0.99966335,0.00016603309,0.000014634653,0.00006841507,0.00005748877,0.000030062942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031669677,0.0007119865,0.00036887033,0.000999027,0.0008203443,0.003192272,0.00095568766,0.0011141283,0.029225687],"category_scores_gemma":[0.0012998804,0.00030472598,0.00025938614,0.0020304208,0.0007455305,0.005420893,0.001971254,0.0010624896,0.014839162],"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.000011519633,0.000044195745,0.000097477845,0.00040533158,0.000013437831,0.00011355566,0.000390599,0.002392045,0.001290516,0.5180715,0.10033431,0.37683544],"study_design_scores_gemma":[0.0000037860661,0.000013738475,0.00015701976,0.00018512059,0.000007369711,0.0002461616,0.0001605326,0.0045658294,0.00058573234,0.19427782,0.7997867,0.000010252175],"about_ca_topic_score_codex":0.0005185671,"about_ca_topic_score_gemma":0.00091284065,"teacher_disagreement_score":0.029225687,"about_ca_system_score_codex":0.000667331,"about_ca_system_score_gemma":0.0005215995,"threshold_uncertainty_score":0.09776962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95238316,0.0018939431,0.037201684,0.0004578467,0.00013541823,0.0000979603,0.00014518118,0.0024259423,0.005258866],"genre_scores_gemma":[0.9947477,0.00022457379,0.0042026266,0.00002920366,0.000027405325,0.0000223522,0.00009545543,0.0000736733,0.0005770495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9923228,0.0021384319,0.000618117,0.0007226699,0.003370287,0.00082764286],"domain_scores_gemma":[0.9819147,0.011261614,0.0012945874,0.0023426504,0.0024156824,0.0007707929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058583803,0.0008264777,0.001272742,0.0007501467,0.001122376,0.0027450025,0.0011770161,0.0013364167,0.0010666385],"category_scores_gemma":[0.02683488,0.0005750878,0.0002790127,0.0013440293,0.0010996845,0.0028488475,0.0012574956,0.0010678881,0.00051886676],"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.0056389477,0.0012360449,0.044608794,0.000863676,0.0003876427,0.0011470265,0.0019705787,0.5804644,0.16806512,0.014585184,0.0049480074,0.17608462],"study_design_scores_gemma":[0.00021472987,0.0014503724,0.010994288,0.000026787593,0.00011741027,0.0004429087,0.000496552,0.8858589,0.091831714,0.006046121,0.0024255454,0.00009460399],"about_ca_topic_score_codex":0.0024783267,"about_ca_topic_score_gemma":0.0008937172,"teacher_disagreement_score":0.0058583803,"about_ca_system_score_codex":0.0013872682,"about_ca_system_score_gemma":0.0009475649,"threshold_uncertainty_score":0.030982435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037223734,0.00067485945,0.9546912,0.00034389005,0.000069098736,0.00013757621,0.00006938937,0.0022559036,0.0045343647],"genre_scores_gemma":[0.811627,0.0011230704,0.18286866,0.000113041424,0.00012678634,0.0001668547,0.00018549465,0.0002184338,0.0035707324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987437,0.0002705128,0.000046736655,0.00009850192,0.0007427112,0.00009776175],"domain_scores_gemma":[0.99858296,0.00064223673,0.00015908667,0.0002492409,0.00030697268,0.000059486105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847353,0.0007289762,0.0009408703,0.00050263177,0.00038238775,0.0008249548,0.0017195434,0.0005814249,0.0006972147],"category_scores_gemma":[0.0034371286,0.00033942764,0.000491862,0.00045056356,0.000543622,0.0015171351,0.0011293117,0.0011408954,0.0003563518],"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.0002626604,0.00019023828,0.00072063593,0.00024215522,0.000070862734,0.00025373814,0.00017165628,0.7408308,0.05776422,0.051121164,0.0038238957,0.14454786],"study_design_scores_gemma":[0.000007911749,0.000040668852,0.000056478082,0.0000051710067,0.000005593122,0.00003057131,0.0000074249547,0.9921312,0.003241807,0.003768654,0.0006974907,0.000006959545],"about_ca_topic_score_codex":0.0028461881,"about_ca_topic_score_gemma":0.0019130909,"teacher_disagreement_score":0.0028461881,"about_ca_system_score_codex":0.00095537,"about_ca_system_score_gemma":0.0009176938,"threshold_uncertainty_score":0.007323265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22128028,0.0020030811,0.7627248,0.00088652066,0.00013492176,0.00012043079,0.00030895034,0.001065552,0.011475385],"genre_scores_gemma":[0.95328254,0.0005524712,0.044372924,0.00008013551,0.00005005798,0.00005438315,0.00012415324,0.000069432244,0.0014140377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992194,0.00020266992,0.000039906325,0.00016058893,0.0002231626,0.00015435013],"domain_scores_gemma":[0.99722004,0.0017800311,0.00016080572,0.00025175355,0.00043378602,0.00015357614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001181314,0.00056379405,0.00073228,0.0006323056,0.00075757696,0.0012188937,0.0012828069,0.0009610686,0.001982867],"category_scores_gemma":[0.0047640884,0.00028744515,0.00033407693,0.0008613048,0.0006878731,0.002645695,0.0016105045,0.0007994054,0.0002623641],"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.00023508168,0.00015142461,0.0009261156,0.00019153772,0.000060176855,0.0002691508,0.0001568886,0.87097615,0.028311273,0.02101848,0.0026723929,0.0750313],"study_design_scores_gemma":[0.000010258566,0.000047389418,0.0001866986,0.0000064864116,0.000009803403,0.000035914803,0.000039450828,0.9892047,0.0033946265,0.0062745283,0.0007821599,0.0000080073805],"about_ca_topic_score_codex":0.003158189,"about_ca_topic_score_gemma":0.0018871902,"teacher_disagreement_score":0.003158189,"about_ca_system_score_codex":0.001196285,"about_ca_system_score_gemma":0.0007008103,"threshold_uncertainty_score":0.008679688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019534722,0.00021975538,0.9529636,0.00070185575,0.00020376859,0.000386464,0.00013792708,0.011558345,0.014293579],"genre_scores_gemma":[0.16430926,0.0004367328,0.81347436,0.00038855642,0.00006480833,0.00056097074,0.00063896127,0.001357686,0.018768637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.00026760512,0.000075503165,0.00012520781,0.00020492048,0.00008287815],"domain_scores_gemma":[0.99901307,0.00012911555,0.000069981856,0.00033982037,0.0002360442,0.00021188408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014943385,0.0004986834,0.0003467324,0.00076387945,0.0013935528,0.002028526,0.0015738073,0.0009539638,0.0029042473],"category_scores_gemma":[0.0017479572,0.0004917732,0.00082660996,0.0007524266,0.0010296229,0.0023508002,0.002778436,0.0010931153,0.001775941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079413195,0.0007490213,0.0089961365,0.00095995626,0.00033080357,0.0023781315,0.0052843285,0.080413744,0.10804222,0.3078601,0.073329285,0.41086203],"study_design_scores_gemma":[0.0001395992,0.0005363682,0.0031601621,0.00023793241,0.00021000847,0.0015262263,0.0007234818,0.5341435,0.027913598,0.057404708,0.37374413,0.00026029214],"about_ca_topic_score_codex":0.00655617,"about_ca_topic_score_gemma":0.008735448,"teacher_disagreement_score":0.00655617,"about_ca_system_score_codex":0.0010018479,"about_ca_system_score_gemma":0.0019898422,"threshold_uncertainty_score":0.013036072},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004785877,0.0010366103,0.0010321098,0.004196565,0.0020458375,0.00013887462,0.0009458796,0.0004821019,0.9853361],"genre_scores_gemma":[0.0239342,0.0009467636,0.0013855025,0.0006673461,0.00020306504,0.00005503047,0.00066248444,0.0006928236,0.9714527],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951863,0.000048400343,0.000011625458,0.00007288126,0.00026370972,0.00008477522],"domain_scores_gemma":[0.99955946,0.00004306137,0.000013450174,0.000041434036,0.0002631981,0.00007931249],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045700127,0.00056666665,0.00015992353,0.00069593015,0.0033168143,0.003673387,0.0008166618,0.0015015083,0.21116047],"category_scores_gemma":[0.001129501,0.000304785,0.00033315743,0.00057834527,0.0010987688,0.0025644286,0.0014273144,0.002468874,0.05038881],"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.00010706346,0.000028684217,0.0004752619,0.00022174505,0.000006933595,0.0003975304,0.003449278,0.00008123665,0.008298875,0.058118258,0.85838544,0.07042972],"study_design_scores_gemma":[0.0000024339124,0.000007843799,0.000948536,0.00003664618,0.0000013141547,0.00005122522,0.00071034644,0.000012147265,0.0006710216,0.00026819034,0.9972844,0.000005831079],"about_ca_topic_score_codex":0.09847612,"about_ca_topic_score_gemma":0.21138152,"teacher_disagreement_score":0.7888395,"about_ca_system_score_codex":0.0035879212,"about_ca_system_score_gemma":0.0020873304,"threshold_uncertainty_score":0.7064021},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011092923,0.06876175,0.37714532,0.0021329417,0.004697798,0.00017199307,0.00018113534,0.0036268518,0.53218925],"genre_scores_gemma":[0.1181349,0.0482106,0.16110659,0.0011134654,0.0032292572,0.0002784642,0.0004248924,0.0007180429,0.66678375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998752,0.000017288083,0.00000347058,0.000019199117,0.00007128659,0.000013611487],"domain_scores_gemma":[0.99988556,0.000046892208,0.0000054016955,0.000026161295,0.00001898306,0.000017062992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671732,0.0006598403,0.00026835976,0.0004466258,0.00047541293,0.0010940889,0.0008067399,0.0007355556,0.020534122],"category_scores_gemma":[0.00031310768,0.0002096323,0.00018697963,0.00045501263,0.00027205993,0.0019432406,0.0012913432,0.0011675034,0.005600646],"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.000037657035,0.00009179184,0.00020940509,0.00032778792,0.000015206201,0.00018867668,0.00019544607,0.0044862065,0.014728528,0.12476053,0.095477544,0.7594812],"study_design_scores_gemma":[0.000008863817,0.000085944055,0.00072963396,0.00036529882,0.000021926657,0.0014613827,0.00012579182,0.040763263,0.0046491567,0.10576014,0.8459905,0.000038172122],"about_ca_topic_score_codex":0.00036227066,"about_ca_topic_score_gemma":0.001404514,"teacher_disagreement_score":0.020534122,"about_ca_system_score_codex":0.00028083468,"about_ca_system_score_gemma":0.00021583991,"threshold_uncertainty_score":0.06869352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2334364,0.0031475767,0.75126266,0.0010915123,0.000094172916,0.000074004,0.00030624348,0.00044786153,0.010139535],"genre_scores_gemma":[0.98129374,0.0015707593,0.013676896,0.0001163962,0.00005157992,0.00006244826,0.00013101414,0.0000820989,0.0030150928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988518,0.0003739986,0.00003778003,0.00016695868,0.00038363505,0.00018587081],"domain_scores_gemma":[0.994245,0.004440688,0.0005493358,0.00023161503,0.00042671114,0.000106699656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025743148,0.00063439814,0.00063996523,0.0014786666,0.0004764169,0.000681452,0.0011537925,0.00063477154,0.0018315293],"category_scores_gemma":[0.011375354,0.00029115513,0.0003685763,0.0013228328,0.0007657639,0.0024622926,0.0007615054,0.00083858205,0.00034952103],"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.00019343439,0.00003665959,0.0022315476,0.0001174029,0.000027377639,0.000176324,0.0002037247,0.881867,0.0043644872,0.09265029,0.0012916075,0.0168402],"study_design_scores_gemma":[0.000003976063,0.000027999718,0.0002875175,0.000010366054,0.0000061470514,0.00005856159,0.000020209529,0.99038625,0.000639365,0.007951311,0.0006009379,0.0000072904672],"about_ca_topic_score_codex":0.0040378436,"about_ca_topic_score_gemma":0.0020252233,"teacher_disagreement_score":0.0040378436,"about_ca_system_score_codex":0.002759254,"about_ca_system_score_gemma":0.000751422,"threshold_uncertainty_score":0.02001983},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00768666,0.006464258,0.7585761,0.0017358231,0.0038090195,0.0008152528,0.0024512121,0.023498215,0.19496346],"genre_scores_gemma":[0.29799697,0.016438479,0.3067254,0.0016293374,0.0033306147,0.0011551981,0.005891041,0.003961868,0.36287114],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998201,0.00020286537,0.0001252065,0.0002976487,0.0009063685,0.00026683425],"domain_scores_gemma":[0.9962825,0.0012831513,0.00012392126,0.001183254,0.0008965181,0.0002306517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018310333,0.0009780523,0.0014475385,0.002413083,0.001764076,0.006683354,0.0029352824,0.0014108053,0.051452443],"category_scores_gemma":[0.0051039034,0.0008446661,0.0006808618,0.004173093,0.0014587654,0.0068380116,0.0028366474,0.0022689225,0.023672393],"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.00043300528,0.0003588819,0.00035471874,0.0011045026,0.0000792251,0.0002604638,0.00028750885,0.010118813,0.012352732,0.3371045,0.15762098,0.47992468],"study_design_scores_gemma":[0.00021062039,0.00015810161,0.00033668152,0.00020415206,0.00013485285,0.0008641516,0.00017118221,0.09861178,0.022242527,0.29849917,0.5783832,0.00018362544],"about_ca_topic_score_codex":0.0018773772,"about_ca_topic_score_gemma":0.0017030871,"teacher_disagreement_score":0.051452443,"about_ca_system_score_codex":0.001454851,"about_ca_system_score_gemma":0.0024118447,"threshold_uncertainty_score":0.17212558},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05042742,0.00048120445,0.8911608,0.0003343204,0.00031908695,0.0005413597,0.00043589465,0.04965092,0.0066490145],"genre_scores_gemma":[0.59037995,0.00048346087,0.3904978,0.00025694896,0.00017464855,0.0004053164,0.0018457536,0.002110711,0.013845411],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991491,0.000118679025,0.00006753935,0.00014482565,0.00043640987,0.00008347748],"domain_scores_gemma":[0.99896014,0.00016897084,0.000111325506,0.0003869602,0.00019525195,0.00017728319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010838468,0.0004717222,0.0006160684,0.0005373706,0.0006182527,0.0011882603,0.0021653532,0.00091501506,0.003085161],"category_scores_gemma":[0.0027100889,0.0003997769,0.00044512778,0.00037277502,0.00045360147,0.0019470989,0.002546253,0.0012276635,0.0012283975],"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.0017016623,0.00090787216,0.004997041,0.00088608684,0.00025345868,0.0015514148,0.0011981318,0.052263696,0.39314172,0.039058372,0.04169568,0.46234483],"study_design_scores_gemma":[0.0003851879,0.0006669041,0.0047664735,0.000059776416,0.00016908158,0.00085819804,0.00025607098,0.6805141,0.13465193,0.012195593,0.16522701,0.0002496784],"about_ca_topic_score_codex":0.0021126673,"about_ca_topic_score_gemma":0.0018825307,"teacher_disagreement_score":0.003085161,"about_ca_system_score_codex":0.0005439473,"about_ca_system_score_gemma":0.0009282261,"threshold_uncertainty_score":0.010320902},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05337762,0.00021306217,0.94312996,0.00016794517,0.0000446747,0.000100140904,0.00007906144,0.00055870303,0.0023288475],"genre_scores_gemma":[0.6101737,0.00026235642,0.3865404,0.00013462157,0.000043231328,0.00015747041,0.00035105814,0.00010217938,0.00223495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952316,0.00009343841,0.000031409,0.00011352064,0.00016634737,0.0000721343],"domain_scores_gemma":[0.9994586,0.0001562199,0.00008709088,0.00009771863,0.00015512678,0.00004528111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062953687,0.00042411333,0.000522993,0.0006967232,0.00097041746,0.0006470633,0.0010164813,0.00081497023,0.0010144516],"category_scores_gemma":[0.001751502,0.00020445758,0.0006022467,0.0005677178,0.00027345613,0.0012254507,0.0009902857,0.00050672283,0.00021308636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031919457,0.00017451467,0.0045484058,0.00035347394,0.00009585121,0.00067744876,0.00057968893,0.39892492,0.10903924,0.05141856,0.0070426366,0.4268261],"study_design_scores_gemma":[0.000026375898,0.00009195327,0.0004898605,0.000012837619,0.000022879223,0.00040436932,0.00007643075,0.96456325,0.016794251,0.0142642595,0.0032368863,0.000016546577],"about_ca_topic_score_codex":0.0007372729,"about_ca_topic_score_gemma":0.00077101984,"teacher_disagreement_score":0.0010164813,"about_ca_system_score_codex":0.00060988363,"about_ca_system_score_gemma":0.0007383733,"threshold_uncertainty_score":0.0044251084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024880929,0.00030073177,0.97137016,0.000344361,0.000043266216,0.000047143996,0.000039703467,0.0005034691,0.0024702584],"genre_scores_gemma":[0.91213757,0.00016425067,0.08442723,0.0001472572,0.00003912484,0.00012736747,0.000066889625,0.000058141104,0.0028321717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996269,0.00013473748,0.000013763184,0.00007005551,0.00008025358,0.00007443785],"domain_scores_gemma":[0.99923956,0.00038746564,0.000077301884,0.00003690697,0.00018225594,0.00007647681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013908957,0.00076261285,0.0008413891,0.00030177302,0.0003759755,0.00070363237,0.0012243476,0.0009036099,0.0016630604],"category_scores_gemma":[0.0024563288,0.0003718981,0.00029916334,0.00029540714,0.00091358286,0.0008022648,0.00091941794,0.0014037511,0.00018151032],"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.00002394952,0.000022515256,0.0001830316,0.000013614425,0.00000936469,0.000015691836,0.000013745762,0.98758125,0.00040090902,0.0036692824,0.00031155514,0.0077550546],"study_design_scores_gemma":[0.0000035952087,0.000008334085,0.000014493654,0.0000010733182,0.0000011048604,0.0000011271709,0.0000010924374,0.9986651,0.00006800846,0.0011583428,0.00007684696,9.830028e-7],"about_ca_topic_score_codex":0.01096379,"about_ca_topic_score_gemma":0.009685453,"teacher_disagreement_score":0.01096379,"about_ca_system_score_codex":0.0014081346,"about_ca_system_score_gemma":0.0018929978,"threshold_uncertainty_score":0.021799982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74964786,0.014560858,0.013408675,0.026863065,0.0007072809,0.00017840478,0.0003849501,0.000082271625,0.19416665],"genre_scores_gemma":[0.98457414,0.0071293134,0.0023574561,0.0008227988,0.0001914953,0.000106416206,0.0001406941,0.00005237432,0.0046253647],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9945639,0.0027688094,0.00032035692,0.0005714115,0.0012008455,0.000574818],"domain_scores_gemma":[0.98099285,0.011561014,0.0037219303,0.0009682945,0.0014380054,0.0013178592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006933196,0.00034071133,0.00044399162,0.00792544,0.009705511,0.01251875,0.0015643135,0.001205608,0.005107358],"category_scores_gemma":[0.025832238,0.00046093928,0.00043113806,0.009920983,0.010357765,0.028182425,0.011862312,0.0025626607,0.00028143747],"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.000059095004,0.000037296635,0.04944226,0.0006628392,0.00004474781,0.00097349694,0.6724584,0.00023154156,0.00043985338,0.1855489,0.0065240017,0.08357761],"study_design_scores_gemma":[0.000006947249,0.000073458126,0.06693743,0.0012664237,0.000063253276,0.0016642537,0.72743714,0.0010848909,0.0002194856,0.07728289,0.12390675,0.00005707998],"about_ca_topic_score_codex":0.006786135,"about_ca_topic_score_gemma":0.018398387,"teacher_disagreement_score":0.01251875,"about_ca_system_score_codex":0.0042654243,"about_ca_system_score_gemma":0.003362019,"threshold_uncertainty_score":0.03666669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1663985,0.0008951106,0.8132913,0.0009917982,0.0000572421,0.0002119436,0.00054221455,0.0005619121,0.017049916],"genre_scores_gemma":[0.9412773,0.00084836216,0.04158221,0.0001578292,0.000035414152,0.00023338906,0.00024463815,0.00008047546,0.015540408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990018,0.00027158993,0.000038058937,0.00017714052,0.00032884863,0.00018262399],"domain_scores_gemma":[0.9985965,0.00068316393,0.00023467316,0.00013925727,0.00026960275,0.00007680344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015714759,0.0006185206,0.0007629836,0.0011871199,0.0007191885,0.0012340477,0.0021857342,0.0011335188,0.003322406],"category_scores_gemma":[0.0048237504,0.0004253981,0.0004381817,0.0011408487,0.00096026954,0.0038367184,0.0011711947,0.0007369144,0.00068256276],"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.00013798378,0.000044541262,0.0012403497,0.000049128128,0.000017032848,0.00030306287,0.00014985813,0.85243404,0.0025628132,0.13047081,0.0017354123,0.010855029],"study_design_scores_gemma":[0.000007117241,0.000016709168,0.00010111777,0.0000043191394,0.0000034835844,0.000047029553,0.000018172588,0.99101394,0.00035881117,0.007510122,0.0009135386,0.000005565297],"about_ca_topic_score_codex":0.00997323,"about_ca_topic_score_gemma":0.005144453,"teacher_disagreement_score":0.00997323,"about_ca_system_score_codex":0.002989017,"about_ca_system_score_gemma":0.001406795,"threshold_uncertainty_score":0.021686971},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031676333,0.00062198093,0.91779053,0.0004625958,0.00051087624,0.0002079554,0.00032391492,0.0034785217,0.04492729],"genre_scores_gemma":[0.55101657,0.0007735328,0.3976353,0.00034787602,0.000097093594,0.000311818,0.0009722374,0.00029078076,0.04855477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998572,0.0000194342,0.0000074769046,0.000023267676,0.00007298406,0.000019679548],"domain_scores_gemma":[0.9998803,0.000018333689,0.000009006733,0.000028248027,0.000055656805,0.0000083443065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013723983,0.00022313281,0.00020187865,0.00030631668,0.0003208276,0.0005659412,0.0009254378,0.00036907734,0.0041746013],"category_scores_gemma":[0.0003471705,0.00010102141,0.00016269405,0.00028704014,0.00015213613,0.0005206475,0.0004411987,0.0004700753,0.001086587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029786315,0.00027180836,0.0009012102,0.0004965099,0.000087672386,0.00038589834,0.0001845138,0.053294342,0.23300248,0.15153821,0.032906007,0.5266335],"study_design_scores_gemma":[0.00006258346,0.00028751293,0.0007528082,0.000049873473,0.000055610508,0.0009324686,0.0001071895,0.68215925,0.16510855,0.026416693,0.124012224,0.000055155488],"about_ca_topic_score_codex":0.0007259491,"about_ca_topic_score_gemma":0.0010391234,"teacher_disagreement_score":0.0041746013,"about_ca_system_score_codex":0.00028719395,"about_ca_system_score_gemma":0.00033623946,"threshold_uncertainty_score":0.013965368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008518969,0.000970709,0.9568051,0.0076043555,0.00029064182,0.00025781113,0.00024630016,0.0005219125,0.024784265],"genre_scores_gemma":[0.5355755,0.0032083618,0.41040015,0.0020756584,0.0014909735,0.0017776953,0.00081702543,0.00048729085,0.044167325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9804652,0.0064391284,0.0016599763,0.0042365887,0.005992194,0.0012070028],"domain_scores_gemma":[0.9732992,0.0084706,0.0017600342,0.011687242,0.003296961,0.0014859017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016546067,0.0010420216,0.0018261645,0.0031625796,0.0046573286,0.019209098,0.006347884,0.0046908413,0.006903962],"category_scores_gemma":[0.022557639,0.0012302211,0.0024900152,0.005016195,0.015620549,0.033710465,0.01271554,0.0061407425,0.0018301969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028054164,0.00002786522,0.0004018384,0.00005757373,0.000022393153,0.00012311313,0.0011754542,0.0055445926,0.00040105145,0.9793941,0.0017311787,0.01109276],"study_design_scores_gemma":[0.000057835954,0.00006148144,0.00019863115,0.00009539975,0.00004252242,0.00030901973,0.0004959189,0.053885512,0.00086415175,0.86966586,0.07425864,0.000064972715],"about_ca_topic_score_codex":0.009744944,"about_ca_topic_score_gemma":0.004615135,"teacher_disagreement_score":0.019209098,"about_ca_system_score_codex":0.0061969683,"about_ca_system_score_gemma":0.006523568,"threshold_uncertainty_score":0.08750504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15775327,0.00028543026,0.80108804,0.0019994793,0.0000666942,0.00042939364,0.0002284942,0.00012287195,0.03802629],"genre_scores_gemma":[0.92597014,0.00027006606,0.062250867,0.0002569219,0.000051436935,0.00040541615,0.0000944233,0.000062636755,0.010638159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549484,0.002633499,0.00014507366,0.00049088366,0.00069705816,0.00053869945],"domain_scores_gemma":[0.98634934,0.010025003,0.0013151322,0.0008198536,0.000890808,0.00059982575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073872246,0.00086540234,0.0011152778,0.0009615083,0.001019375,0.0023104707,0.0026444886,0.0024296723,0.0067247283],"category_scores_gemma":[0.02436106,0.00073965825,0.001034215,0.00074804865,0.0026072047,0.0054343967,0.0021968412,0.0025573971,0.00059729436],"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.00015571012,0.00010461922,0.00095828174,0.00007383421,0.000043709624,0.00020661473,0.00040394085,0.09687467,0.0020506503,0.88917655,0.0012812262,0.008670253],"study_design_scores_gemma":[0.00008772284,0.00012409921,0.00048934267,0.00002807384,0.0000250043,0.00012643647,0.00017349042,0.6330697,0.0008847746,0.36165,0.0033004137,0.000041049443],"about_ca_topic_score_codex":0.0028157977,"about_ca_topic_score_gemma":0.0020752826,"teacher_disagreement_score":0.0073872246,"about_ca_system_score_codex":0.002738641,"about_ca_system_score_gemma":0.0033791019,"threshold_uncertainty_score":0.039067805},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05320998,0.00017868874,0.917941,0.00057454035,0.00013944431,0.00055990904,0.00006180473,0.005224155,0.022110542],"genre_scores_gemma":[0.32987082,0.0002749953,0.65142196,0.00022556863,0.000041560077,0.00096683763,0.00024463277,0.0022802446,0.014673412],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978623,0.0012329405,0.000118324926,0.0002388643,0.0003500905,0.00019745069],"domain_scores_gemma":[0.9951958,0.0033836602,0.00023711628,0.00040532966,0.00037601512,0.00040210073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044089244,0.0010239,0.00037196386,0.0006501219,0.0015289037,0.0040250253,0.0021576488,0.0009421621,0.0076701012],"category_scores_gemma":[0.013451687,0.0008134437,0.0010643384,0.000285114,0.003062811,0.0028410978,0.0038331118,0.0012966878,0.0015593746],"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.00081289,0.0007133403,0.012491141,0.0024669585,0.00021602225,0.0015506927,0.08718642,0.08288817,0.09384179,0.17357509,0.021018658,0.52323884],"study_design_scores_gemma":[0.00047501476,0.0015226131,0.0067084357,0.001153404,0.00039171177,0.0013385125,0.02087391,0.2695953,0.047695983,0.11312153,0.5366834,0.00044023787],"about_ca_topic_score_codex":0.0021186722,"about_ca_topic_score_gemma":0.0031761427,"teacher_disagreement_score":0.0076701012,"about_ca_system_score_codex":0.0013140499,"about_ca_system_score_gemma":0.0017322403,"threshold_uncertainty_score":0.025659084},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0353405,0.00089106214,0.7399707,0.000921579,0.0007373975,0.0024036022,0.0037119205,0.13686047,0.07916281],"genre_scores_gemma":[0.43224815,0.0017293206,0.4831631,0.0014714126,0.0002630824,0.0020959561,0.019818734,0.016801272,0.042408936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920887,0.0001341928,0.0000434428,0.00007821293,0.00039569096,0.00013952631],"domain_scores_gemma":[0.99939716,0.00010724848,0.00003631262,0.00014849279,0.00013754402,0.00017329451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011603521,0.00087500905,0.0003243901,0.00090053416,0.00048820465,0.0012776788,0.002275889,0.0008794834,0.009484217],"category_scores_gemma":[0.00189008,0.00037096703,0.0005176145,0.00035887086,0.00056224695,0.0020683568,0.002717172,0.0018327292,0.0025210944],"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.0023931013,0.0014783965,0.0041990266,0.0016106595,0.00026377456,0.0026653348,0.0016359114,0.03476726,0.16389625,0.14586556,0.2096411,0.4315836],"study_design_scores_gemma":[0.0005465862,0.0006588544,0.0062503885,0.00038523908,0.00009039661,0.0014509559,0.00036907816,0.27904347,0.07020073,0.026570918,0.6140809,0.00035250088],"about_ca_topic_score_codex":0.0033539988,"about_ca_topic_score_gemma":0.0041450607,"teacher_disagreement_score":0.009484217,"about_ca_system_score_codex":0.00066648854,"about_ca_system_score_gemma":0.0011547789,"threshold_uncertainty_score":0.03172779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049420126,0.0014227822,0.9284779,0.00402596,0.00007572683,0.00023086292,0.00041046212,0.0003427071,0.015593626],"genre_scores_gemma":[0.60749,0.00112497,0.38576546,0.00029848848,0.00018686077,0.00049155863,0.00052664446,0.00008321286,0.0040327897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914301,0.003157187,0.0007633037,0.0014562433,0.0025636288,0.0006296253],"domain_scores_gemma":[0.9845598,0.010348626,0.0011345875,0.0017378277,0.0014612876,0.0007578754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075007025,0.0011224503,0.0018165298,0.0031383054,0.0026468,0.00899563,0.003603759,0.0036441407,0.003912931],"category_scores_gemma":[0.018626891,0.00079926825,0.0034674003,0.003874371,0.006226191,0.0137628745,0.0053449515,0.004392128,0.0003581207],"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.000019040135,0.000022028673,0.00016925258,0.00008953679,0.00002959226,0.00010835595,0.00024051331,0.01375716,0.0002615173,0.9760416,0.00048122025,0.008780231],"study_design_scores_gemma":[0.000021371177,0.000009197347,0.00008531995,0.000016637416,0.000014794041,0.000065939515,0.00005735282,0.043670405,0.00014247542,0.953532,0.0023707664,0.000013799138],"about_ca_topic_score_codex":0.00468852,"about_ca_topic_score_gemma":0.002390125,"teacher_disagreement_score":0.00899563,"about_ca_system_score_codex":0.005489352,"about_ca_system_score_gemma":0.0021590106,"threshold_uncertainty_score":0.03982818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009102369,0.0007344773,0.9865737,0.00052794226,0.00018392358,0.0002095843,0.00005184123,0.000787804,0.0018283624],"genre_scores_gemma":[0.37146577,0.001293112,0.6205566,0.00049350975,0.00031113235,0.0013982703,0.0002136986,0.00028358886,0.0039843423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925794,0.0033356063,0.00043214078,0.0010819326,0.0020607705,0.00051021855],"domain_scores_gemma":[0.983779,0.0106689995,0.0014266743,0.0026632403,0.0010713832,0.00039059517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064411927,0.0009529014,0.0014813592,0.0013100298,0.001835486,0.0021673536,0.0034917884,0.0019733189,0.0025849985],"category_scores_gemma":[0.02501619,0.0007314529,0.0009409282,0.0012725706,0.0030858344,0.0043389075,0.0029125302,0.0028053976,0.0006404012],"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.00020916211,0.00014732333,0.0004460568,0.0002911507,0.00012222306,0.00015009799,0.0001772798,0.5883093,0.005266654,0.3684061,0.0031492687,0.03332535],"study_design_scores_gemma":[0.00014369599,0.000115126626,0.000077365956,0.00003671574,0.000040219657,0.000105649255,0.000036770823,0.8380292,0.0031452265,0.1514851,0.0067374753,0.00004742456],"about_ca_topic_score_codex":0.0012498081,"about_ca_topic_score_gemma":0.0011968184,"teacher_disagreement_score":0.0064411927,"about_ca_system_score_codex":0.0021987024,"about_ca_system_score_gemma":0.0025888584,"threshold_uncertainty_score":0.03406465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038321175,0.00042857387,0.9532889,0.00015596546,0.00005189796,0.0003468402,0.00013538593,0.0048452383,0.0024260865],"genre_scores_gemma":[0.69472003,0.0003213052,0.29925546,0.00011366094,0.000050560557,0.0004648325,0.00050828274,0.00026363376,0.004302267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993094,0.0001569963,0.00004195771,0.000113414455,0.00028645614,0.000091698705],"domain_scores_gemma":[0.9990926,0.00023732979,0.00011182754,0.000312316,0.00014631732,0.00009961601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095769664,0.0005387402,0.000805228,0.0007642516,0.0009360808,0.0007305956,0.0018303589,0.00060584553,0.0014154217],"category_scores_gemma":[0.0017790418,0.00029185548,0.00046846428,0.000737489,0.0005058981,0.0018322258,0.002308458,0.0007068386,0.00044696615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013410355,0.0005923622,0.0023551376,0.00070805557,0.00028067201,0.0006767306,0.0009613581,0.20205928,0.15573047,0.04757147,0.02100145,0.56672204],"study_design_scores_gemma":[0.0003131862,0.00044843374,0.001115171,0.000023391121,0.0000527471,0.00042777727,0.00015062779,0.9302843,0.028185034,0.016865386,0.022053724,0.00008031115],"about_ca_topic_score_codex":0.0017565096,"about_ca_topic_score_gemma":0.0021603229,"teacher_disagreement_score":0.0018303589,"about_ca_system_score_codex":0.0004786067,"about_ca_system_score_gemma":0.0009394993,"threshold_uncertainty_score":0.005064845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016278451,0.00009282171,0.97744375,0.0007368501,0.00004098207,0.00014359859,0.00004260868,0.0003103206,0.004910524],"genre_scores_gemma":[0.62596226,0.00021662339,0.36386895,0.00042541846,0.00009238609,0.00037958144,0.00013085522,0.00017272228,0.008751133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930187,0.0039581186,0.00030140957,0.0011833456,0.001128111,0.00041030475],"domain_scores_gemma":[0.9907017,0.004702799,0.00061576883,0.0024426286,0.00072743266,0.0008096823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009655259,0.0006854316,0.0008527141,0.00075672846,0.0020601724,0.0034266864,0.0024715436,0.0019629989,0.0056792954],"category_scores_gemma":[0.0142337885,0.00047387532,0.0012827232,0.00067595596,0.004114966,0.006025118,0.006684671,0.0030477871,0.0008366645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031176303,0.0002689805,0.002018959,0.0001663345,0.000115837924,0.00037097454,0.0019730164,0.12053027,0.004716518,0.7783789,0.0032058617,0.08794255],"study_design_scores_gemma":[0.000054673816,0.00012308473,0.0003781235,0.00004987098,0.000051184044,0.00018150681,0.00035239023,0.4797494,0.0026483296,0.5026453,0.013711716,0.000054439166],"about_ca_topic_score_codex":0.0017738079,"about_ca_topic_score_gemma":0.0017943683,"teacher_disagreement_score":0.009655259,"about_ca_system_score_codex":0.0015357528,"about_ca_system_score_gemma":0.0018497187,"threshold_uncertainty_score":0.051062465},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11764265,0.0018190666,0.71960586,0.001253844,0.00046152747,0.0013284476,0.000758187,0.14022861,0.016901901],"genre_scores_gemma":[0.7564964,0.00074058445,0.22811154,0.00064998696,0.00021143444,0.0005609587,0.0016701176,0.0016009804,0.009957901],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984824,0.00020169797,0.00011148683,0.00029956768,0.0005452742,0.00035957582],"domain_scores_gemma":[0.9980862,0.0002525997,0.00020970068,0.0007838061,0.0002685837,0.0003991792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015766061,0.0011198432,0.00083878427,0.0010718707,0.0014603825,0.0019992646,0.004140266,0.00097454916,0.0030395137],"category_scores_gemma":[0.0024444945,0.00067256886,0.0005499788,0.0014640857,0.00092915434,0.0030073554,0.0036902293,0.0010688712,0.001442734],"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.0022047022,0.00082911906,0.008081007,0.0007863425,0.00023648998,0.0013746229,0.0009807609,0.11176149,0.053293426,0.023962041,0.10308583,0.69340414],"study_design_scores_gemma":[0.00035625647,0.00044131692,0.0038749224,0.00006678742,0.00014717852,0.0007287516,0.00044172764,0.8731641,0.052276213,0.014635336,0.05364861,0.00021883113],"about_ca_topic_score_codex":0.0069213375,"about_ca_topic_score_gemma":0.005739665,"teacher_disagreement_score":0.0069213375,"about_ca_system_score_codex":0.0013119214,"about_ca_system_score_gemma":0.002837107,"threshold_uncertainty_score":0.013762116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08621181,0.000100836565,0.8873382,0.0011524555,0.0001379165,0.0012933584,0.00022598631,0.004955997,0.018583417],"genre_scores_gemma":[0.70338315,0.00013338868,0.282153,0.00020569895,0.00003464126,0.00069985643,0.0004414356,0.00035330848,0.01259547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963916,0.001301903,0.00023066046,0.00036900744,0.0014207414,0.00028612683],"domain_scores_gemma":[0.99408025,0.0017642905,0.00048952317,0.002342308,0.00087477925,0.00044880342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004558608,0.0004278157,0.00045790567,0.0005922469,0.0012670761,0.0022953562,0.0018806225,0.0017267655,0.0055476516],"category_scores_gemma":[0.010083297,0.0004893939,0.0004247884,0.0006586343,0.0023623528,0.0043308255,0.004100206,0.001770926,0.0017211837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011988346,0.0010315075,0.0066945506,0.00042137044,0.000077870245,0.0019416611,0.0017477891,0.26194996,0.05200272,0.4474042,0.009574533,0.21595499],"study_design_scores_gemma":[0.00017431672,0.0003983061,0.00063666736,0.00009941573,0.000022232207,0.00035650763,0.00015728481,0.8172509,0.038062375,0.10743547,0.03532003,0.00008648714],"about_ca_topic_score_codex":0.0021012323,"about_ca_topic_score_gemma":0.00209622,"teacher_disagreement_score":0.0055476516,"about_ca_system_score_codex":0.001052579,"about_ca_system_score_gemma":0.0037396408,"threshold_uncertainty_score":0.02410853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019074658,0.0001003579,0.97369826,0.0007089326,0.00004225284,0.00015057046,0.000047445883,0.00032656646,0.005850959],"genre_scores_gemma":[0.67532945,0.00019667893,0.3145036,0.00040241564,0.000073947376,0.00035607774,0.00012773354,0.00015051004,0.008859581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99375075,0.0035657322,0.000259943,0.0010494541,0.00096713443,0.00040700118],"domain_scores_gemma":[0.99236906,0.0039358083,0.0005425671,0.0017624111,0.0006426556,0.00074755534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008194236,0.0007074047,0.0007985294,0.0007201247,0.0017720896,0.003177766,0.0022589506,0.0017407591,0.0061917924],"category_scores_gemma":[0.01219589,0.00043211546,0.0012131579,0.00065280905,0.0033744678,0.0052662026,0.005945729,0.002703856,0.0007868768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040985967,0.0003763497,0.0028868297,0.00020248095,0.00014981425,0.00042440207,0.0022658338,0.16631098,0.0055531445,0.7032102,0.0036978212,0.114512436],"study_design_scores_gemma":[0.000056626413,0.00015365228,0.00049784005,0.00005433051,0.00005870609,0.0001792872,0.00040871708,0.57655567,0.0024900087,0.40611333,0.013371777,0.000060095514],"about_ca_topic_score_codex":0.0020046302,"about_ca_topic_score_gemma":0.0021441325,"teacher_disagreement_score":0.008194236,"about_ca_system_score_codex":0.0015280574,"about_ca_system_score_gemma":0.001816632,"threshold_uncertainty_score":0.043335795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019682078,0.00021337753,0.9696201,0.0002947231,0.00014096186,0.00013486871,0.00008109888,0.003063731,0.006769022],"genre_scores_gemma":[0.7108073,0.00017248541,0.27806726,0.00035792912,0.00009109718,0.00031913226,0.00022446661,0.00025956793,0.009700787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996637,0.000063112595,0.000016387774,0.00009458353,0.000101088786,0.000061047445],"domain_scores_gemma":[0.9993357,0.00020049259,0.000102009864,0.00007588462,0.00017041131,0.00011559254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068989524,0.0009807864,0.00066787214,0.00028353685,0.0005608914,0.00091018184,0.0017266514,0.0009820889,0.0030449848],"category_scores_gemma":[0.0016117563,0.00032216025,0.00036631132,0.00020913238,0.00057053455,0.00081828714,0.0014557157,0.001232507,0.0007554362],"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.0001594062,0.00019606962,0.0010644846,0.000089921785,0.000053432595,0.0001263718,0.00010522471,0.88284713,0.008712557,0.010894388,0.0060032704,0.08974767],"study_design_scores_gemma":[0.000010357414,0.000021716896,0.000041167,0.0000024046287,0.000003421368,0.000006194068,0.0000071889935,0.9973182,0.00054158975,0.0010208929,0.0010232627,0.0000035670294],"about_ca_topic_score_codex":0.0054557007,"about_ca_topic_score_gemma":0.006196213,"teacher_disagreement_score":0.0054557007,"about_ca_system_score_codex":0.0005968047,"about_ca_system_score_gemma":0.0013179159,"threshold_uncertainty_score":0.010847867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008005752,0.00033021337,0.98775357,0.0004042488,0.00005506806,0.0000512045,0.000117742326,0.0015253703,0.0017567731],"genre_scores_gemma":[0.6534577,0.0005652888,0.33739784,0.00075862976,0.00010659993,0.00026139023,0.00048102753,0.000466396,0.006505091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992944,0.0002209464,0.000031456126,0.00018567921,0.00015102727,0.00011651144],"domain_scores_gemma":[0.9990293,0.00045255554,0.00012522258,0.00011826756,0.00017634407,0.00009838633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014516673,0.0009696226,0.00093942054,0.0006684105,0.0003726725,0.0011147935,0.0025346917,0.0012093938,0.0023208493],"category_scores_gemma":[0.0037992224,0.00057047396,0.00066361006,0.0006223826,0.0011801005,0.0018192199,0.0018032616,0.0021792743,0.00064228993],"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.000088318186,0.00008547953,0.0008967012,0.00008180032,0.000039193947,0.00008538029,0.00008188164,0.88679516,0.002087568,0.018288448,0.0033350936,0.08813494],"study_design_scores_gemma":[0.0000039287247,0.000009246166,0.00003383994,0.0000036455795,0.0000027198794,0.000006631168,0.000003082818,0.9955604,0.00023635727,0.003749132,0.00038802737,0.0000029754663],"about_ca_topic_score_codex":0.0115357265,"about_ca_topic_score_gemma":0.0137693165,"teacher_disagreement_score":0.0115357265,"about_ca_system_score_codex":0.0020631116,"about_ca_system_score_gemma":0.0024872322,"threshold_uncertainty_score":0.022937179},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08688161,0.00012494983,0.90345865,0.0005368077,0.0000962266,0.00014585523,0.000059800208,0.003546394,0.0051497817],"genre_scores_gemma":[0.80028605,0.00008904502,0.19612582,0.00016773264,0.00003300065,0.00011263647,0.00015865667,0.00033360816,0.002693499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977568,0.00075553276,0.00016036638,0.00047583898,0.0005888853,0.00026270418],"domain_scores_gemma":[0.9963251,0.0006645949,0.00028347704,0.0017572264,0.0005144726,0.00045503955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035405734,0.00045261974,0.00066903926,0.00044303262,0.0015367254,0.0024262953,0.00165049,0.0010119278,0.0012595874],"category_scores_gemma":[0.0042281854,0.0003658074,0.0004869973,0.0005349368,0.0015009857,0.0029951318,0.0019155426,0.0016409423,0.00056386634],"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.00090806844,0.0009316484,0.007226602,0.00028837955,0.00018104468,0.0009066463,0.0020711515,0.4823427,0.12117518,0.21857847,0.007009251,0.15838088],"study_design_scores_gemma":[0.00003483365,0.00006927974,0.00064249756,0.000016328413,0.000021465752,0.00009528446,0.00021236771,0.92197645,0.01709017,0.051318355,0.008487393,0.000035499615],"about_ca_topic_score_codex":0.0029580928,"about_ca_topic_score_gemma":0.0035207977,"teacher_disagreement_score":0.0035405734,"about_ca_system_score_codex":0.0014617849,"about_ca_system_score_gemma":0.0025975408,"threshold_uncertainty_score":0.01872456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08858087,0.002106362,0.83658236,0.002129791,0.00068539864,0.00066327554,0.00059614435,0.048614353,0.020041453],"genre_scores_gemma":[0.4738512,0.0013660335,0.50404257,0.00068640796,0.0004461446,0.00034302924,0.0014555425,0.002096727,0.01571238],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957027,0.0007571969,0.00026944466,0.0005288915,0.0021857023,0.00055608276],"domain_scores_gemma":[0.98942405,0.002025996,0.0005833463,0.0045403033,0.0026991328,0.00072713505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006239473,0.0008957492,0.001057086,0.0011439796,0.0012979617,0.0036385667,0.0027159061,0.0017184338,0.0066549866],"category_scores_gemma":[0.016356315,0.0010056783,0.0004472515,0.001380126,0.00094681047,0.00949609,0.004013109,0.0029674964,0.0048530055],"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.0029449728,0.0015841919,0.0120032225,0.0012504281,0.00020175315,0.0011652588,0.0017588524,0.07910264,0.11988537,0.15142004,0.10927811,0.5194052],"study_design_scores_gemma":[0.00050324714,0.0006532815,0.001990437,0.00009869328,0.00010422765,0.0007553798,0.00035676634,0.6862662,0.075697996,0.07627252,0.15719938,0.000101903366],"about_ca_topic_score_codex":0.003990754,"about_ca_topic_score_gemma":0.0030735796,"teacher_disagreement_score":0.0066549866,"about_ca_system_score_codex":0.0015089982,"about_ca_system_score_gemma":0.0027472,"threshold_uncertainty_score":0.032997906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038723215,0.00022511774,0.99244857,0.00023480445,0.000022517064,0.00016159864,0.00024708526,0.0017976284,0.0009903986],"genre_scores_gemma":[0.17179774,0.00025070555,0.8237951,0.00024653572,0.00007432961,0.00046768115,0.0012732195,0.00033246476,0.0017623071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964588,0.0012896468,0.0001407512,0.0009480595,0.0008451292,0.00031747704],"domain_scores_gemma":[0.99580574,0.0016165632,0.00027194657,0.0011391076,0.0007614618,0.00040508716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036210523,0.0012665789,0.0013257331,0.0032465744,0.0018101989,0.0020822017,0.0047187787,0.0021775558,0.0037027716],"category_scores_gemma":[0.012046853,0.0006881321,0.0017982988,0.0038736258,0.0017517462,0.0053567044,0.004995357,0.002723594,0.0013739374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047914224,0.00044025632,0.0038131503,0.0005287713,0.00019328806,0.0005490575,0.0014432681,0.32391146,0.015731249,0.29068127,0.032084372,0.33014473],"study_design_scores_gemma":[0.00005633057,0.000054906886,0.00015997609,0.000018599603,0.0000201406,0.00013615946,0.0000924614,0.914081,0.0011919742,0.07764256,0.006516917,0.000028925566],"about_ca_topic_score_codex":0.013190043,"about_ca_topic_score_gemma":0.017884934,"teacher_disagreement_score":0.013190043,"about_ca_system_score_codex":0.001840446,"about_ca_system_score_gemma":0.0029281196,"threshold_uncertainty_score":0.02622652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015023698,0.009237364,0.9032697,0.0010774774,0.0011464558,0.00032619128,0.0004457046,0.003077301,0.06639613],"genre_scores_gemma":[0.3185449,0.013323967,0.55122,0.00061371806,0.00095993787,0.0011661861,0.001839422,0.0013815394,0.110950254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.00021139933,0.00009515483,0.00014093032,0.00046819163,0.00013577146],"domain_scores_gemma":[0.99863404,0.0006217241,0.00006802003,0.00042465338,0.00018877524,0.000062765146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110815,0.0011250161,0.0012167605,0.0010338017,0.0016976706,0.002646493,0.0020363398,0.0012442874,0.008150568],"category_scores_gemma":[0.0032030663,0.0006984923,0.0006488034,0.0021874604,0.0015215208,0.0045229434,0.002135084,0.002676634,0.002294189],"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.00022914058,0.00008107659,0.00010517787,0.0004197997,0.000051818297,0.000112548885,0.0003949715,0.018349353,0.006043986,0.7931956,0.022452641,0.15856402],"study_design_scores_gemma":[0.00012657962,0.000103324375,0.00014258751,0.000118834025,0.00006592987,0.0002696618,0.0001669978,0.10198091,0.012656659,0.7690803,0.11522126,0.00006702038],"about_ca_topic_score_codex":0.0009832826,"about_ca_topic_score_gemma":0.0014480699,"teacher_disagreement_score":0.008150568,"about_ca_system_score_codex":0.0013441074,"about_ca_system_score_gemma":0.0010174196,"threshold_uncertainty_score":0.027266383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006800946,0.0027396039,0.97659713,0.00029554387,0.00024112458,0.0005495771,0.001201983,0.0021492338,0.009424815],"genre_scores_gemma":[0.115035705,0.0022359074,0.8589866,0.0002461609,0.0003886644,0.0005745545,0.00532652,0.00038192634,0.016823998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922248,0.0016449466,0.0005474821,0.002463745,0.0027228394,0.0003961275],"domain_scores_gemma":[0.99189115,0.0019620908,0.0005293317,0.00285618,0.0024499919,0.0003111819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032914928,0.0014892727,0.002794426,0.0075316234,0.0027959743,0.004733895,0.004053148,0.0022456152,0.005797165],"category_scores_gemma":[0.011514302,0.0006906991,0.0020181637,0.011152823,0.0010934934,0.0033023048,0.0028565342,0.001098325,0.0060832333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002898328,0.00026210744,0.0024258888,0.0010545005,0.0006084703,0.00023110658,0.0006420485,0.0504298,0.009225338,0.024435086,0.036232006,0.8741638],"study_design_scores_gemma":[0.00018743532,0.00043188865,0.004464268,0.00028762303,0.0005623719,0.0022537082,0.0010336409,0.60956365,0.03925052,0.10798852,0.23368298,0.00029342712],"about_ca_topic_score_codex":0.0056421123,"about_ca_topic_score_gemma":0.008944965,"teacher_disagreement_score":0.0075316234,"about_ca_system_score_codex":0.0017064249,"about_ca_system_score_gemma":0.0028795295,"threshold_uncertainty_score":0.019393504},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015629707,0.0037157263,0.9479211,0.0010454537,0.0007095903,0.00036616024,0.00014452495,0.007277658,0.023190033],"genre_scores_gemma":[0.25816107,0.005172187,0.68597996,0.00026950974,0.00066131825,0.00068810565,0.0007416118,0.0009873499,0.04733892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983014,0.00029871805,0.0001852087,0.00019556063,0.0008588713,0.00016030863],"domain_scores_gemma":[0.99867046,0.0004113283,0.000081035214,0.00038258106,0.00033576842,0.00011885567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018605907,0.0006528545,0.0006108141,0.0007435314,0.00095759635,0.0043239305,0.0017466148,0.0010042532,0.0047623],"category_scores_gemma":[0.004383127,0.00069464,0.00054415595,0.001392071,0.0005644027,0.0028677285,0.0017204751,0.0019254384,0.0030638408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033727757,0.00042886924,0.0014352251,0.0012307898,0.00012041909,0.00068454136,0.001714669,0.040252592,0.11663685,0.35071674,0.028419591,0.45802242],"study_design_scores_gemma":[0.00024291455,0.00042123048,0.001459116,0.00019924977,0.00010728165,0.0009039817,0.0004137116,0.22651918,0.10888559,0.104913,0.5558184,0.00011647034],"about_ca_topic_score_codex":0.00039391153,"about_ca_topic_score_gemma":0.00030853803,"teacher_disagreement_score":0.0047623,"about_ca_system_score_codex":0.0011769331,"about_ca_system_score_gemma":0.00097602484,"threshold_uncertainty_score":0.015931427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009714152,0.0003382661,0.969024,0.0018996862,0.00053196476,0.0007471953,0.00022479933,0.002584252,0.014935679],"genre_scores_gemma":[0.36352798,0.00174718,0.58641624,0.0017301008,0.0009069279,0.002606284,0.0011458254,0.0008605217,0.041058972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935508,0.0021485514,0.0007134427,0.00057536166,0.002555704,0.00045604797],"domain_scores_gemma":[0.9900502,0.0038881705,0.0006055048,0.003400238,0.0010387352,0.0010172094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011049122,0.0005643269,0.0011505509,0.0017833327,0.003636607,0.0055189384,0.0031273926,0.0031847837,0.006041268],"category_scores_gemma":[0.01875062,0.000716118,0.0008152343,0.002558106,0.0033342105,0.013371457,0.010240731,0.003008927,0.0028527593],"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.00035204308,0.000265677,0.00096265017,0.00024064304,0.0000711134,0.00045165778,0.0017297728,0.0045979093,0.0077686906,0.8261921,0.020451192,0.13691649],"study_design_scores_gemma":[0.00036632206,0.00046730187,0.0004802624,0.0001395696,0.00013901538,0.0014162492,0.0007582657,0.09792722,0.019018574,0.55807644,0.32099432,0.00021646378],"about_ca_topic_score_codex":0.0009061119,"about_ca_topic_score_gemma":0.00084589684,"teacher_disagreement_score":0.011049122,"about_ca_system_score_codex":0.0010879552,"about_ca_system_score_gemma":0.0026095505,"threshold_uncertainty_score":0.05843401},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9494831,0.0004461119,0.047602225,0.00020413352,0.0000276109,0.00004056145,0.000082124825,0.0003749806,0.0017392237],"genre_scores_gemma":[0.99785304,0.000059691094,0.0019592163,0.000009228519,0.000010300186,0.000005974255,0.000028127752,0.000005511042,0.00006885903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988374,0.00041586676,0.00005852378,0.00023202055,0.0003315386,0.00012466464],"domain_scores_gemma":[0.99145037,0.00445346,0.0015566383,0.00087543,0.0013552688,0.00030875465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016157819,0.00026792282,0.0005921532,0.0013124289,0.0008898264,0.00066605455,0.0008335686,0.0006025944,0.00038695714],"category_scores_gemma":[0.010017211,0.00018793679,0.00020633904,0.00091130554,0.0010104756,0.0019957246,0.0009917472,0.0005411892,0.00011424303],"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.0010327061,0.0006244668,0.15306887,0.0003887681,0.00027401384,0.0013524692,0.0009734816,0.65396905,0.06946012,0.01559791,0.002920754,0.10033747],"study_design_scores_gemma":[0.0000066979924,0.00012662217,0.015369592,0.000009422246,0.000021230666,0.00024764927,0.00021582047,0.9732377,0.00870868,0.0017295582,0.00030599214,0.000021071437],"about_ca_topic_score_codex":0.004469352,"about_ca_topic_score_gemma":0.0025386044,"teacher_disagreement_score":0.004469352,"about_ca_system_score_codex":0.0009460597,"about_ca_system_score_gemma":0.0003570542,"threshold_uncertainty_score":0.008886695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021376189,0.009309242,0.8202156,0.0018877985,0.0010247385,0.00011459707,0.00011564398,0.0010379188,0.14491825],"genre_scores_gemma":[0.76926076,0.0064855907,0.12036963,0.0005353428,0.001047282,0.00032377383,0.00020418991,0.00044132283,0.1013321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987778,0.00040154238,0.000036267284,0.00020339261,0.00037384804,0.00020710572],"domain_scores_gemma":[0.9986778,0.00059266906,0.000045958164,0.00042580083,0.00018523012,0.00007247686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011318744,0.0009899131,0.0010689828,0.0006943075,0.0013427263,0.002446244,0.0020140987,0.0017985788,0.013446942],"category_scores_gemma":[0.0033231007,0.00047705285,0.0005109532,0.0011639782,0.0013554791,0.0046889964,0.0030376113,0.0019869911,0.0031664756],"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.00015751597,0.00006636653,0.00008927254,0.0001865345,0.00003453735,0.00011735964,0.00033361002,0.019377682,0.0058235195,0.82732135,0.014203138,0.13228914],"study_design_scores_gemma":[0.000027967159,0.00007283834,0.00018294362,0.000107036525,0.00004222887,0.0004466738,0.00013099253,0.15045315,0.00450131,0.78468025,0.059309304,0.000045249086],"about_ca_topic_score_codex":0.0007113578,"about_ca_topic_score_gemma":0.00060376263,"teacher_disagreement_score":0.013446942,"about_ca_system_score_codex":0.0009906834,"about_ca_system_score_gemma":0.00077017903,"threshold_uncertainty_score":0.04498458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00833056,0.00038800546,0.9323587,0.00037232076,0.00035149683,0.0005191159,0.00042104023,0.04884242,0.0084164245],"genre_scores_gemma":[0.37473428,0.001119733,0.5851995,0.0008198022,0.0006278677,0.0012071666,0.0038311337,0.0043718885,0.028088653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824154,0.00046380825,0.00019838489,0.00029048612,0.0006777742,0.00012793102],"domain_scores_gemma":[0.9973984,0.0007703166,0.0002188317,0.0010017245,0.00029125335,0.00031946765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036716927,0.00069985486,0.00095024274,0.0010253721,0.0009923478,0.0036540993,0.0031890266,0.0015486025,0.0064980946],"category_scores_gemma":[0.007764977,0.00068728864,0.00063509686,0.0008979783,0.0009440235,0.0042347754,0.0032250616,0.0017808473,0.003350989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022837257,0.00085725676,0.004766575,0.0010273071,0.0005460781,0.002112473,0.0016662974,0.04405995,0.098483324,0.21326736,0.11313183,0.5177978],"study_design_scores_gemma":[0.00035480695,0.0005097904,0.0014442953,0.00008445595,0.00018014811,0.001355225,0.00023167815,0.5559068,0.06251987,0.080227815,0.29695538,0.00022971306],"about_ca_topic_score_codex":0.0008802409,"about_ca_topic_score_gemma":0.0009724526,"teacher_disagreement_score":0.0064980946,"about_ca_system_score_codex":0.0006268164,"about_ca_system_score_gemma":0.001257125,"threshold_uncertainty_score":0.02173829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3738276,0.00019825385,0.5613557,0.0010353184,0.0004955975,0.0013128403,0.0020499225,0.0465342,0.013190571],"genre_scores_gemma":[0.853074,0.000048235965,0.1416438,0.00022840918,0.000022650429,0.0003240033,0.0013946237,0.00064702105,0.002617191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9890562,0.0046404516,0.0007498768,0.0015447583,0.0029499794,0.0010586798],"domain_scores_gemma":[0.96428996,0.022549735,0.0014877602,0.006456151,0.004308612,0.0009078361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007537625,0.0010363498,0.0006904484,0.0010717532,0.00054052786,0.0018738082,0.0023456684,0.0015920328,0.009407469],"category_scores_gemma":[0.038544856,0.00041787888,0.0009792467,0.00050810684,0.0011961004,0.0023596338,0.0023285144,0.0015458247,0.0016564472],"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.007858698,0.0043856464,0.08240183,0.0009861565,0.00054625585,0.0014589608,0.0013294527,0.46819308,0.04564453,0.03931102,0.01965399,0.32823035],"study_design_scores_gemma":[0.00016487797,0.00039193896,0.0018958616,0.00004427375,0.000045433768,0.00010881692,0.00015018925,0.9658205,0.022400865,0.006683015,0.0022647276,0.00002949577],"about_ca_topic_score_codex":0.011380182,"about_ca_topic_score_gemma":0.008514865,"teacher_disagreement_score":0.011380182,"about_ca_system_score_codex":0.0013393073,"about_ca_system_score_gemma":0.004421652,"threshold_uncertainty_score":0.03986323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071743585,0.015225039,0.00018372425,0.0038942657,0.004801167,0.00002663262,0.0020136216,0.00017334384,0.9729647],"genre_scores_gemma":[0.0016140037,0.0020498778,0.00006459765,0.00019212783,0.00018321395,0.000009229843,0.00023034264,0.0000731111,0.9955835],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995627,0.000031578016,0.00001545818,0.000074319585,0.0002291784,0.00008683174],"domain_scores_gemma":[0.99969804,0.00004460602,0.000018489323,0.000025621383,0.00014608758,0.00006718006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675375,0.0009938575,0.0006167646,0.0019387032,0.004459522,0.006780989,0.00076894736,0.0019774945,0.2506273],"category_scores_gemma":[0.0016896953,0.0004443321,0.00031381444,0.0032912083,0.0009124912,0.0024818352,0.0014800576,0.0026000177,0.08646887],"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.00002845143,0.000008578124,0.00016953623,0.000088190754,0.0000043227983,0.0000910201,0.00013522228,0.000073907475,0.00009805672,0.020758005,0.94470453,0.033840157],"study_design_scores_gemma":[0.0000014645555,0.0000018470896,0.00026556497,0.000042500447,6.9765525e-7,0.000014242724,0.000032205724,0.000013097947,0.000027678841,0.00035975772,0.9992386,0.00000233547],"about_ca_topic_score_codex":0.12201257,"about_ca_topic_score_gemma":0.43283084,"teacher_disagreement_score":0.2506273,"about_ca_system_score_codex":0.005027357,"about_ca_system_score_gemma":0.003127446,"threshold_uncertainty_score":0.8384319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020822529,0.00010659833,0.00029542332,0.00012308208,0.00006988496,0.000060847764,0.9917532,0.0010296626,0.0044788774],"genre_scores_gemma":[0.00179527,0.000051191593,0.000709025,0.000023891069,0.0000076213773,0.000050428665,0.9953798,0.000075649274,0.001907208],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933904,0.00005820071,0.000046785743,0.00018497206,0.0002261094,0.00014478264],"domain_scores_gemma":[0.9987469,0.0000737031,0.00006319293,0.00025119362,0.0007105152,0.00015443156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006458674,0.0015536293,0.00089774095,0.0020774077,0.0009267825,0.0010793313,0.0020963028,0.000946603,0.013635104],"category_scores_gemma":[0.0019122425,0.0003531274,0.0003536088,0.003147264,0.00036931175,0.0009760625,0.0009979274,0.0012397652,0.025292767],"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.00007223745,0.000031461535,0.0010724235,0.00013512101,0.000011111227,0.000037502577,0.000038218182,0.00043855808,0.0003178533,0.00034313934,0.99307394,0.004428418],"study_design_scores_gemma":[0.000114415496,0.000029036617,0.016333155,0.00018416015,0.000016189186,0.00008545878,0.00035833236,0.0028910579,0.001653661,0.0005528879,0.97773355,0.000048121932],"about_ca_topic_score_codex":0.2548028,"about_ca_topic_score_gemma":0.48272884,"teacher_disagreement_score":0.2548028,"about_ca_system_score_codex":0.0021362607,"about_ca_system_score_gemma":0.0028431383,"threshold_uncertainty_score":0.50663936},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079597963,0.00053017837,0.00047342916,0.0005047545,0.00043180195,0.00028865898,0.84352064,0.0021498944,0.15130462],"genre_scores_gemma":[0.0068170433,0.0021424058,0.0036066456,0.00036914038,0.00018299671,0.0005693531,0.7694784,0.0017575987,0.21507646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996562,0.000023386945,0.000021614213,0.000056708494,0.00013484852,0.00010728528],"domain_scores_gemma":[0.9979656,0.00018259104,0.0001240384,0.00011157491,0.0012994447,0.00031670328],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003710542,0.0011892669,0.00081512984,0.0037759317,0.0009274857,0.002376312,0.0015154876,0.00081701716,0.7129128],"category_scores_gemma":[0.0028931196,0.00047484614,0.000512666,0.007467005,0.00038124193,0.0014344915,0.001173726,0.0009895694,0.44997913],"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.000027427861,0.000010102595,0.0005590342,0.0004271007,0.0000055733176,0.00004283201,0.00006428099,0.00004273482,0.00010970935,0.00018846677,0.98826945,0.010253272],"study_design_scores_gemma":[0.0000509235,0.000008118866,0.0061870497,0.00042866086,0.000008099695,0.00006281177,0.00021093422,0.00008983738,0.00014053995,0.00018876004,0.99261004,0.000014108091],"about_ca_topic_score_codex":0.33516836,"about_ca_topic_score_gemma":0.47743335,"teacher_disagreement_score":0.7129128,"about_ca_system_score_codex":0.0020250296,"about_ca_system_score_gemma":0.0059367595,"threshold_uncertainty_score":0.66643494},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26287112,0.46135807,0.24435753,0.0010872219,0.0004268376,0.0002647251,0.0011891273,0.00076135795,0.027683955],"genre_scores_gemma":[0.58102244,0.35811105,0.051709637,0.00011636698,0.000210835,0.00023199749,0.001534231,0.00011148497,0.0069520073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994898,0.00009829594,0.000091399,0.000071115595,0.00022116651,0.00002826577],"domain_scores_gemma":[0.9988568,0.00068450393,0.00009798976,0.000040928342,0.000305045,0.000014778503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910629,0.00067334966,0.0012180117,0.0017137057,0.00044080245,0.0017255528,0.0013919782,0.0013912919,0.0008473905],"category_scores_gemma":[0.002242852,0.00040383247,0.00093065435,0.0022482343,0.0002950173,0.0011290977,0.0002262162,0.00019836304,0.00045913452],"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.00023750354,0.00031530883,0.010659799,0.01560245,0.00035071504,0.0012745911,0.0007916536,0.45945507,0.014165187,0.005242713,0.0034969621,0.48840815],"study_design_scores_gemma":[0.000050219896,0.000492556,0.015593639,0.0042194463,0.0008296639,0.0013660867,0.0017837799,0.8446478,0.020183194,0.0055488176,0.10511415,0.00017058822],"about_ca_topic_score_codex":0.010101008,"about_ca_topic_score_gemma":0.00972364,"teacher_disagreement_score":0.010101008,"about_ca_system_score_codex":0.00040731655,"about_ca_system_score_gemma":0.0011794498,"threshold_uncertainty_score":0.02008444},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00996701,0.0014741857,0.45475686,0.0010584353,0.0011861535,0.0003469769,0.053693082,0.40455902,0.07295828],"genre_scores_gemma":[0.07861732,0.0016779136,0.47432947,0.001616914,0.00035400258,0.00092659425,0.11336331,0.2288077,0.100306794],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996294,0.00003248448,0.000026635875,0.00011386733,0.00014469933,0.000052909763],"domain_scores_gemma":[0.999416,0.00012967193,0.000037928407,0.00021688185,0.0001449221,0.00005466005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072096376,0.0027473255,0.0010105675,0.0016023763,0.0008200251,0.0030854032,0.0027121466,0.0016003837,0.1838057],"category_scores_gemma":[0.0030730462,0.0017822159,0.0024182184,0.0011557847,0.00041670058,0.0026068352,0.0034460928,0.0017212984,0.10529537],"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.00042624283,0.00007693556,0.0027702034,0.001125069,0.00022742954,0.00039053443,0.0002900061,0.0066130636,0.012242105,0.020460214,0.6767497,0.2786285],"study_design_scores_gemma":[0.00024553615,0.00013840562,0.0034338913,0.00031972319,0.00021589137,0.0014802149,0.00018546541,0.054071352,0.05106807,0.052709173,0.8359854,0.00014687215],"about_ca_topic_score_codex":0.003187846,"about_ca_topic_score_gemma":0.0068024048,"teacher_disagreement_score":0.1838057,"about_ca_system_score_codex":0.00079990976,"about_ca_system_score_gemma":0.0014303058,"threshold_uncertainty_score":0.61489135},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99608576,0.00004917902,0.00037719758,0.000011639229,0.0000055921632,0.0000075103876,0.0027272762,0.000025278108,0.00071058114],"genre_scores_gemma":[0.9934007,0.00003558941,0.00056523475,0.000014315508,0.0000058433116,0.000032432505,0.0054089655,0.000013122012,0.00052391755],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999684,0.0000516756,0.000049173013,0.00010256202,0.000080230915,0.000032378986],"domain_scores_gemma":[0.9979552,0.00029489608,0.00075093436,0.00031476782,0.00054022664,0.00014400955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048898405,0.000102302,0.0001488118,0.00060060166,0.00022221966,0.00030056303,0.00017720564,0.000115718234,0.0008863317],"category_scores_gemma":[0.0014716821,0.00009447406,0.00015133184,0.00064656703,0.00010993275,0.00014269722,0.00021185787,0.000105412284,0.00020862733],"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.000093354356,0.000015632457,0.98920596,0.000021046826,0.000065151646,0.000021761176,0.00024419813,0.00020290643,0.0032712559,0.000014334962,0.00046554013,0.0063788067],"study_design_scores_gemma":[9.138715e-7,0.0000057939524,0.99959,0.000001220941,0.000004416222,0.000009114358,0.000025686088,0.000059618313,0.00008459785,0.0000024066587,0.00021511332,0.0000010665091],"about_ca_topic_score_codex":0.040250715,"about_ca_topic_score_gemma":0.12370304,"teacher_disagreement_score":0.040250715,"about_ca_system_score_codex":0.0002830375,"about_ca_system_score_gemma":0.00031121817,"threshold_uncertainty_score":0.080032885},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004897159,0.0005219993,0.111964636,0.00047238046,0.00046420255,0.001154944,0.017012322,0.81701535,0.046496965],"genre_scores_gemma":[0.14846751,0.0012577305,0.14217743,0.0017809523,0.0004375111,0.0027067827,0.12748979,0.3480942,0.22758807],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976641,0.00032869435,0.00018525099,0.00032716538,0.0010703724,0.00042435483],"domain_scores_gemma":[0.99702126,0.0004066141,0.000086444765,0.0016882956,0.00053893565,0.00025849586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025418086,0.0018309784,0.0017217048,0.0017132122,0.0010869473,0.0041692704,0.0055893976,0.0027903295,0.14012891],"category_scores_gemma":[0.008379534,0.0015605408,0.0008718598,0.001481726,0.00090305606,0.0037689807,0.0043902434,0.0032771807,0.17347234],"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.0016982785,0.0003408075,0.00073343236,0.00080452376,0.00016374112,0.0006325095,0.00022764987,0.0044950554,0.012494228,0.017109904,0.89187086,0.06942906],"study_design_scores_gemma":[0.0010533069,0.00024594986,0.00094181293,0.00018685182,0.000074327356,0.0012281559,0.0001066134,0.11587788,0.059823215,0.03437856,0.7857778,0.0003055794],"about_ca_topic_score_codex":0.003213573,"about_ca_topic_score_gemma":0.0025970456,"teacher_disagreement_score":0.14012891,"about_ca_system_score_codex":0.0010282113,"about_ca_system_score_gemma":0.0017788546,"threshold_uncertainty_score":0.4687779},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015777716,0.003187484,0.9563006,0.0011156463,0.00039696187,0.000344312,0.00021735085,0.002099924,0.020560006],"genre_scores_gemma":[0.45336834,0.005704077,0.5198905,0.00033319677,0.0005699262,0.0011222411,0.00055727793,0.00028744087,0.018167052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998459,0.00042061027,0.00015422913,0.00023160748,0.00064823875,0.00008636854],"domain_scores_gemma":[0.9984168,0.0007704361,0.0001751173,0.0003185137,0.0002297748,0.00008929935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016494367,0.00040935646,0.0008054667,0.0007093715,0.001287566,0.0030995319,0.0013127238,0.001188777,0.0033276586],"category_scores_gemma":[0.0051203463,0.00055216387,0.0005277603,0.0008230566,0.0012789255,0.003621562,0.002025555,0.0016495412,0.0010611189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006344124,0.000046920093,0.00031423476,0.00029357828,0.000021698497,0.00028928352,0.00045766163,0.041716408,0.0040546423,0.89589375,0.0052116043,0.051636763],"study_design_scores_gemma":[0.00007320923,0.00011515364,0.00033515377,0.00011874807,0.000038586648,0.00044469818,0.0002656107,0.29726633,0.0048244516,0.5124729,0.18399996,0.000045161003],"about_ca_topic_score_codex":0.0012465839,"about_ca_topic_score_gemma":0.001172101,"teacher_disagreement_score":0.0033276586,"about_ca_system_score_codex":0.0014130695,"about_ca_system_score_gemma":0.0013984399,"threshold_uncertainty_score":0.011132181},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089971855,0.00070003216,0.8053408,0.0010260986,0.00061910914,0.001087168,0.000629965,0.05870706,0.041917898],"genre_scores_gemma":[0.60827416,0.0004126724,0.27885008,0.00040690965,0.00020090061,0.0009041282,0.0017857525,0.0017410218,0.1074243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994087,0.00012116971,0.000050066566,0.00012500591,0.00019156691,0.00010345057],"domain_scores_gemma":[0.9991646,0.00011114512,0.000026603464,0.0002052805,0.00026078848,0.00023173647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010573218,0.0007269734,0.0006190797,0.0006200759,0.001571255,0.0030110504,0.0029202409,0.0011601207,0.01976298],"category_scores_gemma":[0.001523816,0.0005962882,0.00045925775,0.0006143686,0.00061931665,0.0025226334,0.0021084072,0.0013883342,0.0075526936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005321708,0.0027380486,0.009138085,0.00069855165,0.00029682415,0.0012767861,0.0024977762,0.062720135,0.12945785,0.12709571,0.10939879,0.54935974],"study_design_scores_gemma":[0.00076889375,0.0011144467,0.0029238139,0.00010549084,0.00014911052,0.00050598965,0.0006436358,0.76211256,0.046674564,0.038771596,0.14606926,0.00016057369],"about_ca_topic_score_codex":0.0059800465,"about_ca_topic_score_gemma":0.0061230017,"teacher_disagreement_score":0.01976298,"about_ca_system_score_codex":0.001414692,"about_ca_system_score_gemma":0.0020473553,"threshold_uncertainty_score":0.06611377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07440582,0.000943335,0.91609496,0.00046504123,0.00009871867,0.00024700424,0.0000768108,0.0021291527,0.005539156],"genre_scores_gemma":[0.772622,0.0004809398,0.22355644,0.0000960537,0.00007585803,0.00017160419,0.00020001868,0.000117287236,0.0026798088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.00031011482,0.000054058142,0.00016118752,0.00035592905,0.00008086882],"domain_scores_gemma":[0.9979436,0.0009077972,0.00020974773,0.00036298714,0.00036045472,0.00021544992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011480832,0.0005715649,0.00048443058,0.0007283513,0.0008789628,0.0014511655,0.0016649313,0.0006252185,0.0013390592],"category_scores_gemma":[0.0052963346,0.00032664966,0.00030829135,0.00053567614,0.0006063175,0.0022377379,0.0020262606,0.0009306202,0.00059916684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007226328,0.00051974243,0.007031672,0.00032693107,0.00014081743,0.0006803148,0.0018859464,0.21797125,0.08160553,0.057081673,0.010134167,0.62189937],"study_design_scores_gemma":[0.000038185975,0.00019620282,0.0023352308,0.00002222079,0.000031413354,0.00030439446,0.00044603183,0.9316396,0.016425442,0.035503816,0.013015613,0.000041705367],"about_ca_topic_score_codex":0.0031483024,"about_ca_topic_score_gemma":0.002632424,"teacher_disagreement_score":0.0031483024,"about_ca_system_score_codex":0.0007554694,"about_ca_system_score_gemma":0.0005324492,"threshold_uncertainty_score":0.006259978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58933663,0.00091592845,0.35050204,0.0028443076,0.00007010896,0.00019211146,0.0000938532,0.00017169253,0.055873264],"genre_scores_gemma":[0.9805455,0.00013261274,0.017048078,0.00008461959,0.000015277183,0.0000517432,0.000020056465,0.000011737668,0.0020902846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982071,0.0011347627,0.00006204738,0.00014640193,0.00022860256,0.00022114445],"domain_scores_gemma":[0.99456376,0.0036790906,0.00045750773,0.0002788349,0.00040132602,0.0006194904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022478802,0.00037420637,0.00043040916,0.000512088,0.0015761228,0.0018988919,0.00096512213,0.0012121768,0.002747792],"category_scores_gemma":[0.008751467,0.00038816768,0.0003541101,0.00045980356,0.002051745,0.0024877766,0.0017652888,0.0008324645,0.00023477583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055703137,0.00018147218,0.006575911,0.00017763852,0.00014807601,0.0015965693,0.0020998751,0.29924783,0.009220631,0.6311268,0.0051772674,0.04389084],"study_design_scores_gemma":[0.0000994327,0.00015079121,0.0010267169,0.000026113326,0.000045358796,0.00037309722,0.0009969942,0.80195445,0.0017138446,0.18822978,0.0053528054,0.000030593925],"about_ca_topic_score_codex":0.0025423586,"about_ca_topic_score_gemma":0.0021758594,"teacher_disagreement_score":0.002747792,"about_ca_system_score_codex":0.0014871549,"about_ca_system_score_gemma":0.0006966478,"threshold_uncertainty_score":0.011888087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015056175,0.0006680978,0.8574363,0.0003292338,0.00064560573,0.0013458955,0.0011541195,0.09402597,0.029338546],"genre_scores_gemma":[0.21541536,0.0020319591,0.6398737,0.0008508799,0.00050107157,0.0020901232,0.007183268,0.012709587,0.11934415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990258,0.00010575649,0.00010604706,0.00017226127,0.0004744177,0.000115679315],"domain_scores_gemma":[0.99911755,0.00015030171,0.00009719954,0.0002968876,0.00018554386,0.00015245998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011028339,0.0011485071,0.0007238176,0.00060781895,0.0007786182,0.0025255543,0.0029561678,0.0013391114,0.011250654],"category_scores_gemma":[0.0025746978,0.0011725281,0.00077207305,0.00060620887,0.0005554916,0.003597219,0.0024318115,0.0021934134,0.0054039056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019912198,0.0010586404,0.0037981358,0.0033606326,0.00040282134,0.0011216982,0.001991895,0.020290622,0.22421534,0.10527013,0.13298517,0.5035136],"study_design_scores_gemma":[0.00039614487,0.0008090913,0.0030558647,0.0001593063,0.00023864723,0.0012478788,0.00018367967,0.11485992,0.13268688,0.017055195,0.7290815,0.00022589324],"about_ca_topic_score_codex":0.0011076682,"about_ca_topic_score_gemma":0.001111332,"teacher_disagreement_score":0.011250654,"about_ca_system_score_codex":0.0006080241,"about_ca_system_score_gemma":0.0015214803,"threshold_uncertainty_score":0.037637174},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610206,0.008956863,0.2750004,0.014793879,0.00074689294,0.0006517968,0.0038265102,0.008075033,0.026928129],"genre_scores_gemma":[0.90403706,0.001915158,0.08292571,0.0005291278,0.0002229017,0.000090627174,0.002856407,0.00018595293,0.0072370353],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989543,0.00023610101,0.00007467606,0.00021846357,0.00038621505,0.00013028941],"domain_scores_gemma":[0.9948909,0.0023993072,0.00036008662,0.0005895176,0.0014975249,0.00026258716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020371152,0.00060397905,0.00057695067,0.0019585618,0.0011374007,0.0017229165,0.0011872788,0.0013937079,0.0020821781],"category_scores_gemma":[0.008196535,0.00029630636,0.0002194678,0.0019430028,0.0008324236,0.0016289535,0.0006992602,0.00092560623,0.00044701347],"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.0015258704,0.00067303755,0.16830339,0.00090670463,0.0003820911,0.002936754,0.0015124597,0.15450089,0.040747836,0.013794633,0.08610315,0.52861327],"study_design_scores_gemma":[0.00012644133,0.00044109087,0.04738982,0.00011208909,0.00015548248,0.0014536919,0.0018966408,0.83903563,0.06501786,0.0076288506,0.03660413,0.00013826274],"about_ca_topic_score_codex":0.026182408,"about_ca_topic_score_gemma":0.030768292,"teacher_disagreement_score":0.026182408,"about_ca_system_score_codex":0.0034266878,"about_ca_system_score_gemma":0.0015560433,"threshold_uncertainty_score":0.052060008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031595588,0.0013681513,0.86297697,0.003969599,0.00031987063,0.0005286212,0.0004494204,0.00013409737,0.09865762],"genre_scores_gemma":[0.76406133,0.0022911446,0.1897873,0.0013478355,0.00036349226,0.0010985815,0.0005842986,0.00010265793,0.040363323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561334,0.0020358446,0.00024287104,0.0006925968,0.0010775698,0.00033779157],"domain_scores_gemma":[0.99565744,0.0027235853,0.00035101356,0.00036999435,0.00047241448,0.00042565053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022979195,0.0013931426,0.0012952287,0.00107401,0.0017528438,0.0036128552,0.0022774325,0.002253396,0.00700289],"category_scores_gemma":[0.008573683,0.00040976136,0.0009036327,0.0013069784,0.0037618058,0.0058375997,0.0036299108,0.002551149,0.0010616189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011039087,0.000021065382,0.00010693621,0.00004458147,0.000015114984,0.000052644853,0.00013909585,0.008384391,0.00019718667,0.98453784,0.0010453692,0.005444741],"study_design_scores_gemma":[0.000023960285,0.000032002317,0.00007925614,0.000025481426,0.000012909024,0.00010359342,0.00014141998,0.040526528,0.00019504514,0.9405818,0.018264716,0.000013292749],"about_ca_topic_score_codex":0.0019400324,"about_ca_topic_score_gemma":0.0014480567,"teacher_disagreement_score":0.00700289,"about_ca_system_score_codex":0.0027203474,"about_ca_system_score_gemma":0.0014103994,"threshold_uncertainty_score":0.02342701},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5452359,0.0012070753,0.42001155,0.0029194446,0.00015556514,0.00038103198,0.00032768506,0.004113464,0.02564828],"genre_scores_gemma":[0.9006655,0.0002636422,0.08623548,0.000113902555,0.000049363025,0.00012665176,0.00022390991,0.000050703413,0.012270859],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987507,0.000019646388,0.000008461483,0.000028131097,0.000050732164,0.000017857934],"domain_scores_gemma":[0.9998468,0.000042309042,0.000013119649,0.00002793818,0.00003613732,0.000033649845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018783574,0.00017038014,0.00037255936,0.0002944424,0.0008383088,0.0010176993,0.00066018157,0.00071426894,0.0033551145],"category_scores_gemma":[0.0005262001,0.00017144677,0.00017762856,0.00044086025,0.0002818244,0.0010536269,0.0007650695,0.00031619446,0.00062931486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012402063,0.0006299479,0.005343431,0.00060811767,0.0001167578,0.0038767888,0.0017490595,0.20231509,0.38399494,0.08553226,0.02922646,0.28536692],"study_design_scores_gemma":[0.00016089235,0.00027458306,0.0015268783,0.000020197145,0.00004662997,0.000658379,0.00035280085,0.935108,0.029902535,0.011141209,0.020777956,0.000029947674],"about_ca_topic_score_codex":0.001597847,"about_ca_topic_score_gemma":0.0020284294,"teacher_disagreement_score":0.0033551145,"about_ca_system_score_codex":0.0005871119,"about_ca_system_score_gemma":0.000510123,"threshold_uncertainty_score":0.011223972},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042462356,0.0002092235,0.95221895,0.00016519355,0.000049829236,0.000115602816,0.000027627812,0.0015875384,0.0031638085],"genre_scores_gemma":[0.81294084,0.00023576176,0.18302706,0.00016498519,0.000040855633,0.00016304161,0.00010308296,0.0001385216,0.0031858585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954814,0.00007217044,0.000027026259,0.00012072336,0.00013423605,0.00009754813],"domain_scores_gemma":[0.9993419,0.00028432076,0.000095374766,0.000091897884,0.00012965674,0.000056815905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104665,0.0010384653,0.00070787873,0.0005912743,0.0005960296,0.001217055,0.001966375,0.0007832089,0.0017059037],"category_scores_gemma":[0.002686438,0.00053506834,0.000619652,0.0004175004,0.0007092623,0.00154591,0.0014493508,0.0014026333,0.00046221924],"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.000053709628,0.000086864544,0.00093104417,0.000032873646,0.000030892417,0.000042603857,0.00004904745,0.945621,0.00398424,0.0059301564,0.00046577412,0.04277177],"study_design_scores_gemma":[0.0000026011155,0.000014811617,0.000036618152,0.0000018601286,0.0000034665384,0.000005292311,0.0000058380942,0.9980292,0.00068018486,0.0010464747,0.00017094506,0.0000026496064],"about_ca_topic_score_codex":0.007619176,"about_ca_topic_score_gemma":0.006888901,"teacher_disagreement_score":0.007619176,"about_ca_system_score_codex":0.0010132095,"about_ca_system_score_gemma":0.0018119859,"threshold_uncertainty_score":0.015149653},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21471237,0.0032794795,0.7670344,0.000926468,0.00033269744,0.00024186347,0.00036721004,0.0025401788,0.01056529],"genre_scores_gemma":[0.90721375,0.0011735117,0.085462615,0.00005765863,0.00015682811,0.000093847135,0.00019304025,0.00012094998,0.0055278484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0003783516,0.00007846595,0.00019502729,0.00046069172,0.00023615842],"domain_scores_gemma":[0.99368495,0.0042700837,0.00036342622,0.00078787055,0.0006530844,0.00024056429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023305304,0.00056922034,0.0016147031,0.0014441313,0.002041144,0.002361153,0.0019203502,0.001344991,0.0016020866],"category_scores_gemma":[0.008066408,0.00085618004,0.00044262208,0.0023599626,0.0009784326,0.002551422,0.0019047391,0.0008564175,0.00038821538],"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.0010607813,0.0003118004,0.0038805094,0.0004519534,0.0001780634,0.0009957385,0.00089599326,0.6154929,0.022768285,0.14211534,0.009566695,0.20228189],"study_design_scores_gemma":[0.000047920945,0.000077167024,0.00034717494,0.000018305645,0.00005378471,0.00022531247,0.00013939016,0.94499975,0.0044240206,0.045437556,0.004200633,0.00002885661],"about_ca_topic_score_codex":0.0038270333,"about_ca_topic_score_gemma":0.0047063124,"teacher_disagreement_score":0.0038270333,"about_ca_system_score_codex":0.0015175367,"about_ca_system_score_gemma":0.0011619206,"threshold_uncertainty_score":0.012325168},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23407675,0.00074247114,0.75643927,0.001297077,0.000117624855,0.00019687037,0.00038432278,0.0008909899,0.005854584],"genre_scores_gemma":[0.95406306,0.00061080727,0.037784893,0.00011725766,0.00020238638,0.00015847523,0.00033742018,0.0001246927,0.0066010607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975727,0.0009636571,0.000106414176,0.00039009456,0.0007619201,0.00020518932],"domain_scores_gemma":[0.9702726,0.02312968,0.001989568,0.0023383808,0.0016520385,0.00061771664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003548388,0.00051814265,0.0011028243,0.0024118377,0.001473997,0.0018845855,0.0018060714,0.0016738934,0.0013395943],"category_scores_gemma":[0.023285514,0.0009094445,0.0007692028,0.0019798467,0.0015328533,0.0033454688,0.002683847,0.0013538825,0.0004936325],"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.00063029863,0.00030355615,0.014695216,0.0005292566,0.00026728562,0.0012508009,0.001765174,0.6346727,0.019163659,0.19490135,0.009845641,0.12197509],"study_design_scores_gemma":[0.000024034553,0.000046161855,0.0011079528,0.000011543304,0.000030373943,0.00015383206,0.00008733862,0.9572261,0.001991764,0.03820941,0.0010945002,0.000016973756],"about_ca_topic_score_codex":0.0029336573,"about_ca_topic_score_gemma":0.003539571,"teacher_disagreement_score":0.003548388,"about_ca_system_score_codex":0.0011904745,"about_ca_system_score_gemma":0.0008437977,"threshold_uncertainty_score":0.018765867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21169838,0.0047791223,0.72198844,0.0016335129,0.0004882802,0.00028269086,0.0009709936,0.0034439901,0.054714605],"genre_scores_gemma":[0.8757274,0.001593151,0.10343602,0.00015716408,0.00013798187,0.00015420098,0.00074300007,0.00015065062,0.017900424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996244,0.0001209866,0.000014199416,0.000057641668,0.00011334693,0.00006942867],"domain_scores_gemma":[0.99926716,0.0002488975,0.00006125897,0.00010372921,0.0002306921,0.00008819576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040807851,0.00016702297,0.00039509413,0.00051848305,0.0009620907,0.0006750379,0.000838867,0.00041098625,0.002605058],"category_scores_gemma":[0.0015785408,0.00018388448,0.00015585478,0.00082345825,0.00033403363,0.0010243264,0.000570948,0.0003613616,0.0007781208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013672479,0.00022994568,0.005628174,0.0008717497,0.00013805606,0.0009102624,0.0013234519,0.2900151,0.056462184,0.2258053,0.07464073,0.34260786],"study_design_scores_gemma":[0.00010592065,0.00019281132,0.0020933393,0.000043768334,0.00009617815,0.00034786493,0.0004302625,0.89446455,0.012121092,0.058235686,0.031831764,0.000036697893],"about_ca_topic_score_codex":0.008050746,"about_ca_topic_score_gemma":0.008330104,"teacher_disagreement_score":0.008050746,"about_ca_system_score_codex":0.001072366,"about_ca_system_score_gemma":0.00086729525,"threshold_uncertainty_score":0.016007781},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137195,0.000683537,0.4702348,0.00064807537,0.00006102774,0.00045385218,0.0005718367,0.0070330617,0.006594313],"genre_scores_gemma":[0.83291316,0.00011566686,0.16371441,0.00008591878,0.000022358749,0.00007808526,0.0004927343,0.00011158028,0.0024662034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975715,0.0007268284,0.00012758354,0.0005579506,0.0007233188,0.00029286995],"domain_scores_gemma":[0.99664474,0.0013191785,0.0003364333,0.0009614303,0.00045492192,0.00028323798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029981234,0.0008615674,0.0009179771,0.0006657036,0.0011252306,0.0008793331,0.0019767466,0.0006944322,0.0016893832],"category_scores_gemma":[0.0072870348,0.0004214216,0.0003740443,0.0008999899,0.00086289184,0.0024788147,0.0020729199,0.00064568245,0.00046832362],"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.0012594262,0.0009825579,0.026108444,0.0003311599,0.00016080296,0.00046890703,0.0008694331,0.48323917,0.055841357,0.01895632,0.011745165,0.4000373],"study_design_scores_gemma":[0.00014149019,0.0003437515,0.0031217386,0.0000055428145,0.000043301385,0.00018962409,0.00024705197,0.9621412,0.023325248,0.0046973145,0.005713786,0.000029875975],"about_ca_topic_score_codex":0.014804069,"about_ca_topic_score_gemma":0.018344324,"teacher_disagreement_score":0.014804069,"about_ca_system_score_codex":0.0013710676,"about_ca_system_score_gemma":0.0028469192,"threshold_uncertainty_score":0.029435813},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03158254,0.0005072067,0.947181,0.00021856067,0.00016737806,0.00032074325,0.00022180993,0.016813489,0.0029873704],"genre_scores_gemma":[0.28687415,0.0006788042,0.700705,0.00018060915,0.00020526467,0.00047791647,0.0013735302,0.0011813625,0.008323394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975376,0.0004965991,0.0003049069,0.00038100244,0.001017005,0.00026296702],"domain_scores_gemma":[0.99368405,0.002575862,0.0003322438,0.002197635,0.0007815854,0.00042866738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003794225,0.0010898011,0.0025568143,0.0018893984,0.002192173,0.005052437,0.0042110546,0.0020469557,0.0062631234],"category_scores_gemma":[0.007497427,0.0022159363,0.001173839,0.0030490335,0.0017790038,0.0072058537,0.0059432858,0.0017750055,0.0038267607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021794362,0.00096337515,0.005930678,0.0014863173,0.00057965494,0.0010579283,0.0014233498,0.2220135,0.07511497,0.15052482,0.027561378,0.5111646],"study_design_scores_gemma":[0.00039867783,0.00030059917,0.0005466289,0.00006169003,0.00026834136,0.0002671469,0.0002494687,0.8074309,0.055245068,0.11453418,0.020583188,0.00011406217],"about_ca_topic_score_codex":0.0017887802,"about_ca_topic_score_gemma":0.0019821697,"teacher_disagreement_score":0.0062631234,"about_ca_system_score_codex":0.0010755468,"about_ca_system_score_gemma":0.0014253027,"threshold_uncertainty_score":0.020952284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009169816,0.00021774552,0.97141415,0.000119187316,0.00026862198,0.0001633022,0.00022106273,0.0141867455,0.0042392956],"genre_scores_gemma":[0.39020333,0.00058557314,0.58961713,0.0002969986,0.00019205596,0.0006521149,0.001458797,0.0017863136,0.015207642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993555,0.00014422975,0.00007803202,0.000097748525,0.0002548718,0.000069620815],"domain_scores_gemma":[0.99924445,0.00028749774,0.000027341744,0.00020103046,0.00014945913,0.0000901228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013892852,0.0006022046,0.0014473081,0.00073914207,0.0011455701,0.0022445172,0.0026294421,0.0011111605,0.0063292608],"category_scores_gemma":[0.0022655656,0.0005671757,0.0009280488,0.00078984944,0.00056993775,0.0016938049,0.0018585047,0.001908453,0.0014271879],"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.0014784938,0.0013409599,0.0022429135,0.00057635375,0.0005152093,0.0010213256,0.00074238126,0.38984868,0.0482686,0.19536366,0.043203186,0.3153982],"study_design_scores_gemma":[0.00012000996,0.000050263985,0.00014783809,0.000009750895,0.00007941061,0.00008002817,0.000018445206,0.95838666,0.008307926,0.016005946,0.016763471,0.000030225405],"about_ca_topic_score_codex":0.0036626938,"about_ca_topic_score_gemma":0.0029099626,"teacher_disagreement_score":0.0063292608,"about_ca_system_score_codex":0.0006059336,"about_ca_system_score_gemma":0.0014310334,"threshold_uncertainty_score":0.021173537},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00465363,0.020522177,0.60827714,0.007145859,0.0033575916,0.0010615498,0.0012873154,0.00838941,0.3453054],"genre_scores_gemma":[0.11157541,0.06829216,0.53049463,0.0020687298,0.0022960503,0.0013145463,0.0042269146,0.0015071271,0.27822447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987436,0.00014644052,0.0000987119,0.00019796121,0.00074095343,0.00007241972],"domain_scores_gemma":[0.99918896,0.00015896128,0.000032290936,0.00015265493,0.00041561262,0.00005157495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010657554,0.0006656754,0.00063996314,0.0011333142,0.001470406,0.005087919,0.002564498,0.0016310082,0.014838073],"category_scores_gemma":[0.0023748023,0.000632758,0.00036246754,0.0023388416,0.0007661383,0.007183902,0.0014983282,0.0016933775,0.012580838],"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.00005855191,0.00008056402,0.00029745747,0.0013370481,0.000031282587,0.0002033929,0.0003776954,0.011904824,0.0067434856,0.4800671,0.10985357,0.38904497],"study_design_scores_gemma":[0.000015924144,0.000043316333,0.00025967575,0.00032924398,0.000035438992,0.000416798,0.00013374002,0.025682902,0.0037645495,0.09696283,0.8723071,0.000048460064],"about_ca_topic_score_codex":0.0023913647,"about_ca_topic_score_gemma":0.0022701456,"teacher_disagreement_score":0.014838073,"about_ca_system_score_codex":0.0014007303,"about_ca_system_score_gemma":0.0019339656,"threshold_uncertainty_score":0.04963827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007012206,0.0021550052,0.9810658,0.00056325365,0.00035366748,0.00044774532,0.00061424676,0.0017002852,0.006087844],"genre_scores_gemma":[0.09608241,0.002037434,0.8947355,0.00014332315,0.00020575605,0.0006170442,0.0015227322,0.00018875621,0.004467075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976223,0.0007181222,0.00026591512,0.00023341956,0.0010367669,0.0001234863],"domain_scores_gemma":[0.99339986,0.002208952,0.00073567964,0.0017224088,0.0016922617,0.00024084527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032460792,0.0008272467,0.0014928622,0.003484676,0.002472976,0.0032529118,0.002600066,0.0018773574,0.003537804],"category_scores_gemma":[0.018095654,0.00055423344,0.00077404076,0.004715121,0.0008364103,0.0071971333,0.0019445405,0.001775019,0.0024839905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020942737,0.00020304264,0.0021481994,0.00070551934,0.00010848301,0.00017669509,0.00051637157,0.11200691,0.007560049,0.37882435,0.038974818,0.45856607],"study_design_scores_gemma":[0.00006437863,0.00026415105,0.0009569897,0.00018962687,0.00009977151,0.0007331507,0.0002590007,0.6510759,0.00562215,0.24839815,0.0921879,0.00014876107],"about_ca_topic_score_codex":0.00467391,"about_ca_topic_score_gemma":0.009328071,"teacher_disagreement_score":0.00467391,"about_ca_system_score_codex":0.0024766487,"about_ca_system_score_gemma":0.0029944314,"threshold_uncertainty_score":0.01796943},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034942992,0.00038888844,0.9656154,0.00031076526,0.00021678967,0.00019461851,0.0011331921,0.013017513,0.015628615],"genre_scores_gemma":[0.1270558,0.0026566468,0.8174961,0.00040876007,0.00015784962,0.0013469358,0.006386018,0.0063489242,0.038142957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955696,0.00013685701,0.000034964214,0.00005233685,0.00018839714,0.000030529212],"domain_scores_gemma":[0.9994386,0.0002837783,0.000019646915,0.00008213382,0.00012680897,0.000049059687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008317894,0.0012304696,0.0007943011,0.0005606592,0.00077532383,0.0018042851,0.002155935,0.0012437559,0.015641857],"category_scores_gemma":[0.0022113475,0.0007167408,0.0006997475,0.0007865611,0.00051189377,0.002070474,0.001176148,0.0016514818,0.0038389587],"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.00024653986,0.00015584986,0.0010546179,0.0005795829,0.00015652759,0.00029594504,0.00039684167,0.6285326,0.009231906,0.10719556,0.09702752,0.15512651],"study_design_scores_gemma":[0.000048571543,0.000027743752,0.0001292275,0.000047423175,0.000028547527,0.00009525367,0.000021578706,0.8803379,0.005125344,0.025451872,0.088658236,0.000028242885],"about_ca_topic_score_codex":0.005492214,"about_ca_topic_score_gemma":0.0056546135,"teacher_disagreement_score":0.015641857,"about_ca_system_score_codex":0.0007592023,"about_ca_system_score_gemma":0.0011537716,"threshold_uncertainty_score":0.052327275},"labels":[],"label_agreement":null}]}