{"meta":{"query_hash":"54650d394c69","filters":{"venue":"International Journal of Network Management"},"cohort_total":56,"direct_labels_cover":0,"predictions_cover":56,"exported":56,"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/54650d394c69","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Network+Management"},"results":[{"id":"W1575552936","doi":"10.1002/nem.1839","title":"A cognitive model‐based approach for autonomic fault management in OpenFlow networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","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":"OpenFlow; Computer science; Control reconfiguration; Fault management; Controller (irrigation); Software-defined networking; Distributed computing; Network management; Fault (geology); Computer network; Embedded system","score_opus":0.020515258360821863,"score_gpt":0.26776905387622735,"score_spread":0.2472537955154055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575552936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022288486,0.00016180707,0.9693619,0.0005705258,0.000067948546,0.00006184869,0.000027722452,0.0003246709,0.0071350397],"genre_scores_gemma":[0.8620404,0.00016620128,0.13539696,0.00014528635,0.000073765084,0.00014144207,0.000046286157,0.000031899108,0.001957764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993794,0.00017008494,0.000029844472,0.00009770761,0.00023130623,0.00009146625],"domain_scores_gemma":[0.999175,0.00031365457,0.00011300915,0.00012771404,0.00018387893,0.00008665546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012004229,0.000554892,0.00052896846,0.00082620647,0.0009359528,0.0020656215,0.0016663602,0.0009074533,0.001756202],"category_scores_gemma":[0.0022542279,0.0002535373,0.0009712915,0.00041785318,0.0012437387,0.0016377721,0.0017938431,0.0011536838,0.0001509023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007727275,0.00012054391,0.00076366094,0.000051227486,0.00006311988,0.00016793293,0.00030561938,0.82180303,0.0029001809,0.1250947,0.0011885746,0.04746409],"study_design_scores_gemma":[0.0000064830224,0.000011583355,0.0000725519,0.000004187303,0.0000072532976,0.00001159768,0.000021708747,0.97188944,0.0003144513,0.027114667,0.0005392857,0.000006831951],"about_ca_topic_score_codex":0.009799364,"about_ca_topic_score_gemma":0.008435056,"teacher_disagreement_score":0.009799364,"about_ca_system_score_codex":0.001988834,"about_ca_system_score_gemma":0.0018795781,"threshold_uncertainty_score":0.01948464},"labels":[],"label_agreement":null},{"id":"W1581689476","doi":"10.1002/nem.1851","title":"User‐centric context data collection and provision harnessing Content‐Centric Networking paradigm","year":2013,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Caching and Content Delivery","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; Computer network; Context management; Bandwidth (computing); Transmission Control Protocol; Data collection; Ubiquitous computing; Network packet; Operating system","score_opus":0.04015442509620459,"score_gpt":0.2536399134744558,"score_spread":0.2134854883782512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581689476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061989333,0.00097159727,0.9267154,0.00073773175,0.00010737205,0.0003226593,0.00010234818,0.0017039335,0.0073497165],"genre_scores_gemma":[0.7449037,0.0005616173,0.2515627,0.00021561077,0.0001116006,0.0001930755,0.0002209437,0.00006322023,0.002167452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.00033905404,0.00009857865,0.00018432766,0.00045925134,0.000101277445],"domain_scores_gemma":[0.99832195,0.00029408812,0.00019194749,0.0004188824,0.0006145777,0.00015856637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018815877,0.00047406147,0.0005747497,0.0009672356,0.00078590144,0.0019999023,0.0011355977,0.0006249713,0.00041497804],"category_scores_gemma":[0.0022807494,0.00021955403,0.00025826017,0.0006737788,0.0005536025,0.0027716232,0.0019132447,0.00080174545,0.00018133111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042367313,0.00054887333,0.010934237,0.00041135852,0.00018044957,0.0009016768,0.002315915,0.051510185,0.114054844,0.16771816,0.013956499,0.63704413],"study_design_scores_gemma":[0.000044904264,0.0002996741,0.004979319,0.00012767756,0.00020710262,0.0009865457,0.00065957394,0.772139,0.07343114,0.06465326,0.082292296,0.00017946381],"about_ca_topic_score_codex":0.0033583161,"about_ca_topic_score_gemma":0.0035252373,"teacher_disagreement_score":0.0033583161,"about_ca_system_score_codex":0.0008529799,"about_ca_system_score_gemma":0.001669402,"threshold_uncertainty_score":0.009950876},"labels":[],"label_agreement":null},{"id":"W1864236274","doi":"10.1002/nem.804","title":"FuzMet: a fuzzy‐logic based alert prioritization engine for intrusion detection systems","year":2011,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Security and Intrusion Detection","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 Waterloo","funders":"","keywords":"Computer science; Intrusion detection system; Prioritization; Fuzzy logic; Task (project management); Cluster analysis; Data mining; Management system; Computer security; Machine learning; Artificial intelligence; Systems engineering","score_opus":0.022294155599268162,"score_gpt":0.23859563634738823,"score_spread":0.21630148074812006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864236274","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.061261125,0.00050463877,0.9058978,0.0003411582,0.00013126065,0.0002585404,0.00083279895,0.028002836,0.0027698453],"genre_scores_gemma":[0.5486178,0.00028699395,0.44565988,0.00026633567,0.00006856393,0.00019756913,0.0013369479,0.0003520353,0.0032139656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943477,0.000088315515,0.000064751126,0.00009608517,0.00028117918,0.000034944744],"domain_scores_gemma":[0.9989943,0.00045256727,0.00014203323,0.000089300396,0.00026578733,0.00005596089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011717136,0.0007774638,0.0007040174,0.001508282,0.00032263392,0.0013257881,0.0010592837,0.0005625973,0.0034400078],"category_scores_gemma":[0.0037319914,0.00034704758,0.00040830226,0.00060127175,0.00028343766,0.0013715234,0.00060858444,0.0007320854,0.0007395469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017764531,0.0003814139,0.008547725,0.00054249907,0.000295989,0.00032967093,0.00024120533,0.20805633,0.07057222,0.013752929,0.020987043,0.67451656],"study_design_scores_gemma":[0.00006603507,0.00016680772,0.0014142288,0.000030756317,0.000046800564,0.00014994401,0.000018414368,0.96615434,0.0222109,0.0045077144,0.005196575,0.000037507136],"about_ca_topic_score_codex":0.0029570113,"about_ca_topic_score_gemma":0.0032254048,"teacher_disagreement_score":0.0034400078,"about_ca_system_score_codex":0.00084553706,"about_ca_system_score_gemma":0.000871022,"threshold_uncertainty_score":0.011508048},"labels":[],"label_agreement":null},{"id":"W1933219619","doi":"10.1002/nem.1838","title":"Design of energy‐efficient cloud systems via network and resource virtualization","year":2013,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Cloud Computing and Resource Management","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; Cloud computing; Data center; Provisioning; Distributed computing; Integer programming; Virtualization; Network topology; Computer network; Network virtualization; Control reconfiguration; Operating system; Embedded system; Algorithm","score_opus":0.00952007004626954,"score_gpt":0.20897476270779305,"score_spread":0.19945469266152352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933219619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044667933,0.0009370701,0.94069886,0.0005631938,0.00009219849,0.00016192424,0.000062618514,0.00026081025,0.012555466],"genre_scores_gemma":[0.8758818,0.0006830998,0.12042357,0.00010112669,0.000034610697,0.00021450865,0.00005647329,0.00004295479,0.0025619054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996767,0.00010695169,0.00001232607,0.000045783803,0.00009029267,0.000067965],"domain_scores_gemma":[0.99984,0.00004747801,0.000031831423,0.00001558264,0.00004415269,0.000021004962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004499395,0.00040538923,0.0004075133,0.00023405792,0.00049658,0.0010301704,0.0008038392,0.00040685537,0.0015230016],"category_scores_gemma":[0.00069180154,0.00028144606,0.00036549364,0.0002620369,0.0004972822,0.0007027482,0.0008933703,0.00050861225,0.00021182638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003128739,0.00002508901,0.00028433357,0.0000751617,0.000021002394,0.00007768164,0.000027733102,0.9494664,0.006445201,0.025159001,0.00087540154,0.017511662],"study_design_scores_gemma":[0.000006502624,0.000021306181,0.00008086093,0.000006548339,0.0000055861974,0.000013309451,0.000013556795,0.9921038,0.0007256797,0.0053698258,0.0016491996,0.000003684467],"about_ca_topic_score_codex":0.002028715,"about_ca_topic_score_gemma":0.002270123,"teacher_disagreement_score":0.002028715,"about_ca_system_score_codex":0.0008095996,"about_ca_system_score_gemma":0.0012324437,"threshold_uncertainty_score":0.0058740377},"labels":[],"label_agreement":null},{"id":"W1964023696","doi":"10.1002/nem.524","title":"POCA: pattern‐oriented channel assignment scheme for wireless cellular networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Wireless Communication Networks Research","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":"Lakehead University","funders":"","keywords":"Computer science; Scheme (mathematics); Channel allocation schemes; Channel (broadcasting); Computer network; Cluster analysis; Wireless; Distributed computing; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.018684646347782444,"score_gpt":0.2781615596368981,"score_spread":0.25947691328911565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964023696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049008287,0.0005306678,0.9378509,0.0004387037,0.00037736964,0.00024587548,0.0001613035,0.0025974815,0.0087893875],"genre_scores_gemma":[0.81568426,0.00029979553,0.17625144,0.00029414898,0.00018389545,0.0002828131,0.0002526369,0.000073632116,0.006677388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994972,0.0001257652,0.000018800958,0.00011007602,0.00014698606,0.00010111958],"domain_scores_gemma":[0.99929416,0.00010611288,0.000106867345,0.00022153165,0.00015907738,0.00011233039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005210534,0.00045673084,0.00060023996,0.00066638086,0.00090380927,0.00080950523,0.001422034,0.00051114825,0.0020608685],"category_scores_gemma":[0.0013322359,0.00019419538,0.00019747608,0.0010874942,0.00066876103,0.0007550886,0.001031795,0.00078891177,0.0007023819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008613903,0.000364168,0.0012791043,0.0001990367,0.0000787287,0.00031700838,0.00014083216,0.16580927,0.07045068,0.054375853,0.019800723,0.6863233],"study_design_scores_gemma":[0.00019666698,0.00038625678,0.0009422278,0.00001601555,0.000035397774,0.0005919857,0.00004207031,0.93236727,0.022057714,0.021450974,0.02185506,0.00005833958],"about_ca_topic_score_codex":0.0015849205,"about_ca_topic_score_gemma":0.0021224057,"teacher_disagreement_score":0.0020608685,"about_ca_system_score_codex":0.0005937531,"about_ca_system_score_gemma":0.0010189813,"threshold_uncertainty_score":0.0068942904},"labels":[],"label_agreement":null},{"id":"W1965570703","doi":"10.1002/nem.424","title":"Service differentiation using a multi‐level RED mechanism","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Random early detection; Router; Network packet; Differentiated services; Queue; Scheme (mathematics); Computer network; Service (business); Active queue management; Simple (philosophy); Distributed computing; Network congestion","score_opus":0.057753821467320374,"score_gpt":0.25454334974677784,"score_spread":0.19678952827945745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965570703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15551168,0.0009877157,0.83109754,0.00047584635,0.00025058107,0.00024184825,0.00006822378,0.004605464,0.0067611407],"genre_scores_gemma":[0.8918258,0.00013321203,0.104267724,0.0003084521,0.00012036472,0.000058947084,0.00005867182,0.00006541658,0.0031614255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980856,0.0004990594,0.00014799385,0.00036186285,0.00056201906,0.00034340075],"domain_scores_gemma":[0.9959518,0.0010995152,0.0005593982,0.0011163562,0.000884384,0.0003884758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031190265,0.0005794507,0.0007178755,0.0011479356,0.00071484165,0.0019914394,0.0025023846,0.0008053508,0.0017958604],"category_scores_gemma":[0.0034949656,0.00035838626,0.00048976025,0.00050922687,0.00081854017,0.0016447094,0.0020111152,0.0016044772,0.00070581044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017836146,0.0016358106,0.0075969566,0.00036109154,0.0002098331,0.00060924,0.0006087064,0.099174246,0.23537143,0.13236645,0.007266859,0.51301575],"study_design_scores_gemma":[0.00014308913,0.0005784398,0.0014659838,0.000040277242,0.00010350115,0.00053745566,0.00003628132,0.9116637,0.057531573,0.017229576,0.010563286,0.00010678602],"about_ca_topic_score_codex":0.0006876283,"about_ca_topic_score_gemma":0.00062225957,"teacher_disagreement_score":0.0031190265,"about_ca_system_score_codex":0.0009800078,"about_ca_system_score_gemma":0.0006635421,"threshold_uncertainty_score":0.016495168},"labels":[],"label_agreement":null},{"id":"W1969614761","doi":"10.1002/nem.690","title":"Limitations of current Ethernet switch architectures for enhanced flow control and service differentiation","year":2008,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Carrier Ethernet; Ethernet flow control; Flow control (data); Ethernet; Ethernet over SDH; Network switch","score_opus":0.03786559219329814,"score_gpt":0.2565917696170034,"score_spread":0.2187261774237053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969614761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28723976,0.026924266,0.5884793,0.010672335,0.0016653123,0.0004777228,0.00026971922,0.0047877613,0.079483815],"genre_scores_gemma":[0.901471,0.005030286,0.085561216,0.001100546,0.0006168483,0.00016518339,0.00018139042,0.00009895859,0.0057745734],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541324,0.0012473322,0.00029779677,0.00031436302,0.0023463215,0.00038092383],"domain_scores_gemma":[0.993082,0.0025257752,0.0004216673,0.0011549492,0.002623861,0.00019175187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00634666,0.00049388927,0.0005302886,0.0008815058,0.0008044162,0.0026190807,0.0033138997,0.0015413844,0.0036543508],"category_scores_gemma":[0.0080731185,0.00038216493,0.00029048635,0.00068709016,0.0009357116,0.0034303798,0.0010376371,0.0015453479,0.0010859806],"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.0011052046,0.0006289682,0.007609885,0.0013015055,0.00015155858,0.00044613375,0.0007400265,0.06762344,0.07820949,0.30736193,0.02177632,0.51304555],"study_design_scores_gemma":[0.00024928487,0.0013285453,0.0063530887,0.00074994477,0.0002602303,0.0020295759,0.0007630889,0.55023634,0.08221757,0.09623737,0.25936338,0.00021154857],"about_ca_topic_score_codex":0.0016727757,"about_ca_topic_score_gemma":0.0014241548,"teacher_disagreement_score":0.00634666,"about_ca_system_score_codex":0.001538095,"about_ca_system_score_gemma":0.00086211885,"threshold_uncertainty_score":0.033564746},"labels":[],"label_agreement":null},{"id":"W1971349922","doi":"10.1002/nem.387","title":"Enhancing TCP performance with a load‐adaptive RED mechanism","year":2001,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Network packet; TCP acceleration; TCP global synchronization; Mechanism (biology); TCP tuning; TCP Friendly Rate Control; Network congestion","score_opus":0.008093867343004654,"score_gpt":0.2079347773148914,"score_spread":0.19984090997188675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971349922","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.54463226,0.0026024794,0.4264792,0.0007981656,0.00039911727,0.00018949843,0.00007779177,0.010179363,0.014642159],"genre_scores_gemma":[0.9738263,0.0002625489,0.023960749,0.00014176924,0.00014223198,0.000019550924,0.000023242328,0.000091441325,0.0015321714],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.00018882574,0.000045409502,0.00008539319,0.0002593261,0.00009776505],"domain_scores_gemma":[0.99782604,0.00084212364,0.0003361893,0.00048208033,0.0003890458,0.00012444225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014045775,0.000612116,0.00040141636,0.0007118006,0.0004178432,0.0011423217,0.0016758506,0.00060047634,0.0014459002],"category_scores_gemma":[0.0033129393,0.00031740498,0.00022520538,0.00035107075,0.0005475461,0.00155623,0.0009863775,0.0010191421,0.0005227353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014393528,0.0011976724,0.0041722325,0.00032652033,0.00016103829,0.00065903965,0.00029429334,0.08728491,0.6481603,0.01662147,0.004433696,0.23524952],"study_design_scores_gemma":[0.0001619076,0.0005301987,0.002821524,0.000041862702,0.000153578,0.0006961518,0.000035518962,0.78485626,0.20042443,0.0043083476,0.0058858795,0.00008431904],"about_ca_topic_score_codex":0.00037313855,"about_ca_topic_score_gemma":0.00030338904,"teacher_disagreement_score":0.0016758506,"about_ca_system_score_codex":0.0003273096,"about_ca_system_score_gemma":0.0002576942,"threshold_uncertainty_score":0.007428229},"labels":[],"label_agreement":null},{"id":"W1973148104","doi":"10.1002/nem.583","title":"Clock synchronization using a linear process model","year":2005,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Time Synchronization 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":"Nortel (Canada)","funders":"","keywords":"Clock drift; Transmitter; Computer science; Clock synchronization; Timestamp; Synchronization (alternating current); Digital clock manager; Self-clocking signal; Clock domain crossing; Clock skew; Process (computing); Real-time computing; Algorithm; Synchronous circuit; Clock signal; Telecommunications; Jitter; Channel (broadcasting)","score_opus":0.01507618205031292,"score_gpt":0.2873483973809304,"score_spread":0.27227221533061746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973148104","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.010624543,0.0001597091,0.98418254,0.00028894772,0.00007012229,0.000043212953,0.00010914141,0.00033881137,0.004183066],"genre_scores_gemma":[0.90913737,0.0006065329,0.073951006,0.00014743474,0.00016515372,0.00027742842,0.00026899058,0.00007365844,0.015372439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987581,0.00043618833,0.000056747525,0.00032207448,0.00031622322,0.000110689565],"domain_scores_gemma":[0.99866796,0.0007042515,0.00025766186,0.00010662502,0.00021684502,0.00004676726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263457,0.0007457237,0.00089884584,0.00052694924,0.00048611776,0.0016738886,0.0013371902,0.0014229036,0.005073351],"category_scores_gemma":[0.0035414165,0.00037468705,0.0006399924,0.00088744005,0.0010176551,0.0016317276,0.00091800065,0.0013325879,0.0010196159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078233024,0.00004288247,0.00048690944,0.000055867557,0.000032333446,0.00009967308,0.00009269383,0.92210156,0.0019302019,0.06300511,0.00070204085,0.01137252],"study_design_scores_gemma":[0.000015642416,0.00001913703,0.00004977886,0.0000040924147,0.000007062244,0.000009207144,0.0000044674634,0.9926294,0.00023769712,0.006400919,0.0006162808,0.0000063214693],"about_ca_topic_score_codex":0.0068286783,"about_ca_topic_score_gemma":0.0035520552,"teacher_disagreement_score":0.0068286783,"about_ca_system_score_codex":0.0010725949,"about_ca_system_score_gemma":0.00095059816,"threshold_uncertainty_score":0.016972005},"labels":[],"label_agreement":null},{"id":"W1976346346","doi":"10.1002/nem.458","title":"Trunking of TDM and narrowband services over IP Networks","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"Nortel (Canada)","funders":"","keywords":"Trunking; Computer science; Computer network; Broadband Integrated Services Digital Network; Quality of service; Public switched telephone network; Telecommunications; Next-generation network; Narrowband; Broadband networks; Broadband; IP Multimedia Subsystem; Voice over IP; Key (lock); Telephone network; Service (business); The Internet; Computer security; World Wide Web","score_opus":0.004805632762446993,"score_gpt":0.1934785562454496,"score_spread":0.1886729234830026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976346346","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.528583,0.0073755947,0.38581997,0.0015738413,0.00034288692,0.0001459062,0.000118933414,0.0011812571,0.07485857],"genre_scores_gemma":[0.97523993,0.0013993499,0.018779837,0.00009499284,0.00011938727,0.00002557732,0.000072329494,0.000026549624,0.0042421552],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962187,0.00010126625,0.000020313622,0.000037161193,0.00012116019,0.00009820193],"domain_scores_gemma":[0.9991961,0.00032290848,0.00010453613,0.00016229753,0.00013287635,0.00008119021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006676634,0.00019753372,0.00023361469,0.0005978221,0.0005170772,0.0010527876,0.00035577948,0.0005272892,0.0023397729],"category_scores_gemma":[0.0023563358,0.00014590124,0.00014109846,0.00057297706,0.000511319,0.0012342845,0.0012238683,0.00042535612,0.00035151985],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004628549,0.000070335154,0.0065946477,0.00020169288,0.00002092618,0.0018317855,0.0016620639,0.03007582,0.05426811,0.1543998,0.005170889,0.74524117],"study_design_scores_gemma":[0.00007006447,0.0008103044,0.01930486,0.00032158807,0.000118538,0.006039371,0.0021659634,0.55279976,0.04597575,0.24373505,0.12858921,0.00006959026],"about_ca_topic_score_codex":0.0011357659,"about_ca_topic_score_gemma":0.00079976197,"teacher_disagreement_score":0.0023397729,"about_ca_system_score_codex":0.0006002846,"about_ca_system_score_gemma":0.00028727064,"threshold_uncertainty_score":0.007827342},"labels":[],"label_agreement":null},{"id":"W1979865356","doi":"10.1002/nem.421","title":"An adaptive load balancing scheme for web servers","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Server; Round-robin DNS; Web server; Scheme (mathematics); Load balancing (electrical power); Computer network; Client–server model; Process (computing); Control (management); Distributed computing; World Wide Web; Operating system; The Internet; Artificial intelligence","score_opus":0.01618493320392848,"score_gpt":0.24217198361177356,"score_spread":0.22598705040784509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979865356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14547518,0.0005429812,0.83514625,0.00041146006,0.0002619108,0.00026901418,0.00009658473,0.0072106402,0.010586015],"genre_scores_gemma":[0.9323398,0.00012670473,0.06226232,0.00016328586,0.00014266408,0.000119195516,0.00010770267,0.00013141175,0.0046068826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919146,0.00019298177,0.000054989574,0.00013047257,0.00031622412,0.00011376785],"domain_scores_gemma":[0.9990414,0.00019566096,0.00008187497,0.00024336518,0.00029577754,0.0001418673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078270154,0.000462141,0.00047119928,0.0009170548,0.0009581604,0.0010513244,0.0014047702,0.0006155015,0.0033475982],"category_scores_gemma":[0.0017521932,0.00020629517,0.00019800816,0.0006892298,0.0005193863,0.0013233596,0.0013802962,0.0009106945,0.0009046661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017303821,0.0009686589,0.002755559,0.0002015666,0.00010864788,0.00050310907,0.0006260732,0.15739329,0.19967021,0.05458118,0.010738064,0.57072324],"study_design_scores_gemma":[0.00016303484,0.00016588993,0.0008495837,0.000015989479,0.000034192864,0.00016346983,0.000046305762,0.9425068,0.026371539,0.017595794,0.012038833,0.000048513124],"about_ca_topic_score_codex":0.0009103406,"about_ca_topic_score_gemma":0.00071074354,"teacher_disagreement_score":0.0033475982,"about_ca_system_score_codex":0.00066745566,"about_ca_system_score_gemma":0.00041911838,"threshold_uncertainty_score":0.011198878},"labels":[],"label_agreement":null},{"id":"W1979963948","doi":"10.1002/nem.525","title":"Frame‐level performance measurement in an ATM test‐bed environment: methodologies and experiences","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"University of Ottawa; Nortel (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Frame (networking); Asynchronous Transfer Mode; Asynchronous communication; Test (biology); Throughput; Quality of service; Measure (data warehouse); Latency (audio); Computer network; Telecommunications; Database","score_opus":0.06311569915411114,"score_gpt":0.27578876294040444,"score_spread":0.2126730637862933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979963948","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.6821129,0.0010970446,0.30858037,0.00038292896,0.000040120147,0.00052900874,0.00017162054,0.0010290621,0.006056931],"genre_scores_gemma":[0.84225273,0.00060378923,0.15529546,0.000058999234,0.000025920019,0.00017644027,0.00016431228,0.00008156357,0.0013407894],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99587774,0.002107312,0.00022041264,0.00024422945,0.0012890195,0.00026115007],"domain_scores_gemma":[0.9954125,0.0015327287,0.00026591658,0.00048605766,0.0020599565,0.00024279405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006382733,0.00050691346,0.00038941822,0.0005084746,0.00037431394,0.0011616594,0.0018369404,0.00073830714,0.00065524905],"category_scores_gemma":[0.0064892313,0.00022400505,0.00015902135,0.00069249584,0.000612336,0.0008616606,0.0005077592,0.0006991059,0.00023695426],"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.0012877623,0.0031893328,0.021005213,0.00084551226,0.000121371835,0.0006152729,0.0036951334,0.072299585,0.31264403,0.0071528233,0.0021593259,0.5749846],"study_design_scores_gemma":[0.00024654268,0.011510218,0.018904444,0.00020544133,0.0001398508,0.0012926304,0.0016374504,0.2430123,0.6984021,0.0028351217,0.021638587,0.00017533025],"about_ca_topic_score_codex":0.0018860956,"about_ca_topic_score_gemma":0.0010848101,"teacher_disagreement_score":0.006382733,"about_ca_system_score_codex":0.0008125331,"about_ca_system_score_gemma":0.00041801672,"threshold_uncertainty_score":0.03375554},"labels":[],"label_agreement":null},{"id":"W1980827998","doi":"10.1002/nem.664","title":"Prioritized e‐mail servicing to reduce non‐spam delay and loss: A performance analysis","year":2007,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Spam and Phishing Detection","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 Victoria","funders":"","keywords":"Computer science; Computer network; Queue; Queueing theory; Scheme (mathematics); Server; Service (business); Markov chain; Mathematics; Machine learning","score_opus":0.0075013850275313,"score_gpt":0.25862272475039877,"score_spread":0.2511213397228675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980827998","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.5033031,0.002020732,0.4861515,0.0006447908,0.00015237794,0.00023139223,0.000070047376,0.0015050628,0.005921006],"genre_scores_gemma":[0.9813343,0.00019012268,0.01745471,0.000071533424,0.000042642805,0.000028275039,0.000023020613,0.000019290655,0.0008359564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983376,0.00052954216,0.00006306622,0.00015892918,0.00055540603,0.00035532462],"domain_scores_gemma":[0.994961,0.0026194109,0.00055673736,0.00041896166,0.0010955624,0.0003482721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024398898,0.0010839191,0.00083472,0.0009316919,0.00049388834,0.0013873093,0.0010781612,0.0009628004,0.0019340015],"category_scores_gemma":[0.004749805,0.00037784514,0.00037750672,0.000583445,0.0004784956,0.00087197695,0.00057883933,0.00077877915,0.00043258799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027202002,0.00093323237,0.008489774,0.00033361153,0.0002060237,0.00037021298,0.0001666033,0.6874328,0.076949924,0.013129337,0.0031811327,0.20608719],"study_design_scores_gemma":[0.000062010724,0.0002962477,0.00102205,0.00000522883,0.000031064155,0.00007553203,0.000019561186,0.9903723,0.0068337074,0.0010085042,0.00026495187,0.000008818785],"about_ca_topic_score_codex":0.0028840632,"about_ca_topic_score_gemma":0.0017954985,"teacher_disagreement_score":0.0028840632,"about_ca_system_score_codex":0.0016504877,"about_ca_system_score_gemma":0.0016114033,"threshold_uncertainty_score":0.0129035115},"labels":[],"label_agreement":null},{"id":"W2006890568","doi":"10.1002/nem.407","title":"Weighted proportional window control of TCP traffic","year":2001,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Bottleneck; Computer science; Window (computing); TCP global synchronization; TCP Friendly Rate Control; Computer network; TCP acceleration; H-TCP; TCP tuning; TCP Westwood plus; Connection (principal bundle); Service (business); Control (management); Network congestion; Operating system; Mathematics; Artificial intelligence; Embedded system","score_opus":0.006698769925220392,"score_gpt":0.22511368744269444,"score_spread":0.21841491751747405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006890568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058486972,0.0010501296,0.93267906,0.00011737795,0.00032012336,0.000111095185,0.000034612975,0.0014300591,0.005770574],"genre_scores_gemma":[0.94053394,0.0004078948,0.05545912,0.00007567375,0.00020541812,0.0000704117,0.0000352571,0.0000855347,0.003126691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983883,0.00032170015,0.00007529591,0.0002554672,0.00080580934,0.00015334866],"domain_scores_gemma":[0.998187,0.0007419073,0.00015442478,0.00030309445,0.00052568025,0.00008786013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294163,0.00060449215,0.0004413884,0.0007241078,0.00045492934,0.0013874942,0.0015776496,0.00041704037,0.0019002508],"category_scores_gemma":[0.0060617006,0.00021510338,0.00026092774,0.00066259794,0.0007665086,0.0014172089,0.0010218526,0.0008792103,0.00029161127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009574332,0.00035081434,0.0017923698,0.00026949064,0.00013754737,0.00035465392,0.0003502123,0.2097761,0.15441962,0.069602124,0.0037912906,0.55819833],"study_design_scores_gemma":[0.000047774527,0.00013738536,0.00036704078,0.00001547696,0.000048737005,0.00014658904,0.000019758987,0.9492958,0.029314552,0.015050644,0.005529963,0.000026254409],"about_ca_topic_score_codex":0.001383796,"about_ca_topic_score_gemma":0.0009829154,"teacher_disagreement_score":0.0019002508,"about_ca_system_score_codex":0.00056494767,"about_ca_system_score_gemma":0.00047330649,"threshold_uncertainty_score":0.0070307255},"labels":[],"label_agreement":null},{"id":"W2008841761","doi":"10.1002/nem.479","title":"Active queue management with flow proportional buffering","year":2003,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Active queue management; Computer science; Queue; Computer network; Network packet; Network congestion; Multilevel queue; Queue management system; Real-time computing","score_opus":0.005079057059864763,"score_gpt":0.20866164521507025,"score_spread":0.2035825881552055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008841761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06884215,0.0025953872,0.9133996,0.00063258864,0.0009295817,0.00043971973,0.00014895096,0.006577467,0.006434599],"genre_scores_gemma":[0.8550072,0.00044399014,0.13677582,0.00048241625,0.0006291318,0.00021851368,0.00014733968,0.0001267645,0.00616875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980952,0.00039990753,0.00013424126,0.00033747964,0.0007598246,0.00027332536],"domain_scores_gemma":[0.996405,0.0011641302,0.00034416118,0.00060466223,0.0011211276,0.00036095706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032576788,0.0011742886,0.0008308685,0.0017890758,0.0011103738,0.0027053258,0.0057322355,0.0010271305,0.004313332],"category_scores_gemma":[0.006003476,0.0005244011,0.0005006961,0.001164443,0.00094323134,0.003724866,0.0020192494,0.0017182408,0.0005812545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024277624,0.0016641944,0.0030725987,0.0005178663,0.00020124803,0.00032417412,0.00075105455,0.10551654,0.056501318,0.0748214,0.01636863,0.7378332],"study_design_scores_gemma":[0.0004593449,0.0007296815,0.0006367388,0.000044536755,0.00019738608,0.00026503459,0.000059197188,0.92287165,0.03074384,0.029274095,0.014615741,0.00010276502],"about_ca_topic_score_codex":0.0030617046,"about_ca_topic_score_gemma":0.0019772463,"teacher_disagreement_score":0.0057322355,"about_ca_system_score_codex":0.001507834,"about_ca_system_score_gemma":0.0013654928,"threshold_uncertainty_score":0.017228425},"labels":[],"label_agreement":null},{"id":"W2012922054","doi":"10.1002/nem.696","title":"A network management tool for resource‐partition based layer 1 virtual private networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":true,"ca_institutions":"Communications Research Centre Canada","funders":"Dalhousie University; Canarie","keywords":"Computer science; Private network; Partition (number theory); Computer network; Database transaction; Application layer; Network element; Distributed computing; Database; Operating system","score_opus":0.01589594882709504,"score_gpt":0.2341048385047788,"score_spread":0.21820888967768376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012922054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01319421,0.00012183765,0.9046853,0.00015250097,0.000051680996,0.00019467912,0.00058458204,0.07693639,0.0040788245],"genre_scores_gemma":[0.29314741,0.00047826002,0.6808924,0.00028745751,0.00005919594,0.0008487469,0.00326164,0.0087564895,0.012268482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991455,0.00021057871,0.00009622771,0.00015123507,0.0003176389,0.00007871529],"domain_scores_gemma":[0.99814117,0.0012304315,0.00015774752,0.00023537308,0.00015609791,0.00007914317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019917258,0.00088949455,0.0006455449,0.0015557137,0.00058355875,0.0020796838,0.001708291,0.00078699144,0.008765339],"category_scores_gemma":[0.0036847845,0.0007006083,0.00056152395,0.0006525982,0.00069003756,0.0029594584,0.001830906,0.001286148,0.0015730305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010707692,0.00057728303,0.008312532,0.0008999242,0.00018587118,0.0021137474,0.0023919095,0.2071235,0.040568676,0.120387144,0.068836205,0.5475324],"study_design_scores_gemma":[0.00016951948,0.000087674474,0.000912968,0.00015868818,0.00005199076,0.00048338377,0.00014413822,0.8590094,0.022071915,0.026865195,0.08995766,0.000087440254],"about_ca_topic_score_codex":0.0017203711,"about_ca_topic_score_gemma":0.0016040076,"teacher_disagreement_score":0.008765339,"about_ca_system_score_codex":0.00086681073,"about_ca_system_score_gemma":0.000817699,"threshold_uncertainty_score":0.029322982},"labels":[],"label_agreement":null},{"id":"W2013376029","doi":"10.1002/nem.793","title":"A random obstacle‐based mobility model for delay‐tolerant networking","year":2011,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Opportunistic and Delay-Tolerant Networks","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":"Simon Fraser University","funders":"Key Laboratory of Computer Network and Information Integration","keywords":"Obstacle; Computer science; Node (physics); Mobility model; Path (computing); Computer network; Delay-tolerant networking; Signal strength; Distributed computing; Real-time computing; Routing (electronic design automation); Routing protocol; Wireless sensor network; Optimized Link State Routing Protocol","score_opus":0.06295481932385799,"score_gpt":0.2715307868331963,"score_spread":0.20857596750933832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013376029","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.06484942,0.000560938,0.9231259,0.000470903,0.00022091817,0.00010047094,0.00019599797,0.00028305085,0.010192329],"genre_scores_gemma":[0.93221235,0.0008750248,0.057952095,0.00014307536,0.00007970113,0.00022905237,0.00023778778,0.000081710714,0.008189147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.00011003335,0.000020216363,0.000053923304,0.00012175596,0.000056360117],"domain_scores_gemma":[0.99952626,0.00017679714,0.000106200394,0.000044748827,0.00010261706,0.000043496817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322063,0.00057328976,0.0005145258,0.00066403963,0.00046267084,0.0007080444,0.0012377164,0.0006759479,0.0010490348],"category_scores_gemma":[0.001320345,0.00025993376,0.00055740756,0.00046824192,0.00052540476,0.0009929792,0.0007834514,0.0005366862,0.00019564315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018263429,0.000015336143,0.00031020644,0.000019402958,0.000010710254,0.00009793556,0.000030014256,0.97250384,0.0010585426,0.022812705,0.00040562704,0.002717366],"study_design_scores_gemma":[0.000003837139,0.0000129795,0.000049414,0.0000031650075,0.0000045383663,0.000024576655,0.0000062411405,0.99633586,0.00014523264,0.002670031,0.0007384982,0.000005675323],"about_ca_topic_score_codex":0.0051506483,"about_ca_topic_score_gemma":0.0029560078,"teacher_disagreement_score":0.0051506483,"about_ca_system_score_codex":0.0008429254,"about_ca_system_score_gemma":0.0006499119,"threshold_uncertainty_score":0.01024133},"labels":[],"label_agreement":null},{"id":"W2016018393","doi":"10.1002/nem.523","title":"Weighted proportional loss rate differentiation of TCP traffic","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Carleton University; Nortel (Canada)","funders":"","keywords":"Computer science; Differentiated services; Queue; Quality of service; Class (philosophy); Operator (biology); Service (business); Computer network; Artificial intelligence; Economics","score_opus":0.006673285738313726,"score_gpt":0.22330838239317455,"score_spread":0.21663509665486083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016018393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15971783,0.00074740354,0.832945,0.00028364314,0.00030758165,0.00013023429,0.000056254943,0.0014570444,0.004355],"genre_scores_gemma":[0.9446335,0.00019288831,0.05250341,0.00011486854,0.0000847989,0.000037397953,0.00005386492,0.000068906564,0.0023104132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980451,0.00053874846,0.000114756884,0.000280173,0.0008529264,0.00016826122],"domain_scores_gemma":[0.99546826,0.0014596322,0.00046694776,0.00089709734,0.0015210919,0.0001869788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029948044,0.0008299217,0.0005202658,0.0010579046,0.0003992909,0.0014737367,0.0016038754,0.0005361716,0.0010488179],"category_scores_gemma":[0.01129811,0.00026756315,0.0002902292,0.00074063655,0.00086564815,0.0020587398,0.000992493,0.0011560759,0.00036680035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010500362,0.00041109518,0.00435142,0.00020422495,0.00011233268,0.00043926472,0.00046587895,0.5112339,0.11576364,0.092580944,0.002806261,0.27058104],"study_design_scores_gemma":[0.000024425375,0.00012618664,0.00045418635,0.000010223354,0.000020689256,0.00013570268,0.000020002826,0.96633375,0.015449943,0.015730802,0.0016694407,0.000024718243],"about_ca_topic_score_codex":0.001158292,"about_ca_topic_score_gemma":0.0008568395,"teacher_disagreement_score":0.0029948044,"about_ca_system_score_codex":0.0011885733,"about_ca_system_score_gemma":0.0006381326,"threshold_uncertainty_score":0.015838206},"labels":[],"label_agreement":null},{"id":"W2016114679","doi":"10.1002/nem.402","title":"Improving network service quality with explicit TCP window control","year":2001,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; TCP acceleration; TCP global synchronization; TCP delayed acknowledgment; TCP tuning; TCP Friendly Rate Control; Network packet; Queue; Window (computing); HSTCP; Compound TCP; Zeta-TCP; TCP Westwood plus; Quality of service; Limit (mathematics); Network congestion; Operating system","score_opus":0.011278779367032983,"score_gpt":0.2429212662415436,"score_spread":0.2316424868745106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016114679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15655747,0.0019779122,0.8353977,0.00032149584,0.00022556292,0.00007165337,0.000024909212,0.002191106,0.0032321725],"genre_scores_gemma":[0.93987626,0.0004027436,0.05838593,0.00007295392,0.00013143719,0.00002528822,0.000024761337,0.0000665787,0.0010139617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986941,0.00031774983,0.00007538105,0.00015748142,0.0005809856,0.00017432802],"domain_scores_gemma":[0.9971738,0.0012895367,0.00034762465,0.0004934687,0.00057796773,0.00011764623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018143428,0.0006301591,0.000680794,0.00047127903,0.00027607157,0.001282182,0.00144126,0.00056778174,0.0009843094],"category_scores_gemma":[0.008028937,0.0002468586,0.00022700006,0.0004193408,0.0006283895,0.0019920925,0.0011208213,0.0013142888,0.00022127773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067551003,0.0006806326,0.004060843,0.00027205408,0.00012439363,0.00027665764,0.0003109469,0.38330626,0.14680095,0.035379373,0.0028325394,0.42527986],"study_design_scores_gemma":[0.00006771264,0.00010574411,0.0005786673,0.0000155812,0.00004400174,0.00007004166,0.000009768206,0.97825694,0.015932009,0.0033321017,0.0015636114,0.000023780209],"about_ca_topic_score_codex":0.0011693275,"about_ca_topic_score_gemma":0.0009633348,"teacher_disagreement_score":0.0018143428,"about_ca_system_score_codex":0.00046879397,"about_ca_system_score_gemma":0.0004850391,"threshold_uncertainty_score":0.009595215},"labels":[],"label_agreement":null},{"id":"W2017177774","doi":"10.1002/nem.705","title":"End‐to‐end DWDM optical link power‐control via a Stackelberg revenue‐maximizing model","year":2008,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Stackelberg competition; Computer science; Mathematical optimization; Flexibility (engineering); Profit (economics); Power (physics); Coordinate descent; Revenue; Power control; Algorithm; Mathematical economics; Mathematics","score_opus":0.010657040476266167,"score_gpt":0.232642151415423,"score_spread":0.22198511093915682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017177774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040140994,0.00019105148,0.94780886,0.0006090437,0.000035073976,0.00007885581,0.00008736195,0.00013136274,0.010917428],"genre_scores_gemma":[0.9185375,0.00036560468,0.06594971,0.00014882554,0.000059437032,0.00020790049,0.000065082386,0.000047286037,0.014618569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990362,0.00033437883,0.000028491917,0.00019567023,0.00022963817,0.00017574156],"domain_scores_gemma":[0.9990951,0.00047474433,0.0001465534,0.00004546573,0.00017052649,0.00006768703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001976108,0.0011250537,0.001351182,0.0005035738,0.0006571239,0.0025461682,0.002447889,0.0019769582,0.003038781],"category_scores_gemma":[0.002305792,0.0007231358,0.00078556116,0.0005974339,0.0017131487,0.0025497177,0.001182237,0.0014002116,0.0005376714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053117667,0.00005699324,0.00015289817,0.000031327923,0.000020621792,0.000091978174,0.000056612855,0.9261282,0.0013103521,0.06541307,0.00066567864,0.006019182],"study_design_scores_gemma":[0.000010618391,0.00001686674,0.000021130021,0.0000028282443,0.000004459423,0.000007901498,0.0000063112293,0.98768705,0.00027859796,0.011759677,0.00020006583,0.0000044257577],"about_ca_topic_score_codex":0.0049151913,"about_ca_topic_score_gemma":0.0028957427,"teacher_disagreement_score":0.0049151913,"about_ca_system_score_codex":0.002608249,"about_ca_system_score_gemma":0.0018066138,"threshold_uncertainty_score":0.018924296},"labels":[],"label_agreement":null},{"id":"W2024471883","doi":"10.1002/nem.428","title":"New job selection and location policies for load‐distributing algorithms","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Distributed and Parallel Computing Systems","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":"Canadian Heritage; Emmanuel Bible College","funders":"","keywords":"Computer science; Selection (genetic algorithm); Selection algorithm; Algorithm; Operations research; Artificial intelligence; Mathematics","score_opus":0.020369519945229946,"score_gpt":0.2626819945922255,"score_spread":0.24231247464699557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024471883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0758147,0.0005128177,0.9140636,0.00059149036,0.00035752202,0.0001738718,0.0000787787,0.0053339535,0.003073381],"genre_scores_gemma":[0.45113802,0.0003244807,0.53980756,0.0002556538,0.00041970803,0.00021313963,0.0002570913,0.0005601428,0.0070242235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981237,0.00061682466,0.00015706102,0.0003003664,0.00058824715,0.0002138084],"domain_scores_gemma":[0.99546957,0.001471722,0.0004542943,0.0012625667,0.00084470335,0.00049719436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028930907,0.0008111858,0.0012076285,0.0007769346,0.0010689364,0.0015411825,0.003122832,0.0008695617,0.0032721518],"category_scores_gemma":[0.006482484,0.00045328613,0.00032042107,0.00083995884,0.00097016967,0.0025685558,0.001776964,0.0014742089,0.0014309039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015636265,0.0010878055,0.003970415,0.0003005156,0.0000895702,0.00024072196,0.00042360378,0.347632,0.0439947,0.029309394,0.016898008,0.5544897],"study_design_scores_gemma":[0.00026589894,0.00009201717,0.00033095793,0.000010083308,0.000021729717,0.000100343896,0.000042682812,0.97695243,0.0093443915,0.0066504795,0.0061562043,0.000032791497],"about_ca_topic_score_codex":0.0017202359,"about_ca_topic_score_gemma":0.0017878286,"teacher_disagreement_score":0.0032721518,"about_ca_system_score_codex":0.0011336424,"about_ca_system_score_gemma":0.0014256401,"threshold_uncertainty_score":0.0153003335},"labels":[],"label_agreement":null},{"id":"W2026086678","doi":"10.1002/nem.675","title":"Network virtualization under user control","year":2008,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","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","funders":"","keywords":"Computer science; Virtualization; Provisioning; Computer network; Virtual network; Network virtualization; Distributed computing; Reuse; Orchestration; Service (business); Temporal isolation among virtual machines; Cloud computing; Operating system","score_opus":0.014912828587666823,"score_gpt":0.23410601500841377,"score_spread":0.21919318642074695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026086678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121034764,0.0027054707,0.7852325,0.0031974278,0.00087933673,0.0001653615,0.00009116875,0.0027307754,0.08396319],"genre_scores_gemma":[0.9741044,0.0007165439,0.01686021,0.0005112925,0.00030013738,0.000076449855,0.000056425986,0.00009446998,0.007280013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995654,0.0019189743,0.00016307797,0.00053474266,0.0010772644,0.00065192627],"domain_scores_gemma":[0.9931671,0.0022385642,0.00051751477,0.0024689555,0.0009261859,0.00068167085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003412098,0.00069233484,0.00061432406,0.00038723738,0.0009135907,0.0050258404,0.0016269974,0.0011709465,0.0033719253],"category_scores_gemma":[0.0066620237,0.00028509903,0.00032991925,0.00040835558,0.0023306466,0.005908161,0.0040640016,0.0025153668,0.00048304058],"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.00035514586,0.00014655286,0.004288568,0.00018822878,0.00009757305,0.0007099115,0.001288111,0.048185553,0.016545212,0.8177858,0.010361147,0.10004824],"study_design_scores_gemma":[0.00005475042,0.00022461098,0.0018745369,0.00011856198,0.00007544828,0.00096082053,0.0008536894,0.5398567,0.017050613,0.32463136,0.11420125,0.00009771075],"about_ca_topic_score_codex":0.0011294299,"about_ca_topic_score_gemma":0.00068479625,"teacher_disagreement_score":0.0050258404,"about_ca_system_score_codex":0.0008419116,"about_ca_system_score_gemma":0.0012887899,"threshold_uncertainty_score":0.018045127},"labels":[],"label_agreement":null},{"id":"W2044165776","doi":"10.1002/nem.581","title":"Customer‐managed end‐to‐end lightpath provisioning","year":2005,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canarie; University of Ottawa; Communications Research Centre Canada","funders":"Canarie","keywords":"Peering; Computer science; Computer network; Provisioning; Quality of service; Bandwidth (computing); Telecommunications; The Internet; World Wide Web","score_opus":0.0067299654913528855,"score_gpt":0.23980838980736158,"score_spread":0.2330784243160087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044165776","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.4844772,0.00037914584,0.40699384,0.0011318201,0.0002613094,0.00070586294,0.00047176334,0.0143571915,0.09122182],"genre_scores_gemma":[0.93192136,0.00008485101,0.050705288,0.00023640953,0.00005733515,0.00007538065,0.00042706294,0.0001480432,0.016344327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999316,0.00015527278,0.00002621988,0.000106909734,0.00025724107,0.000138472],"domain_scores_gemma":[0.99860686,0.0001790346,0.000115893214,0.00038632657,0.0005568718,0.00015494759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074209546,0.00031112914,0.00020187213,0.00020143816,0.00055372994,0.001038632,0.0010891291,0.00093321997,0.006273695],"category_scores_gemma":[0.00082160113,0.00018692011,0.00010912893,0.00026403336,0.00022538732,0.00090767036,0.0007912913,0.00053677935,0.002094276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001790137,0.0017932093,0.012885957,0.00020990387,0.00006645025,0.001684088,0.0007217962,0.06678679,0.16238329,0.021664303,0.080448814,0.6495653],"study_design_scores_gemma":[0.00014057048,0.00055792596,0.0056738444,0.000027916016,0.00003495364,0.0011179683,0.00029860274,0.7960259,0.12152088,0.010780339,0.06371009,0.000111069414],"about_ca_topic_score_codex":0.0013144372,"about_ca_topic_score_gemma":0.0013858329,"teacher_disagreement_score":0.006273695,"about_ca_system_score_codex":0.00034401522,"about_ca_system_score_gemma":0.0007027368,"threshold_uncertainty_score":0.02098757},"labels":[],"label_agreement":null},{"id":"W2053147723","doi":"10.1002/nem.625","title":"A simple mechanism for stabilizing network queues in TCP/IP networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Active queue management; Computer science; Queue; Padé approximant; Simple (philosophy); Nonlinear system; Stability (learning theory); Queueing theory; Controller (irrigation); Control theory (sociology); Network congestion; Computer network; Control (management); Applied mathematics; Mathematics","score_opus":0.008216961726850616,"score_gpt":0.23909124340027543,"score_spread":0.23087428167342483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053147723","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.09203971,0.000323001,0.89926875,0.00034760637,0.0001642162,0.00013485002,0.00004184911,0.0012891167,0.0063909516],"genre_scores_gemma":[0.9570031,0.00009723044,0.040798705,0.00009117097,0.000046034573,0.00007388012,0.000013805143,0.000018552666,0.0018573442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996282,0.00008610859,0.000020008258,0.00006613808,0.00015268257,0.000046839334],"domain_scores_gemma":[0.9989987,0.00035795305,0.0001374054,0.0002531392,0.00019997364,0.000052781314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497827,0.00041265803,0.00040294012,0.00047411956,0.0004252752,0.0008623756,0.00168467,0.00091604964,0.0026325502],"category_scores_gemma":[0.0027163208,0.00025922497,0.0002928835,0.00021427906,0.001081313,0.0011952593,0.0014101409,0.0009029296,0.00034466683],"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.00045165184,0.00034038117,0.001643199,0.00033159583,0.00012213414,0.00045893868,0.0003069979,0.48137212,0.1980859,0.21898311,0.0026080762,0.09529585],"study_design_scores_gemma":[0.000059726826,0.000121327306,0.00019289694,0.000010550116,0.000014472375,0.000074878015,0.00001276014,0.9730488,0.011863104,0.012780107,0.0018064034,0.0000150214155],"about_ca_topic_score_codex":0.000619021,"about_ca_topic_score_gemma":0.000469025,"teacher_disagreement_score":0.0026325502,"about_ca_system_score_codex":0.0006080699,"about_ca_system_score_gemma":0.0005377613,"threshold_uncertainty_score":0.008806765},"labels":[],"label_agreement":null},{"id":"W2060631282","doi":"10.1002/nem.751","title":"A hybrid approach to operating system discovery based on diagnosis","year":2010,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"University of Ottawa; Université Laval","keywords":"Computer science; Unification; Simple (philosophy); Knowledge extraction; Data science; Artificial intelligence; Machine learning; Programming language","score_opus":0.008074049951444444,"score_gpt":0.23565243955933168,"score_spread":0.22757838960788723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060631282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015797026,0.00019942722,0.9781974,0.00087569625,0.000045296067,0.00011419718,0.00007083966,0.0010591353,0.0036410142],"genre_scores_gemma":[0.37927264,0.00017131383,0.6172912,0.00030496914,0.000065762324,0.0001494518,0.0001616104,0.00009165073,0.0024913026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940783,0.002181406,0.00031934178,0.0008441855,0.002282223,0.00029453222],"domain_scores_gemma":[0.9832519,0.011882753,0.00084440847,0.0021436159,0.0015239818,0.00035331395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049970327,0.0008044047,0.0012009763,0.0049323305,0.0011897582,0.004502351,0.0041831974,0.0024192492,0.0033649409],"category_scores_gemma":[0.010641592,0.0008273236,0.0012549805,0.0024285272,0.0038246978,0.006391742,0.0045145326,0.0023053621,0.00058247155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005308838,0.0007615772,0.008214518,0.0005143432,0.0002841653,0.0010169772,0.0021614013,0.1890519,0.013762032,0.45871955,0.0041755675,0.32080716],"study_design_scores_gemma":[0.000071641254,0.00007604566,0.00037073306,0.00002866392,0.00007164788,0.0002944943,0.0002011443,0.8766253,0.004640632,0.11305995,0.0045056874,0.000054010397],"about_ca_topic_score_codex":0.0047164885,"about_ca_topic_score_gemma":0.0041327276,"teacher_disagreement_score":0.0049970327,"about_ca_system_score_codex":0.0023580424,"about_ca_system_score_gemma":0.002843187,"threshold_uncertainty_score":0.02642715},"labels":[],"label_agreement":null},{"id":"W2063978548","doi":"10.1002/nem.505","title":"Circuit emulation services over Ethernet—Part 1: Clock synchronization using timestamps","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Time Synchronization 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":"Nortel (Canada)","funders":"","keywords":"Metro Ethernet; Computer science; Computer network; Ethernet over PDH; Synchronous Ethernet; Carrier Ethernet; Ethernet; Clock synchronization; Ethernet over SDH; Connection-oriented Ethernet; Ethernet flow control; Synchronization (alternating current); Embedded system; Telecommunications","score_opus":0.012446146693049874,"score_gpt":0.24972849854825693,"score_spread":0.23728235185520705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063978548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18090102,0.00646249,0.7160588,0.0020140621,0.0009874257,0.00065873086,0.00034511165,0.011627392,0.080945],"genre_scores_gemma":[0.8660217,0.004228343,0.101073176,0.000318186,0.0007143833,0.00012795466,0.00049595383,0.00025299168,0.02676744],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999456,0.0001598729,0.000048986203,0.000047092366,0.00020101148,0.0000871297],"domain_scores_gemma":[0.9991485,0.00028308513,0.00014776851,0.00017081296,0.00018966942,0.00006016921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008843734,0.0004814491,0.00026849462,0.0010193479,0.00038468206,0.0016338504,0.0007140488,0.00061335583,0.005733967],"category_scores_gemma":[0.0019952727,0.0001522528,0.00018232888,0.0012763487,0.00043769745,0.0011285406,0.00064684445,0.00046099882,0.0009969234],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008143308,0.0002647896,0.0039841966,0.00042903257,0.000042628755,0.001012851,0.0006905928,0.020702848,0.12436123,0.12473719,0.027804825,0.69515556],"study_design_scores_gemma":[0.00025720842,0.0009838198,0.0053513567,0.00022395917,0.00015539213,0.0035299745,0.0005304074,0.2772062,0.30100492,0.020378599,0.39027753,0.0001005998],"about_ca_topic_score_codex":0.0013671636,"about_ca_topic_score_gemma":0.0007762038,"teacher_disagreement_score":0.005733967,"about_ca_system_score_codex":0.0005416813,"about_ca_system_score_gemma":0.00068329496,"threshold_uncertainty_score":0.019182026},"labels":[],"label_agreement":null},{"id":"W2074717607","doi":"10.1002/nem.539","title":"DRED‐MP: Queue management with multiple levels of drop precedence","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Active queue management; Computer science; Network packet; Queue; Computer network; Drop (telecommunication); Network congestion; Queue management system; Queueing theory; Priority queue; Distributed computing; Telecommunications","score_opus":0.009270980478158003,"score_gpt":0.22872944832325584,"score_spread":0.21945846784509784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074717607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036385026,0.0007517308,0.9559238,0.00052294886,0.00032040768,0.0001855359,0.00012431073,0.0034290906,0.002357092],"genre_scores_gemma":[0.695852,0.00039946148,0.29783747,0.00038212625,0.00021185548,0.00010822616,0.00019859795,0.000119408076,0.0048908195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991737,0.00018993848,0.000091239745,0.00015201353,0.00028225954,0.00011081634],"domain_scores_gemma":[0.9978619,0.0006240908,0.0003053917,0.0004263876,0.00052525604,0.00025694663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021085467,0.0005352793,0.0007106324,0.0009256697,0.00070962036,0.0015295116,0.0032780217,0.00062424655,0.003173776],"category_scores_gemma":[0.003634127,0.0003557605,0.000391381,0.00065187336,0.00059807056,0.0012464485,0.0017848951,0.0014955265,0.0006007659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012259699,0.0005974595,0.004232025,0.00045030296,0.0001137995,0.0005522365,0.00029879072,0.18340865,0.055709124,0.056433655,0.010130683,0.68684727],"study_design_scores_gemma":[0.00027878227,0.00030671342,0.00046425333,0.000022732667,0.00003736848,0.00024606273,0.000027552634,0.9568002,0.022511253,0.010663366,0.008597857,0.000043922377],"about_ca_topic_score_codex":0.0017791146,"about_ca_topic_score_gemma":0.0019569844,"teacher_disagreement_score":0.0032780217,"about_ca_system_score_codex":0.000782455,"about_ca_system_score_gemma":0.0010804645,"threshold_uncertainty_score":0.011151195},"labels":[],"label_agreement":null},{"id":"W2096470551","doi":"10.1002/nem.506","title":"Circuit emulation services over Ethernet—Part 2: Prototype and experimental results","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Time Synchronization 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":"Nortel (Canada)","funders":"","keywords":"Computer science; Emulation; Ethernet; Jitter; Clock synchronization; Computer network; Network packet; Synchronization (alternating current); Synchronous Ethernet; Real-time computing; Embedded system; Telecommunications; Channel (broadcasting)","score_opus":0.0108349261642156,"score_gpt":0.254370168135099,"score_spread":0.2435352419708834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096470551","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.94654465,0.00013240219,0.044286396,0.00018858246,0.0000809688,0.0009370912,0.00030812275,0.0034699515,0.0040518935],"genre_scores_gemma":[0.9780065,0.00007680157,0.019043757,0.000049777147,0.000018411522,0.0002385767,0.00032639373,0.00018629717,0.0020534701],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978994,0.00066313246,0.00013106834,0.0002809524,0.00058791926,0.0004374711],"domain_scores_gemma":[0.9971705,0.00093921705,0.00019537132,0.00050222996,0.0008810691,0.00031151634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019515733,0.0008885696,0.00088589685,0.00069504295,0.0005657497,0.0008086409,0.0028527335,0.0012549261,0.004131009],"category_scores_gemma":[0.0038494875,0.00028156282,0.0003793748,0.000583764,0.000727368,0.0014447944,0.00074340566,0.00096209894,0.0007958687],"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.0075575924,0.009771059,0.01072661,0.0013244206,0.00028640812,0.0021960353,0.0026275534,0.03342438,0.80095106,0.006860795,0.005855045,0.118419],"study_design_scores_gemma":[0.0012552433,0.017156778,0.0070538586,0.000060442802,0.00012589736,0.0007292633,0.00054327,0.08979798,0.8744533,0.00049183844,0.008238248,0.000093786686],"about_ca_topic_score_codex":0.0023384308,"about_ca_topic_score_gemma":0.0005709637,"teacher_disagreement_score":0.004131009,"about_ca_system_score_codex":0.0008476304,"about_ca_system_score_gemma":0.00045877253,"threshold_uncertainty_score":0.013819635},"labels":[],"label_agreement":null},{"id":"W2129949151","doi":"10.1002/nem.388","title":"ATM test‐bed architecture for training purposes","year":2001,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Petri Nets in System Modeling","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":"Lakehead University","funders":"","keywords":"Computer science; Training (meteorology); Test (biology); Architecture; Field (mathematics); Engineering management; Operations research; Engineering","score_opus":0.03677629542056229,"score_gpt":0.2888250046978496,"score_spread":0.25204870927728734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129949151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24510823,0.00095925154,0.6365443,0.0011935949,0.0006663213,0.0009438818,0.0011131864,0.04546447,0.06800679],"genre_scores_gemma":[0.9069895,0.000228939,0.067817464,0.0003001842,0.00008082763,0.00027784723,0.0011657036,0.0002738539,0.022865698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996158,0.00010496011,0.000023554901,0.00005928782,0.00012563783,0.00007072016],"domain_scores_gemma":[0.9993755,0.00009766028,0.0000321907,0.00009820385,0.0003141624,0.00008228354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039634918,0.0005458643,0.00025898856,0.0004961159,0.00027328334,0.000745674,0.0015093525,0.00067833817,0.014571578],"category_scores_gemma":[0.00071984436,0.00024831507,0.00018432122,0.00030848745,0.00023987821,0.0006810429,0.00058544986,0.000638801,0.0034172938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002219897,0.0009337363,0.00813922,0.00075098115,0.00015451977,0.0012338915,0.00040097997,0.23835944,0.23415661,0.031257927,0.06243513,0.41995767],"study_design_scores_gemma":[0.00018174763,0.0009991804,0.004056106,0.00010561891,0.00012536299,0.0005730941,0.00010662966,0.68027586,0.20553772,0.006436027,0.10150677,0.000095869225],"about_ca_topic_score_codex":0.0024669466,"about_ca_topic_score_gemma":0.001451621,"teacher_disagreement_score":0.014571578,"about_ca_system_score_codex":0.00057812507,"about_ca_system_score_gemma":0.00053654326,"threshold_uncertainty_score":0.048746765},"labels":[],"label_agreement":null},{"id":"W2130871161","doi":"10.1002/nem.452","title":"Interworking of switched ethernet and ATM flow control mechanisms","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Flow control (data); Ethernet; Ethernet flow control; Flow (mathematics); TCP Friendly Rate Control; Transmission Control Protocol","score_opus":0.00989592912454802,"score_gpt":0.20677692915115095,"score_spread":0.19688100002660294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130871161","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.9803371,0.0008204597,0.014861595,0.00008604131,0.00010449464,0.000058786256,0.000017041582,0.0001297193,0.0035848583],"genre_scores_gemma":[0.9960602,0.00010617514,0.0034124574,0.000019707182,0.000016859532,0.000015288293,0.000016443824,0.0000045994443,0.00034831534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972379,0.0014025742,0.00011192171,0.00013520036,0.0007036365,0.00040871772],"domain_scores_gemma":[0.9947218,0.0030957013,0.00071596226,0.0003356241,0.0008921335,0.00023890455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042956783,0.00062416267,0.00038658638,0.00077513687,0.00037357406,0.0013190686,0.0011128809,0.0007996339,0.0015076603],"category_scores_gemma":[0.008033682,0.00025998484,0.00027438637,0.00053615245,0.0007084217,0.0014862487,0.0009263283,0.0008580082,0.000101468315],"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.008368012,0.0027998923,0.054210085,0.0006270923,0.00058168464,0.0011801361,0.0005988721,0.6124125,0.092589475,0.03209801,0.001727167,0.19280708],"study_design_scores_gemma":[0.0003142419,0.004367425,0.0077327313,0.00009491518,0.00028820196,0.00029680424,0.00022935253,0.93244725,0.046196748,0.004674267,0.0033077847,0.000050205414],"about_ca_topic_score_codex":0.0013799105,"about_ca_topic_score_gemma":0.0006921982,"teacher_disagreement_score":0.0042956783,"about_ca_system_score_codex":0.0007334823,"about_ca_system_score_gemma":0.00062210363,"threshold_uncertainty_score":0.022718012},"labels":[],"label_agreement":null},{"id":"W2142559290","doi":"10.1002/nem.426","title":"A self‐regulating TCP acknowledgment (ACK) pacing scheme","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Scheme (mathematics); TCP delayed acknowledgment; TCP acceleration; TCP Westwood plus; H-TCP; TCP global synchronization; TCP Friendly Rate Control; Computer network; TCP tuning; Network congestion","score_opus":0.011873683307134926,"score_gpt":0.22245400069878754,"score_spread":0.21058031739165262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142559290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09415419,0.0012122183,0.89101434,0.00035842418,0.0008422331,0.0003437422,0.000097492484,0.005549771,0.006427495],"genre_scores_gemma":[0.8229861,0.00045521586,0.16810487,0.0004497992,0.00044171893,0.00020543502,0.00016492221,0.00019345457,0.006998453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989309,0.0002530436,0.0001048443,0.0001813035,0.00041695134,0.000113098926],"domain_scores_gemma":[0.9977507,0.00047937263,0.0002588844,0.0005910588,0.0006453432,0.00027457156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014999155,0.00045708995,0.00053605053,0.00070006336,0.00043595917,0.0010021309,0.0020922648,0.0006309689,0.001454959],"category_scores_gemma":[0.0023993452,0.00031445475,0.00030231124,0.0003282073,0.00052039477,0.0012601112,0.0012080934,0.0015077256,0.0006425734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016617364,0.0012128173,0.0061122393,0.0004809414,0.00018937046,0.0008318989,0.0004736368,0.043621574,0.37779886,0.04926188,0.0096244905,0.50873053],"study_design_scores_gemma":[0.0003106271,0.001287532,0.0030248163,0.000081489925,0.00028349482,0.0017820548,0.000056470646,0.8008086,0.13453148,0.008467101,0.049103677,0.0002626997],"about_ca_topic_score_codex":0.00033474996,"about_ca_topic_score_gemma":0.00028004352,"teacher_disagreement_score":0.0020922648,"about_ca_system_score_codex":0.00031667895,"about_ca_system_score_gemma":0.0005029373,"threshold_uncertainty_score":0.007932425},"labels":[],"label_agreement":null},{"id":"W2315595044","doi":"10.1002/nem.1928","title":"ROUTE: run‐time robust reducer workload estimation for MapReduce","year":2016,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Cloud Computing and Resource Management","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":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Workload; Reducer; Scheduling (production processes); Distributed computing; Real-time computing; Mathematical optimization; Operating system","score_opus":0.012707672687848543,"score_gpt":0.2445965335879856,"score_spread":0.23188886090013708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315595044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06174235,0.0006305351,0.8897126,0.00028055822,0.00017956649,0.00018706181,0.0007388894,0.04471587,0.0018124842],"genre_scores_gemma":[0.59787166,0.00024270255,0.39465022,0.0001471988,0.00011235618,0.00019279275,0.0020650532,0.0021887573,0.0025293187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989091,0.00019787547,0.000048745464,0.00028138264,0.00048683048,0.00007609937],"domain_scores_gemma":[0.99846774,0.00038046695,0.00017496297,0.0004142039,0.00045789467,0.00010465806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012182832,0.0010584556,0.0007080569,0.0006685947,0.0003764365,0.00072080444,0.0016753871,0.0005156354,0.0021162159],"category_scores_gemma":[0.0042678434,0.00045355587,0.0005353581,0.0004915056,0.00040632088,0.000860198,0.0008603041,0.0010659848,0.0013198836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057149166,0.00016734212,0.0044557485,0.00029399132,0.00019791044,0.00027003273,0.00022302252,0.7154675,0.040229484,0.0039300397,0.02135898,0.2128346],"study_design_scores_gemma":[0.000018638471,0.000050400817,0.00046790778,0.0000047916237,0.000007691927,0.00004972999,0.000020544303,0.9870996,0.008410854,0.0010759699,0.0027710078,0.000022843346],"about_ca_topic_score_codex":0.0061183167,"about_ca_topic_score_gemma":0.0045450437,"teacher_disagreement_score":0.0061183167,"about_ca_system_score_codex":0.0004613197,"about_ca_system_score_gemma":0.0014240145,"threshold_uncertainty_score":0.012165427},"labels":[],"label_agreement":null},{"id":"W2553156561","doi":"10.1002/nem.1957","title":"Fast failure detection and recovery in SDN with stateful data plane","year":2016,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":80,"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":"Seventh Framework Programme","keywords":"Stateful firewall; Computer science; OpenFlow; Forwarding plane; Failover; Computer network; Network packet; Software-defined networking; Distributed computing; Pipeline (software); Overhead (engineering); Latency (audio); Operating system","score_opus":0.010978967496437474,"score_gpt":0.22212865301624776,"score_spread":0.21114968551981028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553156561","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.5916375,0.00025659075,0.40086582,0.00018370444,0.000062410625,0.000081957456,0.00013384299,0.004148177,0.0026300198],"genre_scores_gemma":[0.98243904,0.00003484754,0.01709389,0.000020304402,0.000005018656,0.00002377883,0.000051637755,0.000031041785,0.00030040418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993861,0.00015103421,0.000054443248,0.00008141765,0.00021665334,0.00011029811],"domain_scores_gemma":[0.9981895,0.00075750833,0.00019532809,0.0003970642,0.0003723466,0.000088240566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012233672,0.0004156033,0.00029822334,0.00048107342,0.00032175603,0.00063156267,0.0007868704,0.0002813307,0.0007908839],"category_scores_gemma":[0.0024278252,0.00021985147,0.00028426552,0.00028241536,0.0006342149,0.0010920807,0.0006533658,0.00052098633,0.00008537621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013605434,0.00033513873,0.013652271,0.00022546858,0.00010957695,0.00032604902,0.00028603358,0.79743046,0.066657946,0.01819497,0.0022628964,0.09915868],"study_design_scores_gemma":[0.000021835096,0.00009639188,0.00050062296,0.000005241432,0.000013604113,0.000024896495,0.000013097991,0.98303556,0.01297915,0.0027664436,0.00053495436,0.000008266986],"about_ca_topic_score_codex":0.0031895572,"about_ca_topic_score_gemma":0.0018338435,"teacher_disagreement_score":0.0031895572,"about_ca_system_score_codex":0.00078744674,"about_ca_system_score_gemma":0.0008264903,"threshold_uncertainty_score":0.0064699054},"labels":[],"label_agreement":null},{"id":"W2606761684","doi":"10.1002/nem.1974","title":"Big data analytics for network and service management","year":2017,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Big Data Technologies and Applications","field":"Decision Sciences","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":"Dalhousie University","funders":"","keywords":"Computer science; Big data; Data science; Analytics; Service (business); Data analysis; Data mining","score_opus":0.45428205358572255,"score_gpt":0.43808036888178165,"score_spread":0.0162016847039409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606761684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060627596,0.30272615,0.41240394,0.117884725,0.036619563,0.00093366613,0.011463644,0.010451984,0.10145356],"genre_scores_gemma":[0.18862389,0.3618939,0.29396164,0.020382037,0.04714751,0.0011073613,0.035547927,0.0028208066,0.04851498],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939644,0.0014591982,0.00042098472,0.00073697086,0.0031110714,0.00030735845],"domain_scores_gemma":[0.990584,0.00404539,0.000559456,0.0015609215,0.0027067012,0.0005435598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054789498,0.0015341932,0.00147447,0.0041815946,0.0011310412,0.008695344,0.002323557,0.0022186781,0.0118835475],"category_scores_gemma":[0.014836416,0.0005915153,0.0008738342,0.007865822,0.0014331916,0.014590584,0.0036485773,0.0036942444,0.00674775],"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.00012926038,0.00006282861,0.0010436123,0.0021224665,0.00014844898,0.00015750359,0.0003279529,0.0066007716,0.001393356,0.19074576,0.4029884,0.39427957],"study_design_scores_gemma":[0.00001624912,0.000035489513,0.00068467646,0.00080048805,0.000032758075,0.00014969854,0.0002963049,0.024674123,0.0011299808,0.24319176,0.7289397,0.000048757378],"about_ca_topic_score_codex":0.0016694481,"about_ca_topic_score_gemma":0.0011522906,"teacher_disagreement_score":0.0118835475,"about_ca_system_score_codex":0.0020083676,"about_ca_system_score_gemma":0.0027095373,"threshold_uncertainty_score":0.03975445},"labels":[],"label_agreement":null},{"id":"W2612901339","doi":"10.1002/nem.1874","title":"Reference node selection in dynamic tree","year":2014,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Time Synchronization 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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Node (physics); Network packet; Hop (telecommunications); Computation; Path (computing); Tree (set theory); Context (archaeology); Algorithm; Computer network; Mathematics","score_opus":0.006777707752662945,"score_gpt":0.2421883431859365,"score_spread":0.23541063543327354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612901339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04758177,0.00043930864,0.9463037,0.00015034115,0.000054494838,0.00010792274,0.00022359038,0.001016196,0.0041226707],"genre_scores_gemma":[0.43832424,0.00031626297,0.55292684,0.00009861676,0.00003886825,0.00014682297,0.00091779995,0.00028368414,0.0069468757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993104,0.00014232987,0.000041628253,0.00016381333,0.00024566118,0.000096222124],"domain_scores_gemma":[0.9989741,0.00033805004,0.000110518136,0.0001972628,0.00030046588,0.00007968936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066397665,0.00034543313,0.00058354397,0.0013597847,0.00087113073,0.0009068931,0.0014996171,0.00063599757,0.0028439332],"category_scores_gemma":[0.002533413,0.0002702848,0.00037342234,0.0013300007,0.0003829419,0.0014380716,0.0013737228,0.00041225227,0.0008141083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044182246,0.00013938219,0.00397336,0.00034475187,0.000058234447,0.0006334254,0.00071785756,0.31370094,0.040964846,0.050028235,0.010683771,0.5783133],"study_design_scores_gemma":[0.000024272882,0.000121585574,0.00079659367,0.000031128293,0.00002236385,0.00035027144,0.0001962987,0.9620487,0.010420405,0.013889713,0.012073135,0.000025504392],"about_ca_topic_score_codex":0.0026152025,"about_ca_topic_score_gemma":0.0045465496,"teacher_disagreement_score":0.0028439332,"about_ca_system_score_codex":0.00059040677,"about_ca_system_score_gemma":0.0006986491,"threshold_uncertainty_score":0.009513974},"labels":[],"label_agreement":null},{"id":"W2613502141","doi":"10.1002/nem.1977","title":"Botnet behaviour analysis: How would a data analytics‐based system with minimum a priori information perform?","year":2017,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Security and Intrusion Detection","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Botnet; Computer science; A priori and a posteriori; Payload (computing); Data mining; Network topology; Information flow; Command and control; Network packet; Machine learning; Artificial intelligence; Computer security; The Internet; Computer network","score_opus":0.02731259170435204,"score_gpt":0.26597300754878545,"score_spread":0.2386604158444334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613502141","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.5095672,0.00059661194,0.44899285,0.0030187485,0.00016609895,0.0006847856,0.001805383,0.029366942,0.005801397],"genre_scores_gemma":[0.890474,0.00008677126,0.106457435,0.0002165444,0.000053145144,0.00019035964,0.0015193687,0.00013138642,0.0008710235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957268,0.0012736624,0.00045154328,0.0011302505,0.0010369392,0.000380767],"domain_scores_gemma":[0.9854537,0.006430596,0.0017211859,0.0022816246,0.0033982783,0.0007146282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063181627,0.0013993084,0.0018386949,0.0028305089,0.00087798806,0.0030334913,0.001556093,0.0015751491,0.0013376474],"category_scores_gemma":[0.021657616,0.0006188013,0.0008412263,0.0009743222,0.0005843477,0.0041344822,0.0014416189,0.0013653017,0.0013606475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026266756,0.002446172,0.12477814,0.0006586823,0.00080039824,0.0005612129,0.00087283284,0.31531897,0.04223481,0.008027783,0.015779493,0.48589483],"study_design_scores_gemma":[0.000018551054,0.00017640961,0.0058578067,0.000039017457,0.000032422024,0.00007676712,0.00009294866,0.97884685,0.011302022,0.0025307692,0.000984283,0.000042165324],"about_ca_topic_score_codex":0.0055182376,"about_ca_topic_score_gemma":0.0035522915,"teacher_disagreement_score":0.0063181627,"about_ca_system_score_codex":0.0017091761,"about_ca_system_score_gemma":0.0026802053,"threshold_uncertainty_score":0.033414066},"labels":[],"label_agreement":null},{"id":"W2756802969","doi":"10.1002/nem.1996","title":"A holistic approach to mitigating DoS attacks in SDN networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Software-defined networking; Computer network; Denial-of-service attack; Forwarding plane; Guard (computer science); OpenFlow; Bandwidth (computing); Intrusion detection system; Distributed computing; Computer security; Network packet; The Internet; Operating system","score_opus":0.034255707238836135,"score_gpt":0.3069957079745939,"score_spread":0.27274000073575777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756802969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045267217,0.0012337882,0.9477388,0.00056261785,0.000065775464,0.00008578239,0.00003858614,0.0005168463,0.004490552],"genre_scores_gemma":[0.75881433,0.0012104933,0.2380271,0.0002820918,0.000064492284,0.00009682251,0.0000891078,0.000053417865,0.0013622232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992725,0.00020824996,0.000034325658,0.00008569789,0.00030287475,0.00009625702],"domain_scores_gemma":[0.99946684,0.00015480632,0.0000912612,0.000080336664,0.00014282932,0.00006387393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001181924,0.0008396475,0.00073054025,0.0007678662,0.00036034948,0.0010216166,0.0009136865,0.00051208923,0.0011220494],"category_scores_gemma":[0.0011351715,0.0003443566,0.00052102754,0.00045087634,0.00060101826,0.0012800083,0.0013789153,0.00089418824,0.00019191031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013986646,0.00017972231,0.002239531,0.000249703,0.00013240725,0.00010864737,0.00011284295,0.7335301,0.05294841,0.020985724,0.0014275225,0.18794551],"study_design_scores_gemma":[0.000012614464,0.00020250818,0.0004369511,0.000036575315,0.00004762184,0.00006098261,0.00006674509,0.97753954,0.008276773,0.010017849,0.0032868285,0.0000148755535],"about_ca_topic_score_codex":0.00071816595,"about_ca_topic_score_gemma":0.0009402493,"teacher_disagreement_score":0.001181924,"about_ca_system_score_codex":0.00070691,"about_ca_system_score_gemma":0.0011098561,"threshold_uncertainty_score":0.006250739},"labels":[],"label_agreement":null},{"id":"W2761002106","doi":"10.1002/nem.2010","title":"Special issue on security for emerging open networking technologies","year":2017,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Security and Intrusion Detection","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":"Computer science; Computer security; Data science","score_opus":0.02545959015606784,"score_gpt":0.3163442670622289,"score_spread":0.29088467690616104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761002106","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.0010845598,0.05716883,0.0050802226,0.03904033,0.82903,0.00039576495,0.0007427138,0.0006389921,0.06681854],"genre_scores_gemma":[0.005319005,0.0555371,0.0021059855,0.011457042,0.81568664,0.00031854355,0.0013525021,0.0005561096,0.10766711],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995773,0.00051890826,0.00039110685,0.00063100946,0.002201677,0.00048431728],"domain_scores_gemma":[0.9905601,0.0031749287,0.00073506864,0.0007757944,0.0034464449,0.0013076613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032457674,0.0022709472,0.0025528846,0.0033648885,0.0018685049,0.006828607,0.0024902143,0.0046834205,0.08052669],"category_scores_gemma":[0.0077664796,0.0006804373,0.0015594726,0.0017132579,0.001253415,0.006945417,0.0030798817,0.0061467174,0.03181914],"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.000049813563,0.000059110123,0.00016781002,0.0007708259,0.000029803416,0.0001454147,0.000055174354,0.00016560967,0.00066107896,0.0051216497,0.9358582,0.056915507],"study_design_scores_gemma":[0.000011587104,0.00006638616,0.00032367875,0.00052954175,0.000018123974,0.00026749336,0.00004250169,0.00032826056,0.00020544705,0.003745696,0.994447,0.00001427228],"about_ca_topic_score_codex":0.00053749816,"about_ca_topic_score_gemma":0.000799472,"teacher_disagreement_score":0.08052669,"about_ca_system_score_codex":0.0020280937,"about_ca_system_score_gemma":0.002700212,"threshold_uncertainty_score":0.26938856},"labels":[],"label_agreement":null},{"id":"W2800520079","doi":"10.1002/nem.2022","title":"DSSDN: Demand‐supply based load balancing in Software‐Defined Wide‐Area Networks","year":2018,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","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 Waterloo","funders":"","keywords":"Computer science; OpenFlow; Controller (irrigation); Software-defined networking; Load balancing (electrical power); Traverse; Quality of service; Computer network; Distributed computing","score_opus":0.009559988038902458,"score_gpt":0.2339670891026539,"score_spread":0.22440710106375145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800520079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046801843,0.0005413043,0.9314106,0.00029691597,0.00022322076,0.00020409537,0.00027026745,0.011809505,0.008442303],"genre_scores_gemma":[0.7628188,0.0003710521,0.22545967,0.00017658093,0.000102645725,0.00026176719,0.00082193874,0.0004715111,0.009516034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995204,0.000098998236,0.000040358776,0.000088874585,0.00019389903,0.000057404788],"domain_scores_gemma":[0.9994796,0.00015247757,0.000043268232,0.00010969023,0.0001666626,0.000048273254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071939896,0.0005137461,0.0003355804,0.00066865236,0.0004524696,0.0008064044,0.0011672643,0.00031037605,0.0032425695],"category_scores_gemma":[0.0011518274,0.00020276198,0.00022784378,0.00050365424,0.00033947697,0.00091897475,0.0009483977,0.0005381105,0.0008013284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065902254,0.00033425805,0.003430292,0.00028587715,0.00005963077,0.0002216021,0.00021866265,0.29862845,0.051618885,0.0320396,0.021853987,0.5906497],"study_design_scores_gemma":[0.000038539034,0.000046838817,0.00038395688,0.0000095892365,0.000006039401,0.00003820216,0.000021159638,0.9719671,0.012051613,0.004985591,0.010437613,0.000013862096],"about_ca_topic_score_codex":0.0026290456,"about_ca_topic_score_gemma":0.0029669616,"teacher_disagreement_score":0.0032425695,"about_ca_system_score_codex":0.0008651073,"about_ca_system_score_gemma":0.00062211254,"threshold_uncertainty_score":0.010847509},"labels":[],"label_agreement":null},{"id":"W2890988064","doi":"10.1002/nem.2046","title":"Clustering‐based quality selection heuristics for HTTP adaptive streaming over cache networks","year":2018,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Image and Video Quality Assessment","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":"Bell (Canada)","funders":"","keywords":"Computer science; Cache; Throughput; Quality of experience; Cluster analysis; Heuristics; Computer network; Overhead (engineering); Hypertext Transfer Protocol; Heuristic; Quality of service; The Internet; Wireless; Machine learning; Artificial intelligence","score_opus":0.04390798948740165,"score_gpt":0.3609375782898079,"score_spread":0.3170295888024062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890988064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48356968,0.00074086216,0.51030505,0.00035258255,0.000052791056,0.00025786733,0.00026061106,0.0011918207,0.003268781],"genre_scores_gemma":[0.9467301,0.000060473292,0.05257853,0.000033137356,0.000012694181,0.000044817527,0.00019029538,0.000036994476,0.00031304767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992681,0.00021891663,0.000048968494,0.00013776319,0.00014999474,0.00017632131],"domain_scores_gemma":[0.9950976,0.0029897098,0.00050431915,0.00023808077,0.0008763127,0.00029404435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014401466,0.0007276252,0.0008347891,0.0015094228,0.0006440299,0.0009032833,0.0015668678,0.0007390404,0.0008226454],"category_scores_gemma":[0.005484027,0.0003681742,0.00039225057,0.00087857555,0.00050001737,0.00081673305,0.0006003384,0.0005921244,0.00012660754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019067235,0.00011277016,0.002833274,0.000032487,0.0000387463,0.000043257118,0.00006503703,0.9677654,0.001930021,0.0022244202,0.0008745502,0.023889355],"study_design_scores_gemma":[0.0000064114374,0.000016042717,0.00021352911,0.0000018116606,0.000004015425,0.0000064297096,0.000011531688,0.99901354,0.00028317567,0.0003968029,0.000043903656,0.0000027079445],"about_ca_topic_score_codex":0.014147758,"about_ca_topic_score_gemma":0.01046016,"teacher_disagreement_score":0.014147758,"about_ca_system_score_codex":0.0025298526,"about_ca_system_score_gemma":0.0015798511,"threshold_uncertainty_score":0.02813083},"labels":[],"label_agreement":null},{"id":"W2899374547","doi":"10.1002/nem.2049","title":"User identification via neural network based language models","year":2018,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Spam and Phishing Detection","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":"Dalhousie University","funders":"Public Safety Canada; Defence Research and Development Canada","keywords":"Computer science; Identification (biology); Phishing; Artificial neural network; Language model; Artificial intelligence; Machine learning; ALARM; Natural language processing; Computer security; World Wide Web; The Internet","score_opus":0.013594933780510597,"score_gpt":0.2589805654666247,"score_spread":0.24538563168611408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899374547","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.57345057,0.0007940533,0.41216472,0.0019849904,0.00021535362,0.00017942362,0.00096451485,0.0027554408,0.0074909613],"genre_scores_gemma":[0.9679946,0.00012906412,0.028015284,0.0001246538,0.000053506894,0.00006067041,0.00044702995,0.000030359708,0.0031448498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989748,0.000474383,0.00006454197,0.00022356909,0.0001439344,0.00011877494],"domain_scores_gemma":[0.9945927,0.004149014,0.00034290183,0.00019260628,0.0006416292,0.0000810774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017102803,0.0009301034,0.0006007616,0.001660585,0.00041060266,0.0011971969,0.00068396894,0.00090753107,0.0020697697],"category_scores_gemma":[0.006929747,0.00032908336,0.00077053136,0.000772295,0.0004317019,0.0016466947,0.00063999,0.0014667476,0.0011808763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082911836,0.0005604347,0.018608224,0.000117659045,0.00023527154,0.0003074837,0.00029670753,0.72407234,0.005900011,0.0040438343,0.0040920284,0.24093696],"study_design_scores_gemma":[0.0000014168554,0.000010992777,0.00033932176,0.0000031315371,0.0000047839626,0.000011615349,0.000008783979,0.99848384,0.0003660164,0.0007133327,0.000052596373,0.0000041693925],"about_ca_topic_score_codex":0.011398564,"about_ca_topic_score_gemma":0.007768177,"teacher_disagreement_score":0.011398564,"about_ca_system_score_codex":0.001343998,"about_ca_system_score_gemma":0.00059389265,"threshold_uncertainty_score":0.022664428},"labels":[],"label_agreement":null},{"id":"W2944401168","doi":"10.1002/nem.2146","title":"Offloading framework for computation service in the edge cloud and core cloud: A case study for face recognition","year":2020,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"IoT and Edge/Fog Computing","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Cloud computing; Computer science; Computation offloading; Edge computing; Enhanced Data Rates for GSM Evolution; Server; Edge device; Mobile cloud computing; Distributed computing; The Internet; Energy consumption; Mobile edge computing; Mobile device; Computer network; Artificial intelligence; Operating system","score_opus":0.09940261041062004,"score_gpt":0.34071543431338447,"score_spread":0.24131282390276443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944401168","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.88696057,0.0007035252,0.09631125,0.0013699055,0.00014782003,0.00038819722,0.00024196967,0.00064537313,0.01323141],"genre_scores_gemma":[0.98004395,0.00010949434,0.017087622,0.00008253323,0.000013469903,0.000043198423,0.00006770978,0.000026809263,0.0025251375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995252,0.00011775351,0.000023154735,0.00006947053,0.00011328738,0.00015116403],"domain_scores_gemma":[0.999338,0.0003367157,0.000033477198,0.00007445466,0.00010634507,0.00011101375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006378648,0.00041466777,0.00042207414,0.00031530223,0.00091465114,0.0007779296,0.0009117971,0.0011444967,0.0024656514],"category_scores_gemma":[0.0011462382,0.00015244384,0.00047029712,0.0002880045,0.00059945043,0.00074464746,0.00074694416,0.000703196,0.0003537015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024106281,0.0018938009,0.041540954,0.00070798333,0.00020349999,0.027212618,0.0013957595,0.5201662,0.048583336,0.025550153,0.019203104,0.31113192],"study_design_scores_gemma":[0.000055347926,0.00022740266,0.0053047254,0.000019987297,0.00003087358,0.0014681029,0.0005440694,0.97199076,0.012362797,0.00357676,0.0043825153,0.000036713667],"about_ca_topic_score_codex":0.010405255,"about_ca_topic_score_gemma":0.012701241,"teacher_disagreement_score":0.010405255,"about_ca_system_score_codex":0.0009177598,"about_ca_system_score_gemma":0.0007965435,"threshold_uncertainty_score":0.020689368},"labels":[],"label_agreement":null},{"id":"W3005719348","doi":"10.1002/nem.2099","title":"FastFabric: Scaling hyperledger fabric to 20 000 transactions per second","year":2020,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":201,"is_retracted":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; Throughput; Database transaction; Overhead (engineering); Focus (optics); Distributed computing; Distributed transaction; Computation; Database; Transaction processing; Operating system; Algorithm","score_opus":0.012085105624472157,"score_gpt":0.2376185950803247,"score_spread":0.22553348945585255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005719348","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.90472007,0.0011426936,0.040590618,0.00084127346,0.00046299613,0.00017250069,0.0006624096,0.02605412,0.025353245],"genre_scores_gemma":[0.9713054,0.0002263758,0.020977812,0.00014949178,0.000049612678,0.000086734486,0.0006325981,0.00050518615,0.0060668034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880373,0.0001816979,0.000070824964,0.0001894113,0.00038751683,0.00036669453],"domain_scores_gemma":[0.99790156,0.00054124184,0.00015407616,0.00069874234,0.0004779573,0.00022647879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008104,0.0008405184,0.0003948168,0.00090787443,0.00046382248,0.0009048967,0.001260532,0.0005291717,0.016560297],"category_scores_gemma":[0.003247136,0.0003059349,0.00020761012,0.00079826696,0.00044483683,0.0024495847,0.0012837113,0.00064152555,0.0024978265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049361764,0.0013889949,0.022694904,0.0005602146,0.00015733685,0.0011732299,0.0008656119,0.10152036,0.30780563,0.013263175,0.06943101,0.47620335],"study_design_scores_gemma":[0.0005568787,0.0023964809,0.0149465585,0.00009284348,0.00010355937,0.0006241101,0.00069565774,0.6714746,0.24575235,0.008071857,0.05510552,0.00017967206],"about_ca_topic_score_codex":0.002326517,"about_ca_topic_score_gemma":0.0020573745,"teacher_disagreement_score":0.016560297,"about_ca_system_score_codex":0.0007130485,"about_ca_system_score_gemma":0.00069221907,"threshold_uncertainty_score":0.055399656},"labels":[],"label_agreement":null},{"id":"W3014071235","doi":"10.1002/nem.2109","title":"Exploring anomalous behaviour detection and classification for insider threat identification","year":2020,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Security and Intrusion Detection","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":"Dalhousie University","funders":"","keywords":"Insider threat; Computer science; Anomaly detection; Identification (biology); Insider; Context (archaeology); Machine learning; Artificial intelligence; Adaptation (eye); Granularity; Computer security; Data mining","score_opus":0.09171610357745036,"score_gpt":0.27349095766134107,"score_spread":0.1817748540838907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014071235","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.6136299,0.00035399603,0.3761635,0.00041202674,0.00008347251,0.00012828414,0.00035124624,0.0068847584,0.0019928254],"genre_scores_gemma":[0.9256258,0.00006236793,0.07347953,0.000039695067,0.000025268782,0.000030039058,0.00029484511,0.000052985622,0.00038950547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976769,0.0006258829,0.00016668726,0.0005137939,0.0008318069,0.00018489701],"domain_scores_gemma":[0.9940491,0.0027109545,0.0009829651,0.0007892842,0.001189103,0.00027855084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017244524,0.00061562937,0.0007206089,0.0028540578,0.00051076495,0.001225732,0.00097652664,0.0007531712,0.000569692],"category_scores_gemma":[0.0057614786,0.00025253996,0.0005421054,0.0011261473,0.0005779942,0.0015417292,0.0011570216,0.0010126015,0.000453459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007412113,0.0009933932,0.1846139,0.00026643835,0.00029447407,0.00080638163,0.0010964108,0.08425493,0.09696745,0.003291454,0.004066958,0.62260705],"study_design_scores_gemma":[0.0000060351667,0.00013180538,0.016639391,0.000013269779,0.000027722926,0.0002716781,0.00011928902,0.9618072,0.01672936,0.0030381286,0.0011915695,0.00002454167],"about_ca_topic_score_codex":0.0020502263,"about_ca_topic_score_gemma":0.0021672484,"teacher_disagreement_score":0.0028540578,"about_ca_system_score_codex":0.000663024,"about_ca_system_score_gemma":0.00052318315,"threshold_uncertainty_score":0.009119868},"labels":[],"label_agreement":null},{"id":"W3047361733","doi":"10.1002/nem.2130","title":"De‐anonymizing Ethereum blockchain smart contracts through code attribution","year":2020,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Authorship Attribution and Profiling","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 Saskatchewan; University of New Brunswick","funders":"","keywords":"Computer science; Blockchain; Anonymity; Database transaction; Stylometry; Computer security; Code (set theory); Field (mathematics); Source code; Smart contract; World Wide Web; Artificial intelligence; Database; Programming language","score_opus":0.048566640354403126,"score_gpt":0.3014062167132896,"score_spread":0.2528395763588865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047361733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23592965,0.0003617125,0.75070375,0.000985327,0.000167131,0.0003086812,0.0009790214,0.0031822491,0.0073824828],"genre_scores_gemma":[0.81805223,0.00022128329,0.17459668,0.00014952899,0.0000646388,0.00019625171,0.0014460334,0.00020507892,0.0050681606],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99411315,0.0017097965,0.0004226608,0.0007839576,0.0025390345,0.00043137124],"domain_scores_gemma":[0.98297775,0.004779156,0.0028334279,0.007000026,0.0021046933,0.00030502948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032431292,0.0005160735,0.00077232067,0.0027390746,0.0010846438,0.0022577227,0.0009116873,0.0010550729,0.0016123734],"category_scores_gemma":[0.02270402,0.00032330022,0.00055782107,0.0027725038,0.0014628732,0.0031323154,0.003629806,0.0012009329,0.0010694987],"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.00076086744,0.00021894691,0.024208374,0.00034033172,0.00012574958,0.001191579,0.0021758093,0.19856551,0.0347504,0.108976364,0.009647176,0.6190389],"study_design_scores_gemma":[0.00003172062,0.00005517664,0.0031175457,0.00008631148,0.000024258823,0.00043528035,0.00056145556,0.8675929,0.030155273,0.08530542,0.012581587,0.000053079104],"about_ca_topic_score_codex":0.0012620258,"about_ca_topic_score_gemma":0.0015514045,"teacher_disagreement_score":0.0032431292,"about_ca_system_score_codex":0.0009978665,"about_ca_system_score_gemma":0.0014696011,"threshold_uncertainty_score":0.017151535},"labels":[],"label_agreement":null},{"id":"W3047761112","doi":"10.1002/nem.2133","title":"Editorial for special issue on “challenges and opportunities of Blockchain and Cryptocurrency”","year":2020,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Blockchain Technology Applications and Security","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":"Cryptocurrency; Blockchain; Computer science; Data science; Computer security","score_opus":0.03506005170185282,"score_gpt":0.26619971524031316,"score_spread":0.23113966353846033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047761112","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.000078519886,0.0018249275,0.0002044932,0.024627302,0.9715101,0.00002840078,0.00007993328,0.00009283173,0.0015535208],"genre_scores_gemma":[0.0005017434,0.0016692538,0.00009919917,0.011019661,0.97966844,0.000027521563,0.000060497376,0.00006231849,0.0068913847],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99465203,0.0005323381,0.00050819747,0.0010721551,0.0027115825,0.0005236031],"domain_scores_gemma":[0.9828682,0.00458453,0.0011429453,0.0005914488,0.007619526,0.0031933652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004811581,0.0029897715,0.002675836,0.002553192,0.0024664842,0.009222906,0.003290425,0.010636863,0.035096265],"category_scores_gemma":[0.01845994,0.00095401524,0.0029748417,0.0008333363,0.0023176244,0.005437029,0.002016883,0.013354,0.020400291],"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.00004966119,0.000015239782,0.000042404325,0.00019545169,0.000013150738,0.000107384956,0.000014131951,0.000029724835,0.00014586368,0.0005165082,0.99394554,0.0049250433],"study_design_scores_gemma":[0.00005450192,0.000051820094,0.00031147676,0.00025000042,0.000030165718,0.00024604265,0.000048524318,0.00018634617,0.0003078359,0.0014388632,0.9970552,0.0000192998],"about_ca_topic_score_codex":0.0006683319,"about_ca_topic_score_gemma":0.0012823617,"teacher_disagreement_score":0.035096265,"about_ca_system_score_codex":0.0023048555,"about_ca_system_score_gemma":0.002408741,"threshold_uncertainty_score":0.11740869},"labels":[],"label_agreement":null},{"id":"W3186165460","doi":"10.1002/nem.2179","title":"Truthful Decentralized Blockchain Oracles","year":2021,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Blockchain Technology Applications and Security","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; Oracle; Voting; Protocol (science); Incentive; Computer security; Random oracle; Majority rule; Scheme (mathematics); Incentive compatibility; Blockchain; Theoretical computer science; Artificial intelligence; Encryption; Microeconomics; Law; Public-key cryptography; Mathematics","score_opus":0.008818722349377247,"score_gpt":0.2514090193419676,"score_spread":0.24259029699259033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186165460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17023183,0.00027208187,0.8131535,0.0009430688,0.00010515913,0.00039854698,0.00038434626,0.0013456545,0.013165782],"genre_scores_gemma":[0.9680549,0.0000862327,0.02837867,0.000059330094,0.000030831074,0.000087498,0.00016680926,0.000022797807,0.003112905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969693,0.0010421129,0.00026436723,0.00038198166,0.0010359213,0.00030647748],"domain_scores_gemma":[0.993522,0.0021266816,0.00084584195,0.0021195323,0.0010157928,0.00037013853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030672885,0.0003300945,0.00062575773,0.00051742216,0.00070281647,0.0018985431,0.0011966696,0.0009581157,0.0038691042],"category_scores_gemma":[0.008463343,0.00019016674,0.00023874761,0.00074434705,0.0012233567,0.0030945528,0.0019770223,0.001035545,0.000598624],"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.0011246378,0.00026322374,0.0040220073,0.00021555115,0.00007156292,0.0005172322,0.00052265683,0.3117187,0.020041175,0.51272166,0.0040932163,0.14468841],"study_design_scores_gemma":[0.00009681231,0.00014506982,0.00038675987,0.000025548241,0.000015046245,0.00009110327,0.00004908732,0.85662663,0.010731922,0.12746592,0.004334801,0.000031288004],"about_ca_topic_score_codex":0.0010264815,"about_ca_topic_score_gemma":0.0009402453,"teacher_disagreement_score":0.0038691042,"about_ca_system_score_codex":0.0007568554,"about_ca_system_score_gemma":0.0013505695,"threshold_uncertainty_score":0.016221523},"labels":[],"label_agreement":null},{"id":"W4296982419","doi":"10.1002/nem.2214","title":"Load migration in distributed softwarized network controllers","year":2022,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","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":"Computer science; Scalability; Controller (irrigation); Distributed computing; Datapath; Protocol (science); Load balancing (electrical power); Software-defined networking; Consistency (knowledge bases); Synchronization (alternating current); Reliability (semiconductor); State (computer science); Computer network; Embedded system; Channel (broadcasting); Algorithm","score_opus":0.007964440727496287,"score_gpt":0.22599310837027317,"score_spread":0.2180286676427769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296982419","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.7911143,0.00018107505,0.20172586,0.0003033732,0.00015481022,0.00020937315,0.000044636905,0.0026362787,0.003630196],"genre_scores_gemma":[0.987608,0.000014730653,0.01165474,0.000045322657,0.000008354875,0.000034592103,0.000023133674,0.00003279468,0.00057847047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988274,0.00029561186,0.000074968964,0.00026048228,0.00037073082,0.00017073804],"domain_scores_gemma":[0.9964845,0.0011205154,0.00052837987,0.0011138888,0.00054392323,0.00020878593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015205735,0.00056740054,0.00054315996,0.00065419823,0.00078914827,0.0012103677,0.001942461,0.00071751885,0.0016173535],"category_scores_gemma":[0.0038086276,0.00032411804,0.00023167316,0.00035103678,0.0010651347,0.0015169255,0.0015358318,0.0009104646,0.00021882422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012891634,0.0007173951,0.0043245796,0.00010327612,0.000094359806,0.00053337065,0.0005375478,0.7886202,0.08504089,0.012681163,0.0019462965,0.1041118],"study_design_scores_gemma":[0.000033162843,0.00010223978,0.00023596484,0.000003164045,0.0000051650654,0.000017598113,0.00004292442,0.98854464,0.00925148,0.0013249354,0.00043014312,0.000008577029],"about_ca_topic_score_codex":0.0024914048,"about_ca_topic_score_gemma":0.0014354535,"teacher_disagreement_score":0.0024914048,"about_ca_system_score_codex":0.0011176948,"about_ca_system_score_gemma":0.000915342,"threshold_uncertainty_score":0.00810945},"labels":[],"label_agreement":null},{"id":"W4311427590","doi":"10.1002/nem.2218","title":"Towards optimal synchronization in NFV‐based environments","year":2022,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Synchronization (alternating current); Scalability; Function (biology); Distributed computing; Flexibility (engineering); Mathematical optimization; Computer network","score_opus":0.008694305706211054,"score_gpt":0.22957592243299862,"score_spread":0.22088161672678758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311427590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12714861,0.00016732853,0.86804533,0.0003365549,0.000046891517,0.000072458126,0.000095649746,0.00051334006,0.0035739455],"genre_scores_gemma":[0.86263156,0.00009179257,0.13579243,0.00006094525,0.000015392263,0.00007584904,0.00012856553,0.00009231606,0.0011110334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991991,0.00027126275,0.000028545413,0.00014639432,0.000109328954,0.00024535568],"domain_scores_gemma":[0.99861526,0.00074481295,0.00021184678,0.00012516555,0.00014813538,0.00015480518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610476,0.00078461104,0.0008195497,0.00058228226,0.0007532541,0.00095990184,0.0011230706,0.00084976654,0.001725851],"category_scores_gemma":[0.0037760932,0.00039312578,0.0003834005,0.0005387833,0.0007981042,0.0013171629,0.0016345963,0.0007123968,0.00018442882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010684914,0.000055355846,0.00057623506,0.000034200024,0.000015215369,0.00005180737,0.0000643081,0.9684839,0.002485356,0.012309814,0.00084838783,0.014968532],"study_design_scores_gemma":[0.0000128681595,0.000022577691,0.000102407364,0.0000044132794,0.000002497451,0.000010509209,0.00004149732,0.9929716,0.00066649594,0.0057789683,0.0003827085,0.000003566822],"about_ca_topic_score_codex":0.0051776883,"about_ca_topic_score_gemma":0.003420374,"teacher_disagreement_score":0.0051776883,"about_ca_system_score_codex":0.0010301464,"about_ca_system_score_gemma":0.0013640833,"threshold_uncertainty_score":0.010295093},"labels":[],"label_agreement":null},{"id":"W4313462864","doi":"10.1002/nem.2220","title":"On minimizing flow monitoring costs in large‐scale software‐defined network networks","year":2023,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software-Defined Networks and 5G","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Heuristic; Software-defined networking; Bandwidth (computing); Software; Real-time computing; Network monitoring; Distributed computing; Computer network","score_opus":0.013467575728948258,"score_gpt":0.2601517411034921,"score_spread":0.24668416537454385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313462864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23377761,0.0013509695,0.75910527,0.0010545742,0.00008418313,0.00028800694,0.00016887658,0.00053126883,0.00363928],"genre_scores_gemma":[0.91130984,0.000395266,0.086932704,0.00009209622,0.00004141572,0.00013601687,0.00012601214,0.000060844828,0.00090585824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815553,0.00076444383,0.000061349645,0.00027883597,0.00033374812,0.00040598938],"domain_scores_gemma":[0.99121183,0.006487068,0.0010654954,0.00029377313,0.00056405464,0.0003778055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00293722,0.0019328136,0.0014022806,0.0010882413,0.00081710203,0.001545128,0.0021397076,0.0011785064,0.0015371777],"category_scores_gemma":[0.00795573,0.0006789808,0.0004622093,0.0014068459,0.0008355492,0.002107691,0.0011361397,0.0009747261,0.00010338744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010974922,0.00008058299,0.0006115727,0.00006576403,0.00001929769,0.000031753098,0.000022808037,0.9785459,0.0008075482,0.0029781593,0.00044611,0.016280727],"study_design_scores_gemma":[0.000008468871,0.0000300522,0.00018104173,0.0000045234124,0.000005571953,0.0000097891225,0.00001680493,0.9977349,0.00027725825,0.0016302537,0.00009818476,0.0000031220015],"about_ca_topic_score_codex":0.0070437235,"about_ca_topic_score_gemma":0.005024594,"teacher_disagreement_score":0.0070437235,"about_ca_system_score_codex":0.0023246352,"about_ca_system_score_gemma":0.0019443515,"threshold_uncertainty_score":0.016866505},"labels":[],"label_agreement":null},{"id":"W4319791589","doi":"10.1002/nem.2222","title":"A federated semi‐supervised learning approach for network traffic classification","year":2023,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Internet Traffic Analysis and Secure E-voting","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":"Artificial Intelligence in Medicine (Canada)","funders":"Guangzhou Research Collaborative Innovation Projects; Guangzhou University","keywords":"Computer science; Traffic classification; Field (mathematics); Machine learning; Artificial intelligence; Domain (mathematical analysis); Data mining; Supervised learning; Service (business); Deep learning; Semi-supervised learning; Artificial neural network; Computer network; Quality of service","score_opus":0.0293230076973299,"score_gpt":0.267264227003791,"score_spread":0.2379412193064611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319791589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05295489,0.00012476198,0.94392544,0.00020723039,0.000042688458,0.00007326522,0.00010332346,0.0015873958,0.00098092],"genre_scores_gemma":[0.8489447,0.00006169862,0.14782499,0.00016975353,0.000072138224,0.00017070665,0.00054840185,0.00006536255,0.0021421695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974757,0.0008389463,0.00017155347,0.000676014,0.0005913212,0.0002464494],"domain_scores_gemma":[0.99651164,0.00093439705,0.00030737335,0.0007604582,0.001332194,0.000154011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750413,0.0007523248,0.0015535976,0.0013330259,0.0007813296,0.0010517039,0.0022483626,0.0013280096,0.0010722578],"category_scores_gemma":[0.0041508237,0.00037944966,0.00092343264,0.0010829469,0.0008954271,0.0016683183,0.0014274456,0.0013720198,0.00040902573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042510073,0.0007756584,0.004867995,0.00007306116,0.000166007,0.00014220174,0.0001714981,0.59113276,0.005278241,0.0068419664,0.0041411137,0.38598433],"study_design_scores_gemma":[0.000003618125,0.000013307324,0.00011678742,0.0000013890253,0.0000031683142,0.000008377726,0.0000062528225,0.99742436,0.00048258068,0.0018344222,0.00010292703,0.0000028451902],"about_ca_topic_score_codex":0.0033196753,"about_ca_topic_score_gemma":0.0030232426,"teacher_disagreement_score":0.0033196753,"about_ca_system_score_codex":0.0010040996,"about_ca_system_score_gemma":0.0016678039,"threshold_uncertainty_score":0.014545739},"labels":[],"label_agreement":null},{"id":"W4387974191","doi":"10.1002/nem.2251","title":"Assessing the impact of bag‐of‐words versus word‐to‐vector embedding methods and dimension reduction on anomaly detection from log files","year":2023,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Software System Performance and Reliability","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":"Intertek (Canada); Dalhousie University","funders":"","keywords":"Computer science; Dimensionality reduction; Benchmarking; Embedding; Word embedding; Word (group theory); Reduction (mathematics); Data mining; Dimension (graph theory); Encoder; Anomaly detection; Information retrieval; Natural language processing; Artificial intelligence","score_opus":0.03230924128243456,"score_gpt":0.39860222292034947,"score_spread":0.3662929816379149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387974191","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.87082314,0.0010336393,0.12214199,0.00037046842,0.00020185718,0.00015727445,0.0008830206,0.0029472786,0.0014414366],"genre_scores_gemma":[0.91119856,0.0002447986,0.08544916,0.00006041631,0.00004217364,0.00011531002,0.0020507106,0.00016107007,0.0006777686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658066,0.0016610689,0.00033034946,0.00047228084,0.00072796294,0.0002276375],"domain_scores_gemma":[0.9811592,0.013718381,0.0008589157,0.0013193416,0.002627133,0.00031707197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049211234,0.0014092663,0.00089689106,0.0026745168,0.00044341327,0.0014636467,0.00089004054,0.0010292365,0.0008873313],"category_scores_gemma":[0.025074944,0.00024701376,0.0007241426,0.0017102967,0.0006824346,0.002799292,0.0011626701,0.0012159114,0.0006080255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022312352,0.0017115176,0.03213031,0.00063269836,0.00056921976,0.000236099,0.0003377211,0.36598173,0.023262441,0.0021291226,0.0048940848,0.5658838],"study_design_scores_gemma":[0.000029581512,0.00079509284,0.0074667064,0.000033195407,0.000053116477,0.00010578575,0.00020609348,0.9706467,0.018856723,0.0011118228,0.00065544294,0.00003977417],"about_ca_topic_score_codex":0.0049337368,"about_ca_topic_score_gemma":0.003811165,"teacher_disagreement_score":0.0049337368,"about_ca_system_score_codex":0.00056043157,"about_ca_system_score_gemma":0.0007189884,"threshold_uncertainty_score":0.026025712},"labels":[],"label_agreement":null},{"id":"W4390984159","doi":"10.1002/nem.2261","title":"<scp>Deeper</scp>: A shared liquidity decentralized exchange design for low trading volume tokens to enhance average liquidity","year":2024,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Blockchain Technology Applications and Security","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":"Market liquidity; Security token; Computer science; Market maker; Liquidity crisis; Business; Liquidity risk; Monetary economics; Accounting liquidity; Liquidity premium; Token ring; Computer security; Economics","score_opus":0.0189282179407002,"score_gpt":0.28551694958940604,"score_spread":0.26658873164870583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390984159","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.1136684,0.00018183266,0.8581594,0.0005337739,0.00012232571,0.00039836342,0.00022985952,0.006222022,0.020483987],"genre_scores_gemma":[0.8276594,0.00008236137,0.15542021,0.00025016707,0.000039614275,0.0002388821,0.00019399246,0.00047227845,0.015643012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990834,0.00022633976,0.00007217818,0.00013883256,0.00032437107,0.00015479757],"domain_scores_gemma":[0.99887305,0.00017132505,0.00016625549,0.0004006721,0.00023193703,0.00015673795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475792,0.00032558417,0.00030864833,0.0003334682,0.0004510201,0.0012310399,0.0013244371,0.0007034762,0.008787648],"category_scores_gemma":[0.0016963514,0.00028707186,0.00030672023,0.00024565132,0.0007810527,0.0022295138,0.0018458177,0.0007765231,0.0017070612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020978914,0.00067702006,0.004614004,0.00076948263,0.00013487175,0.001016983,0.0010513519,0.09599001,0.33364058,0.19227824,0.018122481,0.34960714],"study_design_scores_gemma":[0.00057143054,0.0018652772,0.0028567207,0.00012516777,0.00011592875,0.0013788921,0.00021259676,0.6033493,0.1953561,0.059,0.13500242,0.0001661043],"about_ca_topic_score_codex":0.00049508084,"about_ca_topic_score_gemma":0.0006692538,"teacher_disagreement_score":0.008787648,"about_ca_system_score_codex":0.00050559605,"about_ca_system_score_gemma":0.0008893954,"threshold_uncertainty_score":0.029397666},"labels":[],"label_agreement":null},{"id":"W4396967659","doi":"10.1002/nem.2276","title":"A distributed algorithm with network‐independent step‐size and event‐triggered mechanism for economic dispatch problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Electric Power System Optimization","field":"Engineering","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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mechanism (biology); Event (particle physics); Economic dispatch; Algorithm; Distributed computing","score_opus":0.003308274439550115,"score_gpt":0.20612919699996962,"score_spread":0.2028209225604195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396967659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008795561,0.00009460778,0.98919374,0.00013231672,0.000042615015,0.000054496806,0.000013744813,0.00012971926,0.0015431002],"genre_scores_gemma":[0.6168652,0.0001658435,0.37856644,0.00013707094,0.000060353817,0.00044906768,0.000086736276,0.000061498715,0.0036078251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996141,0.00013088113,0.000021662703,0.00008568754,0.000103384045,0.000044187822],"domain_scores_gemma":[0.99885213,0.0007007586,0.000095531344,0.00006585784,0.00022044587,0.00006540081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010436579,0.00076757575,0.0009300958,0.00045095393,0.00044350416,0.0007970466,0.0014683085,0.0013435219,0.0023975815],"category_scores_gemma":[0.0026043085,0.00027506924,0.0004274505,0.0004937779,0.00059109903,0.0007634239,0.0010063023,0.0010732169,0.00031944775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009537299,0.000071155846,0.0002962854,0.00005006525,0.000024100344,0.000051932977,0.000027143275,0.95469475,0.001525743,0.0086929165,0.0010225645,0.03344785],"study_design_scores_gemma":[0.00002157998,0.000013707877,0.000017244962,0.000001627302,0.0000017765967,0.0000052061496,0.00000201421,0.9988386,0.00014372784,0.0008241172,0.00012872576,0.0000016699883],"about_ca_topic_score_codex":0.0024242683,"about_ca_topic_score_gemma":0.0021450927,"teacher_disagreement_score":0.0024242683,"about_ca_system_score_codex":0.0006576048,"about_ca_system_score_gemma":0.0013183928,"threshold_uncertainty_score":0.008020639},"labels":[],"label_agreement":null},{"id":"W4407613617","doi":"10.1002/nem.70005","title":"Option Contracts in the DeFi Ecosystem: Opportunities, Solutions, and Technical Challenges","year":2025,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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; Ecosystem; Risk analysis (engineering); Business; Ecology","score_opus":0.07552117587262999,"score_gpt":0.24852278633995448,"score_spread":0.17300161046732448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407613617","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.43447843,0.0057286043,0.42543727,0.039595865,0.00054675,0.00028590075,0.00047537446,0.0016829743,0.09176885],"genre_scores_gemma":[0.9183695,0.0016892564,0.07274105,0.00087582495,0.0002647312,0.000091582675,0.0002801703,0.0001078405,0.005580057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955967,0.0019282169,0.00019017981,0.0004491442,0.0013331533,0.0005026455],"domain_scores_gemma":[0.9830549,0.007042198,0.0022457847,0.0044242316,0.0020391874,0.0011936105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102531295,0.00033341447,0.0004800471,0.0010244938,0.0011068602,0.005795461,0.0016798779,0.0024661536,0.0063899825],"category_scores_gemma":[0.019032475,0.00031063895,0.0004962367,0.001321921,0.0026658513,0.013539089,0.0041616037,0.003406539,0.0008855015],"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.00022699134,0.00019772422,0.011629718,0.0002628058,0.000039161212,0.0007951688,0.00085758703,0.022009881,0.0055642384,0.77301556,0.0066714655,0.17872971],"study_design_scores_gemma":[0.00009219326,0.00042975883,0.0080346055,0.0004975026,0.00003180076,0.0018062216,0.0022850947,0.16274081,0.0072321207,0.64982665,0.16685519,0.00016800764],"about_ca_topic_score_codex":0.00070109725,"about_ca_topic_score_gemma":0.00067238044,"teacher_disagreement_score":0.0102531295,"about_ca_system_score_codex":0.0012572238,"about_ca_system_score_gemma":0.0016441685,"threshold_uncertainty_score":0.054224372},"labels":[],"label_agreement":null},{"id":"W4412764303","doi":"10.1002/nem.70020","title":"QoS‐Aware Load Balancing in Cloud Computing Based on Chronological Kookaburra Optimization Algorithm","year":2025,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Cloud Computing and Resource Management","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Cloud computing; Load balancing (electrical power); Distributed computing; Quality of service; Algorithm; Optimization algorithm; Computer network; Mathematical optimization; Operating system","score_opus":0.0071332359682233035,"score_gpt":0.24818948304927102,"score_spread":0.24105624708104773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412764303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13103352,0.0010087882,0.860699,0.00039202243,0.00013850938,0.00012885229,0.000065968474,0.00045850407,0.006074844],"genre_scores_gemma":[0.8730713,0.00024007316,0.124660276,0.0001238104,0.00003464468,0.00013319451,0.00008682395,0.000055744553,0.001594112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996618,0.00009667787,0.000020306219,0.00007363974,0.00007215305,0.00007547627],"domain_scores_gemma":[0.9995604,0.00017700614,0.00008778774,0.00002459917,0.00010284149,0.000047331338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406851,0.0007394672,0.00077846827,0.0008814709,0.00074983755,0.0009973282,0.0010333129,0.0006625531,0.0014043461],"category_scores_gemma":[0.0012196352,0.00036588585,0.00050346536,0.00068740785,0.0005397229,0.0007595106,0.0006694143,0.0005268114,0.00018188125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001199008,0.000046248188,0.00079640874,0.00003360561,0.000025891644,0.000030245352,0.00002753188,0.9744624,0.0017735532,0.0039451513,0.00050217856,0.01823689],"study_design_scores_gemma":[0.0000064775195,0.000011817513,0.00006768676,0.0000018921946,0.0000022158736,0.00000445812,0.0000044495864,0.9991929,0.00012078212,0.00047462282,0.00011005636,0.0000025792272],"about_ca_topic_score_codex":0.008035742,"about_ca_topic_score_gemma":0.0063877665,"teacher_disagreement_score":0.008035742,"about_ca_system_score_codex":0.0009027205,"about_ca_system_score_gemma":0.0019020739,"threshold_uncertainty_score":0.015977979},"labels":[],"label_agreement":null}]}