{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092081726,0.0002784111,0.99084294,0.00094440934,0.0010500265,0.0009358634,0.0000018979194,0.00004085846,0.0049847723],"genre_scores_gemma":[0.61531115,0.00017550522,0.38106582,0.0024240017,0.00043371753,0.0002278234,0.000015678144,0.000020995447,0.00032530588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997798,0.0000603744,0.00076240895,0.00037639108,0.00054105447,0.00046177034],"domain_scores_gemma":[0.9986583,0.00016563722,0.00045645985,0.00025112627,0.00035302245,0.00011545671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073355326,0.00023354637,0.00029910673,0.0003617222,0.00006759045,0.00041309375,0.0018328237,0.00006714051,0.000020903724],"category_scores_gemma":[0.000009932327,0.00021465954,0.00021425904,0.00032531624,0.00003092228,0.000716583,0.00046798223,0.00022838988,0.00001072795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086228836,0.00017481255,0.0002569508,0.000011197388,0.00035705967,0.000052346946,0.000034661694,0.84171027,1.6752772e-7,0.020390276,0.01131426,0.12561178],"study_design_scores_gemma":[0.0025397043,0.00008344861,0.0020451737,0.00019625408,0.000041473726,0.000011816451,0.00004144171,0.9837604,0.0000012192207,0.00900542,0.0020545085,0.00021909423],"about_ca_topic_score_codex":0.000008150646,"about_ca_topic_score_gemma":0.000003114099,"teacher_disagreement_score":0.6143903,"about_ca_system_score_codex":0.00023507088,"about_ca_system_score_gemma":0.000033623342,"threshold_uncertainty_score":0.8753562},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071612224,0.009932255,0.89589,0.008240165,0.012353246,0.00074267207,0.0000025535276,0.00010516419,0.0011217347],"genre_scores_gemma":[0.9913185,0.0017980114,0.004154087,0.0009579629,0.0011009434,0.0000056744902,0.000010542009,0.000011588717,0.0006426798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980516,0.00010950702,0.00057222525,0.00031724875,0.000669352,0.00028009372],"domain_scores_gemma":[0.99856675,0.00011998798,0.0005577401,0.00035525634,0.00028615666,0.00011409493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056751334,0.00015579176,0.00021031094,0.00028423115,0.0001594431,0.0009506307,0.0016190544,0.000038409013,0.00001621861],"category_scores_gemma":[0.00002290256,0.00013544918,0.00007310034,0.0003442022,0.000028410837,0.0015744009,0.0009879696,0.00020673788,0.000019225148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000970787,0.00015905566,0.01178405,0.00001838118,0.0006544223,0.0002870711,0.00018814162,0.0032349734,0.00003551838,0.0085444385,0.0809222,0.8940747],"study_design_scores_gemma":[0.0039018833,0.00022689454,0.037884478,0.0010724439,0.0001457434,0.000683561,0.0003538209,0.8082714,0.000009543252,0.0068229064,0.14009064,0.00053667475],"about_ca_topic_score_codex":0.00009597553,"about_ca_topic_score_gemma":0.000008028921,"teacher_disagreement_score":0.9197063,"about_ca_system_score_codex":0.00014577278,"about_ca_system_score_gemma":0.000031467564,"threshold_uncertainty_score":0.9166954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018317316,0.0003567607,0.9869351,0.0003156806,0.00848663,0.00035775593,0.0000012749947,0.000063919164,0.0016511788],"genre_scores_gemma":[0.92520267,0.00032296864,0.071910545,0.00054149254,0.001850021,0.000036441616,0.000005381194,0.00001562801,0.00011487776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982751,0.00008767268,0.0006126323,0.00022213307,0.0005796923,0.00022274796],"domain_scores_gemma":[0.99845916,0.000068506655,0.00057293207,0.00020296474,0.00061817735,0.00007824811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069434,0.00014799224,0.00018229231,0.00037296757,0.00012059347,0.00017056965,0.00085948186,0.00007318981,0.00002373796],"category_scores_gemma":[0.000028148654,0.00013527823,0.0001564403,0.0003493609,0.00001817008,0.00058629416,0.0001524777,0.00014665247,0.000008812281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008207382,0.00042953886,0.00018833885,0.00009417259,0.0006071248,0.00015239113,0.00037010518,0.17400827,0.00023154815,0.12690371,0.007893644,0.68830043],"study_design_scores_gemma":[0.0022498043,0.0009877712,0.0023146681,0.0004020819,0.00008248806,0.00015793146,0.000051626477,0.8599742,0.00083745073,0.036009774,0.0965774,0.00035482988],"about_ca_topic_score_codex":0.000008870011,"about_ca_topic_score_gemma":0.0000063605085,"teacher_disagreement_score":0.9233709,"about_ca_system_score_codex":0.00017578772,"about_ca_system_score_gemma":0.000022359502,"threshold_uncertainty_score":0.55164856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005101026,0.0011093603,0.98882115,0.00067264464,0.0023068136,0.00019997079,1.6016999e-7,0.000031308133,0.0017575489],"genre_scores_gemma":[0.96704566,0.00013583747,0.030112889,0.00046735493,0.001571963,0.000010154606,0.0000013369232,0.00001604835,0.00063873525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977031,0.00022331667,0.00074523827,0.00022550936,0.0008420931,0.00026076927],"domain_scores_gemma":[0.9983733,0.00015404314,0.00078104826,0.00026594705,0.00033291552,0.000092702685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010515562,0.00015715831,0.00023916949,0.0002042027,0.00008505552,0.00024937166,0.0011511559,0.00004061588,0.000008490061],"category_scores_gemma":[0.000009209126,0.00013361027,0.00008027413,0.00032304224,0.000042509822,0.00005498057,0.00070703187,0.00009865306,0.000005051233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019091007,0.00006237872,0.0001059632,0.000013809442,0.00029641198,0.000035498044,0.00010479003,0.9021445,0.0000055446444,0.042749763,0.021893922,0.032568347],"study_design_scores_gemma":[0.00047310066,0.00013468419,0.0006863491,0.00029435768,0.000031035626,0.000061458435,0.00006459154,0.9706561,0.0000056681997,0.002811025,0.024643889,0.0001377676],"about_ca_topic_score_codex":0.00002252323,"about_ca_topic_score_gemma":2.907826e-7,"teacher_disagreement_score":0.96194464,"about_ca_system_score_codex":0.000081697064,"about_ca_system_score_gemma":0.000011691882,"threshold_uncertainty_score":0.5448469},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018587464,0.0006297047,0.98711085,0.0063346038,0.0028916593,0.0004414171,0.0000018911553,0.00004892623,0.0006822139],"genre_scores_gemma":[0.94071656,0.0008759208,0.055502214,0.0009529176,0.001629512,0.0000731932,0.00001731074,0.000029992345,0.00020236528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685323,0.000117450465,0.0008502748,0.00032853216,0.0013076857,0.00054282375],"domain_scores_gemma":[0.9975194,0.00015636881,0.00066799944,0.00065114995,0.00081212603,0.00019299479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013171327,0.00022983481,0.0002910133,0.00028936472,0.0001664501,0.00032357403,0.0038119282,0.000081478385,0.000014938118],"category_scores_gemma":[0.000016255319,0.00021750182,0.0002538787,0.00043595213,0.000058181133,0.0005453168,0.0011323993,0.00037888048,0.000012724598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109367094,0.00040490553,0.0002218516,0.000018924577,0.0008983596,0.00024459412,0.00016678667,0.7847341,0.000036164227,0.09461331,0.010877053,0.107674636],"study_design_scores_gemma":[0.0059137833,0.00044712707,0.0013886674,0.000812139,0.000047411715,0.000090740505,0.00012990805,0.91057396,0.00029298963,0.016821915,0.06290344,0.0005779403],"about_ca_topic_score_codex":0.000007011965,"about_ca_topic_score_gemma":0.000005242216,"teacher_disagreement_score":0.93885785,"about_ca_system_score_codex":0.00052241463,"about_ca_system_score_gemma":0.000070460046,"threshold_uncertainty_score":0.8869467},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004750194,0.00020810234,0.9871983,0.003879199,0.0032171102,0.000107793654,8.6986705e-7,0.000038038215,0.00060041354],"genre_scores_gemma":[0.8868059,0.00018963167,0.11029326,0.0014612766,0.00086934085,0.000003382381,0.0000012193501,0.000009226781,0.00036678452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984651,0.00007003566,0.00045767942,0.00017040587,0.0006358247,0.00020093432],"domain_scores_gemma":[0.9988347,0.00003982848,0.0004415671,0.00018215219,0.00042372232,0.000078028825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029349403,0.00012523383,0.00015081333,0.00016154489,0.00007250693,0.00019368547,0.0011466271,0.00003734837,0.000089641544],"category_scores_gemma":[0.0000068705995,0.00011617745,0.00010581286,0.00024494572,0.0000075594876,0.00043323697,0.00022214634,0.00013398624,0.000023682762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056273475,0.0003857535,0.00029265665,0.000015359643,0.0011377296,0.00041980518,0.00035033727,0.16243632,0.0001044933,0.14124708,0.009411508,0.6841427],"study_design_scores_gemma":[0.0013609738,0.000032524287,0.001588334,0.000119101365,0.00003936982,0.00008842081,0.000020978961,0.9876404,0.000008708701,0.00350305,0.0054669916,0.00013117187],"about_ca_topic_score_codex":0.000003187377,"about_ca_topic_score_gemma":0.000007962073,"teacher_disagreement_score":0.8820557,"about_ca_system_score_codex":0.0001128856,"about_ca_system_score_gemma":0.000010964004,"threshold_uncertainty_score":0.4737579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044953905,0.00080965296,0.94995636,0.0025534257,0.0013140904,0.00022889997,0.0000037953118,0.000015621252,0.00016425076],"genre_scores_gemma":[0.9781946,0.0005527602,0.020129029,0.0005190049,0.00053932576,0.000019202665,0.0000032172418,0.0000060650664,0.000036771668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988313,0.000055938097,0.00043713662,0.00013926218,0.000398772,0.0001376239],"domain_scores_gemma":[0.9985011,0.00033450403,0.00044037923,0.00011322855,0.000554654,0.000056122764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024603787,0.00010404229,0.0001805209,0.00012478004,0.00006267706,0.000040660118,0.0005373987,0.000023951212,0.0000033862236],"category_scores_gemma":[0.000024510944,0.00009009308,0.000094788775,0.00012173141,0.000023475934,0.00009044084,0.00006873479,0.000097988355,0.0000011288723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018392292,0.00011195971,0.00028341546,0.00001766326,0.00045938208,0.0000072019557,0.0005035852,0.240182,0.000055325017,0.016644606,0.0015866602,0.7399643],"study_design_scores_gemma":[0.005395978,0.0002598332,0.024670085,0.00025685804,0.00012739567,0.000059029815,0.00003701303,0.93691695,0.000074917516,0.017686587,0.014290167,0.0002251666],"about_ca_topic_score_codex":0.0000010007044,"about_ca_topic_score_gemma":0.00001061052,"teacher_disagreement_score":0.9332407,"about_ca_system_score_codex":0.000028489681,"about_ca_system_score_gemma":0.000028651728,"threshold_uncertainty_score":0.36738893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009456124,0.00017051939,0.9757441,0.0026347977,0.0016708778,0.00012051882,1.6032865e-7,0.00004555398,0.010157334],"genre_scores_gemma":[0.9477093,0.0005146259,0.048786733,0.0008619261,0.000925916,0.000007733409,4.0455302e-7,0.000008937191,0.0011844202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981603,0.000045571876,0.00040121583,0.00019074204,0.0009507488,0.0002514023],"domain_scores_gemma":[0.9987444,0.00005092169,0.00039625866,0.00018775635,0.00053143204,0.00008921311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706662,0.0001385185,0.00016897768,0.0001204669,0.00007646898,0.00014865614,0.0011400983,0.00002780373,0.00004045525],"category_scores_gemma":[0.0000046304244,0.00011070357,0.00007777054,0.0002568235,0.000020094854,0.00053195667,0.00017016465,0.00017436038,0.000020875388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006960309,0.00014021838,0.00051539874,0.0000072205835,0.0010455755,0.0017296558,0.0002455865,0.1325971,0.00002047281,0.1788134,0.0056756306,0.6785137],"study_design_scores_gemma":[0.007591868,0.0019505107,0.0066742445,0.0016914674,0.00018223106,0.0025705197,0.00025918815,0.76986545,0.00018567599,0.02099065,0.18711886,0.0009193238],"about_ca_topic_score_codex":0.0000015655,"about_ca_topic_score_gemma":0.000010198944,"teacher_disagreement_score":0.93825316,"about_ca_system_score_codex":0.00018353002,"about_ca_system_score_gemma":0.00006463141,"threshold_uncertainty_score":0.45143607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023889102,0.0004036411,0.9924236,0.002468347,0.00072767434,0.00011798908,5.014484e-7,0.000110951354,0.0013583929],"genre_scores_gemma":[0.6009326,0.00019386748,0.39727935,0.00048112823,0.00090455485,0.000002563215,0.0000014790434,0.000012079096,0.00019239636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982079,0.000029306586,0.0005648107,0.00019794719,0.000765564,0.00023444332],"domain_scores_gemma":[0.9984866,0.00002223609,0.0005583521,0.0002452236,0.0006345588,0.00005302915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375182,0.00013937382,0.00015511236,0.0002850736,0.0000761895,0.00015499903,0.001844594,0.00005472146,0.000023829582],"category_scores_gemma":[0.000021022182,0.00013229102,0.00008059915,0.00047284056,0.000033124034,0.000980663,0.00040114514,0.00015961975,0.000019171532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009195897,0.00005253174,0.00014490286,0.0000059411277,0.00012978219,0.00003109081,0.000063915235,0.87655705,0.0000039825572,0.028583465,0.003182008,0.09123616],"study_design_scores_gemma":[0.0004050885,0.000030115225,0.00003568918,0.00010872824,0.000018612092,0.0000762873,0.000015583093,0.9817157,0.00007634649,0.010997552,0.006393639,0.00012667783],"about_ca_topic_score_codex":5.126092e-7,"about_ca_topic_score_gemma":0.0000010961103,"teacher_disagreement_score":0.59854364,"about_ca_system_score_codex":0.0003260941,"about_ca_system_score_gemma":0.00007631603,"threshold_uncertainty_score":0.53946716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89635813,0.032906868,0.03812686,0.00043858492,0.012623763,0.00053312886,0.000010919419,0.0001403958,0.018861365],"genre_scores_gemma":[0.99345297,0.0036446247,0.0010391158,0.0001795266,0.0015448529,0.0000035155035,0.0000030749559,0.000027883341,0.00010441946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983269,0.000041964486,0.0006632319,0.00014566454,0.0005533277,0.0002689064],"domain_scores_gemma":[0.99923533,0.00007834778,0.00029313317,0.00016266793,0.00014667971,0.000083847735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045812788,0.00018948407,0.0002896333,0.00015297996,0.000039556195,0.000088382854,0.00046665774,0.00007483723,0.00023105324],"category_scores_gemma":[0.00000351358,0.00018586626,0.00012331178,0.00016416052,0.00004535759,0.00030958158,0.00015599417,0.0002625312,0.0000027257856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011030218,0.0001078997,0.010551168,0.00017770196,0.0013013845,0.00016705717,0.00047650028,0.9218517,0.0000129894615,0.0017310624,0.010107236,0.053405024],"study_design_scores_gemma":[0.002566382,0.00012567495,0.036285188,0.0009175827,0.00022453707,0.000121018194,0.00013479887,0.905408,0.000026841975,0.0035375871,0.050252788,0.00039956238],"about_ca_topic_score_codex":0.000006925779,"about_ca_topic_score_gemma":0.000025877513,"teacher_disagreement_score":0.09709486,"about_ca_system_score_codex":0.00010135364,"about_ca_system_score_gemma":0.0000021372346,"threshold_uncertainty_score":0.7579406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033115118,0.0006343148,0.9843164,0.0034179152,0.0034705808,0.00019861542,0.0000018653582,0.00005762383,0.004591173],"genre_scores_gemma":[0.8953578,0.00015996177,0.10108051,0.0012588609,0.0016250327,0.0000109958555,9.680065e-7,0.000008915334,0.0004969894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985339,0.00004416129,0.000378596,0.00018619541,0.00062842545,0.00022871397],"domain_scores_gemma":[0.99879414,0.00007748695,0.00031911055,0.00018596953,0.00051908015,0.00010422988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368168,0.00011627754,0.0001497827,0.000097836215,0.000068520654,0.00018392464,0.0013166328,0.000030848678,0.00005420403],"category_scores_gemma":[0.000009135045,0.00010815754,0.00013602445,0.00014315908,0.000016912425,0.00060036586,0.00009837125,0.00011317174,0.00001841175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014749778,0.00017778545,0.0003316449,0.000005806833,0.00069128285,0.00019800325,0.00014810111,0.12079131,0.000018364803,0.12418218,0.08132181,0.6719862],"study_design_scores_gemma":[0.001436087,0.00025313988,0.00041561053,0.00008486036,0.000023308672,0.000038647308,0.00003959245,0.9047091,0.0000024823676,0.0021272039,0.09074252,0.00012747268],"about_ca_topic_score_codex":9.375168e-7,"about_ca_topic_score_gemma":0.000004757865,"teacher_disagreement_score":0.8920463,"about_ca_system_score_codex":0.00017002822,"about_ca_system_score_gemma":0.000026334706,"threshold_uncertainty_score":0.44105363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24707375,0.001152935,0.7475479,0.0024438803,0.001222478,0.00016496675,4.1363666e-7,0.000029396919,0.00036425097],"genre_scores_gemma":[0.883525,0.0007660576,0.11499151,0.00041058724,0.0002645874,0.000017582657,3.2774824e-7,0.000004567369,0.000019752253],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99824315,0.00008373949,0.00044017765,0.00021770834,0.0008021016,0.00021310031],"domain_scores_gemma":[0.99929315,0.00008690903,0.00026041412,0.00016536197,0.00011739676,0.00007679572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264343,0.0001301665,0.00017218056,0.000138367,0.00006377184,0.00016046166,0.000975395,0.000034387904,0.000012737791],"category_scores_gemma":[0.000028225071,0.000111310816,0.000045707813,0.00011718064,0.000055914723,0.0006568983,0.0002138162,0.00015260489,0.000004358297],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007373103,0.00017908982,0.0040370733,0.0000070288984,0.0001325615,0.000176434,0.0020408814,0.20403859,0.000023556882,0.012206652,0.00019110389,0.7768933],"study_design_scores_gemma":[0.023080079,0.0051558907,0.4700335,0.0028937152,0.00022507168,0.00090566714,0.010208055,0.35942316,0.0007877422,0.08953928,0.035119675,0.002628164],"about_ca_topic_score_codex":0.000002895678,"about_ca_topic_score_gemma":0.000006704477,"teacher_disagreement_score":0.7742651,"about_ca_system_score_codex":0.0001780842,"about_ca_system_score_gemma":0.00002940369,"threshold_uncertainty_score":0.45391235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41890478,0.000078033205,0.5777243,0.0009324231,0.001192854,0.000064867396,1.8545177e-7,0.00001546446,0.001087104],"genre_scores_gemma":[0.9477962,0.00016910903,0.050361305,0.00081231305,0.00067743764,0.0000014707746,6.011023e-7,0.000005123806,0.00017641556],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99858886,0.000023688903,0.0004180893,0.00018215709,0.00058335636,0.00020386437],"domain_scores_gemma":[0.999126,0.00005645384,0.00025664523,0.00016718834,0.0002786694,0.00011501982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013659043,0.000100208206,0.00016210444,0.0005182311,0.000078499754,0.00022972425,0.0007749223,0.000027552667,0.000008771533],"category_scores_gemma":[0.000009976987,0.00009334725,0.00009365486,0.00079379685,0.000011684813,0.0004305678,0.00028058953,0.00012965978,0.0000072551898],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007661545,0.00017352456,0.07725402,0.000049664744,0.005003172,0.0013423886,0.0023676236,0.26643604,0.00027622108,0.0062687006,0.0051486744,0.6349138],"study_design_scores_gemma":[0.0022909332,0.00045008355,0.72488153,0.00050738937,0.0005133776,0.00053188024,0.00015505738,0.22692421,0.0005110507,0.0020915917,0.040614046,0.0005288678],"about_ca_topic_score_codex":0.000019083413,"about_ca_topic_score_gemma":0.000029106419,"teacher_disagreement_score":0.6476275,"about_ca_system_score_codex":0.000121160825,"about_ca_system_score_gemma":0.00001207866,"threshold_uncertainty_score":0.380659},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020727254,0.0007151797,0.9656246,0.0059226234,0.0030578044,0.00021699576,0.0000017282728,0.00004466765,0.0036891785],"genre_scores_gemma":[0.9858384,0.0003330587,0.0114144,0.00071852014,0.0011723927,0.0000066734965,0.000002201199,0.00000791746,0.0005064141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977033,0.000081810984,0.00079870643,0.00017932634,0.0010058631,0.00023097577],"domain_scores_gemma":[0.99821717,0.000097930104,0.0007530212,0.00019562927,0.00063677016,0.00009950409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064013054,0.00013950653,0.00025683912,0.00021472316,0.000046341214,0.000085050626,0.0013437846,0.000041312807,0.00010993984],"category_scores_gemma":[0.0000100804355,0.00011927629,0.00020629348,0.00028892778,0.000048650512,0.00036301694,0.00010106805,0.00016027586,0.000015591257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029426577,0.0002694973,0.0015851724,0.0000056861945,0.0009462807,0.00059283985,0.000050028477,0.1968472,0.000010314007,0.10029208,0.009505975,0.68960065],"study_design_scores_gemma":[0.010287451,0.0006059285,0.022036206,0.00044802472,0.00020691357,0.0009847282,0.00006103817,0.6690345,0.000018578225,0.013183772,0.2826252,0.0005076716],"about_ca_topic_score_codex":7.8548896e-7,"about_ca_topic_score_gemma":0.0000018741069,"teacher_disagreement_score":0.9651112,"about_ca_system_score_codex":0.00007230308,"about_ca_system_score_gemma":0.00006040082,"threshold_uncertainty_score":0.48639458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001348346,0.00015817951,0.9629309,0.0015765771,0.002053867,0.00022297028,6.6250476e-7,0.000044453664,0.03166401],"genre_scores_gemma":[0.8096173,0.00026397774,0.18727598,0.0008156841,0.0006314429,0.00002631521,0.0000022344302,0.000014740601,0.0013523371],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801767,0.00007623919,0.00043618734,0.00023825243,0.00096235285,0.0002693162],"domain_scores_gemma":[0.99890625,0.000042316282,0.0003876451,0.00021015329,0.00035008526,0.00010352145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048640376,0.00016494482,0.00017504446,0.0001762445,0.00008165912,0.00018450979,0.0009789142,0.000027623664,0.000067775574],"category_scores_gemma":[0.0000050512594,0.0001322959,0.00010424244,0.00025071774,0.00003161005,0.00046667637,0.00013709358,0.0001747701,0.00001871615],"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.00012763898,0.00011697894,0.00021874617,0.0000074127215,0.0010583487,0.0009377634,0.00005904135,0.17843473,8.42735e-7,0.38203225,0.003836064,0.4331702],"study_design_scores_gemma":[0.010049379,0.0008137306,0.017679183,0.001142301,0.00035656473,0.0017922526,0.00050265895,0.18194549,0.000093359646,0.04410638,0.74033946,0.0011792291],"about_ca_topic_score_codex":6.3909255e-7,"about_ca_topic_score_gemma":0.0000022507961,"teacher_disagreement_score":0.80826896,"about_ca_system_score_codex":0.00017935484,"about_ca_system_score_gemma":0.000042093747,"threshold_uncertainty_score":0.53948706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017219092,0.0003785536,0.988571,0.0027536107,0.003632309,0.0005754148,0.0000021238004,0.000105262625,0.0022598172],"genre_scores_gemma":[0.868223,0.0004279471,0.11744058,0.0068055866,0.0054287277,0.00012412472,0.00002076714,0.00003826118,0.0014909685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687177,0.00014555661,0.00096144073,0.0004053794,0.0010126014,0.0006032237],"domain_scores_gemma":[0.99808025,0.00028168227,0.0007012106,0.00042105833,0.00036817262,0.00014763868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011898223,0.00028553818,0.00034272857,0.00021615869,0.0002770982,0.00022516181,0.0018167032,0.00008448798,0.00004315928],"category_scores_gemma":[0.000015445208,0.00027095125,0.00033612002,0.00041627706,0.00006145948,0.0004546123,0.00034426033,0.0002518839,0.000018766246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003228292,0.000105360625,0.00034314292,0.000006554268,0.00047331862,0.00036935537,0.000019452544,0.6524343,4.316206e-7,0.11017088,0.1277683,0.10798611],"study_design_scores_gemma":[0.002881461,0.00031590014,0.0027849053,0.00031967586,0.00010369878,0.0001048309,0.0000122310075,0.60535085,0.0000021968485,0.0043863556,0.38339642,0.0003414849],"about_ca_topic_score_codex":5.0084833e-7,"about_ca_topic_score_gemma":0.0000014442211,"teacher_disagreement_score":0.8711304,"about_ca_system_score_codex":0.00018058206,"about_ca_system_score_gemma":0.000035571844,"threshold_uncertainty_score":0.99997425},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007598804,0.00036432574,0.9899297,0.00038202482,0.0038832705,0.00035856554,0.0000036015463,0.000046812096,0.004271843],"genre_scores_gemma":[0.7528408,0.000092290924,0.24460427,0.0012906177,0.0009353333,0.000025872601,0.0000046279965,0.000015425525,0.00019077383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975433,0.00007164638,0.00092565775,0.00031473156,0.0007204923,0.00042417922],"domain_scores_gemma":[0.9980316,0.00019967744,0.0006773395,0.0003671381,0.00055062486,0.00017360193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014225433,0.00021952804,0.00034395055,0.00016478785,0.0001157582,0.00016414636,0.0017883868,0.00006884758,0.000025421828],"category_scores_gemma":[0.000005188864,0.00019303031,0.00035238883,0.00018333342,0.000048266356,0.0003970872,0.0002718978,0.0002017163,0.0000042149277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015913482,0.0005033607,0.0005711467,0.000028297183,0.0008200683,0.00061976066,0.0004862588,0.62311953,0.0000012996779,0.03148289,0.018961314,0.32181475],"study_design_scores_gemma":[0.0027771243,0.000111243724,0.00014192473,0.00015366495,0.000067655106,0.00005735624,0.000014997884,0.96148306,0.0000026168186,0.027947497,0.0070502344,0.00019263696],"about_ca_topic_score_codex":0.000004191421,"about_ca_topic_score_gemma":0.0000041692906,"teacher_disagreement_score":0.7520809,"about_ca_system_score_codex":0.00012061183,"about_ca_system_score_gemma":0.00009321329,"threshold_uncertainty_score":0.78715473},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10827496,0.00026522673,0.8826497,0.0047828434,0.0030863658,0.00016569847,0.0000014912682,0.000038421356,0.0007352895],"genre_scores_gemma":[0.9827428,0.0002249919,0.015818244,0.00030010619,0.00073280564,0.000005262537,0.00000540598,0.0000070319466,0.00016336536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810743,0.00006409677,0.0007123603,0.00016745148,0.0007673314,0.00018134058],"domain_scores_gemma":[0.9984336,0.000048256345,0.0007535363,0.00016183165,0.00052878703,0.000074010866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005083061,0.00012622558,0.0001973266,0.00019683666,0.00004573973,0.00008804401,0.0010090593,0.000037079953,0.000041971038],"category_scores_gemma":[0.000008213483,0.000108187596,0.00016563784,0.00024354966,0.000040727853,0.0003808958,0.00012457694,0.0001357035,0.000011875645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001317377,0.00029999015,0.00034097632,0.000010538394,0.0006463561,0.00022668974,0.000098216384,0.46059033,0.000018173463,0.2635967,0.0019160052,0.27212426],"study_design_scores_gemma":[0.026111761,0.0015019022,0.12184094,0.0020778573,0.00052787556,0.0008694312,0.00015353409,0.5537809,0.00054727914,0.22568354,0.065408446,0.0014965062],"about_ca_topic_score_codex":9.95402e-7,"about_ca_topic_score_gemma":0.0000027096432,"teacher_disagreement_score":0.87446785,"about_ca_system_score_codex":0.000116848816,"about_ca_system_score_gemma":0.00006834818,"threshold_uncertainty_score":0.4411762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006707659,0.00046916748,0.977477,0.008789391,0.0023533145,0.00023798367,8.506987e-7,0.000081321115,0.0038833008],"genre_scores_gemma":[0.96158856,0.00018480384,0.026367703,0.007833794,0.003544583,0.000017467753,0.000002014886,0.000017513545,0.00044354875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972296,0.00016826391,0.0007710337,0.00030503818,0.0010686147,0.0004574929],"domain_scores_gemma":[0.9976277,0.00020544913,0.0008687045,0.00036584423,0.0007633787,0.00016893826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012424669,0.0002249482,0.000333007,0.00011803302,0.00012656843,0.00034555723,0.0019090599,0.000051284467,0.000049372884],"category_scores_gemma":[0.000011325926,0.00018346221,0.00014306151,0.00049022964,0.000022364986,0.00065623474,0.0002284886,0.00027757452,0.000027204158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005705003,0.00011143198,0.005706089,0.000008901594,0.0009084266,0.0006539225,0.0000721067,0.47969207,0.0000058309033,0.0737132,0.0060608736,0.43249667],"study_design_scores_gemma":[0.016785482,0.0007458849,0.060469273,0.00085621234,0.0003274682,0.0012454332,0.00021904228,0.6453923,0.000005342513,0.011266567,0.2614822,0.0012048096],"about_ca_topic_score_codex":0.000019115854,"about_ca_topic_score_gemma":0.000045610774,"teacher_disagreement_score":0.9548809,"about_ca_system_score_codex":0.00012773353,"about_ca_system_score_gemma":0.0000599188,"threshold_uncertainty_score":0.7481372},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012465191,0.0006221033,0.9767896,0.0024059818,0.0020810047,0.00020963997,0.000007204636,0.0001758005,0.005243464],"genre_scores_gemma":[0.7853295,0.00070834043,0.2123384,0.00048593065,0.0008769192,0.000008515932,0.000002237892,0.00004336318,0.00020675053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979416,0.000017891174,0.00067660684,0.00018914432,0.0007267631,0.00044798793],"domain_scores_gemma":[0.9991477,0.00010958252,0.00014429478,0.00024084703,0.00019957652,0.00015797364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027483137,0.00023417904,0.00032248464,0.00024548382,0.000063926454,0.00004934857,0.0008316432,0.00009342234,0.0000466353],"category_scores_gemma":[0.000048960937,0.0002302639,0.00016985103,0.00022643452,0.000073529634,0.00025317818,0.00021028076,0.00046723743,0.000047658414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009325893,0.00003329385,0.00007233211,0.0000076019937,0.00046531542,0.0007029325,0.000048549267,0.939817,0.00006312281,0.005910304,0.012106824,0.040679432],"study_design_scores_gemma":[0.0021015436,0.00025306805,0.0011866153,0.00040617646,0.0001124482,0.0004951404,0.000049224975,0.89621055,0.00007214321,0.030414471,0.06808688,0.0006117133],"about_ca_topic_score_codex":5.6011504e-7,"about_ca_topic_score_gemma":0.0000019604581,"teacher_disagreement_score":0.77286434,"about_ca_system_score_codex":0.00030549488,"about_ca_system_score_gemma":0.000013554885,"threshold_uncertainty_score":0.9389889},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012319044,0.00060697255,0.992925,0.0021778112,0.0016575116,0.000110432105,0.000001364814,0.000028838138,0.0012601719],"genre_scores_gemma":[0.9148236,0.00012840658,0.08181474,0.00023714239,0.002120813,0.0000030599986,0.0000033155338,0.0000065057125,0.0008624192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988645,0.000029091092,0.00037017302,0.00013666488,0.00042271605,0.00017686859],"domain_scores_gemma":[0.9988638,0.00006574815,0.0003340703,0.00008060896,0.00058617943,0.00006959504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004644962,0.000090815214,0.00011739695,0.00008732833,0.00008602061,0.0003089971,0.00055683963,0.000026665952,0.000006779647],"category_scores_gemma":[0.000028872986,0.000085804306,0.000053070176,0.00026483263,0.000007689922,0.00027111307,0.0001246755,0.00007293611,0.0000047258295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028464545,0.00006218775,0.0018045288,0.000034621433,0.00051700143,0.00002717632,0.0005119843,0.2219013,0.000009454357,0.09704469,0.21086134,0.46719724],"study_design_scores_gemma":[0.001243247,0.00018047655,0.0057671904,0.00025332547,0.00003226249,0.00027267373,0.000039718238,0.72847545,0.000015424412,0.007425303,0.25610638,0.0001885503],"about_ca_topic_score_codex":0.000019476112,"about_ca_topic_score_gemma":0.0000040969317,"teacher_disagreement_score":0.9135917,"about_ca_system_score_codex":0.00015232763,"about_ca_system_score_gemma":0.000024636669,"threshold_uncertainty_score":0.3498998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013319231,0.0009169378,0.9879555,0.002513215,0.0047644936,0.00012074347,6.5323684e-7,0.00006125774,0.002335268],"genre_scores_gemma":[0.9348843,0.0014413971,0.049044713,0.009235259,0.004453808,0.000008161106,0.0000048055663,0.000023095978,0.0009044513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789625,0.000095720876,0.0006025902,0.0002066401,0.0008814961,0.00031730498],"domain_scores_gemma":[0.9985951,0.00015239847,0.00049797085,0.0002560764,0.00039548377,0.000102939615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044188512,0.0001599906,0.00022142605,0.00013950118,0.00013813238,0.00014517558,0.0014055844,0.000053028318,0.00004515947],"category_scores_gemma":[0.000013923089,0.00014163474,0.00015394339,0.00036710183,0.000038475668,0.0005413214,0.00025302268,0.00017183738,0.000034730376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006205884,0.00006611546,0.004190017,0.0000019325284,0.00039614557,0.00038593714,0.000049520695,0.67778367,7.345448e-7,0.16180259,0.14418861,0.011072651],"study_design_scores_gemma":[0.006511247,0.0004435861,0.120198265,0.00041542298,0.00013628419,0.0009047691,0.000040413473,0.13445878,0.0000058757278,0.11028106,0.6258309,0.0007734236],"about_ca_topic_score_codex":0.0000030337724,"about_ca_topic_score_gemma":0.0000023089528,"teacher_disagreement_score":0.9389108,"about_ca_system_score_codex":0.000112810594,"about_ca_system_score_gemma":0.00003688201,"threshold_uncertainty_score":0.5775697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06556513,0.0032986528,0.7470726,0.011485408,0.0096748965,0.0009448669,0.000008039239,0.0013273685,0.16062303],"genre_scores_gemma":[0.80292785,0.00076907396,0.19367456,0.0004865854,0.001640133,0.000010569107,0.0000023151003,0.000037180627,0.00045173577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983286,0.000014676725,0.000548819,0.00014755702,0.0006199508,0.00034036275],"domain_scores_gemma":[0.99937487,0.000065539956,0.00013220673,0.00018430091,0.00013809203,0.00010501171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030008308,0.0001824139,0.00020994434,0.00031764686,0.000046516252,0.00008425649,0.000827586,0.000054588367,0.00012905343],"category_scores_gemma":[0.000027273813,0.00016682279,0.000106723695,0.00028410726,0.000032297037,0.0003114482,0.00025410735,0.000320941,0.00015568675],"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.000025032863,0.000023249735,0.000056738438,0.0000069304456,0.00023573039,0.00014107514,0.000030075445,0.65882224,0.000028929195,0.008783371,0.020590803,0.31125584],"study_design_scores_gemma":[0.0007199632,0.00009649723,0.0016260244,0.00036656696,0.00005624867,0.00006919372,0.00010574495,0.04496713,0.00016843026,0.0040883063,0.94738764,0.00034823114],"about_ca_topic_score_codex":3.8297463e-7,"about_ca_topic_score_gemma":0.0000045804386,"teacher_disagreement_score":0.92679685,"about_ca_system_score_codex":0.00030182247,"about_ca_system_score_gemma":0.0000055969717,"threshold_uncertainty_score":0.6802836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002535071,0.0008069682,0.98928016,0.001845937,0.0035359433,0.0003659612,0.000001148419,0.00005778299,0.0015710138],"genre_scores_gemma":[0.95025355,0.00025015164,0.043296464,0.0012880557,0.004595333,0.00004580178,0.000007643782,0.000020602589,0.00024239867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754184,0.000103860584,0.00092652324,0.00030010293,0.0005909552,0.000536738],"domain_scores_gemma":[0.99838287,0.00028645468,0.0005652035,0.00024162522,0.00044381924,0.000080027494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011879721,0.00020952195,0.0003165555,0.00019144606,0.00009635806,0.00028949638,0.0014452906,0.00007169642,0.000015506348],"category_scores_gemma":[0.000015804662,0.0002002347,0.00022056604,0.00037130772,0.000024360237,0.00043899796,0.00025078704,0.00022228448,0.0000036183103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006720576,0.000058841808,0.00057329715,0.0000037828872,0.000106811254,0.00009341332,0.000013386562,0.5466158,8.410333e-7,0.37057495,0.01643314,0.06545858],"study_design_scores_gemma":[0.0017862403,0.00011812018,0.00211826,0.00016737223,0.0000313643,0.000031725755,0.000025978852,0.7653565,0.0000026043685,0.20018484,0.02995423,0.00022277248],"about_ca_topic_score_codex":0.000018770972,"about_ca_topic_score_gemma":0.00014254381,"teacher_disagreement_score":0.9477185,"about_ca_system_score_codex":0.00019467814,"about_ca_system_score_gemma":0.000040187166,"threshold_uncertainty_score":0.8165334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07612066,0.00001916645,0.90539414,0.0012854767,0.007477352,0.00027075366,0.0000019657111,0.000052496325,0.009377971],"genre_scores_gemma":[0.92457604,0.0000060973407,0.07334541,0.00086733326,0.0010909949,0.0000361852,0.0000013008678,0.0000072661796,0.00006939774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982378,0.000053797074,0.00047465655,0.00022394613,0.000820509,0.0001892861],"domain_scores_gemma":[0.9989784,0.00010248717,0.00024137284,0.0003467052,0.00023674712,0.00009433067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010499599,0.0001232556,0.00017068992,0.00019092271,0.000081693564,0.00042344132,0.0015058911,0.000024599276,0.000004071175],"category_scores_gemma":[0.000032378604,0.00009180172,0.00012982638,0.00016481827,0.000013473598,0.00048476967,0.00025343394,0.00021945484,0.000022388604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000837928,0.00056496926,0.022062255,0.00012246358,0.0003338924,0.0002978852,0.00018489979,0.8162991,0.000016940068,0.06077538,0.025278986,0.07397946],"study_design_scores_gemma":[0.0020010446,0.00051212875,0.03719258,0.0015158904,0.000050523788,0.00031593748,0.00014015652,0.9062392,0.00032767313,0.00065825775,0.050459947,0.00058661954],"about_ca_topic_score_codex":0.0000053453637,"about_ca_topic_score_gemma":8.0516907e-7,"teacher_disagreement_score":0.84845537,"about_ca_system_score_codex":0.00013527206,"about_ca_system_score_gemma":0.0000334818,"threshold_uncertainty_score":0.40832543},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01207657,0.0005463764,0.9823317,0.0007731631,0.0023482286,0.00017845642,0.0000010028168,0.00014445379,0.0016000456],"genre_scores_gemma":[0.9241256,0.00035767906,0.07337084,0.0005433962,0.0013716785,0.0000033709784,0.000010235218,0.000025090754,0.00019212475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978189,0.000053296088,0.00066793995,0.00025958297,0.0009299426,0.00027035217],"domain_scores_gemma":[0.9982897,0.00003295744,0.0008068263,0.0003295392,0.00048102037,0.000059977323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004471664,0.00018302957,0.00019062115,0.00032960405,0.00010337177,0.00032183868,0.0016573794,0.00008489454,0.00007964304],"category_scores_gemma":[0.000010880318,0.00018068682,0.00010428098,0.0005987584,0.000038603153,0.001096725,0.00045891522,0.00017388216,0.000034711837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010848962,0.000066725486,0.0011109508,0.000015108385,0.0002564354,0.00012143174,0.00011869422,0.8681295,0.000014742434,0.09059138,0.00093501253,0.038629156],"study_design_scores_gemma":[0.0036814488,0.00025591408,0.007713683,0.0014874879,0.0001408237,0.00044750015,0.00013945955,0.7053988,0.00026123074,0.21983656,0.059842438,0.0007946486],"about_ca_topic_score_codex":0.000011332038,"about_ca_topic_score_gemma":0.000005728004,"teacher_disagreement_score":0.912049,"about_ca_system_score_codex":0.0006088498,"about_ca_system_score_gemma":0.000074515134,"threshold_uncertainty_score":0.73681945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008143843,0.0002837656,0.98181784,0.0023187036,0.0015383088,0.00024952748,0.0000022338354,0.000039419792,0.005606369],"genre_scores_gemma":[0.91372764,0.00023153886,0.08480874,0.0003932863,0.00038039446,0.000009912049,8.9291296e-7,0.000010237835,0.0004373753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781966,0.00004966346,0.0006035052,0.0002421065,0.0010250201,0.00026002715],"domain_scores_gemma":[0.9985268,0.00006975868,0.0005964733,0.00029956584,0.00041039314,0.0000970014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049467164,0.00016912434,0.0002321533,0.00020162208,0.000055733715,0.00012107216,0.0017480131,0.000032442036,0.00002380287],"category_scores_gemma":[0.000006889569,0.00013907038,0.00012104723,0.00031310724,0.000055631983,0.0004477406,0.00030129496,0.00015583051,0.000012530625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018110526,0.0002062422,0.00067375775,0.000020594667,0.0010096582,0.0005774339,0.00015340283,0.5046968,0.000008748626,0.17194922,0.0013124313,0.31921062],"study_design_scores_gemma":[0.072275475,0.004812493,0.2193374,0.011632925,0.0012403474,0.0023844994,0.0014019106,0.35554728,0.0011002813,0.1479098,0.17879798,0.0035596155],"about_ca_topic_score_codex":0.0000058966043,"about_ca_topic_score_gemma":0.000018299226,"teacher_disagreement_score":0.9055838,"about_ca_system_score_codex":0.00014914034,"about_ca_system_score_gemma":0.00004519274,"threshold_uncertainty_score":0.56711257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14069673,0.0034013574,0.82190543,0.007836878,0.0062817037,0.0014332866,0.000005732093,0.0004741639,0.017964687],"genre_scores_gemma":[0.97593176,0.0001652949,0.022790495,0.00035994448,0.00058197725,0.000009792641,0.000003676038,0.000009754526,0.00014728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985561,0.000029101346,0.00046265387,0.00020643538,0.0005821957,0.00016352467],"domain_scores_gemma":[0.9991069,0.000024179797,0.00044379928,0.00020576795,0.00017397414,0.000045369226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034953802,0.00012013479,0.00012266739,0.00016384858,0.00005898073,0.00021958578,0.00094845577,0.000046924568,0.000020763095],"category_scores_gemma":[0.0000067127335,0.00011020662,0.00004794294,0.00021593377,0.00003642027,0.0006346415,0.00040602736,0.000115157214,0.000012981612],"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.0003739501,0.00037631593,0.0019809622,0.00004086348,0.00086191064,0.0005814705,0.001385793,0.5041747,0.00011836515,0.36039487,0.0057073687,0.12400341],"study_design_scores_gemma":[0.024819078,0.0028725918,0.049198378,0.0033568693,0.00014370731,0.0010675141,0.0009329341,0.11229353,0.0054854443,0.457676,0.34018093,0.0019730171],"about_ca_topic_score_codex":0.0000056907393,"about_ca_topic_score_gemma":0.0000033269775,"teacher_disagreement_score":0.83523506,"about_ca_system_score_codex":0.00017432177,"about_ca_system_score_gemma":0.00002104491,"threshold_uncertainty_score":0.44940957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025994955,0.00039564157,0.98618245,0.0032885722,0.0030171445,0.00018329195,0.0000014913632,0.000038616014,0.0042932765],"genre_scores_gemma":[0.64071554,0.00021587398,0.35476837,0.0010866834,0.0025805,0.000016321053,0.0000018826541,0.000015783047,0.0005990665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824554,0.00003662187,0.0005595719,0.00019417267,0.00069089636,0.00027317714],"domain_scores_gemma":[0.99864715,0.00028930456,0.00044609598,0.00020886732,0.00033081812,0.00007773619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082832633,0.0001298341,0.00019210759,0.00023653779,0.00007975335,0.0002405596,0.0018639691,0.00003211426,0.0000100119905],"category_scores_gemma":[0.00007013343,0.00011365243,0.0001693716,0.0002442291,0.00001602733,0.00031140624,0.00025516347,0.0001338955,0.000005143298],"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.0000858252,0.00009795732,0.0007588064,0.00001783918,0.0005453184,0.0005930939,0.00075819675,0.30462128,0.00004613067,0.028554082,0.017547404,0.64637405],"study_design_scores_gemma":[0.0027222557,0.00039321207,0.0011253969,0.00086965255,0.00006534833,0.0017395552,0.00020686175,0.20325513,0.000039128947,0.07281661,0.7163357,0.0004311134],"about_ca_topic_score_codex":0.0000010474413,"about_ca_topic_score_gemma":0.0000030610706,"teacher_disagreement_score":0.69878834,"about_ca_system_score_codex":0.00011998753,"about_ca_system_score_gemma":0.000032034968,"threshold_uncertainty_score":0.46346116},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015242143,0.0011325518,0.9899834,0.0031734344,0.0018871343,0.000110031346,8.008457e-7,0.000023079216,0.002165376],"genre_scores_gemma":[0.9554577,0.00044851936,0.042457733,0.00087272975,0.0004895539,0.000003564469,3.216476e-7,0.0000075817115,0.00026232775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985208,0.00007506376,0.00052527856,0.00016029099,0.0005384533,0.00018010533],"domain_scores_gemma":[0.99892014,0.00012820268,0.00048041248,0.00016013955,0.000234763,0.0000763589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055643683,0.00012310884,0.00023094774,0.00012916134,0.00003346084,0.0001082637,0.00091689476,0.00003827327,0.00007527965],"category_scores_gemma":[0.000011088539,0.00010738482,0.00011080113,0.00013392852,0.00002948767,0.00023658285,0.00017285872,0.00014793954,0.0000075693038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006674505,0.00008310692,0.0002195935,0.00000684332,0.00071920943,0.0001612316,0.00021937434,0.046942994,0.00002062188,0.09703656,0.0051585445,0.8493652],"study_design_scores_gemma":[0.002689625,0.00019535031,0.0006877099,0.00027764932,0.00006847248,0.00012476745,0.000044246917,0.96193695,0.000013917636,0.018164326,0.015636079,0.00016088203],"about_ca_topic_score_codex":0.0000012164776,"about_ca_topic_score_gemma":0.0000021343765,"teacher_disagreement_score":0.9539335,"about_ca_system_score_codex":0.00004215767,"about_ca_system_score_gemma":0.0000066293405,"threshold_uncertainty_score":0.43790257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004197044,0.0021190457,0.9415908,0.0073039755,0.006901727,0.00023689738,4.983772e-7,0.0001722854,0.037477735],"genre_scores_gemma":[0.84478456,0.00040344737,0.15018246,0.0009314268,0.002287023,0.0000075647163,5.932069e-7,0.000012232261,0.0013907074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.000067673696,0.00058581395,0.00020987028,0.0007804588,0.00028686822],"domain_scores_gemma":[0.9987422,0.00008587201,0.0004557021,0.00023133335,0.00037043,0.00011444223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054587255,0.00015282308,0.00018970517,0.00016730843,0.000092465896,0.00027418692,0.0013221883,0.00003585718,0.00016471223],"category_scores_gemma":[0.000013684665,0.00013937605,0.00016244627,0.00025131073,0.000018091036,0.00047030754,0.00032624358,0.00019213898,0.00010032267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021301066,0.00021219821,0.000559165,0.000012929796,0.0008879838,0.00031793138,0.00037952114,0.037240777,0.000006851447,0.11296668,0.05063718,0.79675746],"study_design_scores_gemma":[0.0015240551,0.00009655194,0.0004501246,0.00027263258,0.000040207084,0.00014013868,0.000048280013,0.7779017,0.000010111944,0.0024730891,0.21682028,0.00022284087],"about_ca_topic_score_codex":3.43629e-7,"about_ca_topic_score_gemma":0.0000010569287,"teacher_disagreement_score":0.8405875,"about_ca_system_score_codex":0.00016234891,"about_ca_system_score_gemma":0.000012136102,"threshold_uncertainty_score":0.568359},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006254161,0.00019858513,0.96919477,0.017513933,0.003144643,0.00023877725,0.0000015677807,0.00006590323,0.0033876812],"genre_scores_gemma":[0.48414657,0.00012546364,0.49558184,0.0010935331,0.0033173028,0.0000276964,0.0000024733058,0.000031880667,0.015673239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809813,0.000054425793,0.00058090343,0.00026866258,0.00070003193,0.0002978205],"domain_scores_gemma":[0.9986013,0.00016571894,0.00052269286,0.00030235422,0.00031824608,0.00008964657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008718065,0.00015958097,0.0001864368,0.00022629082,0.00009243928,0.00023651953,0.0017887475,0.000037869646,0.000031218042],"category_scores_gemma":[0.000034761935,0.00011179116,0.00020140594,0.00019424742,0.000028922717,0.00013743059,0.0005360863,0.000079565594,0.000052128995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067927394,0.00009147074,0.000055884095,0.000009094005,0.00043884048,0.00005956131,0.000066124114,0.3112107,0.000026444755,0.016147207,0.05826827,0.6135585],"study_design_scores_gemma":[0.004391093,0.00034410568,0.004023409,0.002219301,0.00015167927,0.00018362126,0.00005040097,0.6911978,0.00015459876,0.043746896,0.25288326,0.0006538472],"about_ca_topic_score_codex":0.0000012900827,"about_ca_topic_score_gemma":4.3109475e-7,"teacher_disagreement_score":0.61290467,"about_ca_system_score_codex":0.00023467181,"about_ca_system_score_gemma":0.000024366362,"threshold_uncertainty_score":0.45587113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019532429,0.00022703664,0.9758381,0.0028397772,0.0010315884,0.000087687724,0.0000049171545,0.000019364306,0.00041905648],"genre_scores_gemma":[0.95615244,0.0009722439,0.04143763,0.000531917,0.00067977543,0.000003272663,0.0000035817757,0.000010271758,0.00020885658],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988882,0.00003885564,0.0002924304,0.00021139091,0.0004041966,0.00016493679],"domain_scores_gemma":[0.99925065,0.000110043955,0.00023978218,0.00026240654,0.000089267116,0.000047849604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044986766,0.00009472462,0.00011789452,0.00016609245,0.000025859226,0.0001395496,0.0010089924,0.000024604557,0.000011509826],"category_scores_gemma":[0.000010781731,0.00006008989,0.000019263949,0.00015777558,0.000021166872,0.00082259247,0.00047032264,0.00009528621,0.0000054767584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025647858,0.000054419303,0.0077256705,0.0000061179226,0.0002639696,0.00060029683,0.000048517228,0.0075869192,0.000012055342,0.0021866923,0.007167809,0.97409105],"study_design_scores_gemma":[0.015441777,0.0022355816,0.24319796,0.00413321,0.0001393777,0.0027713012,0.0002642536,0.05616851,0.00010268426,0.052463885,0.6217277,0.0013537703],"about_ca_topic_score_codex":0.000007886233,"about_ca_topic_score_gemma":0.00017119097,"teacher_disagreement_score":0.9727373,"about_ca_system_score_codex":0.000071619776,"about_ca_system_score_gemma":0.000015215594,"threshold_uncertainty_score":0.24503946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044099884,0.0007839036,0.84392256,0.10843819,0.0085461205,0.00096551067,0.00026177763,0.000051722745,0.032620214],"genre_scores_gemma":[0.7218554,0.010047957,0.25163335,0.0051950994,0.007941352,0.00004697457,0.00012038981,0.000041331743,0.0031181797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768066,0.000022022028,0.0007172176,0.00035212017,0.000996548,0.00023145173],"domain_scores_gemma":[0.9963348,0.00023304837,0.0011425416,0.0016891919,0.000528512,0.00007188612],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026490884,0.00012074387,0.00021562955,0.00015597799,0.00037620397,0.0010566218,0.0071322387,0.000045148023,0.000021026155],"category_scores_gemma":[0.00017601973,0.00009268962,0.000068994355,0.0001889862,0.0000807926,0.0004600022,0.0039143595,0.000115202805,0.000017273871],"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.00005017982,0.000032934233,0.0014801277,0.000006304218,0.00040328124,0.00003354801,0.0000057290094,0.0036559973,3.7355014e-7,0.040090207,0.29184872,0.6623926],"study_design_scores_gemma":[0.00056727126,0.000025948235,0.021459894,0.00006668943,0.0000940416,0.000016909911,0.00015848331,0.011619869,7.293855e-7,0.1185877,0.84730726,0.00009520551],"about_ca_topic_score_codex":0.000006592812,"about_ca_topic_score_gemma":0.00007544146,"teacher_disagreement_score":0.7174454,"about_ca_system_score_codex":0.000035076875,"about_ca_system_score_gemma":0.000011678058,"threshold_uncertainty_score":0.9999804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033903948,0.00009074692,0.98454165,0.0022678366,0.0009204264,0.00007043298,1.3622412e-7,0.000075469456,0.00864292],"genre_scores_gemma":[0.89040375,0.00018663176,0.10864736,0.00029887405,0.00018600025,0.0000038839657,0.0000011020896,0.0000066419893,0.00026576707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986466,0.00006983081,0.0004398919,0.00016979249,0.00048332568,0.00019053044],"domain_scores_gemma":[0.9992097,0.000057421505,0.00034856118,0.00015103848,0.00020307967,0.000030169871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059422187,0.00009927366,0.00013434373,0.00036738496,0.000030545525,0.00012224421,0.0015561866,0.000044069417,0.00002234725],"category_scores_gemma":[0.0000297532,0.00009354648,0.000045804467,0.0004801169,0.000022235354,0.00040836487,0.00032175894,0.00019214292,0.000027038832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002210336,0.00007560186,0.0033224348,0.0000061034375,0.000111355024,0.0000540985,0.000030876177,0.2233022,0.000025681118,0.17999002,0.0064237434,0.58663577],"study_design_scores_gemma":[0.0012300963,0.00017159316,0.049528062,0.00025135465,0.000013145214,0.000100678146,0.000018901688,0.7950557,0.000053004504,0.080192015,0.07313606,0.00024937314],"about_ca_topic_score_codex":0.000003533511,"about_ca_topic_score_gemma":0.000036567926,"teacher_disagreement_score":0.8870133,"about_ca_system_score_codex":0.00025060773,"about_ca_system_score_gemma":0.000017843426,"threshold_uncertainty_score":0.38147146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015422984,0.00007562125,0.976207,0.0042148232,0.0020525844,0.00020673094,0.000011051359,0.000047773457,0.0017614283],"genre_scores_gemma":[0.9764634,0.00007267079,0.022355108,0.0003237426,0.000653078,0.0000050033495,0.00003189823,0.000006253512,0.000088888955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997656,0.000057220233,0.0005486497,0.00024026031,0.0012531485,0.00024470565],"domain_scores_gemma":[0.9963802,0.000029088136,0.0016193291,0.0012607005,0.0005970056,0.00011367884],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011362633,0.00017396353,0.00027827342,0.0005378518,0.00032340514,0.0020144817,0.0044544428,0.00008408129,0.000015614996],"category_scores_gemma":[0.000022536016,0.0001397617,0.00015006425,0.00036855898,0.00004521174,0.003913187,0.0008998608,0.00035351719,0.000009143168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013615991,0.0005234279,0.065468796,0.00019281755,0.01511143,0.0015936441,0.0007209649,0.47364756,0.000004062718,0.051328596,0.05058553,0.33946157],"study_design_scores_gemma":[0.0011069145,0.0002001364,0.035484422,0.00024608098,0.00054007524,0.000068173205,0.00010885766,0.9349154,0.0000063255707,0.000091497444,0.027041024,0.00019108594],"about_ca_topic_score_codex":0.000024767221,"about_ca_topic_score_gemma":0.00005451826,"teacher_disagreement_score":0.9610404,"about_ca_system_score_codex":0.00018953985,"about_ca_system_score_gemma":0.00006279002,"threshold_uncertainty_score":0.99902153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053136256,0.00026575447,0.9753484,0.0019417246,0.0037651528,0.00020127074,6.7878415e-7,0.000029747976,0.013133642],"genre_scores_gemma":[0.89064366,0.000133386,0.10583608,0.001308422,0.0018280689,0.000014754583,0.0000021851477,0.000014278711,0.0002191609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979256,0.000059060974,0.0006313261,0.0002940675,0.0006966291,0.00039331891],"domain_scores_gemma":[0.9983459,0.00010529588,0.00063204777,0.0005486958,0.0002152071,0.00015283663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100027,0.00017379018,0.00025845264,0.000227593,0.00017376173,0.00086235447,0.003545378,0.00005394234,0.0000064506685],"category_scores_gemma":[0.000077441684,0.00015986916,0.00013264165,0.00020033016,0.000035831592,0.0005547061,0.0010741019,0.00030661348,0.000014750775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052968848,0.00014475848,0.011966176,0.0000093676435,0.00021828605,0.0005133656,0.00017866696,0.7797758,6.563629e-7,0.050604574,0.021061778,0.1354736],"study_design_scores_gemma":[0.0024328383,0.0001710255,0.2020592,0.0010482377,0.000042144005,0.00022424987,0.0000797948,0.7418973,0.00000218967,0.017516363,0.03397273,0.00055395986],"about_ca_topic_score_codex":0.000016956574,"about_ca_topic_score_gemma":0.000011282706,"teacher_disagreement_score":0.88533,"about_ca_system_score_codex":0.00015210698,"about_ca_system_score_gemma":0.000022609554,"threshold_uncertainty_score":0.83157045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003036443,0.00065430143,0.53543097,0.05924225,0.13663884,0.0018551216,0.0000063937646,0.0002816378,0.2628541],"genre_scores_gemma":[0.754041,0.0035782326,0.07860137,0.0025968982,0.15892914,0.000074450276,0.0000051964025,0.00004697519,0.0021267186],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848837,0.000035514677,0.00044501165,0.0002488715,0.00051796803,0.00026425725],"domain_scores_gemma":[0.9982133,0.00007527952,0.00090945145,0.0004944197,0.0002646235,0.000042917047],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010029222,0.00013977945,0.00020683766,0.00016583818,0.0005454296,0.0015116051,0.0057080565,0.0000612102,0.000039011247],"category_scores_gemma":[0.000050107075,0.00012781184,0.00014336225,0.000094215044,0.00004656325,0.0010552324,0.0019592284,0.0002355615,0.000013942128],"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.00015145524,0.000060467624,0.00008743607,0.000005114545,0.00019399037,0.000082783474,0.000087157954,0.004253477,6.9688906e-7,0.080919184,0.2933397,0.62081856],"study_design_scores_gemma":[0.0007473553,0.00018846887,0.0003731664,0.00024394557,0.000013833509,0.000023889357,0.000045527016,0.01779087,0.00003977289,0.09693529,0.88346547,0.00013240326],"about_ca_topic_score_codex":0.0000056679305,"about_ca_topic_score_gemma":0.000015912536,"teacher_disagreement_score":0.7510046,"about_ca_system_score_codex":0.00011483206,"about_ca_system_score_gemma":0.000016527274,"threshold_uncertainty_score":0.9996715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039619603,0.0008889591,0.9853199,0.0025697355,0.0052805822,0.00018040313,0.000001065019,0.00009117095,0.0017062131],"genre_scores_gemma":[0.8667679,0.00028518622,0.12578288,0.0050077536,0.0019391985,0.000012275151,0.0000054789925,0.000026519147,0.0001728396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967441,0.00012488381,0.0009589133,0.0003956593,0.0012001088,0.00057631545],"domain_scores_gemma":[0.9976817,0.00046695647,0.0006096464,0.00043136455,0.0006483686,0.00016199557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015602433,0.00027785887,0.00036656618,0.00035867214,0.00010894706,0.00034491537,0.0021917985,0.00009743588,0.00011054445],"category_scores_gemma":[0.00012031722,0.00025362102,0.00020962131,0.00071508915,0.00007119494,0.0005932726,0.00054378144,0.00035642524,0.000031320928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034562885,0.00026174393,0.10409463,0.00001607266,0.00045272382,0.001414242,0.00016959837,0.65190464,0.0000023626044,0.0092818085,0.11958911,0.1124674],"study_design_scores_gemma":[0.004611615,0.00055496435,0.12742999,0.0015218849,0.00006651015,0.00016651755,0.00002670333,0.7668091,0.000020227597,0.015431044,0.08265863,0.0007027812],"about_ca_topic_score_codex":0.000019003184,"about_ca_topic_score_gemma":0.0000739081,"teacher_disagreement_score":0.8628059,"about_ca_system_score_codex":0.00040206176,"about_ca_system_score_gemma":0.0001292922,"threshold_uncertainty_score":0.9999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006386785,0.000065788656,0.99445397,0.0008086652,0.002863004,0.00018811738,0.0000024399174,0.000029753524,0.0009495847],"genre_scores_gemma":[0.71880794,0.000028306737,0.2762715,0.0016155944,0.0030288359,0.000010847949,0.0000048512497,0.000011910161,0.00022020304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806273,0.00014036539,0.0006454663,0.00022820717,0.00064735033,0.0002758791],"domain_scores_gemma":[0.9980157,0.00022384958,0.0006516785,0.00018703812,0.00084751385,0.00007419419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013312609,0.00014727483,0.00019390504,0.00014004721,0.00013307863,0.00027125928,0.00090768054,0.000046637924,0.000018036735],"category_scores_gemma":[0.00003662398,0.00013887796,0.00016303608,0.00019993745,0.0000404462,0.00041358222,0.0002552711,0.00015648319,0.0000034635195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009196624,0.0005422972,0.0023847197,0.000057039888,0.0016831611,0.00011730557,0.0003693285,0.54495406,0.000026150792,0.09928645,0.068409815,0.28125],"study_design_scores_gemma":[0.0010553594,0.0003969762,0.0066091684,0.00012914102,0.000040546616,0.000012445803,0.000042826712,0.9685655,0.000034315806,0.0027509897,0.02019913,0.00016355517],"about_ca_topic_score_codex":0.000017455377,"about_ca_topic_score_gemma":0.000047629943,"teacher_disagreement_score":0.71818244,"about_ca_system_score_codex":0.00028142618,"about_ca_system_score_gemma":0.000053251984,"threshold_uncertainty_score":0.5663279},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010369844,0.00014021194,0.9792033,0.0013966507,0.0069464343,0.00008348003,4.3685455e-7,0.000046219502,0.0018134568],"genre_scores_gemma":[0.96276784,0.000020240965,0.031838406,0.0012639036,0.0037917383,0.0000034922564,0.0000027223311,0.000009129924,0.00030250975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850297,0.000076047414,0.0004147953,0.00017389125,0.00063846743,0.0001938533],"domain_scores_gemma":[0.9988772,0.000043778262,0.0004071172,0.00025427126,0.00035666567,0.000060923983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401148,0.00010086882,0.00010436366,0.00014547814,0.00009320626,0.00030981837,0.001233058,0.000032950622,0.00003548253],"category_scores_gemma":[0.000007867687,0.000093501054,0.00010325994,0.00028369395,0.000027656344,0.0007685165,0.00017538291,0.0001235862,0.00003279991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011159574,0.00008161321,0.00048965495,0.0000063689254,0.00027207972,0.00015176967,0.00028649796,0.74452907,0.00010748157,0.025146862,0.04299781,0.18581916],"study_design_scores_gemma":[0.00050773163,0.000115677336,0.0049990835,0.00007088795,0.000026233547,0.00004994515,0.000016610269,0.9642793,0.00014197451,0.017156916,0.01250048,0.00013517437],"about_ca_topic_score_codex":0.000009805544,"about_ca_topic_score_gemma":0.000011241773,"teacher_disagreement_score":0.952398,"about_ca_system_score_codex":0.00009115263,"about_ca_system_score_gemma":0.000013708586,"threshold_uncertainty_score":0.38128623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18229695,0.000071181596,0.8060783,0.005310244,0.005587079,0.0005987138,6.799744e-7,0.0000129093605,0.000043923646],"genre_scores_gemma":[0.87291706,0.0000131784755,0.11679444,0.0035444882,0.006692971,0.000022018614,0.000004252045,0.000008837947,0.000002750578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988744,0.00006585414,0.00042032203,0.00018452527,0.0002914903,0.0001633861],"domain_scores_gemma":[0.99873555,0.0005328137,0.00032692324,0.00007328099,0.00028533515,0.000046072913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095992896,0.0001035813,0.0001412845,0.00008524162,0.00011963862,0.00025959784,0.00059837237,0.000027964727,4.0865737e-7],"category_scores_gemma":[0.000048765964,0.00008586081,0.000061495564,0.00026633378,0.00000792724,0.00022176995,0.00019610289,0.00015728916,0.0000013330673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006973395,0.00065739744,0.0032077122,0.00024920012,0.001000321,0.0031392048,0.066599295,0.0972128,0.000005581155,0.013549892,0.05288977,0.7607915],"study_design_scores_gemma":[0.0029304198,0.000777406,0.001582427,0.00035606287,0.00009238073,0.0007555941,0.0071945908,0.91652817,0.0000028590257,0.06048122,0.009056009,0.00024288736],"about_ca_topic_score_codex":0.0000074727345,"about_ca_topic_score_gemma":0.0000060216307,"teacher_disagreement_score":0.8193154,"about_ca_system_score_codex":0.00004944267,"about_ca_system_score_gemma":0.000013835925,"threshold_uncertainty_score":0.35013023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007205804,0.00016532268,0.96168387,0.02749786,0.0007135885,0.00012929445,0.0000030786991,0.00005836751,0.0025428333],"genre_scores_gemma":[0.9087662,0.00005586773,0.08527756,0.005038357,0.0005109309,0.000013372312,9.848343e-7,0.000008667463,0.0003280778],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987875,0.000027701895,0.0003972402,0.00021639842,0.00038586883,0.00018528577],"domain_scores_gemma":[0.9992404,0.000034918594,0.00016776138,0.00018845632,0.00022736634,0.00014112671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024074949,0.00010799343,0.00014950868,0.00017545238,0.00008797815,0.00012383447,0.0015581585,0.0000442729,0.00024747732],"category_scores_gemma":[0.00000543247,0.000102839746,0.00011666642,0.00040745607,0.000022028287,0.00020789134,0.00017094618,0.00023650478,0.00008134234],"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.00007906183,0.0003218559,0.000407306,0.000024548084,0.0010776429,0.00029202845,0.0019553918,0.08978918,0.0003865582,0.09976644,0.0766763,0.72922367],"study_design_scores_gemma":[0.00083696796,0.00016645639,0.0024188021,0.00006104665,0.00005017155,0.00016750867,0.00018947572,0.06191988,0.0003063256,0.009370424,0.9242021,0.00031088747],"about_ca_topic_score_codex":0.0000011842476,"about_ca_topic_score_gemma":0.000003094231,"teacher_disagreement_score":0.90156037,"about_ca_system_score_codex":0.00006402646,"about_ca_system_score_gemma":0.0000163372,"threshold_uncertainty_score":0.4193683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10017905,0.00017303464,0.89329696,0.003666979,0.0022623537,0.00021364936,8.301859e-7,0.000041733638,0.00016539203],"genre_scores_gemma":[0.9878072,0.0007487989,0.009821751,0.0004573824,0.0011051751,0.000028405546,0.0000019743388,0.00000800102,0.00002128316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882424,0.000040192877,0.00044921145,0.00020614422,0.00035877057,0.00012142402],"domain_scores_gemma":[0.99905604,0.000045590285,0.0004044589,0.00011033737,0.00030669908,0.00007688573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037757217,0.00009217527,0.00010979429,0.00012603076,0.00010461425,0.000244488,0.0004432383,0.00002998794,0.000004052228],"category_scores_gemma":[0.000025021398,0.00009213034,0.000076329256,0.00019868041,0.000016269516,0.0011517594,0.00013962177,0.00011142144,0.0000052688865],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002517928,0.00008166351,0.001172834,0.00003168405,0.00025742748,0.000037688194,0.00087716454,0.0056733033,0.0013364739,0.03774638,0.0018590399,0.95067453],"study_design_scores_gemma":[0.0032508676,0.0011057929,0.23381546,0.00024767235,0.0002025326,0.00026747145,0.00049884064,0.6474494,0.0031207134,0.028500298,0.08090859,0.00063237094],"about_ca_topic_score_codex":0.0000019783768,"about_ca_topic_score_gemma":0.0000037026032,"teacher_disagreement_score":0.9500422,"about_ca_system_score_codex":0.000073651434,"about_ca_system_score_gemma":0.000008549985,"threshold_uncertainty_score":0.37569666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048060697,0.0003951578,0.9593597,0.03139023,0.0015699823,0.00009951438,0.0000029448436,0.000051115552,0.0023252903],"genre_scores_gemma":[0.9151881,0.00015760392,0.07443635,0.008826188,0.0012407446,0.000002879994,0.0000041566254,0.000009313484,0.0001347122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982796,0.0001332333,0.00050908985,0.00017996607,0.00062301086,0.00027514348],"domain_scores_gemma":[0.99886787,0.0000987692,0.0004614956,0.00012355487,0.00031104998,0.00013728527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747927,0.00012165858,0.00017445543,0.000055549768,0.00008684894,0.00022308149,0.0011516486,0.00005336494,0.000050416544],"category_scores_gemma":[0.000059459708,0.00011565649,0.0001339581,0.00024064185,0.000021473676,0.00030269197,0.00029103458,0.00028797425,0.0000337663],"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.00027105058,0.00013133948,0.0036039767,0.000025958496,0.0009874105,0.0011206139,0.0018193426,0.13125327,0.00034792238,0.758103,0.031627785,0.07070829],"study_design_scores_gemma":[0.0021997357,0.00025431407,0.0045984806,0.00031777786,0.00007174263,0.0002181865,0.00017662493,0.21120892,0.0009713687,0.034208477,0.7453856,0.00038878864],"about_ca_topic_score_codex":0.0000031550085,"about_ca_topic_score_gemma":0.0000012826339,"teacher_disagreement_score":0.910382,"about_ca_system_score_codex":0.0001666824,"about_ca_system_score_gemma":0.0000493978,"threshold_uncertainty_score":0.47163346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015376575,0.0128198005,0.4659645,0.36546063,0.119560316,0.0016747195,0.000042683758,0.00015411443,0.018946642],"genre_scores_gemma":[0.47946745,0.026978472,0.07706638,0.0026679388,0.4136161,0.0000572834,0.0000037954728,0.000024474082,0.00011810881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992474,0.000018277859,0.00026372285,0.0001270909,0.00026077317,0.00008274921],"domain_scores_gemma":[0.9993744,0.00007917972,0.00023285739,0.000081938735,0.00018004263,0.000051616116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028637712,0.00007139101,0.00013347712,0.00008383633,0.000032656695,0.000028742661,0.0004925203,0.000041706433,0.000005479835],"category_scores_gemma":[0.000017094391,0.000065491244,0.000037136746,0.00003734673,0.000052050156,0.000054141445,0.0002128239,0.00009612292,4.3527416e-7],"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.00005690767,0.000038558654,0.0000060074326,0.000016969736,0.00010745861,0.0000071970085,0.00035587698,0.00016936382,0.0000016949242,0.51389915,0.09115394,0.3941869],"study_design_scores_gemma":[0.0006997752,0.0003937235,0.00013287795,0.000053290998,0.000016617516,0.000008350812,0.00016643523,0.005378685,0.000023241864,0.0709946,0.92205644,0.000075951015],"about_ca_topic_score_codex":3.055977e-7,"about_ca_topic_score_gemma":5.9365414e-7,"teacher_disagreement_score":0.8309025,"about_ca_system_score_codex":0.000011068417,"about_ca_system_score_gemma":0.000010811854,"threshold_uncertainty_score":0.26706555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036497496,0.0019160154,0.9339153,0.021743616,0.0022596077,0.000105919375,0.0000015889631,0.00008871283,0.0034717023],"genre_scores_gemma":[0.8443309,0.00087645295,0.15297514,0.001233692,0.00032616028,0.00000679281,0.000002041764,0.000006865553,0.00024196239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987443,0.00005509926,0.00040658718,0.00017454613,0.00043575105,0.0001836841],"domain_scores_gemma":[0.9988858,0.000054550368,0.00027692804,0.00030121114,0.00042139992,0.00006009566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040084077,0.00009044203,0.000144298,0.00012463024,0.000061304585,0.00011896666,0.0014278269,0.000047489317,0.000058538142],"category_scores_gemma":[0.000020437265,0.00008544607,0.000115939634,0.00034152748,0.00003103391,0.000091886024,0.00045364638,0.00016252481,0.000015279464],"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.000016947472,0.00020065997,0.0005207234,0.0000044461913,0.0004561773,0.00096355897,0.000114096794,0.0043883305,0.000036927162,0.8242653,0.015622496,0.15341032],"study_design_scores_gemma":[0.0021432326,0.00007369434,0.0051685665,0.00015517455,0.000064006315,0.0010173795,0.00026093895,0.033261817,0.001220475,0.36419412,0.5921049,0.0003356736],"about_ca_topic_score_codex":0.0000015349664,"about_ca_topic_score_gemma":0.0000044208255,"teacher_disagreement_score":0.8078334,"about_ca_system_score_codex":0.00006631349,"about_ca_system_score_gemma":0.00003692517,"threshold_uncertainty_score":0.34843895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074686804,0.0014095256,0.9753998,0.0069805896,0.0073300553,0.00030328348,0.000006732262,0.000074708245,0.0010266306],"genre_scores_gemma":[0.9663818,0.000419487,0.029593581,0.0019153678,0.0013320042,0.000048121226,0.000026932179,0.000016657603,0.00026606748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971921,0.0001976849,0.00075386115,0.0002381003,0.0012556093,0.0003626409],"domain_scores_gemma":[0.99864596,0.00020899653,0.00059550616,0.00023396256,0.00023750305,0.000078057165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015360139,0.00015560437,0.00027177733,0.00018176263,0.00014678831,0.000186784,0.001698101,0.000030119325,0.00008912728],"category_scores_gemma":[0.000033013454,0.00015304604,0.00017922164,0.0006962171,0.000019933444,0.00034158284,0.00072825706,0.0003514656,0.0000063441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027673223,0.000121740544,0.008271304,0.0000022298054,0.00026844128,0.0005390502,0.000091613525,0.86037165,0.0000010330775,0.01594643,0.088734284,0.025375508],"study_design_scores_gemma":[0.008598585,0.00042545845,0.04711969,0.00017244206,0.000063736414,0.00024352311,0.00012245323,0.32792863,0.0000016537572,0.0518591,0.5629565,0.00050822133],"about_ca_topic_score_codex":0.000022247938,"about_ca_topic_score_gemma":0.00003878628,"teacher_disagreement_score":0.9589131,"about_ca_system_score_codex":0.00062577246,"about_ca_system_score_gemma":0.00008421552,"threshold_uncertainty_score":0.62410367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043468084,0.00035752167,0.9893637,0.0020702991,0.002590642,0.00011403626,0.0000015472965,0.000018581115,0.0011368789],"genre_scores_gemma":[0.94541746,0.00012484624,0.052444372,0.0014116411,0.000396379,0.000017833663,0.0000085450965,0.000010884513,0.00016801835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810904,0.00009907006,0.00043581298,0.00017824149,0.0009721065,0.0002056995],"domain_scores_gemma":[0.99937344,0.00004439788,0.00031822964,0.0001740847,0.000040223666,0.000049611015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064342,0.000103076345,0.00012939016,0.0002571337,0.00007713649,0.000098949145,0.0014196949,0.000017850267,0.00015330805],"category_scores_gemma":[0.0000075235025,0.000105933956,0.00008667036,0.0003374884,0.000014165889,0.00026404587,0.0006618929,0.00020575286,0.000006634546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043137654,0.00014171256,0.0021663997,0.0000019632173,0.00008023587,0.00044152187,0.000055428474,0.9015002,0.0000010939815,0.0071238773,0.0057365503,0.08270787],"study_design_scores_gemma":[0.0025226346,0.00032729455,0.026644513,0.000089737376,0.00002306127,0.00010618292,0.000059472528,0.76223546,0.000011211592,0.0052023097,0.20250295,0.00027520026],"about_ca_topic_score_codex":0.000004930477,"about_ca_topic_score_gemma":0.000001333609,"teacher_disagreement_score":0.9410707,"about_ca_system_score_codex":0.00044757145,"about_ca_system_score_gemma":0.000040281873,"threshold_uncertainty_score":0.43198615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015404369,0.0013243195,0.9598209,0.0017900221,0.01952883,0.00031498433,0.000002806237,0.0003199935,0.0014937501],"genre_scores_gemma":[0.7577611,0.004604127,0.22358805,0.0023705568,0.010734284,0.00005952692,0.000029473917,0.000100714606,0.0007521303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996439,0.00014477142,0.0009515363,0.00043256368,0.0011448396,0.0008873079],"domain_scores_gemma":[0.9979456,0.00070938934,0.0005181769,0.00042233718,0.00023513412,0.00016935638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017725414,0.0002982674,0.00040066452,0.00050406926,0.00015247322,0.00026997548,0.0020392288,0.00011199866,0.000021992697],"category_scores_gemma":[0.00007169436,0.00028723895,0.00024369218,0.0015140922,0.000023809089,0.00045916537,0.00085873046,0.00053587486,0.000063078616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010714803,0.000089131136,0.018388081,0.000005563382,0.00019581527,0.0009430717,0.00011706728,0.83500546,2.3396328e-7,0.004523859,0.057993155,0.082631394],"study_design_scores_gemma":[0.0035225458,0.00029979067,0.103335924,0.002162811,0.000045187542,0.00008378291,0.00011906422,0.84150505,0.000003558144,0.019856,0.028410288,0.0006559682],"about_ca_topic_score_codex":0.0000053222775,"about_ca_topic_score_gemma":0.000018038687,"teacher_disagreement_score":0.7423568,"about_ca_system_score_codex":0.00036602182,"about_ca_system_score_gemma":0.00003351069,"threshold_uncertainty_score":0.999958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008070012,0.0001249309,0.98726726,0.0009939284,0.0015219845,0.00019649926,5.472286e-7,0.00013007874,0.0016947773],"genre_scores_gemma":[0.9595376,0.00014611591,0.037176143,0.0002962806,0.0017372123,0.000021397129,0.00004503105,0.000017847628,0.0010223638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779737,0.000119581615,0.0007181101,0.00029427017,0.0006938917,0.00037675773],"domain_scores_gemma":[0.9986652,0.00013518524,0.0005305214,0.00009383959,0.0004964684,0.00007876649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016261966,0.0001645387,0.00025240757,0.0002625676,0.00019728334,0.00047337005,0.0011459629,0.000058493366,0.000012969761],"category_scores_gemma":[0.000031338623,0.00014817345,0.00028751497,0.0006960397,0.000018751527,0.00031359817,0.00020513016,0.00024302567,0.00001881973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004172676,0.000049228565,0.000062121784,0.000011633177,0.0005645535,0.000038731094,0.00018312297,0.86405677,0.0000034774032,0.048285127,0.029702643,0.057000887],"study_design_scores_gemma":[0.00062255544,0.000081153754,0.0004896393,0.00008383317,0.000045062166,0.00002165523,0.00020054555,0.9779295,0.0000010617039,0.00013007899,0.02025332,0.00014164114],"about_ca_topic_score_codex":4.97699e-7,"about_ca_topic_score_gemma":0.000001935191,"teacher_disagreement_score":0.9514676,"about_ca_system_score_codex":0.00011561309,"about_ca_system_score_gemma":0.00002950626,"threshold_uncertainty_score":0.6042338},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80019665,0.000073971714,0.19566852,0.00023805028,0.003625816,0.000099467106,0.0000010459272,0.000018375848,0.00007808166],"genre_scores_gemma":[0.966529,0.00008847628,0.032909736,0.000012098221,0.0004390206,0.000003007866,0.0000012665962,0.000005311694,0.000012099633],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986588,0.00017963,0.00044130877,0.00015993384,0.00043887607,0.00012148224],"domain_scores_gemma":[0.99867487,0.00041206472,0.00047441872,0.00019605922,0.00020347712,0.00003913239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014636808,0.00009509341,0.00017026646,0.00024334666,0.000072231,0.0001047958,0.00043403814,0.000032943946,0.000007306621],"category_scores_gemma":[0.00007154959,0.000061607985,0.0001245004,0.00040531417,0.00002807294,0.00038324346,0.00022883461,0.00011700874,0.000002356202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003184046,0.000052937037,0.0021912002,0.000016464051,0.00059703365,0.0000137474935,0.00064970466,0.4600617,0.0021323503,0.00023834615,0.00085648155,0.53287166],"study_design_scores_gemma":[0.0013528022,0.0009146883,0.6724493,0.0010334532,0.00008418912,0.000038170194,0.00058980926,0.31500918,0.0038210577,0.003994797,0.0004954174,0.00021713931],"about_ca_topic_score_codex":0.00006320059,"about_ca_topic_score_gemma":0.0000018487436,"teacher_disagreement_score":0.6702581,"about_ca_system_score_codex":0.00014757214,"about_ca_system_score_gemma":0.000021021147,"threshold_uncertainty_score":0.25123006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015839446,0.0012465751,0.9741495,0.0054148114,0.0023449524,0.0006154214,0.000013993525,0.00016121074,0.00021405703],"genre_scores_gemma":[0.7746166,0.0009867265,0.22102201,0.0011805538,0.0010307203,0.0001987654,0.0000079786805,0.000025443032,0.00093121734],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979814,0.00007972104,0.00057852495,0.00041453182,0.00052482897,0.0004209715],"domain_scores_gemma":[0.99864894,0.00030377114,0.00023110285,0.00033777405,0.00032642306,0.00015200974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013134329,0.00019830561,0.00025170465,0.0003304563,0.00013347606,0.00041860604,0.002008618,0.0000949947,0.000038618902],"category_scores_gemma":[0.000076326345,0.00019348561,0.00021500268,0.00045912413,0.000032707238,0.0004118237,0.000432085,0.0002578983,0.000029996574],"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.00012278403,0.00044952898,0.000046225003,0.00016849156,0.0012962465,0.00062258675,0.0023731447,0.056795914,0.00033826227,0.09599383,0.72933465,0.112458356],"study_design_scores_gemma":[0.00044330762,0.00029903956,0.00019485428,0.00040340069,0.00004847336,0.00008267266,0.000033083896,0.4385546,0.0013213083,0.035007868,0.5234559,0.00015546322],"about_ca_topic_score_codex":0.0000031350958,"about_ca_topic_score_gemma":0.0000038887947,"teacher_disagreement_score":0.75877714,"about_ca_system_score_codex":0.00027171837,"about_ca_system_score_gemma":0.00005120536,"threshold_uncertainty_score":0.7890114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069834484,0.0011554831,0.9942989,0.00036151553,0.0024280115,0.00047545735,0.000035359502,0.00008198794,0.0004649883],"genre_scores_gemma":[0.810587,0.002185244,0.18346953,0.00010601898,0.0026453086,0.00013579393,0.00007784897,0.00011317812,0.00068006397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998704,0.000023819432,0.00051228324,0.00017206534,0.00032009694,0.0002677338],"domain_scores_gemma":[0.9994654,0.00010659734,0.00015027249,0.00008761084,0.00011352081,0.00007662227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041806023,0.00017620086,0.00021358428,0.00010957525,0.000037722923,0.00023252271,0.00025687428,0.000048523558,0.000022422983],"category_scores_gemma":[0.0000028257577,0.00015249544,0.000086032866,0.00011197499,0.00000919935,0.00023311203,0.00005454311,0.00013703083,0.0000051686907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007300865,0.00001958151,0.000075189615,0.0001072721,0.002108009,0.00015527211,0.000033798584,0.9197099,0.0000031218358,0.017275304,0.024788724,0.035650827],"study_design_scores_gemma":[0.001154492,0.000167024,0.00024381296,0.00060885586,0.0001810663,0.00018067505,0.000024368568,0.9697842,0.000010776027,0.0093779145,0.018050728,0.00021611473],"about_ca_topic_score_codex":0.0000034584248,"about_ca_topic_score_gemma":0.000016238555,"teacher_disagreement_score":0.81082934,"about_ca_system_score_codex":0.00045208808,"about_ca_system_score_gemma":0.00002632598,"threshold_uncertainty_score":0.62185836},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08860034,0.10980987,0.10062403,0.109968506,0.008204388,0.0009612343,0.000079006815,0.00003481844,0.5817178],"genre_scores_gemma":[0.97230935,0.026082022,0.00049893686,0.000617858,0.00020998235,0.000010228989,0.000002510139,0.000003871584,0.00026525083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991183,0.000026293344,0.00058335625,0.000104804174,0.000041135067,0.00012608778],"domain_scores_gemma":[0.9994409,0.00008373543,0.00032013297,0.000099093326,0.00003607681,0.000020062782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016783304,0.00006619357,0.0001708189,0.00020229084,0.000041202245,0.000075997115,0.00032780386,0.000035615773,0.000015278794],"category_scores_gemma":[0.000017920704,0.00005953351,0.000056170404,0.000042823758,0.000022529815,0.00016084152,0.000091870636,0.00011144089,0.00000398515],"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.000028062293,0.00004284534,0.00043734114,0.000010439561,0.000115970804,0.000027583359,0.000058443475,0.0016913664,1.2245226e-7,0.9873646,0.0023802281,0.007843034],"study_design_scores_gemma":[0.0007164725,0.00003647812,0.014802358,0.00015360904,0.000012560615,0.000059584276,0.0005809811,0.0015486714,1.6428903e-7,0.5839644,0.3980432,0.00008154007],"about_ca_topic_score_codex":0.000007350671,"about_ca_topic_score_gemma":0.000052621923,"teacher_disagreement_score":0.883709,"about_ca_system_score_codex":0.000119517135,"about_ca_system_score_gemma":0.000009704829,"threshold_uncertainty_score":0.24277061},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002117098,0.00014190497,0.98091143,0.0037648696,0.004861785,0.00015379419,3.1716348e-7,0.000057530848,0.007991292],"genre_scores_gemma":[0.8186387,0.000041313284,0.1764502,0.0031883307,0.0013484954,0.0000035356727,0.0000025624968,0.0000102170625,0.00031669057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777055,0.00013213661,0.00066411943,0.00031051482,0.00082535436,0.00029733148],"domain_scores_gemma":[0.9989109,0.0001657601,0.00036716825,0.00026298975,0.00024222651,0.000050960534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011584811,0.00017367372,0.00023414157,0.00046338062,0.00009160564,0.00023339661,0.0015413999,0.00005371473,0.000013959359],"category_scores_gemma":[0.000028198661,0.00015476422,0.0001347925,0.00056392397,0.000025683457,0.000046995145,0.0006471046,0.00029527326,0.000006015275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024571149,0.00013115487,0.00043969127,0.000009989791,0.00010293821,0.00028336837,0.000039975515,0.82828313,2.2528997e-7,0.0038602995,0.0045073847,0.16231729],"study_design_scores_gemma":[0.0012259446,0.00009473493,0.00328439,0.0007710868,0.00001355694,0.000008611547,0.000048387108,0.9853126,0.0000029947803,0.0006557491,0.008451628,0.00013034474],"about_ca_topic_score_codex":0.000007400151,"about_ca_topic_score_gemma":0.0000017006755,"teacher_disagreement_score":0.8165216,"about_ca_system_score_codex":0.0006511471,"about_ca_system_score_gemma":0.0000582907,"threshold_uncertainty_score":0.63111013},"labels":[],"label_agreement":null}]}