{"meta":{"query_hash":"3ba57be992fa","filters":{"topic":"Network Packet Processing and Optimization"},"cohort_total":186,"direct_labels_cover":0,"predictions_cover":186,"exported":186,"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/3ba57be992fa","api":"https://metacan.xera.ac/api/v1/cohort?topic=Network+Packet+Processing+and+Optimization"},"results":[{"id":"W107363239","doi":"","title":"A Calculus for Distributed Firewall Specification and Verification","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Firewall (physics); Computer science; Application firewall; Stateful firewall; Process calculus; Semantics (computer science); Predicate transformer semantics; Network topology; Formal specification; Network calculus; Programming language; Theoretical computer science; Operational semantics; Distributed computing; Mathematics; Computer security; Computer network; Quality of service","score_opus":0.09806598485889861,"score_gpt":0.3405121344173353,"score_spread":0.24244614955843669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107363239","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.00083477056,0.0010071258,0.99627763,0.000776562,0.00006135503,0.00016528148,0.000020330666,0.0007222551,0.00013469157],"genre_scores_gemma":[0.014827108,0.00025667367,0.9842515,0.000054466112,0.000087715016,0.000082585466,0.00018222489,0.000009865829,0.00024783582],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988797,0.000121458615,0.00027125192,0.00043542453,0.0000885352,0.0002036879],"domain_scores_gemma":[0.9989207,0.00057234935,0.0001341773,0.0002739201,0.000060216218,0.000038654638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000712132,0.00014448032,0.00020509446,0.0001498661,0.00010611721,0.0002332821,0.00021919652,0.00014979986,0.0000016785324],"category_scores_gemma":[0.0003598124,0.00013225531,0.000029163002,0.0004727848,0.0000620364,0.00041009593,0.000079378406,0.00009487351,1.3285916e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015691186,0.000016038779,0.0008875616,0.000015316647,0.0000021437359,7.667499e-7,0.00009048957,0.000027908214,0.00017575231,0.009966365,0.0032394333,0.9855625],"study_design_scores_gemma":[0.0021650067,0.00076238386,0.15981035,0.0002802125,0.00006397891,0.000063619525,0.00006053679,0.04374264,0.049487773,0.5842194,0.15777798,0.0015661246],"about_ca_topic_score_codex":0.00009463509,"about_ca_topic_score_gemma":0.000027818513,"teacher_disagreement_score":0.9839964,"about_ca_system_score_codex":0.000051094106,"about_ca_system_score_gemma":0.000029880754,"threshold_uncertainty_score":0.5393215},"labels":[],"label_agreement":null},{"id":"W1182960591","doi":"10.1016/j.comcom.2015.08.003","title":"A compression approach to reducing power consumption of TCAMs in regular expression matching","year":2015,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Regular expression; Throughput; Parallel computing; Content-addressable memory; Matching (statistics); Set (abstract data type); Artificial intelligence; Operating system","score_opus":0.06838275011301369,"score_gpt":0.2977764274054741,"score_spread":0.2293936772924604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1182960591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025924109,0.0005270817,0.9705316,0.00045386032,0.0001750904,0.00022694696,8.1154997e-7,0.0001339436,0.0020265547],"genre_scores_gemma":[0.5030842,0.000020633493,0.49675605,0.000071685696,0.000014728354,0.000017311628,0.000012914505,0.0000068316403,0.000015656935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852103,0.00031597714,0.00040845067,0.00031573963,0.00024469596,0.0001941234],"domain_scores_gemma":[0.99744755,0.00010646266,0.00018203225,0.0019432278,0.00018479644,0.00013591762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006036405,0.00013015262,0.00021098171,0.000247181,0.00014661894,0.00011939809,0.0018683738,0.00007310605,8.25222e-7],"category_scores_gemma":[0.000023121976,0.00012814775,0.000036742676,0.0006176746,0.00006248129,0.00050965266,0.00141333,0.00020164912,0.000010861542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044070912,0.0014994141,0.0032641247,0.00011856732,0.000021987571,0.0000022007969,0.045821212,0.8308977,0.0051398133,0.043851852,0.0077980845,0.061541002],"study_design_scores_gemma":[0.00054193655,0.000054913027,0.0016644408,0.00062720786,0.0000038246462,0.000012555981,0.00012640428,0.99191225,0.00087483815,0.002914979,0.0010436001,0.00022306027],"about_ca_topic_score_codex":0.000024875204,"about_ca_topic_score_gemma":0.0000023800706,"teacher_disagreement_score":0.4771601,"about_ca_system_score_codex":0.000068472655,"about_ca_system_score_gemma":0.00007078919,"threshold_uncertainty_score":0.5225713},"labels":[],"label_agreement":null},{"id":"W126306277","doi":"10.1007/978-3-319-11764-5_16","title":"Incremental Verification of Computing Policies","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Predicate (mathematical logic); Property (philosophy); Computer science; Set (abstract data type); Mathematical economics; Sequence (biology); Action (physics); Algorithm; Mathematics; Programming language; Philosophy; Epistemology","score_opus":0.014725737125482573,"score_gpt":0.2461241649650206,"score_spread":0.231398427839538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126306277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003011631,0.0001835979,0.9949832,0.0002232842,0.0007775964,0.00015349523,0.0000011483913,0.00011214327,0.0032643897],"genre_scores_gemma":[0.59316856,0.000022275479,0.40600556,0.0003966748,0.00029649082,0.0000010524304,0.0000053862673,0.000016999027,0.000086996384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760336,0.00003289084,0.0005060514,0.00080890494,0.0006783031,0.0003704719],"domain_scores_gemma":[0.9981286,0.00022429765,0.0004877407,0.0008254071,0.000255114,0.000078864316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084797124,0.00030048293,0.0003841324,0.00055612833,0.00020150021,0.00027249873,0.0018966047,0.00018741774,0.0000047671124],"category_scores_gemma":[0.00005382867,0.0002907398,0.0000717089,0.0005570406,0.00050340354,0.00029103417,0.0006615146,0.00033677198,0.000010248924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026866148,0.000015694846,0.00009641194,0.00006146432,0.000006332405,0.0000025382226,0.0011008646,0.17457098,0.00026134515,0.034296177,0.000020448615,0.7895651],"study_design_scores_gemma":[0.00016217057,0.00010102258,0.00019969157,0.00044756735,0.0000056158096,0.000016628497,1.8472653e-7,0.9696446,0.0033051108,0.025499143,0.00026496238,0.00035330086],"about_ca_topic_score_codex":0.000019831037,"about_ca_topic_score_gemma":0.000012114019,"teacher_disagreement_score":0.7950736,"about_ca_system_score_codex":0.00015057415,"about_ca_system_score_gemma":0.00026423333,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W1484913574","doi":"10.1007/11422778_46","title":"A Multizone Pipelined Cache for IP Routing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cache; Cache algorithms; Smart Cache; Parallel computing; Computer network; Cache invalidation; Pipeline (software); IP forwarding; Routing table; CPU cache; Routing (electronic design automation); Operating system; Routing protocol","score_opus":0.019440455725693154,"score_gpt":0.2555890350503842,"score_spread":0.23614857932469108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484913574","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.000011202694,0.0004984436,0.9953401,0.0009308332,0.0013088905,0.00045102992,0.000003321501,0.0002735143,0.0011826284],"genre_scores_gemma":[0.050077546,0.00003028704,0.94570345,0.001400448,0.001545222,0.000017072769,0.000011396155,0.000043956185,0.0011706023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658865,0.000022941651,0.0005514372,0.0014647775,0.00063703145,0.00073519343],"domain_scores_gemma":[0.9976366,0.0005127782,0.00036856273,0.0009444692,0.0003852453,0.00015235055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001096106,0.00048173819,0.0004715835,0.00049875845,0.00041337073,0.00071225746,0.0023429294,0.00033722195,0.000005514681],"category_scores_gemma":[0.0001660069,0.00044908756,0.00013575109,0.0005618339,0.00030534732,0.0006347546,0.0006378602,0.0005480545,0.000017723867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052441596,0.000016167065,0.000008311001,0.000024130548,0.000004855447,0.000006414445,0.00045557084,0.22909844,0.000018053117,0.0055899853,0.00002470208,0.76474816],"study_design_scores_gemma":[0.00038113943,0.00008716561,0.000007977068,0.00034981445,0.000008840302,0.00002354035,1.0228131e-7,0.95702446,0.00042696125,0.039538663,0.0016332789,0.0005180845],"about_ca_topic_score_codex":0.000005984211,"about_ca_topic_score_gemma":0.00004623766,"teacher_disagreement_score":0.7642301,"about_ca_system_score_codex":0.00026686527,"about_ca_system_score_gemma":0.00053461705,"threshold_uncertainty_score":0.9997961},"labels":[],"label_agreement":null},{"id":"W1488177014","doi":"","title":"A 0.8V, 9ns, 0.77mW at 50MHz, 128kb, four-way, set-associative, 2-level CMOS cache memory using two-stage WLOTC/BLOTC tag-compare scheme and sense wordlines/bitlines (SWL/SBL) tag sense amps with an 8-T tag cell in level 2 and a 10-T shrunk logic swing (SLS) memory cell with the ground/floating (G/F) data sense amp in level 1","year":2001,"lang":"en","type":"article","venue":"European Solid-State Circuits Conference","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sense amplifier; CMOS; Sense (electronics); Cache; Memory cell; CPU cache; Dissipation; Computer hardware; Semiconductor memory; Electronic engineering; Parallel computing; Electrical engineering; Voltage; Engineering; Transistor; Physics","score_opus":0.23221016553163445,"score_gpt":0.3082770443711565,"score_spread":0.07606687883952204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488177014","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.8288116,0.00033801442,0.16726522,0.00020845355,0.00011148035,0.00076279114,0.00021640972,0.0002592084,0.002026808],"genre_scores_gemma":[0.9599266,0.00020966177,0.036052972,0.0006340122,0.00018606774,0.000011817245,0.00020300655,0.00018055292,0.002595286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922462,0.001880954,0.0011354301,0.0023369533,0.00090195664,0.0014985129],"domain_scores_gemma":[0.99528176,0.0006839535,0.0011528085,0.0017885128,0.0006378307,0.00045511915],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003031763,0.0010843795,0.0010172124,0.00042658628,0.0009834623,0.0014425837,0.001154494,0.0001367233,0.000020187515],"category_scores_gemma":[0.00021543191,0.00088630314,0.000059448837,0.001672208,0.0005353696,0.0022582521,0.0013974477,0.0010313855,0.000020108435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025018114,0.0028129618,0.09969932,0.002783835,0.0006329858,0.025431093,0.26139817,0.43059596,0.08504076,0.00059158885,0.0012612039,0.087250315],"study_design_scores_gemma":[0.0077113807,0.00033738493,0.021327557,0.0013364134,0.00012170287,0.0012756437,0.00706426,0.9564123,0.0012884474,0.00010576471,0.000447988,0.0025711684],"about_ca_topic_score_codex":0.001072802,"about_ca_topic_score_gemma":0.008869657,"teacher_disagreement_score":0.5258163,"about_ca_system_score_codex":0.0003116455,"about_ca_system_score_gemma":0.0005464895,"threshold_uncertainty_score":0.99959403},"labels":[],"label_agreement":null},{"id":"W1505103139","doi":"10.1109/icassp.1990.116020","title":"Systolic implementation of counterpropagation networks","year":2002,"lang":"en","type":"article","venue":"International Conference on Acoustics, Speech, and Signal Processing","topic":"Network Packet Processing and Optimization","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 Windsor","funders":"","keywords":"Computer science; Architecture; Word (group theory); Very-large-scale integration; Artificial intelligence; Computer architecture; Embedded system; Philosophy; Linguistics; Art","score_opus":0.027546133003731394,"score_gpt":0.2812496908472481,"score_spread":0.2537035578435167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505103139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009121781,0.00020298836,0.9859121,0.0005168145,0.00026190173,0.0001079279,0.0000046815244,0.000083642204,0.0037881744],"genre_scores_gemma":[0.98498356,0.00024031184,0.014179,0.0002295737,0.0001721955,0.0000068957434,0.000014318909,0.000010251926,0.0001638762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986751,0.000035286528,0.00036452906,0.00032278278,0.00041511166,0.00018721005],"domain_scores_gemma":[0.99892944,0.00004133308,0.00031527376,0.00011871471,0.0005315495,0.00006370351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020596778,0.00015462033,0.0001600579,0.00015850796,0.0001491996,0.0003785988,0.00036782672,0.00007202915,0.00013251326],"category_scores_gemma":[0.000016186032,0.00014873776,0.000028653034,0.00018690652,0.0000768169,0.0006198484,0.0000631953,0.00014473249,0.0000058496803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021577347,0.00009865227,0.0006900636,0.00008665712,0.00002961611,0.000010744495,0.0010397331,0.01536695,0.002582868,0.01899003,0.00041812705,0.960665],"study_design_scores_gemma":[0.0003156487,0.000094384086,0.0003107817,0.00020221119,0.000011915015,0.000020449597,0.00020939464,0.995753,0.0006478065,0.0022328293,0.000044297958,0.0001573014],"about_ca_topic_score_codex":0.000016776634,"about_ca_topic_score_gemma":0.0000039938222,"teacher_disagreement_score":0.980386,"about_ca_system_score_codex":0.000050650477,"about_ca_system_score_gemma":0.000052698764,"threshold_uncertainty_score":0.606535},"labels":[],"label_agreement":null},{"id":"W1519913544","doi":"10.1109/iscas.2004.1329351","title":"Low power dual matchline ternary content addressable memory","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Content-addressable memory; Content-addressable storage; Computer science; Power (physics); Dual (grammatical number); Power consumption; Reduction (mathematics); Ternary operation; Table (database); Capacitance; Capacitive sensing; Computer hardware; Parallel computing; Operating system; Artificial intelligence; Database; Mathematics","score_opus":0.02115177342424038,"score_gpt":0.22607827706595277,"score_spread":0.2049265036417124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519913544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01624995,0.00015859553,0.9597774,0.0020497772,0.0005224856,0.00009249301,6.517856e-7,0.00038122365,0.020767413],"genre_scores_gemma":[0.83164287,0.000022892958,0.15616433,0.002023663,0.0001295353,0.000008462009,0.000005865438,0.000013472249,0.009988888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909925,0.000015720072,0.00017051001,0.00027096583,0.0002073082,0.00023623163],"domain_scores_gemma":[0.9994316,0.000015815785,0.00005588539,0.00032203182,0.000089984496,0.0000846457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013845135,0.00010780303,0.00010935587,0.000045614717,0.00010080032,0.00017101866,0.00032601695,0.000047852274,0.00008090315],"category_scores_gemma":[0.0000107284495,0.00008770313,0.00003658367,0.00021508153,0.00003083439,0.0005295365,0.00012835776,0.00008280455,0.00015117033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011138166,0.0020665391,0.0010213947,0.00015082821,0.0001481318,0.0006842215,0.004967362,0.6873191,0.0051028756,0.13766104,0.056698997,0.10406816],"study_design_scores_gemma":[0.0133503815,0.001460486,0.0035099997,0.0011108288,0.000052760468,0.00081425987,0.00094552356,0.70984995,0.20329684,0.052380715,0.009765505,0.0034627786],"about_ca_topic_score_codex":0.000029150831,"about_ca_topic_score_gemma":0.00000706774,"teacher_disagreement_score":0.8153929,"about_ca_system_score_codex":0.00003611312,"about_ca_system_score_gemma":0.0000694712,"threshold_uncertainty_score":0.35764298},"labels":[],"label_agreement":null},{"id":"W1536322440","doi":"","title":"Modeling and verification of firewall configurations using domain restriction method","year":2011,"lang":"en","type":"article","venue":"International Conference for Internet Technology and Secured Transactions","topic":"Network Packet Processing and Optimization","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":"Concordia University","funders":"","keywords":"Firewall (physics); Computer science; Application firewall; Distributed computing; Formal verification; Model checking; Computer security; Computer network; Stateful firewall; Theoretical computer science; Entropy (arrow of time)","score_opus":0.060235257010702925,"score_gpt":0.2947489383889734,"score_spread":0.2345136813782705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536322440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03637581,0.00006306412,0.9622952,0.0004113113,0.00021716327,0.00014096919,0.00001390495,0.000101080615,0.00038150343],"genre_scores_gemma":[0.72621155,0.00007667505,0.2736192,0.000011165741,0.0000078214925,0.000027994842,0.0000068633176,0.000004259363,0.000034474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992804,0.000023319244,0.00025329663,0.00026455696,0.0000758455,0.0001025651],"domain_scores_gemma":[0.9994095,0.000032837972,0.000102356265,0.0001213634,0.0003045598,0.00002939705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013293233,0.00009619976,0.00011604244,0.0003823777,0.00010719028,0.000045993893,0.00023997201,0.00014880947,0.000017657403],"category_scores_gemma":[0.000020274245,0.00010091075,0.00002944407,0.0002330649,0.00008794836,0.0003918566,0.000015585052,0.00012260555,3.1638032e-7],"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.000055162796,0.00008084167,0.00007667884,0.00002456839,0.00009667728,7.211462e-7,0.004236124,0.0021303198,0.005807807,0.9634299,0.0000053453923,0.024055803],"study_design_scores_gemma":[0.00025250297,0.00006932726,0.000028460972,0.00004088643,0.000020356962,0.00003119502,0.0002637474,0.89819956,0.0041208044,0.09681278,0.00007389192,0.00008651996],"about_ca_topic_score_codex":0.000060316957,"about_ca_topic_score_gemma":0.00003534307,"teacher_disagreement_score":0.8960692,"about_ca_system_score_codex":0.000019908468,"about_ca_system_score_gemma":0.000044131073,"threshold_uncertainty_score":0.4115021},"labels":[],"label_agreement":null},{"id":"W1541908892","doi":"10.1109/hpsr.2002.1024220","title":"Multi-zone caches for accelerating IP routing table lookups","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 Alberta","funders":"","keywords":"Computer science; Computer network; Cache; Loose Source Routing; Routing table; Source routing; IP forwarding; Network packet; Routing protocol","score_opus":0.05121562897356994,"score_gpt":0.268261431583526,"score_spread":0.21704580260995607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541908892","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.0010608684,0.0001498976,0.99282223,0.00010924525,0.00019478184,0.00012717514,2.5849423e-7,0.00021579323,0.005319729],"genre_scores_gemma":[0.32631227,0.0000027168076,0.6699407,0.00019424414,0.00004411184,0.000014801962,0.0000017607024,0.00000767202,0.0034817017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991152,0.00003117565,0.00017623638,0.0002869933,0.000094464805,0.0002958986],"domain_scores_gemma":[0.99947345,0.000088744295,0.00007719356,0.00020232495,0.000105847226,0.000052415133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042364933,0.00009960267,0.000105509316,0.00003429426,0.00034347337,0.0003729917,0.00024328919,0.00004693884,0.000010373328],"category_scores_gemma":[0.00012463298,0.00008892867,0.000028439592,0.00030002487,0.000011870095,0.00054677227,0.000041769417,0.000061016057,0.000007848598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012738495,0.00047117495,0.0063854493,0.00018456802,0.000084382795,0.000007664565,0.004683163,0.32832715,0.0051407944,0.32205036,0.0080518285,0.32460076],"study_design_scores_gemma":[0.00037597684,0.000020659361,0.000029916691,0.000020035532,0.000004214713,0.000004354482,0.00007045849,0.9892702,0.008250722,0.00035020956,0.0014576841,0.00014554666],"about_ca_topic_score_codex":0.00001263911,"about_ca_topic_score_gemma":0.000014081056,"teacher_disagreement_score":0.6609431,"about_ca_system_score_codex":0.000019484733,"about_ca_system_score_gemma":0.0000702808,"threshold_uncertainty_score":0.3626406},"labels":[],"label_agreement":null},{"id":"W1545511512","doi":"10.5555/2043468.2043512","title":"Two-level cache architecture to reduce memory accesses for IP lookups","year":2011,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Parallel computing; Cache; Bottleneck; Routing table; Tree traversal; Prefix; Computer network; Network packet; Operating system; Routing protocol; Embedded system; Algorithm","score_opus":0.0634416463568282,"score_gpt":0.3069556644432329,"score_spread":0.24351401808640472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545511512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027435865,0.00009180179,0.9571866,0.0016401681,0.0037893613,0.00034075533,0.000023287632,0.0003041277,0.009188069],"genre_scores_gemma":[0.78028727,0.000008492954,0.21582204,0.00068978616,0.0004942228,0.000087838685,0.000019135146,0.000020622274,0.0025706182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856466,0.000034163415,0.00027030875,0.00050082087,0.00033874373,0.00029130405],"domain_scores_gemma":[0.9988007,0.00015587195,0.0001306065,0.00033887223,0.0004428255,0.00013111944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002557199,0.00018474984,0.00015582358,0.00022319524,0.0001289603,0.00025452854,0.0016040816,0.00006684133,0.000048728398],"category_scores_gemma":[0.00018041927,0.00017292715,0.00007614386,0.00031933765,0.000049141716,0.00039275672,0.00020569196,0.00014108348,0.000033087614],"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.00013198778,0.0002052164,0.00013075955,0.00003653044,0.00011393206,0.000030763036,0.0027692793,0.03196477,0.00035334632,0.015422534,0.008062207,0.9407787],"study_design_scores_gemma":[0.009413609,0.0010275176,0.007743291,0.0012529817,0.00013979875,0.0006797375,0.0006768389,0.66224694,0.15212671,0.036653973,0.123817675,0.00422093],"about_ca_topic_score_codex":0.000027029473,"about_ca_topic_score_gemma":0.00005519375,"teacher_disagreement_score":0.93655777,"about_ca_system_score_codex":0.000055350625,"about_ca_system_score_gemma":0.00011036351,"threshold_uncertainty_score":0.7051765},"labels":[],"label_agreement":null},{"id":"W1558521568","doi":"10.1109/isspit.2004.1433693","title":"Processor array design for deep packet classification","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 Victoria","funders":"","keywords":"Computer science; String (physics); Pipeline (software); Dependency (UML); Graph; Parallel computing; Network packet; Iterative method; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Computer network; Programming language","score_opus":0.04413897924058824,"score_gpt":0.2734542910742603,"score_spread":0.22931531183367204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558521568","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.00007290808,0.00009233565,0.9920973,0.003114527,0.00009146235,0.00024928947,2.1374845e-7,0.00030951973,0.0039724084],"genre_scores_gemma":[0.21593048,0.000012109912,0.78195316,0.0004949214,0.00017588031,0.00008109127,0.0000048871025,0.000008088567,0.0013394031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991919,0.000027201866,0.00016124506,0.00028789803,0.00012504692,0.00020670264],"domain_scores_gemma":[0.99936885,0.00008583942,0.00008228212,0.00024154202,0.00016434236,0.000057161946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003138999,0.000091250964,0.00008058187,0.000051184034,0.00015759413,0.00020733758,0.00036592732,0.000054132244,0.000010379865],"category_scores_gemma":[0.000046007957,0.00007716958,0.000027825676,0.00028789372,0.000016972215,0.00068446354,0.000014431917,0.000041511314,0.00004254085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002849153,0.00016284415,0.00008079341,0.000046330508,0.000014170837,2.2316533e-7,0.0011062307,0.05621371,0.0019308744,0.0575638,0.017577847,0.86527467],"study_design_scores_gemma":[0.00023005702,0.000044050612,0.00004989082,0.000008440815,0.000004113944,0.0000023949592,0.000016686821,0.9749528,0.010545933,0.00484253,0.009171326,0.00013177173],"about_ca_topic_score_codex":3.0241537e-7,"about_ca_topic_score_gemma":0.000003364355,"teacher_disagreement_score":0.9187391,"about_ca_system_score_codex":0.000032495034,"about_ca_system_score_gemma":0.00006413723,"threshold_uncertainty_score":0.3146884},"labels":[],"label_agreement":null},{"id":"W1559947292","doi":"10.1109/etfa.2005.1612765","title":"The Special Needs of SCADA/PCN Firewalls: Architectures and Test Results","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; British Columbia Institute of Technology","funders":"","keywords":"Firewall (physics); SCADA; Application firewall; Software deployment; Industrial control system; Computer security; Computer science; Open source; Engineering; Control (management); Stateful firewall; Operating system; Software; Business","score_opus":0.004962649642546288,"score_gpt":0.19842861144406115,"score_spread":0.19346596180151487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559947292","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.1756325,0.0025409495,0.41841865,0.017018199,0.001277241,0.00045386842,0.000014841821,0.0005628058,0.38408095],"genre_scores_gemma":[0.9781194,0.000027075783,0.017439952,0.00008522729,0.0007456938,0.000001485625,0.0000018870957,0.0000041926405,0.0035750924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994536,0.000020591518,0.00016591666,0.00010575724,0.00012619235,0.00012793834],"domain_scores_gemma":[0.99927616,0.0003925793,0.00007146702,0.00019373087,0.000044386437,0.00002169291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019825633,0.00006241023,0.00006334664,0.000040912844,0.00017053891,0.00015125706,0.00026452483,0.000026575091,0.0000013787316],"category_scores_gemma":[0.00007816107,0.000037702845,0.000016181039,0.00030500384,0.00008435083,0.00006295318,0.00007695923,0.000049949063,0.0000015237466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096668446,0.0001883207,0.008152208,0.00003590099,0.000018313227,0.0000049523014,0.0037230265,0.024193887,0.0003576099,0.09755201,0.1163067,0.7493704],"study_design_scores_gemma":[0.002838784,0.0005835233,0.07576345,0.00018618023,0.000026162608,0.00007471473,0.00026039136,0.72804147,0.015936024,0.101995766,0.073427595,0.0008659606],"about_ca_topic_score_codex":0.00004391963,"about_ca_topic_score_gemma":0.000116635114,"teacher_disagreement_score":0.8024869,"about_ca_system_score_codex":0.0000046470786,"about_ca_system_score_gemma":0.000025266692,"threshold_uncertainty_score":0.15374774},"labels":[],"label_agreement":null},{"id":"W1560102360","doi":"10.1007/978-0-387-71760-9_8","title":"Packets, Packet Headers, and Header Format","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Manitoba Beekeepers' Association","funders":"","keywords":"Header; Network packet; Computer science; Computer network","score_opus":0.021430287642708674,"score_gpt":0.2073628873003857,"score_spread":0.18593259965767703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560102360","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044276335,0.005054946,0.2935451,0.0016432324,0.00034138837,0.00018288728,0.0000039725746,0.00047882966,0.6987452],"genre_scores_gemma":[0.0018525118,0.011575705,0.07661451,0.0031390004,0.0004681512,0.000009007566,0.000074067146,0.00009236364,0.90617466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843425,0.000013582073,0.0003170631,0.0005622132,0.0003316962,0.0003411706],"domain_scores_gemma":[0.9989543,0.000052187796,0.00016681966,0.0005493166,0.000102105354,0.00017526648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011882224,0.00037895064,0.00035701384,0.00015463204,0.00024381981,0.00024817188,0.0004214565,0.0003531289,0.00007311747],"category_scores_gemma":[0.000005867543,0.00033169126,0.000082440056,0.00006170154,0.00014409987,0.00060499954,0.00021876874,0.00032559634,0.00012704276],"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.000009546512,0.000021904334,0.000017512159,0.00014631577,0.00007118001,0.00006431184,0.0014433612,0.000094520045,0.0000010306628,0.2681177,0.54779565,0.18221694],"study_design_scores_gemma":[0.00059753115,0.00015500236,0.000014731768,0.00040724556,0.000031809017,0.00057227,0.000022770288,0.038997017,0.000045859673,0.036401477,0.9214802,0.001274105],"about_ca_topic_score_codex":0.0000025353127,"about_ca_topic_score_gemma":0.0000072090625,"teacher_disagreement_score":0.37368453,"about_ca_system_score_codex":0.000039963692,"about_ca_system_score_gemma":0.00010661012,"threshold_uncertainty_score":0.9999135},"labels":[],"label_agreement":null},{"id":"W1560773978","doi":"","title":"PCIU: An efficient packet classification algorithm with an incremental update capability","year":2010,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Bottleneck; Network packet; Statistical classification; Algorithm; Routing algorithm; Routing (electronic design automation); Data mining; Computer network; Artificial intelligence; Routing protocol; Embedded system","score_opus":0.02569693793863277,"score_gpt":0.2914582352866313,"score_spread":0.2657612973479985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560773978","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.77097267,0.000021882883,0.22665825,0.00040025133,0.00071810244,0.0004065644,0.000007592457,0.00010059669,0.0007140742],"genre_scores_gemma":[0.942137,0.00004449175,0.057180043,0.00007645447,0.00019134552,0.000085840074,0.00026502387,0.000013106501,0.000006719296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733764,0.0004108574,0.00054331706,0.00046525616,0.0010778402,0.00016508858],"domain_scores_gemma":[0.99690497,0.00007379615,0.00047596407,0.001040961,0.0013921671,0.00011216967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731604,0.00019327516,0.00019061237,0.00017280711,0.0002671257,0.0003632836,0.0010204948,0.00009538087,0.000012252809],"category_scores_gemma":[0.000010621856,0.0001683817,0.000026866932,0.0002610364,0.00011523489,0.001211938,0.00011886,0.0002435083,0.000008024464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010146382,0.0009139181,0.0046782047,0.00003240893,0.00006727123,2.0721902e-7,0.0014632033,0.47587425,0.0015480958,0.013495314,0.00003821554,0.5017874],"study_design_scores_gemma":[0.0008179404,0.00039749237,0.021693032,0.00005404978,0.00001702919,0.000025828931,0.000048970236,0.9755678,0.00082097476,0.000058865888,0.00030566787,0.00019234842],"about_ca_topic_score_codex":0.000035448415,"about_ca_topic_score_gemma":0.0000210307,"teacher_disagreement_score":0.5015951,"about_ca_system_score_codex":0.00010470033,"about_ca_system_score_gemma":0.000120381024,"threshold_uncertainty_score":0.6866406},"labels":[],"label_agreement":null},{"id":"W1565193452","doi":"10.1109/iscas.2003.1206223","title":"An approach for improving the speed of content addressable memories","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Scheme (mathematics); Computer science; Dissipation; Standby power; Power (physics); Content-addressable memory; Speedup; Random access memory; Computer hardware; Electronic engineering; Embedded system; Parallel computing; Engineering; Artificial intelligence; Artificial neural network","score_opus":0.05175406172266863,"score_gpt":0.252608551292595,"score_spread":0.20085448956992638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565193452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016354789,0.0000977956,0.9895192,0.000054297452,0.000099482706,0.00015808751,4.1807215e-7,0.000053418196,0.008381865],"genre_scores_gemma":[0.58945894,0.0000015482342,0.4096199,0.000089093875,0.000023084518,0.0000073231126,0.0000019801005,0.0000037563389,0.0007943833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.000037971764,0.0001243858,0.00016302946,0.000099323835,0.00013381884],"domain_scores_gemma":[0.99941826,0.00004558148,0.00007397365,0.00029611678,0.00013918313,0.000026913753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004286861,0.000058032318,0.00008167051,0.000017687384,0.00013209278,0.00011835529,0.00033432787,0.000023893903,0.0000033163049],"category_scores_gemma":[0.00004775875,0.000035078898,0.000025743855,0.00016425183,0.000037027516,0.00031653937,0.000020035115,0.000030785635,3.1550104e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003566581,0.00041581987,0.0012891646,0.00023023019,0.000040087234,4.1734708e-7,0.0030770954,0.14886603,0.007725204,0.772873,0.0021004342,0.063346885],"study_design_scores_gemma":[0.00023007317,0.00006149149,0.000028670012,0.0000032790751,0.000005571773,0.0000021596993,0.0003465689,0.96338105,0.034356486,0.0013527275,0.00016121287,0.00007071211],"about_ca_topic_score_codex":0.000009569028,"about_ca_topic_score_gemma":0.0000014381342,"teacher_disagreement_score":0.814515,"about_ca_system_score_codex":0.000006480413,"about_ca_system_score_gemma":0.00004434157,"threshold_uncertainty_score":0.14304759},"labels":[],"label_agreement":null},{"id":"W1567824201","doi":"10.1109/pacrim.2003.1235744","title":"A study on design approaches for network processor units","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 Victoria","funders":"","keywords":"Computer science; Network processor; Network planning and design; Computer architecture; Data transmission; Computer network; Distributed computing","score_opus":0.16656190898425988,"score_gpt":0.27843981256459654,"score_spread":0.11187790358033667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567824201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014132438,0.000040718776,0.995381,0.00035443375,0.00012193188,0.00073888607,1.3216763e-7,0.00028705364,0.0016625912],"genre_scores_gemma":[0.6376861,0.0000011938674,0.36139572,0.00025564406,0.00013538597,0.00014826868,0.0000016037367,0.000010417417,0.0003656836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905825,0.000041109823,0.00013973044,0.00034134949,0.00015572828,0.00026381266],"domain_scores_gemma":[0.99943316,0.0000866677,0.000060139882,0.00025780298,0.000107850035,0.000054400578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042954143,0.000119892546,0.00011235277,0.000042197713,0.00023285222,0.00019803418,0.00041715443,0.000038780574,6.0689416e-7],"category_scores_gemma":[0.000041520812,0.0000941387,0.000017616261,0.0008375987,0.000012361794,0.0002584678,0.000044735887,0.000059747003,0.000008976843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021101978,0.00024513574,0.00005543588,0.0000081830685,0.0000118320795,0.0000016786311,0.0015084066,0.9531595,4.6000136e-7,0.029172087,0.00082537986,0.014990811],"study_design_scores_gemma":[0.0036925822,0.003132389,0.0003798984,0.00011840535,0.000031565633,0.00001032634,0.00086213334,0.9033577,0.0009980267,0.08632217,0.0004253226,0.0006695154],"about_ca_topic_score_codex":0.0000011695709,"about_ca_topic_score_gemma":0.0000041238914,"teacher_disagreement_score":0.63627285,"about_ca_system_score_codex":0.000026939922,"about_ca_system_score_gemma":0.00014011595,"threshold_uncertainty_score":0.38388646},"labels":[],"label_agreement":null},{"id":"W1571559246","doi":"10.1002/0471221562.ch5","title":"SOI CMOS Digital Circuits","year":2002,"lang":"en","type":"other","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Silicon on insulator; Static random-access memory; CMOS; Electronic circuit; Computer science; Digital electronics; Electronic engineering; Electrical engineering; Computer hardware; Engineering; Materials science; Optoelectronics; Silicon","score_opus":0.012120235586284575,"score_gpt":0.20401880021316943,"score_spread":0.19189856462688484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571559246","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.3934678e-8,0.00027173333,0.45265833,0.00005190542,0.00021989412,0.00003481355,0.0000010793848,0.0005631914,0.546199],"genre_scores_gemma":[0.0001995177,0.0000679153,0.013019966,0.00017434731,0.00031887248,0.0000034920558,0.0000103551965,0.000116274925,0.9860892],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991997,0.0000078455505,0.00009690602,0.00032972262,0.00017910481,0.00018673774],"domain_scores_gemma":[0.99942935,0.000011170334,0.00008589064,0.00039467507,0.000020010833,0.00005887875],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000025408712,0.00015244336,0.00013324166,0.00010884581,0.000033367993,0.0004801152,0.0005453838,0.00015173771,0.00131394],"category_scores_gemma":[0.000007393955,0.00013138108,0.000038493505,0.00024712321,0.000019924406,0.00022167373,0.00008615742,0.00008647467,0.0010721044],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9031867e-8,0.000013295553,0.000005561155,0.000009743377,0.000005234715,0.0000036707045,0.000018635454,0.00005700515,4.9867854e-8,0.001264564,0.81943053,0.1791917],"study_design_scores_gemma":[0.000089701556,0.000011724996,0.0000010117907,0.000081921025,0.000002847123,0.000008019655,0.0000010007517,0.044376142,0.0000027251663,0.00028867784,0.9548958,0.00024044522],"about_ca_topic_score_codex":0.0000038021815,"about_ca_topic_score_gemma":0.0000021207304,"teacher_disagreement_score":0.4398902,"about_ca_system_score_codex":0.000012154109,"about_ca_system_score_gemma":0.00002452016,"threshold_uncertainty_score":0.9997057},"labels":[],"label_agreement":null},{"id":"W1575968875","doi":"","title":"Usable Firewall Configuration.","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"USable; Computer science; Firewall (physics); World Wide Web; Physics","score_opus":0.01099493926765502,"score_gpt":0.2260047024672377,"score_spread":0.21500976319958268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575968875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019401689,0.00006270755,0.8120396,0.004592895,0.00014372994,0.00004394581,1.9356297e-7,0.0002086621,0.18096809],"genre_scores_gemma":[0.7783706,0.000015102086,0.21467899,0.0008905154,0.00018619302,0.0000052518285,0.0000024254477,0.000004079989,0.0058468156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948996,0.000015556798,0.00009303434,0.00015092248,0.000115687035,0.00013485954],"domain_scores_gemma":[0.99965394,0.000019889021,0.000034787157,0.00019643194,0.000052273143,0.000042700252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100728685,0.000051697203,0.000051315506,0.000025302164,0.00010282416,0.00015073066,0.00025726814,0.000028123106,0.00017837412],"category_scores_gemma":[0.000012787908,0.000048085247,0.00001570418,0.00017567145,0.000014090396,0.0004865459,0.000029978552,0.00004640182,0.00025148064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041405824,0.00008054363,0.00018537352,0.000010863958,0.000008887996,0.0000034728698,0.0019066914,0.0148363635,0.0033592605,0.11269949,0.10803218,0.75887275],"study_design_scores_gemma":[0.0001536884,0.000016224934,0.00007812028,0.000009431743,0.0000016253632,0.0000050683357,0.000003250008,0.89698595,0.0050447723,0.0084729465,0.089128286,0.000100646306],"about_ca_topic_score_codex":8.8191774e-7,"about_ca_topic_score_gemma":0.000002288,"teacher_disagreement_score":0.8821496,"about_ca_system_score_codex":0.000018394321,"about_ca_system_score_gemma":0.000037845515,"threshold_uncertainty_score":0.32323587},"labels":[],"label_agreement":null},{"id":"W1585628008","doi":"10.1007/978-3-540-45234-8_63","title":"The Bank Nth Chance Replacement Policy for FPGA-Based CAMs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cache; Cache algorithms; Page cache; CPU cache; Field-programmable gate array; Smart Cache; Embedded system; Content-addressable memory; Parallel computing","score_opus":0.014346994644272202,"score_gpt":0.25611510585889974,"score_spread":0.24176811121462755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585628008","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.0000034837497,0.0009048637,0.9887743,0.0057726293,0.001859873,0.00061898696,0.0000034173163,0.00013306967,0.0019293824],"genre_scores_gemma":[0.012957682,0.00018922093,0.97038424,0.012012088,0.0014178755,0.000100909994,0.000013496609,0.0000740868,0.0028504191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965208,0.000043914664,0.00047575598,0.0013514304,0.000780071,0.00082802284],"domain_scores_gemma":[0.99688274,0.0007108127,0.0004009388,0.0014922246,0.0003729521,0.00014036377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014548473,0.00046538314,0.00035650367,0.00041157482,0.0009656941,0.0010229093,0.0027386649,0.0002276691,0.000003003278],"category_scores_gemma":[0.000201343,0.0003494921,0.00012559142,0.0008300951,0.00056621863,0.00032131665,0.00035485748,0.00043269855,0.0000079083275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016990782,0.000019459443,0.0000054062507,0.000042088235,0.00000789391,0.0000045249353,0.00022071862,0.24629316,0.0000074281024,0.030202564,0.00036884524,0.7228109],"study_design_scores_gemma":[0.000358793,0.00021152316,0.0000033130116,0.00027890084,0.0000058435453,0.0000120404,8.5480714e-8,0.8779075,0.001154895,0.09175557,0.027840251,0.0004712476],"about_ca_topic_score_codex":0.0000093532335,"about_ca_topic_score_gemma":0.000047733203,"teacher_disagreement_score":0.7223397,"about_ca_system_score_codex":0.00041806643,"about_ca_system_score_gemma":0.0012170672,"threshold_uncertainty_score":0.9998957},"labels":[],"label_agreement":null},{"id":"W1585696627","doi":"10.1109/parbse.1990.77209","title":"Reconfigurable systolic architectures for hashing","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 Windsor","funders":"","keywords":"Successor cardinal; Computer science; Table (database); Hash function; Hash table; Host (biology); Very-large-scale integration; Parallel computing; Theoretical computer science; Programming language; Database; Embedded system; Mathematics","score_opus":0.02838948419159033,"score_gpt":0.22933947079023334,"score_spread":0.20094998659864302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585696627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012654383,0.00025455645,0.94976753,0.0011741761,0.00017442669,0.00009010325,2.2852151e-7,0.00026508459,0.047008473],"genre_scores_gemma":[0.75695354,0.0000074337754,0.23429875,0.000645309,0.00011134681,0.000021887066,7.7339945e-7,0.000007241627,0.00795374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946713,0.0000136127865,0.00009448282,0.00018169377,0.00006775972,0.00017528974],"domain_scores_gemma":[0.9996318,0.00006857744,0.0000351503,0.00018846536,0.0000365774,0.000039427516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010775581,0.00006052529,0.00006941534,0.00004717766,0.0001537976,0.00020264517,0.00028462388,0.000027804977,0.00003881833],"category_scores_gemma":[0.00002945323,0.00004992814,0.000028951972,0.00016131368,0.000009615988,0.00009056453,0.000013419195,0.000041844338,0.000024964367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036232161,0.000056304,0.000110643756,0.00007856736,0.000016855964,0.0000021208184,0.0016518882,0.0879175,0.00012973577,0.041927442,0.046312787,0.82179254],"study_design_scores_gemma":[0.00012587525,0.000024312962,0.000008179622,0.0000179798,0.0000016635619,0.000010413827,0.0000046936734,0.9872925,0.0009847503,0.005018337,0.0064244843,0.000086801716],"about_ca_topic_score_codex":0.000003343219,"about_ca_topic_score_gemma":0.000003743148,"teacher_disagreement_score":0.899375,"about_ca_system_score_codex":0.000010005383,"about_ca_system_score_gemma":0.0000065636336,"threshold_uncertainty_score":0.20360105},"labels":[],"label_agreement":null},{"id":"W1588841734","doi":"10.1109/ccece.2001.933764","title":"Traffic identification using artificial neural network [Internet traffic]","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Telnet; Computer science; Backpropagation; Artificial neural network; Classifier (UML); Artificial intelligence; Perceptron; The Internet; Telephony; File Transfer Protocol; Multilayer perceptron; Machine learning; Time delay neural network; Feed forward; Feedforward neural network; Data mining; Computer network; Engineering; World Wide Web","score_opus":0.04402837148749212,"score_gpt":0.24997117595415488,"score_spread":0.20594280446666277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588841734","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.16317466,0.00025411617,0.83344764,0.0004559341,0.0010510547,0.00010872063,2.390751e-7,0.0005267668,0.0009809053],"genre_scores_gemma":[0.95965874,0.000009254834,0.03848474,0.0002128501,0.00046249747,0.0000039910374,0.0000042192933,0.0000132737205,0.0011504291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857795,0.000072259696,0.0003501647,0.00041458127,0.00023018938,0.00035486594],"domain_scores_gemma":[0.9993389,0.000035123,0.00013314938,0.0003366053,0.00007389821,0.000082325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022867047,0.00014494048,0.00013104356,0.00007313935,0.00019988406,0.0005926874,0.00048895105,0.00007412207,0.000105644205],"category_scores_gemma":[0.000012954446,0.00013944988,0.00006248938,0.00069067365,0.00003821393,0.00069612294,0.000056881814,0.000115659815,0.00011149485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020549112,0.000045266635,0.0000086816035,0.0000036151346,0.0000045936454,0.0000028079712,0.00025915683,0.847759,0.00003542779,0.0032729912,0.0036467647,0.14495963],"study_design_scores_gemma":[0.00009109553,0.000022554592,0.00003378538,0.000013066749,0.000007966453,0.000020199224,0.000010292902,0.99888766,0.00012694864,0.00027285385,0.00034282007,0.0001707642],"about_ca_topic_score_codex":0.0000030434835,"about_ca_topic_score_gemma":0.0000117706295,"teacher_disagreement_score":0.7964841,"about_ca_system_score_codex":0.00003652351,"about_ca_system_score_gemma":0.000012277187,"threshold_uncertainty_score":0.5715298},"labels":[],"label_agreement":null},{"id":"W1591593704","doi":"","title":"PolicyVis: firewall security policy visualization and inspection","year":2007,"lang":"en","type":"article","venue":"USENIX Large Installation Systems Administration Conference","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Firewall (physics); Application firewall; Computer science; Computer security; Security policy; Context-based access control; DMZ; Visualization; Network security; Stateful firewall; Data mining; Business","score_opus":0.01745739873635292,"score_gpt":0.29773056044300583,"score_spread":0.2802731617066529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591593704","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.09526499,0.00010254909,0.8951112,0.000389393,0.00041099815,0.00035478317,0.000008941627,0.0006380571,0.0077190585],"genre_scores_gemma":[0.997463,0.000060370137,0.0014376316,0.00014287405,0.0004376497,0.000012860299,0.000080486345,0.0000171203,0.00034803178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978559,0.00013094503,0.0006581931,0.00052224874,0.0004498627,0.00038286176],"domain_scores_gemma":[0.99839586,0.000089692454,0.00044176102,0.0003521366,0.00052385725,0.00019667286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009664108,0.00023269214,0.00021398325,0.00038900398,0.0004733528,0.00096772134,0.00022992652,0.00020749395,0.000006495926],"category_scores_gemma":[0.0001565108,0.00024905257,0.000035394118,0.000994538,0.000055354896,0.0015783595,0.000080559235,0.00013756764,0.000014216635],"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.000028566737,0.0001017916,0.003682166,0.00008615867,0.000016550985,0.000007403489,0.006416497,0.0002453009,0.0003062614,0.9859032,0.00020274396,0.0030033588],"study_design_scores_gemma":[0.0008376544,0.0002115348,0.008497193,0.00013478476,0.000011522049,0.0001280356,0.00066364167,0.9720592,0.0008393344,0.0036353362,0.01246568,0.00051608926],"about_ca_topic_score_codex":0.000103238715,"about_ca_topic_score_gemma":0.00033811035,"teacher_disagreement_score":0.98226786,"about_ca_system_score_codex":0.00014302811,"about_ca_system_score_gemma":0.0004443826,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W1594309940","doi":"10.1007/978-3-642-00904-4_16","title":"Performance Characterization for the Implementation of Content Addressable Memories Based on Parallel Hashing Memories","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Architecture; Latency (audio); Hash function; Set (abstract data type); Computer architecture; Very-large-scale integration; Parallel computing; Embedded system; Computer engineering; Programming language; Telecommunications","score_opus":0.031753346613989784,"score_gpt":0.26444498644813563,"score_spread":0.23269163983414584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594309940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024164513,0.00009801961,0.9965529,0.0012495583,0.0009081902,0.0006278717,0.000009041971,0.00006943875,0.00024332317],"genre_scores_gemma":[0.5848125,0.00014547231,0.41176182,0.002150964,0.0005802002,0.000058737645,0.00009890302,0.00003674313,0.00035466242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977758,0.000024525947,0.00048247122,0.0006804883,0.00066788465,0.00036882356],"domain_scores_gemma":[0.997877,0.0004427673,0.000539232,0.0006654897,0.00042739796,0.000048133585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083717756,0.00031740675,0.00033493707,0.00029828152,0.00047772532,0.00045890248,0.0013526889,0.0001293942,0.000006528775],"category_scores_gemma":[0.000043918462,0.00023652143,0.00008080905,0.00039890243,0.00029160175,0.00073632644,0.00014342564,0.0002444886,0.0000012699238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019969255,0.000012566425,0.00008193365,0.000052333915,0.0000052267205,6.596035e-7,0.0005351273,0.379593,0.00009048477,0.0016074358,0.000007986198,0.61799324],"study_design_scores_gemma":[0.0003945092,0.00033117336,0.0007426241,0.00038842755,0.000013574546,0.0000025313802,0.0000011573175,0.9891324,0.0049093287,0.0034710637,0.00034117483,0.00027201982],"about_ca_topic_score_codex":0.000004924493,"about_ca_topic_score_gemma":0.000022724811,"teacher_disagreement_score":0.6177212,"about_ca_system_score_codex":0.0001243007,"about_ca_system_score_gemma":0.00039536622,"threshold_uncertainty_score":0.9645064},"labels":[],"label_agreement":null},{"id":"W1600993111","doi":"10.1109/pacrim.2003.1235743","title":"Network processor design: issues and challenges","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; OSI model; Computer network; Software deployment; Network planning and design; Communications protocol; Networking hardware; Protocol (science); The Internet; Software engineering; Operating system","score_opus":0.05238004862480959,"score_gpt":0.25485296937835983,"score_spread":0.20247292075355022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600993111","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.00010744787,0.017356299,0.96999884,0.009629271,0.00008435992,0.00007003308,1.8475667e-8,0.00027209416,0.0024816182],"genre_scores_gemma":[0.109727286,0.0054030973,0.8835499,0.00057844917,0.00022462655,0.000011961927,3.7360894e-7,0.000008224771,0.0004960737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938047,0.000020746182,0.000083361985,0.00023443095,0.00009886736,0.00018215142],"domain_scores_gemma":[0.99969816,0.000023924815,0.000031710726,0.00014940338,0.000046749443,0.000050067174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020066253,0.00007986775,0.00008075161,0.000021756225,0.0001194338,0.00014702126,0.00020432651,0.000039089948,0.000002211167],"category_scores_gemma":[0.00001098842,0.000064688735,0.000007956965,0.00018329985,0.000022255748,0.00039794532,0.00006517374,0.00004150934,0.000011182431],"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.000010937382,0.00007811447,0.00006929635,0.00010568615,0.000015368152,0.000011972505,0.0031281938,0.3192133,0.000011797678,0.3436425,0.0023842047,0.33132863],"study_design_scores_gemma":[0.0012579241,0.0004416977,0.0007157143,0.0002797838,0.000014174515,0.000077970544,0.00013166569,0.2622325,0.0017936719,0.7204201,0.011868066,0.0007667073],"about_ca_topic_score_codex":0.0000030539702,"about_ca_topic_score_gemma":0.0000050159015,"teacher_disagreement_score":0.37677762,"about_ca_system_score_codex":0.000008405766,"about_ca_system_score_gemma":0.00003423625,"threshold_uncertainty_score":0.263793},"labels":[],"label_agreement":null},{"id":"W1729220625","doi":"10.1109/ccece.2000.849552","title":"Traffic identification using Bayes' classifier","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 New Brunswick","funders":"","keywords":"Computer science; Naive Bayes classifier; Byte; Classifier (UML); Traffic classification; Bayes' theorem; Data mining; Quality of service; Bayes classifier; The Internet; Network packet; Server; Bayes error rate; Artificial intelligence; Machine learning; Computer network; Bayesian probability; World Wide Web; Support vector machine; Operating system","score_opus":0.04397368960835139,"score_gpt":0.24372187411859425,"score_spread":0.19974818451024284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1729220625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010809634,0.00012226055,0.98214966,0.00037697132,0.000279014,0.00004004766,7.595937e-8,0.0002480805,0.0059742345],"genre_scores_gemma":[0.8920048,0.000017345465,0.10408066,0.00016478967,0.00007104376,0.000001931513,8.849934e-7,0.000005449593,0.0036530897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934316,0.000025139532,0.00014229142,0.00021853032,0.0001333585,0.00013750842],"domain_scores_gemma":[0.9995821,0.000015627382,0.000055258704,0.00025407955,0.00005240039,0.000040497533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116815994,0.00006126827,0.000054061456,0.000059952858,0.00013789324,0.00026661606,0.00026246207,0.000038876526,0.00008409099],"category_scores_gemma":[0.000009743186,0.000056009798,0.000022895409,0.00041018426,0.00001678627,0.0005823708,0.00002902401,0.000047552025,0.000114144874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014134471,0.00016273545,0.00016146568,0.000019384492,0.000013289695,0.000005369591,0.0013474207,0.23120594,0.0014291741,0.022160212,0.0146990055,0.7287946],"study_design_scores_gemma":[0.00006889817,0.000005231251,0.00005993578,0.0000059504177,0.0000024561937,0.0000069753282,0.000007763703,0.99824244,0.00033110238,0.00025628693,0.0009335601,0.00007938059],"about_ca_topic_score_codex":0.0000010495356,"about_ca_topic_score_gemma":0.0000012214742,"teacher_disagreement_score":0.8811952,"about_ca_system_score_codex":0.000022722325,"about_ca_system_score_gemma":0.000008494136,"threshold_uncertainty_score":0.25709847},"labels":[],"label_agreement":null},{"id":"W1769793830","doi":"10.1109/mtdt.1994.397198","title":"Fully-parallel multi-megabit integrated CAM/RAM design","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Megabit; Computer science; Computer hardware; Computer architecture; Chip; Embedded system; Line (geometry); Memory architecture; Electronic circuit; Implementation; Scheme (mathematics); Parallel computing; Engineering; Electrical engineering; Telecommunications","score_opus":0.05049293546176017,"score_gpt":0.23754735416058784,"score_spread":0.18705441869882766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769793830","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.00014987132,0.0002727355,0.9916871,0.00059290056,0.00022075075,0.00011547158,2.0439026e-7,0.00056151155,0.0063994247],"genre_scores_gemma":[0.07609117,0.000052112384,0.90475476,0.00061392726,0.0000457462,0.000012959989,0.0000023487812,0.0000109956545,0.018415973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989275,0.00008329105,0.00019482855,0.00034391406,0.00016533615,0.0002851414],"domain_scores_gemma":[0.9993023,0.00005748558,0.000062644256,0.00035756582,0.00012106922,0.000098908364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019718114,0.00014442051,0.00012741482,0.00007819098,0.00015258949,0.00027752703,0.0005621607,0.000078718724,0.00019528711],"category_scores_gemma":[0.000040449813,0.00011614792,0.00003739248,0.000601451,0.000034870325,0.00050057913,0.000073896845,0.00012800876,0.00039058173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001681209,0.00060666935,0.0005532759,0.000023306942,0.000046356472,0.00003459329,0.0021161009,0.4272072,0.00024980886,0.015324146,0.16636185,0.38745987],"study_design_scores_gemma":[0.0003510954,0.0000501837,0.0000413604,0.000014420406,0.000003147904,0.000011061343,0.000011295147,0.9958123,0.00024438108,0.00028435537,0.0030035302,0.00017284766],"about_ca_topic_score_codex":0.000017594935,"about_ca_topic_score_gemma":0.00000876543,"teacher_disagreement_score":0.5686051,"about_ca_system_score_codex":0.000031465992,"about_ca_system_score_gemma":0.000026347103,"threshold_uncertainty_score":0.5020268},"labels":[],"label_agreement":null},{"id":"W1778647827","doi":"10.1109/iscas.2002.1010523","title":"0.8 V CMOS content-addressable-memory (CAM) cell circuit with a fast tag-compare capability using bulk PMOS dynamic-threshold (BP-DTMOS) technique based on standard CMOS technology for low-voltage VLSI systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PMOS logic; CMOS; Threshold voltage; Computer science; Very-large-scale integration; Electronic engineering; Voltage; MOSFET; Electrical engineering; Transistor; Materials science; Embedded system; Engineering","score_opus":0.024690220807921315,"score_gpt":0.23763696669031614,"score_spread":0.21294674588239482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778647827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014511257,0.00018967544,0.9767389,0.00012952829,0.0003982638,0.0029974948,0.00005140345,0.0010461248,0.0039373413],"genre_scores_gemma":[0.91544735,0.0000042692945,0.082895756,0.00026490208,0.000031802017,0.0005565311,0.000025390447,0.00007746587,0.0006964991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959734,0.00014798333,0.0007636412,0.0014397356,0.00067184854,0.0010033645],"domain_scores_gemma":[0.9966527,0.00018862828,0.00047632644,0.0016258286,0.00082617224,0.0002303141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010832588,0.00061761355,0.0007974577,0.00039379412,0.0006112788,0.00051351363,0.0010736677,0.00036964306,0.000020194058],"category_scores_gemma":[0.000086970314,0.00052627217,0.00013470209,0.0014819838,0.00028599863,0.0005423558,0.0000996457,0.0004883107,0.000005959637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004448285,0.0011441974,0.005389559,0.0020655023,0.00009127328,0.000070062975,0.00033882147,0.95055383,0.01940365,0.01578024,0.0008780629,0.0038399405],"study_design_scores_gemma":[0.0025059632,0.0006045049,0.000009251912,0.0007138065,0.000043258373,0.0000554102,0.00039109337,0.9474845,0.04608828,0.000744999,0.00053631025,0.0008226257],"about_ca_topic_score_codex":0.000060807815,"about_ca_topic_score_gemma":0.000072255614,"teacher_disagreement_score":0.9009361,"about_ca_system_score_codex":0.000580411,"about_ca_system_score_gemma":0.00063381373,"threshold_uncertainty_score":0.9997189},"labels":[],"label_agreement":null},{"id":"W1781272967","doi":"10.3233/978-1-60750-049-0-284","title":"Formal Specification and Analysis of Firewalls","year":2009,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Network Packet Processing and Optimization","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 en Outaouais; Université Laval","funders":"","keywords":"Computer science","score_opus":0.028762232498105993,"score_gpt":0.2576080885729131,"score_spread":0.22884585607480712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781272967","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.000016391255,0.001618951,0.97576296,0.00017880257,0.000051412866,0.00022353536,0.00000942363,0.000028454506,0.022110073],"genre_scores_gemma":[0.16596918,0.035949174,0.73910034,0.00053471536,0.00066720264,0.00026358478,0.00066634984,0.00008333656,0.05676613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888843,0.000008863523,0.00044890307,0.00038487208,0.00013073842,0.00013821824],"domain_scores_gemma":[0.9992576,0.000034371467,0.00024615752,0.0003275771,0.00008240068,0.00005184498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018600428,0.00014494761,0.00030567613,0.00051768066,0.000103244514,0.0000868016,0.00026745757,0.00014887439,0.0000064333426],"category_scores_gemma":[0.000005223573,0.00015503755,0.00005495028,0.00045517244,0.00013237681,0.00022415476,0.00005485023,0.00013540372,0.0000026295181],"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.000002604936,0.000014360932,0.000048919275,0.000008011456,0.000032503274,2.0026661e-7,0.0001642163,0.0011309858,0.000002635284,0.3525073,0.00007809849,0.64601016],"study_design_scores_gemma":[0.000016446238,0.000037645546,0.00027525282,0.000060604398,0.0002120719,0.0000010445752,0.0000567427,0.4201784,0.00021066405,0.56354284,0.01512752,0.00028073584],"about_ca_topic_score_codex":0.000003869934,"about_ca_topic_score_gemma":0.000015727408,"teacher_disagreement_score":0.6457294,"about_ca_system_score_codex":0.000024828329,"about_ca_system_score_gemma":0.000030031417,"threshold_uncertainty_score":0.63222474},"labels":[],"label_agreement":null},{"id":"W1838648969","doi":"10.1109/cicc.1999.777282","title":"A self-timed, fully-parallel content addressable queue for switching applications","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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; Pointer (user interface); Queue; CMOS; Parallel computing; Queueing theory; Content-addressable storage; Embedded system; Computer hardware; Content-addressable memory; Computer network; Electronic engineering; Engineering","score_opus":0.031360491002569615,"score_gpt":0.25151552714350667,"score_spread":0.22015503614093707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838648969","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.000051045576,0.00026245252,0.97701585,0.0004347216,0.00009932267,0.0005077043,5.814355e-7,0.00039584137,0.021232495],"genre_scores_gemma":[0.044997066,0.000028772592,0.9509717,0.00052139565,0.000058932375,0.0004489472,0.00000513787,0.000012136054,0.0029558851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990413,0.000032181677,0.00019759742,0.00033315443,0.00012490201,0.00027082654],"domain_scores_gemma":[0.9992136,0.00009385594,0.00008447884,0.00035634113,0.00016536018,0.000086377724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030265131,0.00011142036,0.000121732824,0.00004970139,0.0002913813,0.00023318658,0.00036829972,0.00005339331,0.000011997381],"category_scores_gemma":[0.000028384677,0.000098277174,0.00005038075,0.000291558,0.0000090843905,0.00037688366,0.000038060072,0.00006451837,0.00003255968],"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.000007053858,0.00020017974,0.00016425423,0.00006838118,0.00003544265,6.163087e-7,0.00040251113,0.0120257335,0.00016519215,0.9584401,0.0056711384,0.022819387],"study_design_scores_gemma":[0.0008581387,0.000056551347,0.00001213491,0.00002003063,0.000015381562,0.00001409349,0.00006622889,0.8542716,0.0011628579,0.021877559,0.12135645,0.00028895415],"about_ca_topic_score_codex":0.000006377748,"about_ca_topic_score_gemma":0.0000093705585,"teacher_disagreement_score":0.93656254,"about_ca_system_score_codex":0.00003296614,"about_ca_system_score_gemma":0.00009676147,"threshold_uncertainty_score":0.40076268},"labels":[],"label_agreement":null},{"id":"W1887768855","doi":"10.1109/mwscas.1993.343333","title":"VLSI implementation of a modular ANN chip for character recognition","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Very-large-scale integration; Modular design; Computer science; Chip; CMOS; Character (mathematics); Computer architecture; Architecture; Embedded system; Computer hardware; Artificial intelligence; Electronic engineering; Engineering; Programming language; Telecommunications; Mathematics","score_opus":0.03946352121113815,"score_gpt":0.2677375651519701,"score_spread":0.22827404394083195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887768855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034701515,0.00003600875,0.9635348,0.0004952297,0.00011019558,0.00015960849,0.0000032100409,0.000068960064,0.0008904892],"genre_scores_gemma":[0.8197115,0.000027824346,0.17950808,0.00027735927,0.00008476569,0.000030578827,0.000033151086,0.0000056808412,0.0003210598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995051,0.000014274332,0.00014666528,0.00014390456,0.000082827566,0.00010725075],"domain_scores_gemma":[0.99964994,0.000018499535,0.000085656546,0.00011583284,0.00010805553,0.00002199492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112102665,0.000050737188,0.000063680185,0.000051290855,0.000051808292,0.000047627283,0.0001126412,0.00002436719,0.00008546719],"category_scores_gemma":[0.000006256084,0.00004668944,0.000028973267,0.00016332713,0.0000072942107,0.00044713286,0.0000160432,0.000019742865,0.000011863591],"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.0000033654778,0.000057599198,0.0002902624,0.000043634187,0.000010676788,2.2956478e-7,0.00084222545,0.00026014843,0.0010541341,0.0015010238,0.0022572689,0.9936794],"study_design_scores_gemma":[0.00070694194,0.00014497853,0.0013902003,0.000022932189,0.000012633232,0.000003193484,0.000048247744,0.967371,0.024208546,0.0049933963,0.00094605726,0.00015188556],"about_ca_topic_score_codex":0.000004377476,"about_ca_topic_score_gemma":0.0000031640498,"teacher_disagreement_score":0.99352753,"about_ca_system_score_codex":0.000008343164,"about_ca_system_score_gemma":0.000006100119,"threshold_uncertainty_score":0.19039403},"labels":[],"label_agreement":null},{"id":"W1901393373","doi":"","title":"An Introduction to Using Linux as a Multipurpose Firewall","year":2000,"lang":"en","type":"article","venue":"Linux journal","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Wireless Telecommunications Association","funders":"","keywords":"Firewall (physics); Operating system; Computer science; Business","score_opus":0.010987387340775031,"score_gpt":0.2761709946404682,"score_spread":0.26518360729969315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901393373","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.44666046,0.00012473177,0.5484629,0.0031964306,0.0009838891,0.000084040876,3.122242e-7,0.00013585482,0.0003513638],"genre_scores_gemma":[0.54736155,0.000064958636,0.4438469,0.0011817792,0.0062359963,0.0000023558866,0.0000025283946,0.000021910531,0.001281985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987773,0.00009766365,0.00026606335,0.00030382487,0.0002638803,0.00029130818],"domain_scores_gemma":[0.9991396,0.000013828214,0.000095681455,0.00032297857,0.00015370183,0.00027419452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004125291,0.0001235464,0.00012283606,0.00012544166,0.0004033683,0.0007077579,0.00049388956,0.00006760524,0.00021778939],"category_scores_gemma":[0.00003541612,0.00011447653,0.000046174406,0.00048643321,0.000016642458,0.0011143051,0.00003066336,0.00027242553,0.00008783363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045960358,0.000116813775,0.00012716636,0.000003942161,0.000011337296,0.000038470414,0.0046802578,0.38629356,0.001191839,0.00014174606,0.0023862333,0.6049627],"study_design_scores_gemma":[0.00031424814,0.00022673771,0.00011065612,0.000037264082,0.000009186819,0.00095592457,0.000028732891,0.97832423,0.00081233366,0.0012278414,0.017749287,0.0002035457],"about_ca_topic_score_codex":0.000010369202,"about_ca_topic_score_gemma":0.0000037808486,"teacher_disagreement_score":0.60475916,"about_ca_system_score_codex":0.0000730131,"about_ca_system_score_gemma":0.000118490505,"threshold_uncertainty_score":0.6824926},"labels":[],"label_agreement":null},{"id":"W1968145044","doi":"10.1109/tcsi.2013.2283997","title":"High-Throughput Low-Energy Self-Timed CAM Based on Reordered Overlapped Search Mechanism","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Japan Society for the Promotion of Science; University of Tokyo","keywords":"Computer science; Asynchronous communication; Word (group theory); Throughput; Dissipation; Energy (signal processing); Electronic circuit; Computer hardware; CMOS; Electronic engineering; Electrical engineering; Mathematics; Engineering; Telecommunications","score_opus":0.008486655486713809,"score_gpt":0.19401198399834818,"score_spread":0.18552532851163436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968145044","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.004111406,0.00008754075,0.9912958,0.000600853,0.0012408508,0.00045942495,0.0000067981,0.00045470387,0.0017425952],"genre_scores_gemma":[0.995025,0.000081353006,0.0024924406,0.00046556097,0.00009136244,0.00014730779,0.000006198878,0.000042236778,0.0016485708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974292,0.00030279637,0.0003832614,0.00076401647,0.00062520156,0.00049550785],"domain_scores_gemma":[0.99852794,0.0001471613,0.00011885483,0.00073012157,0.00017639405,0.0002995317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035254555,0.00032581412,0.00036482117,0.0002483609,0.0005942881,0.0005577949,0.00038369815,0.0002287787,0.00003755168],"category_scores_gemma":[0.000004929731,0.0002929761,0.00010674345,0.00058204087,0.00007443327,0.00041897423,0.000003286566,0.0002315842,0.000038068625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003301364,0.0007756823,0.000005735284,0.0004170845,0.00027193196,0.000029351697,0.0013664085,0.7518742,0.011427952,0.049335074,0.0011432432,0.18332031],"study_design_scores_gemma":[0.0012672549,0.00035728805,0.00001949849,0.00029138147,0.000030911775,0.000026552994,0.00014434679,0.9903506,0.006072729,0.0003498104,0.00061195076,0.00047768105],"about_ca_topic_score_codex":0.0004421847,"about_ca_topic_score_gemma":0.000019962243,"teacher_disagreement_score":0.99091357,"about_ca_system_score_codex":0.00012605908,"about_ca_system_score_gemma":0.00017958412,"threshold_uncertainty_score":0.99995226},"labels":[],"label_agreement":null},{"id":"W1970328709","doi":"10.1109/tpds.2011.51","title":"SCBXP: An Efficient CAM-Based XML Parsing Technique in Hardware Environments","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Beirut Arab University","keywords":"Computer science; XML Signature; Streaming XML; Efficient XML Interchange; XML framework; Simple API for XML; XML database; XML Encryption; XML validation; Parsing; XML; Programming language; Operating system","score_opus":0.02618344522003093,"score_gpt":0.22542693635864888,"score_spread":0.19924349113861795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970328709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072169527,0.00010707183,0.99170786,0.000026914835,0.0002799539,0.0003589946,0.000038254093,0.00014552807,0.00011847989],"genre_scores_gemma":[0.98916364,0.000015267451,0.010550919,0.00003053034,0.000012638914,0.00015150539,0.000023689083,0.000011474079,0.00004034034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862003,0.0001485045,0.00030361052,0.0004348602,0.0002043837,0.00028862504],"domain_scores_gemma":[0.9993509,0.000027835355,0.00009238167,0.0003601485,0.000024403289,0.0001443185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026414063,0.00018643754,0.00019871579,0.00014512395,0.0002424662,0.00012205895,0.00024455268,0.00012955257,0.000004672524],"category_scores_gemma":[0.0000016816252,0.00017634992,0.000040041323,0.00035590632,0.000054570537,0.00024023495,0.000002186058,0.00017599502,0.000008206273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003477873,0.0003552493,0.00016765937,0.000028291577,0.0000068544036,0.000010614801,0.00030650423,0.99717075,0.00012054088,0.00011778467,0.0000164875,0.0016644843],"study_design_scores_gemma":[0.0006571127,0.00015396446,0.00044881355,0.00017466313,0.000011502029,0.000020101059,0.00009723496,0.9969817,0.0010074184,0.00005085046,0.00013520097,0.0002614581],"about_ca_topic_score_codex":0.00012046718,"about_ca_topic_score_gemma":0.000015673035,"teacher_disagreement_score":0.9819467,"about_ca_system_score_codex":0.00008792036,"about_ca_system_score_gemma":0.00004442707,"threshold_uncertainty_score":0.7191341},"labels":[],"label_agreement":null},{"id":"W1978070018","doi":"10.1145/1101908.1101925","title":"Blowtorch","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Network packet; Computer network; Packet analyzer; Packet generator; Stateful firewall; Firewall (physics); Header; Distributed computing; Real-time computing; Processing delay; Transmission delay","score_opus":0.006713487888598387,"score_gpt":0.219518846482702,"score_spread":0.21280535859410363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978070018","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.00061389274,0.00006275644,0.9169309,0.0017537007,0.000058373833,0.000011049348,1.0027282e-8,0.00019388924,0.08037542],"genre_scores_gemma":[0.47378814,0.000008196248,0.5194693,0.0007226449,0.00013092693,0.0000011155311,2.4439439e-7,0.0000017536075,0.0058776224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972165,0.0000058867668,0.000043960903,0.00008893225,0.00006120108,0.00007839588],"domain_scores_gemma":[0.99981046,0.000008407534,0.000009935615,0.00012657362,0.000020132647,0.000024493067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059493817,0.000026315567,0.000023902849,0.000017942193,0.000040539213,0.00007173282,0.00018837252,0.000013093203,0.000031233263],"category_scores_gemma":[0.0000030383897,0.000021542646,0.000008877829,0.00013865999,0.0000049753003,0.00027905536,0.000030197047,0.000021961414,0.00016282932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.407361e-7,0.000024658504,0.00015825492,0.0000015921856,0.0000019258823,6.581731e-7,0.00018946464,0.011252358,0.00004244861,0.11625738,0.01660686,0.855464],"study_design_scores_gemma":[0.00007104864,0.0000074570416,0.00007427595,0.000002471442,4.855714e-7,0.000003673993,0.0000015159508,0.93754274,0.0012820709,0.0011083753,0.05984759,0.00005827315],"about_ca_topic_score_codex":7.452922e-7,"about_ca_topic_score_gemma":0.0000015695153,"teacher_disagreement_score":0.9262904,"about_ca_system_score_codex":0.0000069484677,"about_ca_system_score_gemma":0.000012902813,"threshold_uncertainty_score":0.20928958},"labels":[],"label_agreement":null},{"id":"W1979897473","doi":"10.1109/hpcc.2012.129","title":"Performance Evaluation of Widely Used Portknoking Algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Dalhousie University","funders":"","keywords":"Computer science; Firewall (physics); Computer network; Internet Control Message Protocol; Network packet; Implementation; Algorithm; Application firewall; Encryption; Stateful firewall; IPv6; Network address translation; Operating system; The Internet; Internet Protocol","score_opus":0.05640658317555513,"score_gpt":0.29613958696574844,"score_spread":0.2397330037901933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979897473","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.25529376,0.00018912957,0.73139316,0.00007068036,0.0003494744,0.00007649953,7.574556e-8,0.00008480313,0.012542459],"genre_scores_gemma":[0.89484954,0.000007880837,0.104907565,0.000039097074,0.00007106961,0.000004306339,0.0000017238948,0.0000033077777,0.000115505056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991162,0.000046019508,0.00015069394,0.00010227038,0.00042505105,0.00015978234],"domain_scores_gemma":[0.99943227,0.000020642277,0.000097621705,0.0001915465,0.00021799484,0.000039927585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014979304,0.000054626475,0.00006840497,0.000050066268,0.000059239643,0.000028920096,0.00018325525,0.00002987492,0.00002376045],"category_scores_gemma":[0.000021814818,0.00004669324,0.000017258326,0.00029828673,0.000014159998,0.0010164544,0.000042308344,0.00003703889,0.000010051066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016535839,0.000069999944,0.039563656,0.00001636143,0.000009595971,6.698674e-8,0.0015649884,0.044556264,0.00016545712,0.0029702678,0.00033580352,0.91074586],"study_design_scores_gemma":[0.00015111286,0.000014549448,0.008996244,0.000017633774,0.000008855601,0.000002427868,0.000012739914,0.987229,0.003314948,0.00009426399,0.0000936152,0.00006460613],"about_ca_topic_score_codex":0.0000033418903,"about_ca_topic_score_gemma":5.3728394e-7,"teacher_disagreement_score":0.9426727,"about_ca_system_score_codex":0.000023651057,"about_ca_system_score_gemma":0.0000607973,"threshold_uncertainty_score":0.19040951},"labels":[],"label_agreement":null},{"id":"W1981393870","doi":"10.1109/bwcca.2012.61","title":"Performance Evaluation of Multi-pattern Matching Algorithms on Smartphone","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Android (operating system); Malware; Pattern matching; Android malware; Algorithm; Matching (statistics); Data mining; Machine learning; Artificial intelligence; Operating system","score_opus":0.050854952757699176,"score_gpt":0.29791011707037474,"score_spread":0.24705516431267555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981393870","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.22770756,0.00007038694,0.76935315,0.000051694606,0.00035273255,0.00006447022,1.5391092e-7,0.00005863484,0.0023412285],"genre_scores_gemma":[0.9081603,0.00000888164,0.09148199,0.00010378558,0.000080102946,0.000006547526,0.0000023617386,0.000004744437,0.00015126955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990968,0.000058970552,0.00014220239,0.00012686527,0.00038110494,0.0001940173],"domain_scores_gemma":[0.99950266,0.00002434667,0.000083931365,0.00021719978,0.00012879111,0.00004305198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011338793,0.00007109183,0.00007477928,0.000057862675,0.00007809096,0.000031711286,0.00019401191,0.000030935098,0.000023287519],"category_scores_gemma":[0.000011117287,0.00005885118,0.00001873797,0.00019761002,0.0000113044125,0.0006142472,0.0000523057,0.00005451349,0.000044372755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014229144,0.00010530449,0.005451055,0.000011054768,0.000004757106,4.1149505e-8,0.0011418029,0.041864183,0.00008853658,0.00014385568,0.00007949053,0.9511085],"study_design_scores_gemma":[0.0002965274,0.000026057816,0.016475864,0.00003353185,0.0000059097883,0.0000016303248,0.000016618706,0.979002,0.0040149614,0.000033672386,0.000017282442,0.00007595262],"about_ca_topic_score_codex":0.000010314731,"about_ca_topic_score_gemma":0.0000015302548,"teacher_disagreement_score":0.9510325,"about_ca_system_score_codex":0.000030442752,"about_ca_system_score_gemma":0.000026848396,"threshold_uncertainty_score":0.23998815},"labels":[],"label_agreement":null},{"id":"W1987566037","doi":"10.1145/968280.968341","title":"An FPGA prototype for the experimental evaluation of a multizone network cache","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 Alberta","funders":"","keywords":"Computer science; Cache; FIFO (computing and electronics); Cache algorithms; Field-programmable gate array; Process (computing); Network packet; Embedded system; CPU cache; Operating system; Computer network","score_opus":0.04837903463321186,"score_gpt":0.3366114786746345,"score_spread":0.2882324440414226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987566037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009180742,0.00042268456,0.988604,0.0002447214,0.00015042914,0.0009848104,2.1199536e-7,0.00006381191,0.0003485564],"genre_scores_gemma":[0.8107221,0.0000016699455,0.1888352,0.000078129604,0.00010455496,0.00023269976,0.000002890454,0.0000045713978,0.000018178796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928653,0.000046027697,0.00012756977,0.00016418338,0.00024741466,0.0001282607],"domain_scores_gemma":[0.9993899,0.000037958762,0.00007063003,0.00027230324,0.0002033758,0.000025820276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008389381,0.00006161386,0.00006295142,0.000014801809,0.00015135886,0.00006321546,0.0002992797,0.00002960795,0.000007434484],"category_scores_gemma":[0.000017701157,0.00004032693,0.000025864345,0.00021286093,0.000026515547,0.00028076506,0.00002565179,0.00003010017,0.000001508577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001973882,0.000097838725,0.000029558896,0.000003973436,0.000007523806,4.0751683e-8,0.0008196908,0.9453444,0.0003187374,0.006513548,0.000091899885,0.046753086],"study_design_scores_gemma":[0.0007451878,0.00023774825,0.0001324388,0.000013874049,0.000011530528,0.0000010506814,0.000062923005,0.97970915,0.015620948,0.0033453023,0.000058154277,0.000061720806],"about_ca_topic_score_codex":0.00002146081,"about_ca_topic_score_gemma":0.000014822587,"teacher_disagreement_score":0.8015414,"about_ca_system_score_codex":0.000036391448,"about_ca_system_score_gemma":0.0001146864,"threshold_uncertainty_score":0.16444845},"labels":[],"label_agreement":null},{"id":"W1990491009","doi":"10.1016/j.micpro.2004.03.013","title":"FPGA implementation and experimental evaluation of a multizone network cache","year":2004,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Computer science; Cache; Field-programmable gate array; Network packet; Virtex; Process (computing); Embedded system; Lookup table; Cache algorithms; CPU cache; Operating system; Computer network","score_opus":0.01715768079153326,"score_gpt":0.29134430091755104,"score_spread":0.2741866201260178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990491009","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.90803194,0.012851221,0.07840834,0.000082482686,0.00016627356,0.00033797594,0.0000032344633,0.000046423193,0.00007210257],"genre_scores_gemma":[0.9882,0.00005862422,0.011561319,0.00004121905,0.00007042256,0.000029261095,0.000011637643,0.000010160478,0.000017344943],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988974,0.000057026613,0.00029395716,0.00032567696,0.00022040203,0.00020555542],"domain_scores_gemma":[0.9993801,0.000012273595,0.00020468861,0.00014460384,0.0002019503,0.000056344023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069210475,0.00013471281,0.00017697991,0.000056200777,0.0001881858,0.00014881053,0.0001316659,0.000059542326,0.000002665329],"category_scores_gemma":[0.0000059558124,0.00012498662,0.00002045161,0.00025779632,0.00005345155,0.00033226985,0.00007995177,0.000052069696,0.0000011270926],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008913144,0.0004273169,0.005557823,0.00095182564,0.00015922863,0.0000060560906,0.037220422,0.07270109,0.60608864,0.0035640192,0.00075201236,0.27248242],"study_design_scores_gemma":[0.008714587,0.00038872167,0.0015981015,0.00059490756,0.000114709175,0.00020428796,0.003947563,0.055837866,0.92506534,0.0020896147,0.0007086399,0.0007356562],"about_ca_topic_score_codex":0.00018363899,"about_ca_topic_score_gemma":0.000059975722,"teacher_disagreement_score":0.3189767,"about_ca_system_score_codex":0.000055931818,"about_ca_system_score_gemma":0.000094375835,"threshold_uncertainty_score":0.5096807},"labels":[],"label_agreement":null},{"id":"W1991047274","doi":"10.1109/async.2012.25","title":"High-Throughput Low-Energy Content-Addressable Memory Based on Self-Timed Overlapped Search Mechanism","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; University of Tokyo","keywords":"Computer science; Overhead (engineering); Throughput; Word (group theory); Content-addressable memory; Energy (signal processing); Dissipation; Computer hardware; CMOS; Content-addressable storage; Embedded system; Electronic engineering; Artificial intelligence; Engineering; Operating system","score_opus":0.024874160876655685,"score_gpt":0.23061943349697012,"score_spread":0.20574527262031445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991047274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024655724,0.00007753467,0.9799124,0.00075144647,0.00095227256,0.000144091,0.0000013576418,0.0007594087,0.014935941],"genre_scores_gemma":[0.80937046,0.000017849015,0.18290149,0.0025241312,0.00028982898,0.000026352393,0.000017125089,0.000028115683,0.004824668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977275,0.00017853767,0.00026428755,0.00047280884,0.0006092024,0.00074764754],"domain_scores_gemma":[0.99861467,0.00015845873,0.000095310235,0.0006990818,0.00017308113,0.0002594052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204938,0.00024115946,0.0002470573,0.00014143388,0.00027398445,0.00023157791,0.00064014137,0.00013926349,0.00014424915],"category_scores_gemma":[0.00002281427,0.00020535504,0.00007401568,0.0005466141,0.000043586617,0.00095103506,0.00016766826,0.00016127326,0.00012585186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009102117,0.0014299398,0.0001983433,0.00010217636,0.00008243446,0.000016600057,0.0007777142,0.06637441,0.0014762881,0.88951594,0.015944416,0.023990741],"study_design_scores_gemma":[0.0010962504,0.00013554764,0.00005707088,0.00005459299,0.000011496813,0.0000038702715,0.000042793552,0.942604,0.05366924,0.0013981644,0.00058149896,0.00034549227],"about_ca_topic_score_codex":0.00024600732,"about_ca_topic_score_gemma":0.000010308245,"teacher_disagreement_score":0.88811773,"about_ca_system_score_codex":0.0001046741,"about_ca_system_score_gemma":0.0001303244,"threshold_uncertainty_score":0.83741355},"labels":[],"label_agreement":null},{"id":"W2002013980","doi":"10.1155/2013/681894","title":"Hardware Accelerators Targeting a Novel Group Based Packet Classification Algorithm","year":2013,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Xeon; Scalability; Network packet; Parallel computing; Hardware acceleration; Speedup; Xeon Phi; Algorithm; Block (permutation group theory); Application-specific instruction-set processor; Embedded system; Instruction set; Computer hardware; Field-programmable gate array; Operating system; Computer network","score_opus":0.02045897926957338,"score_gpt":0.2544230019503378,"score_spread":0.2339640226807644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002013980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010616791,0.00016830022,0.98369706,0.0016962799,0.0023751033,0.00009550327,0.0000018762311,0.00008134861,0.0012677218],"genre_scores_gemma":[0.6257718,0.000017331831,0.37304878,0.00044520502,0.00064259756,0.0000023884256,0.000013292593,0.000014157652,0.000044453744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799067,0.00008247327,0.0007785706,0.00027090262,0.0006060323,0.0002713727],"domain_scores_gemma":[0.9966164,0.00022922641,0.0010635133,0.00017068505,0.0017879807,0.00013215013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826835,0.00017421714,0.00022625881,0.0003171704,0.00017156596,0.0010239305,0.0012943242,0.000081908685,0.00007950843],"category_scores_gemma":[0.00018006598,0.00016030346,0.00012978053,0.00034654886,0.000030387322,0.001557798,0.00006196872,0.00032108065,0.000028158274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000983737,0.0001787279,0.001562085,0.000016764972,0.00011009911,0.000018970208,0.00035014268,0.031097833,0.005485445,0.0013591577,0.006018054,0.95379287],"study_design_scores_gemma":[0.00068907056,0.00005664631,0.0014405024,0.00023470414,0.0000064731826,0.000093667135,0.00010362204,0.9924363,0.0017365626,0.0006023285,0.0024131883,0.00018696034],"about_ca_topic_score_codex":0.000021178774,"about_ca_topic_score_gemma":6.5815135e-7,"teacher_disagreement_score":0.96133846,"about_ca_system_score_codex":0.00015721183,"about_ca_system_score_gemma":0.00016899148,"threshold_uncertainty_score":0.9873786},"labels":[],"label_agreement":null},{"id":"W2003569306","doi":"10.1109/async.2013.16","title":"A Low-Energy Variation-Tolerant Asynchronous TCAM for Network Intrusion Detection Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Asynchronous communication; Content-addressable memory; Robustness (evolution); Byte; Network packet; Intrusion detection system; Dissipation; Word (group theory); Embedded system; Computer hardware; Artificial neural network; Computer network; Artificial intelligence","score_opus":0.005469129697024398,"score_gpt":0.1899289250570135,"score_spread":0.1844597953599891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003569306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009827762,0.00015838521,0.99533516,0.0001910517,0.0015992433,0.0003064343,2.4343404e-7,0.00035316436,0.0010735322],"genre_scores_gemma":[0.91274786,0.000019522884,0.08526073,0.0002736356,0.00076991064,0.00024062544,0.000007600904,0.000015081685,0.00066502683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988477,0.000058942274,0.0002757631,0.00033982517,0.00016356441,0.0003142079],"domain_scores_gemma":[0.9991158,0.00010356593,0.00014473319,0.00029668046,0.00025957587,0.00007963402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023449067,0.00013371605,0.00014841606,0.00006298764,0.0003475042,0.0005851253,0.0002868831,0.00010286163,0.000015672515],"category_scores_gemma":[0.000018575352,0.000113660455,0.000044959274,0.00041918454,0.000012299736,0.0007262545,0.00006674637,0.00005422675,0.00003370256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008858837,0.000059107835,0.000019524052,0.000050475985,0.000020488413,4.986497e-7,0.00021651025,0.6911985,0.00059905474,0.037307747,0.0036724543,0.26684678],"study_design_scores_gemma":[0.00025136105,0.000086581,0.00011478434,0.000046247256,0.0000052759633,0.000007726741,0.000007648228,0.99285793,0.0004247452,0.004896091,0.0011415043,0.00016012428],"about_ca_topic_score_codex":0.00023950354,"about_ca_topic_score_gemma":0.00003092094,"teacher_disagreement_score":0.9117651,"about_ca_system_score_codex":0.000068632864,"about_ca_system_score_gemma":0.00005383422,"threshold_uncertainty_score":0.56423765},"labels":[],"label_agreement":null},{"id":"W2010588223","doi":"10.1109/iscc.2014.6912478","title":"A formal framework for verifying inter-firewalls consistency","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Firewall (physics); Computer science; Consistency (knowledge bases); Security policy; Formal verification; Application firewall; Distributed computing; Model checking; Consistency model; Formal methods; Theoretical computer science; Data consistency; Computer security; Stateful firewall; Software engineering; Entropy (arrow of time)","score_opus":0.017922572360241692,"score_gpt":0.2634014934726423,"score_spread":0.2454789211124006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010588223","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.0005516689,0.000035829074,0.9897929,0.0005753392,0.0004277804,0.00008811701,1.8926005e-7,0.00022606344,0.008302136],"genre_scores_gemma":[0.44652906,0.000002599059,0.5523742,0.0007674071,0.00008882044,0.000012569134,0.0000011421688,0.000004676919,0.00021954793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992897,0.000019432682,0.00014930504,0.0002110451,0.00008297307,0.00024756158],"domain_scores_gemma":[0.9993485,0.00019664354,0.00006070735,0.0002622205,0.0000777835,0.000054133656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028600616,0.00008190099,0.00010133549,0.000037958955,0.00020253562,0.00020876742,0.00035078468,0.00006356098,0.000009184047],"category_scores_gemma":[0.00013285624,0.000070056994,0.00004713172,0.00015943556,0.000022960689,0.0005144163,0.000093089846,0.000069999995,0.000016491986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005983008,0.00002020455,0.00015801564,0.000030396735,0.0000063598786,2.2710836e-7,0.00043743485,0.00039055463,0.0000111618865,0.6875634,0.0010151197,0.31036115],"study_design_scores_gemma":[0.00021674146,0.000098168144,0.000038352642,0.000069860085,0.000004132075,0.0000043812884,0.000018192251,0.8783145,0.0003746891,0.1131643,0.0075505674,0.00014615232],"about_ca_topic_score_codex":0.0000022201605,"about_ca_topic_score_gemma":0.0000021797568,"teacher_disagreement_score":0.8779239,"about_ca_system_score_codex":0.000011951137,"about_ca_system_score_gemma":0.000025434812,"threshold_uncertainty_score":0.28568414},"labels":[],"label_agreement":null},{"id":"W2025967251","doi":"10.1007/s11265-014-0886-z","title":"Algorithm and Architecture of Fully-Parallel Associative Memories Based on Sparse Clustered Networks","year":2014,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Associative property; Field-programmable gate array; Content-addressable memory; Parallel computing; Artificial neural network; Architecture; Content-addressable storage; Computer architecture; Computer hardware; Artificial intelligence; Mathematics","score_opus":0.00867406844215649,"score_gpt":0.2171119082575264,"score_spread":0.20843783981536992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025967251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007992397,0.0013461299,0.9968026,0.00026106907,0.00035058323,0.00009358681,0.0000010077773,0.000030508334,0.0003152656],"genre_scores_gemma":[0.83569646,0.000012778722,0.16348504,0.00013463577,0.0005841462,0.0000023571495,0.0000012034691,0.00001608502,0.00006726923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979282,0.0003108065,0.0006821459,0.0002266728,0.0006018049,0.00025039748],"domain_scores_gemma":[0.99719214,0.00030620085,0.0016169393,0.00014848007,0.00061117276,0.00012504958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531416,0.00020120306,0.00050971156,0.00021179592,0.00019133544,0.00036956038,0.00042467462,0.00013151197,9.4685623e-7],"category_scores_gemma":[0.000074296324,0.00015289412,0.000079292215,0.00041725303,0.00008726765,0.0004354193,0.000045337445,0.00035647303,3.6944394e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059727376,0.000058070695,0.00020942985,0.00016402856,0.000028137956,0.000006636326,0.0007201289,0.77994406,0.00002994318,0.00009057944,0.00017381688,0.21851546],"study_design_scores_gemma":[0.0008041671,0.0004997033,0.00012600441,0.0012822492,0.000028658902,0.00006656098,0.000086748434,0.9959822,0.0000815035,0.00068446546,0.00019765733,0.00016002498],"about_ca_topic_score_codex":0.0000031061866,"about_ca_topic_score_gemma":6.1416733e-7,"teacher_disagreement_score":0.8348972,"about_ca_system_score_codex":0.000052009334,"about_ca_system_score_gemma":0.00017534223,"threshold_uncertainty_score":0.62348413},"labels":[],"label_agreement":null},{"id":"W2029440477","doi":"10.1109/glocom.2014.7036987","title":"A hierarchical hashing scheme to accelerate longest prefix matching","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Petro-Canada","funders":"","keywords":"Computer science; Hash table; Hash function; Bottleneck; Prefix; Routing table; Bitmap; Parallel computing; Matching (statistics); Routing (electronic design automation); Trie; Scheme (mathematics); Data structure; Algorithm; Computer network; Routing protocol; Mathematics","score_opus":0.016117918103810795,"score_gpt":0.25002014518783167,"score_spread":0.23390222708402086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029440477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029262697,0.000011515143,0.9518942,0.0039626043,0.00018563618,0.00006483723,8.650993e-8,0.00037337624,0.014245048],"genre_scores_gemma":[0.50224984,0.0000014654777,0.49473268,0.0021062873,0.00014352908,0.0000063864045,0.0000011047115,0.000007908749,0.0007508305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989386,0.000058100915,0.00015794965,0.0003599224,0.00019860778,0.00028682136],"domain_scores_gemma":[0.9993344,0.00007274478,0.00003851152,0.00034290607,0.000055614433,0.0001558024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040687973,0.00011010968,0.000113556605,0.000077755874,0.00020096714,0.00069732993,0.0005999904,0.000047524183,0.000014291822],"category_scores_gemma":[0.000051975127,0.00009417116,0.000025723974,0.00039050612,0.000013467103,0.00058573554,0.00026047268,0.00014854787,0.00012484465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022682707,0.00014144686,0.001793555,0.00006950188,0.000022573004,0.000008685754,0.004435571,0.0817515,0.0027079186,0.36737174,0.0077632633,0.5339115],"study_design_scores_gemma":[0.00020791753,0.0000693776,0.000713185,0.0000713065,0.0000021036717,0.000009700906,0.000009511658,0.9799073,0.0011146966,0.012296939,0.0053251167,0.00027287274],"about_ca_topic_score_codex":0.0000115850535,"about_ca_topic_score_gemma":0.000011839837,"teacher_disagreement_score":0.89815575,"about_ca_system_score_codex":0.000018428167,"about_ca_system_score_gemma":0.000030671694,"threshold_uncertainty_score":0.67243683},"labels":[],"label_agreement":null},{"id":"W2031294089","doi":"10.1109/itng.2011.178","title":"Embedded Network Firewall on FPGA","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Firewall (physics); Application firewall; Computer science; Computer network; Network packet; Context-based access control; Field-programmable gate array; Embedded system; Stateful firewall; IP tunnel; Operating system; Internet protocol suite; The Internet","score_opus":0.03306108086301955,"score_gpt":0.21970511257108627,"score_spread":0.1866440317080667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031294089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013915633,0.000044186763,0.7384194,0.00013023804,0.00045062727,0.000050092625,5.3165927e-8,0.00039826287,0.25911555],"genre_scores_gemma":[0.7313105,0.000014694433,0.26173133,0.0019303169,0.00021618915,0.0000067226274,0.0000014105303,0.000009466139,0.0047793556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930257,0.000027085964,0.000106462474,0.00022670234,0.00011585689,0.00022130834],"domain_scores_gemma":[0.99949867,0.000025038426,0.000041837524,0.00033582858,0.000036994366,0.00006161846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014257591,0.00008262554,0.00007330428,0.000025806716,0.00010481447,0.000072142146,0.00040819144,0.000042191234,0.00010283766],"category_scores_gemma":[0.000007977126,0.00006667915,0.000026617101,0.00029598188,0.000014672699,0.00022505238,0.00006784427,0.00006527904,0.00019040353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005068695,0.00033872516,0.0013275571,0.000019096935,0.000039932722,0.000038461778,0.011234115,0.022685507,0.000011229706,0.26167494,0.18804379,0.51453596],"study_design_scores_gemma":[0.0004168525,0.00029101322,0.0017789728,0.00006531481,0.0000067906285,0.000010046213,0.000018581452,0.93979007,0.0017518582,0.047857687,0.007566525,0.00044627997],"about_ca_topic_score_codex":0.000005941162,"about_ca_topic_score_gemma":0.0000041453277,"teacher_disagreement_score":0.91710454,"about_ca_system_score_codex":0.000009657446,"about_ca_system_score_gemma":0.00002194184,"threshold_uncertainty_score":0.2719097},"labels":[],"label_agreement":null},{"id":"W2041702516","doi":"10.1109/reconfig.2013.6732271","title":"An efficient application-specific instruction-set processor for packet classification","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Application-specific instruction-set processor; Instruction set; Bottleneck; Network processor; Network packet; Preprocessor; Routing (electronic design automation); Set (abstract data type); Coprocessor; Parallel computing; Embedded system; Computer network; Artificial intelligence; Programming language","score_opus":0.021058961961999915,"score_gpt":0.26094900133510435,"score_spread":0.23989003937310444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041702516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021980576,0.000041342206,0.9745897,0.0009102638,0.0001982051,0.00071793667,0.0000017424638,0.00042951453,0.0011306978],"genre_scores_gemma":[0.76536024,0.00001238683,0.23344062,0.00015728667,0.00015225219,0.0006382517,0.000059431703,0.0000127148,0.00016682006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877304,0.000026458292,0.00025992605,0.0005093141,0.00019297462,0.00023827],"domain_scores_gemma":[0.9986793,0.00004588271,0.00014619557,0.0005674984,0.0004522556,0.00010891237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019510472,0.00013003683,0.00010555754,0.00009506261,0.00029525606,0.00048814173,0.00055299245,0.0000772438,0.000022131684],"category_scores_gemma":[0.000011389797,0.000113422306,0.000032574822,0.00054406055,0.000040780127,0.00077696575,0.000026882431,0.00006096666,0.00011505995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012040859,0.00027710624,0.00068624225,0.0000599281,0.000010353157,7.896862e-8,0.00089723454,0.02972327,0.0021830674,0.277362,0.010768778,0.67801994],"study_design_scores_gemma":[0.00030896816,0.000049072627,0.0020096924,0.0000065204813,0.0000022706404,0.0000031034187,0.000100225676,0.985316,0.0011149999,0.0059440453,0.004971268,0.00017384725],"about_ca_topic_score_codex":0.000008781922,"about_ca_topic_score_gemma":0.0000028753645,"teacher_disagreement_score":0.9555927,"about_ca_system_score_codex":0.000044297758,"about_ca_system_score_gemma":0.00005264954,"threshold_uncertainty_score":0.47071618},"labels":[],"label_agreement":null},{"id":"W2043493229","doi":"10.1109/jssc.2004.831433","title":"A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme","year":2004,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":161,"is_retracted":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":"Pipeline (software); Computer science; Power (physics); Content-addressable memory; Swing; Line (geometry); Content-addressable storage; Reduction (mathematics); Binary search algorithm; Computer hardware; Search algorithm; Real-time computing; Artificial intelligence; Algorithm; Engineering; Mathematics","score_opus":0.0563906129532896,"score_gpt":0.29512896645515496,"score_spread":0.23873835350186537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043493229","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.37779176,0.00029274513,0.6202916,0.00035219511,0.00088768045,0.00009511681,0.0000032351184,0.000047804133,0.00023787924],"genre_scores_gemma":[0.9715036,0.00012498467,0.027160672,0.000488748,0.00043624736,0.0000013637374,0.0000011130373,0.000035248002,0.00024801164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711084,0.00014229644,0.0008574357,0.0003489121,0.0008803005,0.0006602328],"domain_scores_gemma":[0.9976364,0.00008938614,0.0004955059,0.0003695232,0.0010147087,0.0003945219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011275986,0.0002507238,0.00045825634,0.00034353082,0.00027802843,0.00034331027,0.00096258754,0.00012009414,0.000015330697],"category_scores_gemma":[0.00009687094,0.00022492495,0.0001790237,0.00071554363,0.00014941387,0.0013701989,0.0000920617,0.000697834,0.000025312815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001061445,0.0006386121,0.0002898316,0.00013531833,0.00017182842,0.0006908022,0.005087485,0.8587514,0.11311865,0.0005609741,0.00073008466,0.01971884],"study_design_scores_gemma":[0.017243935,0.0015105393,0.0008128164,0.004044978,0.00012493694,0.0043322565,0.0006591176,0.5589268,0.39198714,0.017788088,0.0004766077,0.0020927445],"about_ca_topic_score_codex":0.000011185231,"about_ca_topic_score_gemma":0.000003117286,"teacher_disagreement_score":0.59371185,"about_ca_system_score_codex":0.0002423364,"about_ca_system_score_gemma":0.000895326,"threshold_uncertainty_score":0.9172173},"labels":[],"label_agreement":null},{"id":"W2047739654","doi":"10.4236/jis.2012.32008","title":"Hardware Performance Evaluation of SHA-3 Candidate Algorithms","year":2012,"lang":"en","type":"article","venue":"Journal of Information Security","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"George Mason University","keywords":"Computer science; NIST; Hash function; Secure Hash Algorithm; Algorithm; Robustness (evolution); MD5; Cryptography; Throughput; Computer security; SHA-2; Embedded system; Cryptographic hash function; Operating system; Wireless","score_opus":0.01855899503513599,"score_gpt":0.27262233797294144,"score_spread":0.25406334293780547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047739654","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.41013396,0.0005959509,0.58352417,0.00024498263,0.0012711332,0.00013765688,0.000003832939,0.000028320848,0.0040599685],"genre_scores_gemma":[0.9815366,0.0000858864,0.018145757,0.00008380699,0.0001348766,0.0000013922081,0.0000057233315,0.0000018992695,0.000004022379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983882,0.00007175236,0.0005768426,0.000033353168,0.0007863175,0.00014355825],"domain_scores_gemma":[0.9973523,0.000022971346,0.0009626887,0.00014126716,0.0014393056,0.000081481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029256241,0.0000706115,0.00013363894,0.00018077341,0.00007461843,0.00008185296,0.0002878633,0.000047752696,0.000019735286],"category_scores_gemma":[0.00011253123,0.00005806393,0.000048508286,0.00033813424,0.000017822798,0.008465233,0.000042992724,0.00013223942,0.000010251491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005971404,0.00018394303,0.0119545255,0.00021384351,0.000074726435,3.603676e-7,0.037930686,0.056907535,0.00002963036,0.0043432154,0.005796659,0.8825052],"study_design_scores_gemma":[0.00080213486,0.000092517315,0.011042628,0.00011275941,0.00003377211,0.00007041703,0.00017707697,0.9806046,0.0026825308,0.00054008095,0.0037234852,0.00011799911],"about_ca_topic_score_codex":0.0000024907065,"about_ca_topic_score_gemma":3.4499908e-7,"teacher_disagreement_score":0.92369705,"about_ca_system_score_codex":0.000077098055,"about_ca_system_score_gemma":0.00018502407,"threshold_uncertainty_score":0.613709},"labels":[],"label_agreement":null},{"id":"W2054206898","doi":"10.1109/fpt.2007.4439273","title":"High Performance Software-Hardware Network Intrusion Detection System","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Field-programmable gate array; Computer science; Software; Network packet; Embedded system; Intrusion detection system; Computer hardware; Process (computing); Network processor; Flexibility (engineering); Quality of service; Real-time computing; Operating system; Computer network; Artificial intelligence","score_opus":0.006141382711886971,"score_gpt":0.1970438485952514,"score_spread":0.19090246588336443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054206898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035878483,0.00007687715,0.959769,0.00003061865,0.001437049,0.00008706728,8.9369514e-8,0.0010612847,0.0016595128],"genre_scores_gemma":[0.75829756,0.000011961575,0.24079962,0.00010322799,0.0004337446,0.0000033977576,0.0000022707027,0.00000860574,0.00033962706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883366,0.000027141403,0.00024193685,0.00029924265,0.0002378116,0.0003601979],"domain_scores_gemma":[0.99931383,0.000054459753,0.00010551446,0.0003188121,0.0001257123,0.00008169382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006836618,0.00012325413,0.000118308846,0.000073110125,0.00038960867,0.00015243937,0.00034314208,0.0000893642,0.0000065679405],"category_scores_gemma":[0.000014093964,0.00010639094,0.000027133348,0.00072809984,0.000016540302,0.00057595666,0.00012149034,0.000119888275,0.00006630514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025270687,0.000017861772,0.0017637977,0.00008295259,0.000007933961,0.0000075268563,0.00012398737,0.14852607,0.00007614449,0.0044442685,0.00068249286,0.8442417],"study_design_scores_gemma":[0.00038964825,0.00015812564,0.0059140543,0.00021851681,0.000009805032,0.00007023815,0.000037080557,0.97592884,0.01457893,0.0003626546,0.0019377635,0.00039436278],"about_ca_topic_score_codex":0.000014449273,"about_ca_topic_score_gemma":0.00001685379,"teacher_disagreement_score":0.84384733,"about_ca_system_score_codex":0.0001027354,"about_ca_system_score_gemma":0.000025729569,"threshold_uncertainty_score":0.43384966},"labels":[],"label_agreement":null},{"id":"W2055611966","doi":"10.1109/asap.2013.6567594","title":"A low-power Content-Addressable Memory based on clustered-sparse networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"McGill University","funders":"","keywords":"Energy consumption; Content-addressable storage; Architecture; CMOS; Memory architecture; Energy (signal processing); Content-addressable memory; Efficient energy use","score_opus":0.021444778988243703,"score_gpt":0.2142230853399171,"score_spread":0.1927783063516734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055611966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022070338,0.000054532935,0.9447597,0.001089711,0.00057329936,0.00025532424,2.381343e-7,0.00038621933,0.050673887],"genre_scores_gemma":[0.94843715,0.000007009999,0.036222223,0.0069003976,0.00010711988,0.000053530315,0.0000062694216,0.000019458415,0.008246851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858457,0.00007568436,0.00023426104,0.00042688288,0.0002637184,0.00041490427],"domain_scores_gemma":[0.99882305,0.000105149134,0.000097184944,0.00063613575,0.00018490515,0.00015360415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022181006,0.0001813988,0.00017018229,0.000083401654,0.00016837248,0.00045311594,0.00059231155,0.00010321066,0.0005354206],"category_scores_gemma":[0.000025678424,0.00014485698,0.00006056875,0.00037628753,0.000043602213,0.0006665356,0.0001066993,0.00016167006,0.000387812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019709834,0.00024316406,0.00025858314,0.000016346183,0.00001316213,0.000008562813,0.0001336682,0.87109214,0.000047300236,0.0023315412,0.08864266,0.03719318],"study_design_scores_gemma":[0.0005420312,0.000094902294,0.00021247342,0.000070073125,0.0000027937865,0.0000019667852,0.000021094755,0.9978177,0.00045398076,0.00019764557,0.00038134586,0.00020399528],"about_ca_topic_score_codex":0.00003183827,"about_ca_topic_score_gemma":0.000006617252,"teacher_disagreement_score":0.9462301,"about_ca_system_score_codex":0.0000342692,"about_ca_system_score_gemma":0.000050850213,"threshold_uncertainty_score":0.5907096},"labels":[],"label_agreement":null},{"id":"W2059285029","doi":"10.1145/1723112.1723148","title":"A 1 cycle-per-byte XML parsing accelerator","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Simple API for XML; XML; Operating system; Parsing; Embedded system; Efficient XML Interchange; XML Signature; Programming language; Database","score_opus":0.007975650614026872,"score_gpt":0.23219723263088257,"score_spread":0.22422158201685571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059285029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050082665,0.00003252824,0.9188184,0.0015694761,0.00090396364,0.00005415127,1.6276373e-7,0.0004637508,0.02807487],"genre_scores_gemma":[0.6977404,0.0000041943026,0.30046567,0.0008651924,0.00018023385,0.0000036660135,9.83987e-7,0.0000068890304,0.0007328075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992774,0.000015303804,0.00011565255,0.00024619943,0.00013544598,0.00021000589],"domain_scores_gemma":[0.9994463,0.000026813741,0.00004066158,0.00033634342,0.00006547966,0.000084408275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015334504,0.00008412937,0.00007610015,0.000045141154,0.00017315002,0.0004135019,0.00043497284,0.000058260288,0.000073875715],"category_scores_gemma":[0.000016573333,0.00007103203,0.000025892163,0.00025441498,0.000024875739,0.0006013244,0.00008446497,0.00015698063,0.0001084188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010483627,0.0002132739,0.0022380615,0.000028672042,0.000022605404,0.000016629494,0.0018431259,0.0035975242,0.021081828,0.14837591,0.024618993,0.7979529],"study_design_scores_gemma":[0.0003673941,0.00003893466,0.00066503603,0.000016447457,0.0000053504846,0.000035141227,0.000015580152,0.94663954,0.011212888,0.0073964507,0.033226874,0.00038034766],"about_ca_topic_score_codex":0.000006419578,"about_ca_topic_score_gemma":0.000014165704,"teacher_disagreement_score":0.94304204,"about_ca_system_score_codex":0.000007097668,"about_ca_system_score_gemma":0.000051442174,"threshold_uncertainty_score":0.39874083},"labels":[],"label_agreement":null},{"id":"W2059811116","doi":"10.1145/2628071.2628079","title":"Bitwise data parallelism in regular expression matching","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Simon Fraser University","funders":"","keywords":"Computer science; SIMD; Parallel computing; Bitwise operation; Regular expression; Backtracking; Implementation; Parallelism (grammar); Data parallelism; Algorithm; Programming language","score_opus":0.02254865816580674,"score_gpt":0.2543185713826495,"score_spread":0.2317699132168428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059811116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004828437,0.00007155166,0.98956096,0.0006743845,0.00013279317,0.000036990263,1.4186217e-7,0.00014580712,0.004548951],"genre_scores_gemma":[0.53387046,0.000018988427,0.4650938,0.00037123973,0.00007587214,0.000002368688,0.000013622277,0.0000056768004,0.0005479729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991612,0.000068459965,0.00013797975,0.00033681054,0.00013914963,0.00015640674],"domain_scores_gemma":[0.9989572,0.000042410524,0.00004302936,0.0008993951,0.000016676275,0.00004126394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004950891,0.00006841632,0.00008117573,0.00005900082,0.0000632294,0.00015640644,0.0010072992,0.000039727594,0.000007595285],"category_scores_gemma":[0.000027166561,0.000055612534,0.000008480303,0.0002241425,0.000010454377,0.0008691352,0.00047593252,0.00007280658,0.0000204863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019853209,0.0002411828,0.002621814,0.000090822316,0.0000074057834,0.000021632031,0.0030193436,0.19216731,0.0033333574,0.13230713,0.04123968,0.62493044],"study_design_scores_gemma":[0.00019673635,0.000007725131,0.00022904192,0.000066028464,6.95059e-7,0.0000025015297,0.000010409535,0.97651047,0.0004843248,0.018613305,0.0037732776,0.00010551283],"about_ca_topic_score_codex":0.00001813119,"about_ca_topic_score_gemma":0.000012376026,"teacher_disagreement_score":0.7843431,"about_ca_system_score_codex":0.000007776961,"about_ca_system_score_gemma":0.000016063292,"threshold_uncertainty_score":0.22678132},"labels":[],"label_agreement":null},{"id":"W2062143991","doi":"10.1109/jssc.2005.864128","title":"Content-Addressable Memory (CAM) Circuits and Architectures: A Tutorial and Survey","year":2006,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1215,"is_retracted":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":"Content-addressable memory; Computer science; Computer architecture; Electronic circuit; Computer hardware; Engineering; Electrical engineering; Artificial intelligence; Artificial neural network","score_opus":0.03292805169399435,"score_gpt":0.25210908370532686,"score_spread":0.21918103201133252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062143991","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.78553396,0.0023667018,0.20912717,0.00014256747,0.002128842,0.00014994903,0.00002011725,0.00005585259,0.0004748533],"genre_scores_gemma":[0.99764514,0.00023749302,0.0007567733,0.00014360854,0.0008337768,0.0000018110786,0.0000025124862,0.000022068141,0.00035683796],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979017,0.00024844482,0.0006462261,0.00032619902,0.0004647769,0.00041268524],"domain_scores_gemma":[0.9981786,0.0002965643,0.00057916215,0.00022161572,0.00050779333,0.00021626991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130117,0.00023091622,0.00043036987,0.00023657353,0.00022139169,0.00041601507,0.00042395777,0.00009551971,0.000002586236],"category_scores_gemma":[0.000122057165,0.00020258715,0.00006259596,0.00034565388,0.00013959165,0.0005598946,0.00005691613,0.0003353748,0.0000021567635],"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.00035225603,0.0010493747,0.055550702,0.0007850027,0.00067009986,0.0010802764,0.014884783,0.22709265,0.05449875,0.0011437937,0.028962046,0.6139303],"study_design_scores_gemma":[0.04559523,0.004933647,0.5104418,0.004719443,0.0006452379,0.01551929,0.00074541115,0.20346856,0.091286294,0.10821383,0.00695301,0.00747827],"about_ca_topic_score_codex":0.000096910124,"about_ca_topic_score_gemma":0.000096607575,"teacher_disagreement_score":0.606452,"about_ca_system_score_codex":0.000046794656,"about_ca_system_score_gemma":0.00019654709,"threshold_uncertainty_score":0.8261264},"labels":[],"label_agreement":null},{"id":"W2064113406","doi":"10.1016/j.jcss.2012.06.001","title":"Space and speed tradeoffs in TCAM hierarchical packet classification","year":2012,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Content-addressable memory; Network packet; The Internet; Hierarchy; Quality of service; Software-defined networking; Throughput; Distributed computing; Computer network; Artificial intelligence; World Wide Web; Artificial neural network; Operating system","score_opus":0.03052033678092598,"score_gpt":0.263910897751214,"score_spread":0.23339056097028804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064113406","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.22983928,0.002509523,0.763048,0.0021153586,0.0009005877,0.00007010596,1.826697e-7,0.000023228535,0.0014937458],"genre_scores_gemma":[0.91164225,0.00006751301,0.08789708,0.00007293899,0.00030998522,2.4672178e-7,7.4446575e-8,0.000001913919,0.000008006953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988322,0.00017068512,0.0003342977,0.0001443744,0.00031554102,0.0002029033],"domain_scores_gemma":[0.9993359,0.00014985321,0.00022803774,0.000078796176,0.00006863624,0.00013880468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019787552,0.00008183925,0.00018637658,0.0002060253,0.00013235673,0.00033047158,0.00028513034,0.000040855,2.6331324e-7],"category_scores_gemma":[0.000014009836,0.000057628207,0.000023703746,0.00042578796,0.00012089204,0.0012813733,0.000058025063,0.00011478955,6.8598746e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006030565,0.0003706598,0.13850914,0.0003174312,0.00004183746,0.00005023255,0.021500243,0.0062418017,0.00058752485,0.475456,0.0023745883,0.35449022],"study_design_scores_gemma":[0.00051951205,0.0002850547,0.060905553,0.0003461254,0.0000084862,0.0013220663,0.0006529327,0.9342209,0.000055024822,0.0008300315,0.00068484445,0.00016943816],"about_ca_topic_score_codex":0.0000019117806,"about_ca_topic_score_gemma":3.9724577e-7,"teacher_disagreement_score":0.9279791,"about_ca_system_score_codex":0.00002350492,"about_ca_system_score_gemma":0.00005508399,"threshold_uncertainty_score":0.3186745},"labels":[],"label_agreement":null},{"id":"W2069885283","doi":"10.1109/globalsip.2013.6737140","title":"Selective decoding in associative memories based on Sparse-Clustered Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Associative property; Field-programmable gate array; Content-addressable memory; Latency (audio); Parallel computing; Low latency (capital markets); Implementation; Computer engineering; Computer hardware; Computer architecture; Artificial neural network; Algorithm; Artificial intelligence; Computer network","score_opus":0.010900455005990363,"score_gpt":0.22196817804957086,"score_spread":0.2110677230435805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069885283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030296552,0.000020254918,0.96823967,0.00082038523,0.00022667125,0.00019285243,1.3723805e-7,0.00017691996,0.027293444],"genre_scores_gemma":[0.9245429,0.0000041117455,0.07363168,0.0011248791,0.00006420518,0.00003358935,0.0000027493536,0.000008304688,0.0005875855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891645,0.00011384193,0.00017759664,0.0003104773,0.00017433755,0.00030731646],"domain_scores_gemma":[0.99924433,0.00028157324,0.00009915859,0.00018523599,0.00013399613,0.00005567477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002651636,0.00012621566,0.00014921831,0.00011414901,0.00012316115,0.0002904467,0.00028977715,0.00008123849,0.00003355333],"category_scores_gemma":[0.000082471204,0.00011008109,0.000028832153,0.0007930845,0.000019129275,0.00058543135,0.000056116005,0.00016730875,0.000034442244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012743834,0.000114088805,0.014311343,0.000007482263,0.00001393111,0.0000032586765,0.0013181604,0.9273076,0.000008769914,0.0030744795,0.007952448,0.04587571],"study_design_scores_gemma":[0.00031614685,0.000052656847,0.0060526235,0.00004208225,0.0000013570665,2.7737497e-7,0.00004007657,0.9913881,0.00025875805,0.0016914891,0.000015922591,0.00014052645],"about_ca_topic_score_codex":0.0000413015,"about_ca_topic_score_gemma":0.00007051472,"teacher_disagreement_score":0.92151326,"about_ca_system_score_codex":0.00014023525,"about_ca_system_score_gemma":0.000060485552,"threshold_uncertainty_score":0.44889766},"labels":[],"label_agreement":null},{"id":"W2073976813","doi":"10.1155/2013/130765","title":"An Impulse-C Hardware Accelerator for Packet Classification Based on Fine/Coarse Grain Optimization","year":2013,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Hardware acceleration; Scalability; Speedup; Xeon; Network packet; Software; Computer hardware; Packet processing; Parallel computing; Computer engineering; Field-programmable gate array; Operating system","score_opus":0.02434092692451534,"score_gpt":0.2871501366300257,"score_spread":0.26280920970551036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073976813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074391547,0.00003151643,0.98705405,0.0024231072,0.0018965648,0.00021980041,0.0000047649705,0.00007796582,0.00085305586],"genre_scores_gemma":[0.67866224,0.000007654334,0.31998536,0.00061839144,0.00059895933,0.000008421821,0.00004278059,0.000019079971,0.000057114416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981824,0.00012105347,0.00067223277,0.00030529252,0.00047620674,0.00024281282],"domain_scores_gemma":[0.9962183,0.00026821275,0.0009091813,0.000257177,0.0022054212,0.00014167768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007365495,0.00018059593,0.0002187942,0.0003632072,0.0001826505,0.0007705645,0.0011658455,0.00009119525,0.00007411446],"category_scores_gemma":[0.00022710627,0.00016617464,0.00012554256,0.00025615154,0.000024637558,0.0014975691,0.000021284419,0.00020200103,0.000010804954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036804166,0.00012101889,0.0002913163,0.00001042059,0.000029727213,0.0000043738987,0.00013891219,0.76589006,0.00045380672,0.00087581645,0.002677005,0.22947074],"study_design_scores_gemma":[0.0008876464,0.0002632704,0.0004313725,0.00018829486,0.0000075376884,0.00003678819,0.00004649692,0.9951574,0.001421087,0.0008433202,0.0005394638,0.00017731459],"about_ca_topic_score_codex":0.000007385642,"about_ca_topic_score_gemma":0.0000013218722,"teacher_disagreement_score":0.6712231,"about_ca_system_score_codex":0.00014662584,"about_ca_system_score_gemma":0.00021227139,"threshold_uncertainty_score":0.74305713},"labels":[],"label_agreement":null},{"id":"W2078732484","doi":"10.1109/jssc.2003.818139","title":"A mismatch-dependent power allocation technique for match-line sensing in content-addressable memories","year":2003,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"CMC Microsystems","keywords":"Word (group theory); Power (physics); Scheme (mathematics); Computer science; Line (geometry); Computer hardware; Arithmetic; Content-addressable memory; Reduction (mathematics); Process (computing); Real-time computing; Artificial intelligence; Mathematics","score_opus":0.04117684806867808,"score_gpt":0.28210375550951067,"score_spread":0.2409269074408326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078732484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027364073,0.0003132903,0.97035867,0.00034524658,0.0009616623,0.0003201398,0.0000037336576,0.00003675767,0.00029644015],"genre_scores_gemma":[0.96092856,0.000118867225,0.038223792,0.00023134802,0.000091280766,0.000008419943,0.000001365975,0.00002568128,0.0003706607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998089,0.00013086999,0.0007851841,0.000246112,0.00036583308,0.0003829587],"domain_scores_gemma":[0.9980384,0.0001253028,0.0006534767,0.0002365466,0.00082647335,0.000119783996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015619167,0.00018733692,0.00036270334,0.0002740931,0.00012412567,0.00019829563,0.000357126,0.000096705306,0.0000031403533],"category_scores_gemma":[0.00015996084,0.00017538873,0.000090745096,0.00041976967,0.000040680832,0.00091468013,0.000017626793,0.00024569244,0.0000027018675],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019964427,0.0009265181,0.0008401469,0.00056406064,0.00025871643,0.00053160393,0.014596682,0.5051273,0.42476022,0.0043519693,0.004278316,0.043564837],"study_design_scores_gemma":[0.0034389226,0.00053824665,0.00013511516,0.0011720472,0.000044915287,0.0013418467,0.0006263761,0.041543156,0.91706455,0.03234753,0.0010477835,0.0006995329],"about_ca_topic_score_codex":0.000005198167,"about_ca_topic_score_gemma":0.000015972726,"teacher_disagreement_score":0.9335645,"about_ca_system_score_codex":0.0001479581,"about_ca_system_score_gemma":0.00027788524,"threshold_uncertainty_score":0.7152145},"labels":[],"label_agreement":null},{"id":"W2084272545","doi":"10.1109/sips.2014.6986075","title":"Algorithm and architecture for a multiple-field context-driven search engine using fully-parallel clustered associative memories","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Content-addressable memory; Content-addressable storage; Parallel computing; Context (archaeology); Search engine; Field (mathematics); Binary search algorithm; Search algorithm; Associative property; Reduction (mathematics); Theoretical computer science; Algorithm; Artificial intelligence; Artificial neural network; Information retrieval; Mathematics","score_opus":0.027216481795496263,"score_gpt":0.2813589087105173,"score_spread":0.25414242691502104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084272545","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.0014175575,0.00033159053,0.99518245,0.0013570122,0.0005493272,0.0007663456,0.000023288703,0.00023363996,0.00013877796],"genre_scores_gemma":[0.051296912,0.000040252748,0.94708467,0.0005474231,0.00044589592,0.000060515697,0.000050536233,0.000031061307,0.00044271143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785954,0.00016982126,0.00035391544,0.0008368042,0.00031681274,0.0004631326],"domain_scores_gemma":[0.9977921,0.00093200314,0.00026391196,0.00046048826,0.00041427062,0.00013720724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050821784,0.00037450297,0.00054749026,0.00016591331,0.00029982397,0.0006085015,0.0006762557,0.0004202555,0.000003528029],"category_scores_gemma":[0.00023916604,0.00033468186,0.00012684417,0.00016558437,0.00006627713,0.00017541346,0.0011595248,0.0006094982,0.0000011200106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049368762,0.000043364376,0.00023702029,0.0002926919,0.00017392392,0.0000030559918,0.004897494,0.44405118,0.00001604105,0.0004672175,0.0006155092,0.54915315],"study_design_scores_gemma":[0.0008777609,0.00011119992,0.00003130664,0.00020921962,0.000031724958,0.000008190759,0.00009143316,0.99319476,0.0002814953,0.004348243,0.00041891247,0.00039576637],"about_ca_topic_score_codex":0.00007919469,"about_ca_topic_score_gemma":0.000080582766,"teacher_disagreement_score":0.54914355,"about_ca_system_score_codex":0.00008593413,"about_ca_system_score_gemma":0.00020861925,"threshold_uncertainty_score":0.99991053},"labels":[],"label_agreement":null},{"id":"W2086048361","doi":"10.1088/1742-6596/385/1/012015","title":"On the Factor Refinement Principle and its Implementation on Multicore Architectures","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Parallel computing; Computer science; Cache; Speedup; Factor (programming language); Divide and conquer algorithms; Ideal (ethics); Multi-core processor; Code (set theory); Programming language; Set (abstract data type)","score_opus":0.04320720264351973,"score_gpt":0.3051953629699251,"score_spread":0.2619881603264054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086048361","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.82335204,0.00011041559,0.17366953,0.0021411923,0.000318709,0.00011174143,0.000003126747,0.000017565522,0.00027564832],"genre_scores_gemma":[0.9965834,0.000028476012,0.002967738,0.00020645333,0.00016979867,0.0000022897875,7.1860455e-7,0.0000038934536,0.000037254424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935275,0.000053240485,0.00015828862,0.000072016024,0.00022756905,0.00013613835],"domain_scores_gemma":[0.9993752,0.00008701082,0.00024541412,0.00010460364,0.00013631624,0.00005141174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001572576,0.000087260116,0.00009226039,0.000028179706,0.00013289678,0.0001350065,0.00019099854,0.000015579863,0.000013347068],"category_scores_gemma":[0.00002968217,0.000051552102,0.000025001746,0.000082761515,0.000022437533,0.00035710304,0.000044860546,0.00013224578,0.0000021893982],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054758788,0.00011134475,0.00081316003,0.000023533441,0.000042336967,0.0000011290385,0.008164788,0.002372733,0.0019597635,0.67206377,0.00019159018,0.3142011],"study_design_scores_gemma":[0.0019238907,0.0031802582,0.047997642,0.0006050014,0.000074769494,0.000069061956,0.0014787248,0.029785445,0.79379183,0.11686323,0.0033990308,0.0008311],"about_ca_topic_score_codex":6.906189e-7,"about_ca_topic_score_gemma":0.0000016850139,"teacher_disagreement_score":0.7918321,"about_ca_system_score_codex":0.000016771564,"about_ca_system_score_gemma":0.00004851391,"threshold_uncertainty_score":0.21022336},"labels":[],"label_agreement":null},{"id":"W2088248663","doi":"10.5296/npa.v1i1.151","title":"Routing Engine Architecture for Next Generation Routers: Evolutional Trends","year":2009,"lang":"en","type":"article","venue":"Network Protocols and Algorithms","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Enhanced Interior Gateway Routing Protocol; Routing table; Distributed computing; Policy-based routing; Static routing; Routing domain; Routing protocol; Link-state routing protocol; Dynamic Source Routing; Zone Routing Protocol; Router; Routing (electronic design automation)","score_opus":0.041638363934563695,"score_gpt":0.29265817798113597,"score_spread":0.25101981404657225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088248663","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.000055616496,0.00017756301,0.99210274,0.0013045409,0.00014287075,0.0057445904,0.0000020306773,0.0001724709,0.00029757892],"genre_scores_gemma":[0.018329892,0.000011445788,0.96563387,0.00082076207,0.004217127,0.010361619,0.000063401254,0.00001646685,0.00054543774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987004,0.000047341295,0.00025073413,0.000427191,0.00018329435,0.00039106476],"domain_scores_gemma":[0.99943346,0.00004526952,0.00012426684,0.00020956728,0.0000921685,0.00009525864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039235337,0.00018178418,0.00018329253,0.00008182154,0.00042378265,0.00050550915,0.00024179106,0.000095780364,0.000003725065],"category_scores_gemma":[0.000014173587,0.00015949452,0.000060391285,0.0005430112,0.000022438106,0.0004691812,0.000042633044,0.00013243104,8.2214996e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011394287,0.000029961648,0.000026861977,0.000008868394,0.0000063890675,9.042187e-7,0.000115435345,0.08909327,0.000048363265,0.0069495435,0.003202584,0.90050644],"study_design_scores_gemma":[0.00064348057,0.00030180896,0.00023504022,0.000088349,0.0000052186583,0.000014766813,0.0000019827419,0.9756226,0.000057843637,0.006268322,0.016554058,0.00020654044],"about_ca_topic_score_codex":0.0000010427029,"about_ca_topic_score_gemma":0.0000015254531,"teacher_disagreement_score":0.9002999,"about_ca_system_score_codex":0.000027867116,"about_ca_system_score_gemma":0.000041180545,"threshold_uncertainty_score":0.6503998},"labels":[],"label_agreement":null},{"id":"W2089227992","doi":"10.1145/1572532.1572575","title":"A multi-method approach for user-centered design of identity management systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Identity management; Computer science; Identity (music); Human–computer interaction; Computer security; Authentication (law); Aesthetics","score_opus":0.059620986063411055,"score_gpt":0.3143238823085655,"score_spread":0.25470289624515446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089227992","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.000016391725,0.00009737121,0.99829596,0.000033192173,0.00012488964,0.0005264661,4.7430004e-7,0.00011585195,0.0007894112],"genre_scores_gemma":[0.047608443,0.000013753947,0.9510586,0.000071964016,0.000020089741,0.000025221867,0.0000031635511,0.000004069892,0.0011946919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991165,0.00008006488,0.000219833,0.0002665623,0.00015325943,0.00016378827],"domain_scores_gemma":[0.9994393,0.00003256801,0.0001120735,0.00028617075,0.00009313411,0.000036778965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006616848,0.00008497059,0.0001412104,0.00007579483,0.000067073015,0.00016975119,0.0004783438,0.000036285775,5.4946196e-7],"category_scores_gemma":[0.000008530917,0.00007340758,0.000040389412,0.0002991951,0.000007599527,0.00048145695,0.000048671274,0.000027444676,0.0000010775336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003120638,0.0005507234,0.000067687935,0.00028677305,0.000048255926,0.0000015248266,0.0003153004,0.8618847,0.0002962105,0.08344247,0.002052805,0.051022317],"study_design_scores_gemma":[0.0005513404,0.00006353196,0.00013849844,0.000027218766,0.000010004379,0.0000020947762,0.000031458225,0.99842507,0.00019807545,0.00040516097,0.000063456915,0.00008409691],"about_ca_topic_score_codex":0.000004741497,"about_ca_topic_score_gemma":2.1151821e-7,"teacher_disagreement_score":0.13654034,"about_ca_system_score_codex":0.000019062332,"about_ca_system_score_gemma":0.000011647231,"threshold_uncertainty_score":0.29934743},"labels":[],"label_agreement":null},{"id":"W2091830734","doi":"10.1109/fpt.2014.7082808","title":"Deep and narrow binary content-addressable memories using FPGA-based BRAMs","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stratix; Computer science; Field-programmable gate array; Verilog; Embedded system; Computer hardware; Parallel computing; Static random-access memory","score_opus":0.03620402639506439,"score_gpt":0.23817713972622404,"score_spread":0.20197311333115964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091830734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029093046,0.00027925332,0.96707606,0.00047676283,0.00023204631,0.000057653506,1.0918739e-7,0.00020230986,0.0025827582],"genre_scores_gemma":[0.78176534,0.0000032075452,0.21686813,0.00075395044,0.00006482695,0.0000023169782,0.0000023715677,0.000008407514,0.00053142715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916863,0.000058713944,0.0001348814,0.00027682172,0.00014692385,0.00021402839],"domain_scores_gemma":[0.99943775,0.00007107407,0.00006477273,0.00025294628,0.00009416268,0.0000792687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002436832,0.00010889796,0.00012575572,0.0000552353,0.00024638246,0.00032247923,0.00023447847,0.00005035021,0.000012889977],"category_scores_gemma":[0.000036489455,0.000092289374,0.000020914858,0.00025017216,0.00007024623,0.00051797245,0.00007761632,0.000060085753,0.0000053637627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000556986,0.00021841573,0.008571013,0.0002405614,0.000033754714,0.000018092254,0.001355905,0.77444446,0.0040369006,0.033764493,0.003073676,0.17418703],"study_design_scores_gemma":[0.00031581,0.00005366607,0.00011646097,0.00002810404,0.00000497776,0.0000063260986,0.000025548517,0.99440074,0.0035590588,0.0009086095,0.0004424876,0.00013823419],"about_ca_topic_score_codex":0.000023612914,"about_ca_topic_score_gemma":0.000011269204,"teacher_disagreement_score":0.7526723,"about_ca_system_score_codex":0.00001412837,"about_ca_system_score_gemma":0.000035066154,"threshold_uncertainty_score":0.37634516},"labels":[],"label_agreement":null},{"id":"W2093314706","doi":"10.1109/mcom.2005.1381884","title":"Providing multicast through recursive unicast","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; Protocol Independent Multicast; Source-specific multicast; Pragmatic General Multicast; IP multicast; Distance Vector Multicast Routing Protocol; Unicast; Distributed computing; Open Shortest Path First; Multicast address; Inter-domain; Routing protocol; Routing (electronic design automation); Link-state routing protocol","score_opus":0.046839936567532936,"score_gpt":0.3085088822535548,"score_spread":0.26166894568602184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093314706","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.00043136082,0.0013526474,0.93370724,0.02181456,0.00027197233,0.00023569728,0.0000027993494,0.00047339257,0.041710358],"genre_scores_gemma":[0.33027038,0.00062994304,0.66709095,0.00062986877,0.00015175766,0.00003766251,0.000016197482,0.000015375035,0.0011578926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879026,0.0001521293,0.00031158535,0.00029945417,0.00017441757,0.00027214203],"domain_scores_gemma":[0.99660677,0.00019999447,0.0001648744,0.0026956855,0.00025912296,0.00007356467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026487082,0.00015011348,0.00015123822,0.00007858482,0.00048272993,0.0002281231,0.002543707,0.00006710244,0.000010530215],"category_scores_gemma":[0.000081554805,0.00015058924,0.00005073239,0.0007649388,0.00015351629,0.001236783,0.00048811312,0.00025934365,0.00043834894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022954824,0.0013746617,0.00027027048,0.000051832336,0.00009478106,0.0000066633556,0.009790666,0.036041316,0.0024190096,0.34098753,0.06871198,0.54022837],"study_design_scores_gemma":[0.0005142523,0.000048930237,0.0000913986,0.000099434714,0.000018203295,0.000034982968,0.00004336836,0.6374315,0.0011068138,0.0035469015,0.3567317,0.0003325317],"about_ca_topic_score_codex":0.0000048090365,"about_ca_topic_score_gemma":0.000043809978,"teacher_disagreement_score":0.6013902,"about_ca_system_score_codex":0.00009300833,"about_ca_system_score_gemma":0.0000840563,"threshold_uncertainty_score":0.6140851},"labels":[],"label_agreement":null},{"id":"W2096194041","doi":"10.1109/iscc.2012.6249373","title":"Load balancing with minimal flow remapping for network processors","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Router; Packet processing; Network packet; Hash function; Workload; Computer network; Load balancing (electrical power); Processing delay; Distributed computing; Parallel computing; Operating system; Transmission delay","score_opus":0.012355884970269152,"score_gpt":0.2266134984612152,"score_spread":0.21425761349094605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096194041","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.0015967407,0.00039415975,0.99070716,0.00029634385,0.0002733501,0.00016154857,1.75055e-7,0.00025807339,0.006312433],"genre_scores_gemma":[0.29572827,0.0000042899655,0.7024885,0.00033863634,0.0005825107,0.000028907663,0.0000023446707,0.000010934104,0.00081564306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988861,0.000016270897,0.00014686518,0.00023382534,0.00019789433,0.0005190235],"domain_scores_gemma":[0.9993765,0.000072996714,0.00008375308,0.00020186167,0.00016182395,0.00010308497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049783115,0.00011978478,0.00012567764,0.00002507293,0.00022653374,0.00015342307,0.0002664971,0.000046997233,0.000004853114],"category_scores_gemma":[0.00003053025,0.000089765126,0.000026000294,0.00043462432,0.000018057528,0.0008664183,0.00005185063,0.000059944046,0.000008189129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020623599,0.00027116315,0.034796502,0.00055509066,0.000118547665,0.000004494386,0.008514708,0.60435796,0.00011058097,0.035801034,0.05714938,0.25811428],"study_design_scores_gemma":[0.00036242238,0.00007574262,0.0003316887,0.0001157793,0.000010008391,0.000016291666,0.000036539954,0.9909143,0.0002708753,0.00046238783,0.00716815,0.00023580421],"about_ca_topic_score_codex":0.000001784676,"about_ca_topic_score_gemma":0.0000068159875,"teacher_disagreement_score":0.38655633,"about_ca_system_score_codex":0.000040363084,"about_ca_system_score_gemma":0.00010759603,"threshold_uncertainty_score":0.36605155},"labels":[],"label_agreement":null},{"id":"W2096253462","doi":"10.1145/1508128.1508171","title":"PERG-Rx","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"CMC Microsystems","keywords":"Computer science; Scalability; Regular expression; Data mining; False positive paradox; Byte; Signature (topology); String (physics); Lossy compression; State (computer science); Pattern matching; Database; Artificial intelligence; Programming language","score_opus":0.00588116255634943,"score_gpt":0.2167406213045004,"score_spread":0.21085945874815096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096253462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049846334,0.000051882904,0.8998918,0.0020747264,0.00007126827,0.000012252268,9.9731245e-9,0.0002138051,0.097185776],"genre_scores_gemma":[0.7448009,0.000008657931,0.24917537,0.0018929569,0.000054919827,3.8380495e-7,4.182295e-7,0.0000011409918,0.0040652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996967,0.0000064690867,0.000045291235,0.00010144243,0.00006461271,0.00008552229],"domain_scores_gemma":[0.9997933,0.0000055772157,0.000011850053,0.00013951542,0.00002276573,0.000027011742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051514384,0.000031781525,0.000029970068,0.000019599098,0.000050545357,0.000097716395,0.00019902631,0.000014986612,0.00001440551],"category_scores_gemma":[0.000004241061,0.00002551116,0.000011070487,0.00017735291,0.000003901931,0.00023886764,0.000013575126,0.000024140494,0.000048249763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.781667e-7,0.00003483074,0.00009128852,0.0000011706505,0.0000012758154,0.000003163892,0.00025474714,0.0034375233,0.000085145584,0.24622424,0.01794728,0.73191833],"study_design_scores_gemma":[0.00016580976,0.000083584084,0.001552329,0.000008993963,0.00000132606,0.000011417913,0.0000072368543,0.95079345,0.0011405185,0.0345419,0.011533374,0.00016003716],"about_ca_topic_score_codex":6.200299e-7,"about_ca_topic_score_gemma":2.987181e-7,"teacher_disagreement_score":0.9473559,"about_ca_system_score_codex":0.0000048531847,"about_ca_system_score_gemma":0.00001243633,"threshold_uncertainty_score":0.104031496},"labels":[],"label_agreement":null},{"id":"W2096857854","doi":"10.1109/cicc.2006.320875","title":"Match Line Sense Amplifiers with Positive Feedback for Low-Power Content Addressable Memories","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"CMOS; Sense (electronics); Computer science; Content-addressable memory; Amplifier; Power (physics); Line (geometry); Content-addressable storage; Electronic engineering; Reduction (mathematics); Current sense amplifier; Electrical engineering; Engineering; Operational amplifier; Artificial intelligence; Physics","score_opus":0.014806054155826564,"score_gpt":0.21627090825955225,"score_spread":0.2014648541037257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096857854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00859017,0.00007096841,0.9802942,0.0008954117,0.00015643894,0.0002635949,0.000006275796,0.00021001132,0.0095129255],"genre_scores_gemma":[0.69238085,0.000006140454,0.28912118,0.00085253816,0.00015164763,0.00003756413,0.00004334697,0.0000231907,0.017383516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989744,0.000019970686,0.00018005323,0.0003400623,0.00017997129,0.00030555145],"domain_scores_gemma":[0.9991328,0.00008631346,0.000091902606,0.00025526385,0.00037421612,0.00005950848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013944988,0.00015042225,0.00016372034,0.000043197375,0.00019588642,0.00031377244,0.00017842204,0.00005396851,0.000013797387],"category_scores_gemma":[0.000009894068,0.00011031375,0.000038073245,0.00028166614,0.000067655186,0.00043098046,0.000047469395,0.000060091093,0.0000126167415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015027523,0.0013231534,0.0020196368,0.00034849858,0.00032108184,0.00013715334,0.0039071096,0.38618836,0.0025766878,0.37681648,0.20379092,0.021068173],"study_design_scores_gemma":[0.0068522394,0.0016716298,0.0013868826,0.0005848436,0.000092149596,0.0001706414,0.001097813,0.84909034,0.110513195,0.020804487,0.005829595,0.0019061622],"about_ca_topic_score_codex":0.000058039946,"about_ca_topic_score_gemma":0.00005155513,"teacher_disagreement_score":0.691173,"about_ca_system_score_codex":0.000033065684,"about_ca_system_score_gemma":0.00006058235,"threshold_uncertainty_score":0.44984642},"labels":[],"label_agreement":null},{"id":"W2098761425","doi":"10.1155/2011/648483","title":"PCIU: Hardware Implementations of an Efficient Packet Classification Algorithm with an Incremental Update Capability","year":2011,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Bottleneck; Network packet; Implementation; Algorithm; Preprocessor; Software; Xeon; State (computer science); Parallel computing; Embedded system; Operating system; Computer network; Artificial intelligence; Programming language","score_opus":0.03564234488915612,"score_gpt":0.290925285919903,"score_spread":0.2552829410307469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098761425","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.38232654,0.000024391324,0.6164251,0.000097145,0.00046338834,0.000074042015,0.000009688928,0.00002917298,0.0005505113],"genre_scores_gemma":[0.71408737,0.000006998356,0.285695,0.000052725853,0.00011612594,9.90894e-7,0.000028805183,0.000007957237,0.000004044517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981106,0.00016736345,0.0007248124,0.00025891763,0.0005507332,0.00018757314],"domain_scores_gemma":[0.9970298,0.000057728685,0.0010871039,0.0002491136,0.0014501136,0.00012613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010413701,0.00013772999,0.00020267695,0.00023801278,0.00013256348,0.00017012341,0.0009873938,0.00004153688,0.00006148354],"category_scores_gemma":[0.000030482995,0.00011960608,0.000061521525,0.0002505822,0.00006578319,0.0010304719,0.00004783989,0.00017185337,0.0000022711063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019782493,0.0010636728,0.007436061,0.000026986925,0.00026915633,0.00004344731,0.006592825,0.07688682,0.0011166373,0.004683994,0.000106038424,0.9015765],"study_design_scores_gemma":[0.00093709596,0.0005258967,0.008836604,0.00014242493,0.000023353734,0.00025931883,0.0010011991,0.97823226,0.008821421,0.00095421565,0.00008336765,0.0001828555],"about_ca_topic_score_codex":0.000065846056,"about_ca_topic_score_gemma":0.000020466347,"teacher_disagreement_score":0.9013937,"about_ca_system_score_codex":0.00012528634,"about_ca_system_score_gemma":0.00020393824,"threshold_uncertainty_score":0.4877394},"labels":[],"label_agreement":null},{"id":"W2105155655","doi":"10.1109/icc.2004.1312664","title":"IP packet forwarding based on comb extraction scheme","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Packet forwarding; Computer science; Virtual routing and forwarding; Computer network; Network packet; Prefix; Matching (statistics); IP forwarding; Routing table; Table (database); Forwarding plane; Routing protocol; Mathematics; Data mining","score_opus":0.013565754193831327,"score_gpt":0.2584052104428383,"score_spread":0.244839456249007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105155655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024589468,0.00001392945,0.97623783,0.001580995,0.00026316082,0.0000587552,1.5394667e-7,0.0003413399,0.019044884],"genre_scores_gemma":[0.70867234,0.0000032597811,0.29015756,0.0008519504,0.00006252981,0.0000047159606,0.0000034371803,0.000006198475,0.00023802384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922657,0.000019003244,0.00011770303,0.00024803774,0.00020539713,0.00018327976],"domain_scores_gemma":[0.999515,0.000040301777,0.000055906312,0.00027425768,0.000054713015,0.00005979449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019340342,0.0000926437,0.00007810746,0.00008128322,0.0001645776,0.0001943049,0.00021903806,0.00005098956,0.000016874386],"category_scores_gemma":[0.000023223172,0.00008143134,0.000037879883,0.00035813166,0.000013466485,0.00049338443,0.00002530887,0.000098079254,0.00007099114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026691092,0.00029605124,0.0006672498,0.000029605768,0.000011780342,0.000016009479,0.00021181293,0.7618643,0.0005690935,0.121388674,0.0029563203,0.11196244],"study_design_scores_gemma":[0.00060738635,0.0000869759,0.0002975648,0.00006118285,0.0000025845934,0.0000047135113,0.000010282189,0.9863778,0.0061107706,0.0051489417,0.001130798,0.00016101752],"about_ca_topic_score_codex":0.0000067379783,"about_ca_topic_score_gemma":0.0000028045451,"teacher_disagreement_score":0.70621336,"about_ca_system_score_codex":0.000064208725,"about_ca_system_score_gemma":0.00006360297,"threshold_uncertainty_score":0.33206737},"labels":[],"label_agreement":null},{"id":"W2105367753","doi":"10.1109/pacrim.1989.48438","title":"MACHAM: a best match content addressable memory","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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; Hamming distance; Content-addressable memory; Template; Chip; Hamming code; Character (mathematics); Content-addressable storage; Content (measure theory); Computer hardware; Acronym; Very-large-scale integration; Artificial intelligence; Embedded system; Algorithm; Programming language; Artificial neural network; Mathematics; Decoding methods","score_opus":0.05053941562026288,"score_gpt":0.2426788123119602,"score_spread":0.19213939669169733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105367753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012900282,0.0003104048,0.80258256,0.00036622866,0.0003006162,0.000070993374,1.9541842e-7,0.00017804623,0.1949009],"genre_scores_gemma":[0.5540424,0.00007536786,0.35977045,0.001669397,0.00007651977,0.000025695012,0.0000029772325,0.000017844573,0.084319375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992038,0.00004443207,0.00013083695,0.00023704984,0.000154705,0.00022919184],"domain_scores_gemma":[0.999465,0.000025706871,0.000042876032,0.00030334698,0.000086267304,0.00007679586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021816877,0.000086727356,0.0000932667,0.00003740613,0.00011567591,0.00018112684,0.0002774771,0.000039599236,0.00013152658],"category_scores_gemma":[0.000024411616,0.00007239413,0.000027154665,0.0002714628,0.000020649257,0.00033523314,0.000044208948,0.00006311387,0.00020519528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015935368,0.0007243696,0.0024846608,0.000108735425,0.00006962853,0.000071281895,0.0019551867,0.02557676,0.0009451447,0.71984273,0.09240588,0.15579969],"study_design_scores_gemma":[0.0030006724,0.00036469908,0.00019540348,0.00022932321,0.000037259964,0.00025275076,0.00096544344,0.83445776,0.04940549,0.027874274,0.08166842,0.001548513],"about_ca_topic_score_codex":0.000021545844,"about_ca_topic_score_gemma":0.000007721418,"teacher_disagreement_score":0.808881,"about_ca_system_score_codex":0.000018413884,"about_ca_system_score_gemma":0.00005012306,"threshold_uncertainty_score":0.29521468},"labels":[],"label_agreement":null},{"id":"W2105664623","doi":"10.1109/ccece.2004.1345213","title":"A static power reduction technique for ternary content addressable memories","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Static random-access memory; Power (physics); Reduction (mathematics); Computer science; Transistor; Content-addressable memory; Electronic circuit; Scaling; Low-power electronics; Dynamic demand; Power consumption; Electrical engineering; Voltage; Computer hardware; Physics; Engineering; Artificial neural network","score_opus":0.032387498572966925,"score_gpt":0.25966474515496774,"score_spread":0.22727724658200082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105664623","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.0005832984,0.00005095032,0.99470633,0.001782661,0.0003023497,0.00033838087,8.3320845e-7,0.00023930632,0.0019958664],"genre_scores_gemma":[0.30859783,0.000010614215,0.68907595,0.00024019465,0.000049253773,0.00014701078,0.0000046871464,0.000008465033,0.0018659702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993484,0.000012124492,0.00014263627,0.00021845159,0.00010974545,0.00016863518],"domain_scores_gemma":[0.99954337,0.000017054785,0.00006132821,0.00020659201,0.00013133466,0.00004034086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016850355,0.00008105122,0.00008623272,0.000050750354,0.00012518383,0.00013456868,0.00021678183,0.000038762537,0.000007765145],"category_scores_gemma":[0.000020826037,0.00006773175,0.000030416728,0.0001883497,0.000028931054,0.00054162386,0.00003992387,0.000045097124,0.000005617027],"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.0002448753,0.0010997821,0.00017065794,0.00041509545,0.00014743672,0.000030851184,0.008265165,0.21148813,0.053071402,0.62468976,0.051875714,0.048501126],"study_design_scores_gemma":[0.0027903698,0.0011476545,0.000095062554,0.00041619467,0.000028531009,0.00026265348,0.0007024014,0.085291944,0.5978173,0.30411723,0.0064212754,0.00090936857],"about_ca_topic_score_codex":0.0000139813465,"about_ca_topic_score_gemma":0.000001889651,"teacher_disagreement_score":0.5447459,"about_ca_system_score_codex":0.00005028027,"about_ca_system_score_gemma":0.000074025396,"threshold_uncertainty_score":0.27620205},"labels":[],"label_agreement":null},{"id":"W2113456791","doi":"","title":"Distributed firewall anomaly detection through LTL model checking","year":2013,"lang":"en","type":"article","venue":"Integrated Network Management","topic":"Network Packet Processing and Optimization","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":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Firewall (physics); Computer science; Anomaly detection; Model checking; Anomaly (physics); Data mining; Distributed computing; Theoretical computer science; Entropy (arrow of time)","score_opus":0.011393600222125459,"score_gpt":0.21146224443187156,"score_spread":0.2000686442097461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113456791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029984592,0.0002717086,0.98722845,0.00047188497,0.0004921825,0.00040700295,0.0000011603653,0.0006983525,0.0074307974],"genre_scores_gemma":[0.8609649,0.00014084023,0.13646474,0.0006655257,0.00014998594,0.0001470175,0.000052064126,0.00002445416,0.0013904751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816877,0.000069386646,0.00035993094,0.0005566423,0.0002778557,0.0005674028],"domain_scores_gemma":[0.9989874,0.000027458853,0.00017514573,0.00054544344,0.0001830962,0.00008145321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022910415,0.00026518072,0.00019770619,0.00007088763,0.00032329085,0.00062191207,0.00070320396,0.00010438293,0.000030697414],"category_scores_gemma":[0.000008906629,0.0002358976,0.00007440266,0.001354064,0.000035703204,0.0010359675,0.0002496051,0.0002209085,0.00012646233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008935817,0.00006270961,0.00007924722,0.000027648894,0.000079358775,0.000009734058,0.00030979846,0.791803,0.000023097682,0.0058401697,0.023547452,0.17820881],"study_design_scores_gemma":[0.00024197985,0.0000353523,0.00017473596,0.00010342755,0.000021413407,0.000003287056,0.000035415298,0.97645694,0.00015743486,0.017861012,0.004638084,0.00027089054],"about_ca_topic_score_codex":0.0000863983,"about_ca_topic_score_gemma":0.000028146142,"teacher_disagreement_score":0.8579664,"about_ca_system_score_codex":0.0001492768,"about_ca_system_score_gemma":0.00002256065,"threshold_uncertainty_score":0.9619625},"labels":[],"label_agreement":null},{"id":"W2115098331","doi":"10.1109/mnrc.2008.4683370","title":"PERG: A scalable pattern-matching accelerator","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Pattern matching; False positive paradox; Field-programmable gate array; Bloom filter; Matching (statistics); Throughput; Pattern recognition (psychology); Intrusion detection system; Computer hardware; Parallel computing; Data mining; Artificial intelligence; Algorithm; Database; Operating system","score_opus":0.020364552884433236,"score_gpt":0.226244449293295,"score_spread":0.20587989640886178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115098331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045052722,0.00006738075,0.94199663,0.00041791386,0.00013431674,0.000033020628,1.02138465e-7,0.00030693534,0.011990999],"genre_scores_gemma":[0.8843211,0.000027514085,0.112261854,0.00091978966,0.000087625674,0.0000043939826,0.0000010938311,0.000006279806,0.0023703456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993173,0.00001989772,0.000108964996,0.00021738793,0.00014926383,0.00018717108],"domain_scores_gemma":[0.99961066,0.0000209813,0.00003299308,0.00022209538,0.00005110794,0.000062146355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081838334,0.0000759318,0.00007767591,0.00003868527,0.0002619048,0.00014686049,0.00035389702,0.000031580665,0.000055720844],"category_scores_gemma":[0.0000039261727,0.00006370517,0.000024311776,0.00026804913,0.000016496546,0.0006343756,0.000094534436,0.000066580375,0.00010936149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011517482,0.00048232396,0.03140114,0.000092414375,0.00005735258,0.00023881973,0.015364091,0.04534484,0.0012475234,0.021350587,0.09832845,0.78608096],"study_design_scores_gemma":[0.00054542825,0.00006378369,0.0027694632,0.000050955394,0.0000037514353,0.0001749377,0.00005477297,0.9820961,0.0035946923,0.0030469636,0.007092561,0.0005066375],"about_ca_topic_score_codex":0.000024065557,"about_ca_topic_score_gemma":0.0000037253885,"teacher_disagreement_score":0.9367512,"about_ca_system_score_codex":0.000015042634,"about_ca_system_score_gemma":0.000049246268,"threshold_uncertainty_score":0.25978214},"labels":[],"label_agreement":null},{"id":"W2117611177","doi":"10.1109/cnsr.2006.21","title":"Cartesian Core Routing and Cartesian Border Gateway Design","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Routing table; Computer science; Computer network; Static routing; Enhanced Interior Gateway Routing Protocol; Policy-based routing; Distributed computing; Dynamic Source Routing; Border Gateway Protocol; Routing domain; Routing (electronic design automation); Interior gateway protocol; Cartesian coordinate system; Routing protocol; Mathematics; Geometry","score_opus":0.014372633179961378,"score_gpt":0.2396353237190827,"score_spread":0.22526269053912132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117611177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021371963,0.00021116619,0.98277164,0.00048992276,0.00009039824,0.00008304949,1.5910305e-7,0.0002673177,0.013949167],"genre_scores_gemma":[0.74033266,0.0000053781255,0.2577101,0.0001898904,0.00008854963,0.0000039373544,0.0000025221213,0.000008407471,0.0016585267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991314,0.000035678764,0.00015170324,0.00029572385,0.0001280656,0.00025744416],"domain_scores_gemma":[0.9995632,0.000053274238,0.00005490261,0.0002089439,0.000060578328,0.000059067806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002101565,0.000114200775,0.000104289385,0.00004868142,0.00022222413,0.00029359633,0.00019565472,0.000052643583,0.0000104212295],"category_scores_gemma":[0.000009711307,0.00009968724,0.000017378621,0.00031142368,0.000033296543,0.00033693298,0.000053964992,0.00006455757,0.000008582692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021462878,0.00024287828,0.03593788,0.000087150875,0.000043566102,0.00010953558,0.0035678952,0.14168002,0.0020026134,0.3608725,0.03349101,0.4219435],"study_design_scores_gemma":[0.00025324823,0.00004269791,0.0018756378,0.00002433139,0.0000062548625,0.00002665004,0.000033375203,0.99011374,0.0009851181,0.0057665543,0.0006503668,0.00022202372],"about_ca_topic_score_codex":0.00009710381,"about_ca_topic_score_gemma":0.000033920634,"teacher_disagreement_score":0.84843373,"about_ca_system_score_codex":0.000015974267,"about_ca_system_score_gemma":0.000043842785,"threshold_uncertainty_score":0.40651277},"labels":[],"label_agreement":null},{"id":"W2118009608","doi":"10.1109/lcn.2010.5735761","title":"A distributed parallel approach for BGP routing table partitioning in next generation routers","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Université de Montréal","funders":"","keywords":"Computer science; Routing table; Scalability; Border Gateway Protocol; Default-free zone; Computer network; Distributed computing; Routing (electronic design automation); Static routing; Routing protocol; Parallel computing; Operating system","score_opus":0.039519461683755565,"score_gpt":0.2490888926050745,"score_spread":0.20956943092131894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118009608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008461184,0.000013459555,0.9898728,0.00026426432,0.00020336817,0.00017760776,0.0000013669843,0.00013598992,0.000869962],"genre_scores_gemma":[0.5343824,0.0000014830705,0.46514505,0.00009627981,0.00010327152,0.000054993387,0.00011165688,0.0000044021144,0.00010047156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911785,0.000023278522,0.00020122858,0.00029987685,0.00009702417,0.00026072003],"domain_scores_gemma":[0.99957776,0.000034817815,0.00007426793,0.00019461765,0.00007152873,0.000047024798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039096264,0.00008953737,0.00009726701,0.000048539077,0.0002028457,0.0005107213,0.00022532298,0.00006799668,0.0000039859924],"category_scores_gemma":[0.000056193778,0.000084550775,0.000024444733,0.00039423117,0.00001479266,0.000921917,0.00004487444,0.00011518996,0.0000017674574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008896004,0.00012562041,0.0030290193,0.000021855436,0.000007687237,9.451198e-7,0.00062341563,0.8911772,0.0038352015,0.08122094,0.0022889746,0.017660256],"study_design_scores_gemma":[0.0003374082,0.000013623752,0.00014739655,0.0000062806575,0.0000021095427,0.0000025311438,0.000027535725,0.9980732,0.00048047263,0.0005696637,0.00022246562,0.00011730895],"about_ca_topic_score_codex":0.000029661394,"about_ca_topic_score_gemma":0.00007696193,"teacher_disagreement_score":0.5259212,"about_ca_system_score_codex":0.000018040651,"about_ca_system_score_gemma":0.000049503786,"threshold_uncertainty_score":0.49248973},"labels":[],"label_agreement":null},{"id":"W2121330629","doi":"10.1109/jssc.2008.2001932","title":"Match Sensing Using Match-Line Stability in Content-Addressable Memories (CAM)","year":2008,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Line (geometry); Voltage; Scheme (mathematics); Stability (learning theory); Computer science; CMOS; Ternary operation; Noise (video); Power (physics); Content-addressable memory; Computer hardware; Electronic engineering; Algorithm; Electrical engineering; Physics; Engineering; Artificial intelligence; Mathematics","score_opus":0.12378963824416805,"score_gpt":0.293034362105582,"score_spread":0.16924472386141393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121330629","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.60290885,0.00029697386,0.3956042,0.00013958101,0.0008420321,0.00007587141,0.0000031758152,0.00003355475,0.00009580109],"genre_scores_gemma":[0.9830264,0.00027608697,0.016146155,0.00016407859,0.00026555252,4.1670535e-7,8.972886e-7,0.000023777766,0.00009664611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739003,0.00019079192,0.001024334,0.00030585198,0.0005750227,0.0005139683],"domain_scores_gemma":[0.99776864,0.0001336312,0.0007565577,0.00033511478,0.0008203333,0.00018572067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011248987,0.00023167703,0.0005418408,0.00025801832,0.00025921498,0.00017100357,0.00050257804,0.00009108361,0.000006733358],"category_scores_gemma":[0.00010110835,0.00021615996,0.00011045644,0.00076054956,0.00014578436,0.0016042899,0.000061593964,0.00042042907,0.0000049515434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014421665,0.0006229538,0.021730706,0.00035571904,0.00015697374,0.0019983528,0.024266575,0.8394193,0.075765096,0.00009511641,0.00097036496,0.03447462],"study_design_scores_gemma":[0.004045132,0.0003700662,0.0042297356,0.0014528023,0.000059654016,0.005200195,0.001017332,0.7764726,0.19836798,0.007502092,0.00019026101,0.0010921075],"about_ca_topic_score_codex":0.000042910815,"about_ca_topic_score_gemma":0.000034771976,"teacher_disagreement_score":0.38011757,"about_ca_system_score_codex":0.00023059828,"about_ca_system_score_gemma":0.0004250838,"threshold_uncertainty_score":0.88147473},"labels":[],"label_agreement":null},{"id":"W2122110587","doi":"10.3844/jcssp.2006.815.823","title":"Separation of the Control Plane and Forwarding Plane in Next-Generation Routers","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Forwarding plane; Separation (statistics); Plane (geometry); Control (management); Computer network; Routing control plane; Artificial intelligence; Network packet; Machine learning; Geometry","score_opus":0.014444177103104071,"score_gpt":0.23632652640385343,"score_spread":0.22188234930074935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122110587","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.27478045,0.00009736292,0.7241731,0.00041401244,0.00045106022,0.00004060673,1.7319634e-7,0.0000042788406,0.000038905055],"genre_scores_gemma":[0.9445819,0.0000075289377,0.055096585,0.000110834786,0.00019489859,3.1856746e-7,2.0718738e-7,0.0000015842188,0.000006138219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989722,0.000052684023,0.00034359595,0.00013056093,0.00037065928,0.00013034797],"domain_scores_gemma":[0.99924695,0.00005240222,0.00038160154,0.00012901289,0.0001579292,0.000032080985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009116674,0.000063307234,0.00013101424,0.00016860916,0.00011886365,0.00028692512,0.0004989483,0.000023512266,2.3810452e-7],"category_scores_gemma":[0.000014302857,0.000043281034,0.000026154912,0.00058201863,0.00009970047,0.0013799493,0.00006249155,0.0000878229,1.6016715e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001817152,0.00006281003,0.0153442435,0.00001552387,0.000006067265,0.000008317533,0.0008707223,0.90667385,0.022362147,0.0055966154,0.00063969387,0.048401847],"study_design_scores_gemma":[0.00042497186,0.0000749023,0.016844098,0.000059326616,0.000003389191,0.00008566429,0.000003337022,0.9784233,0.003336513,0.00065245916,0.000038910366,0.000053114603],"about_ca_topic_score_codex":0.000008331618,"about_ca_topic_score_gemma":0.000009361055,"teacher_disagreement_score":0.6698014,"about_ca_system_score_codex":0.00003687037,"about_ca_system_score_gemma":0.00012932114,"threshold_uncertainty_score":0.27668256},"labels":[],"label_agreement":null},{"id":"W2122878358","doi":"10.1109/ccece.2004.1345236","title":"Comparing a novel QoS routing algorithm to standard pruning techniques used in QoS routing algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"St. Mary's University; Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer science; Quality of service; Pruning; Algorithm; Routing (electronic design automation); Path (computing); Dijkstra's algorithm; Heuristic; Shortest path problem; Mathematical optimization; Graph; Computer network; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.027518399758740805,"score_gpt":0.2757944805590631,"score_spread":0.24827608080032226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122878358","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.0061094644,0.000023232587,0.9897211,0.00047167524,0.0003160792,0.0003508066,0.0000010319061,0.00095561304,0.0020509984],"genre_scores_gemma":[0.37681952,0.0000021581354,0.62266916,0.0002219488,0.00019476491,0.000020598553,0.0000027139672,0.000018814233,0.000050315335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976539,0.00004286937,0.00053535256,0.000656621,0.00045410037,0.000657163],"domain_scores_gemma":[0.99906576,0.00006615,0.00016433756,0.00039400603,0.0001558491,0.00015392705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010673212,0.00026217537,0.0003604718,0.00030067386,0.0003092238,0.00063606096,0.00070419355,0.00010695236,0.000002501658],"category_scores_gemma":[0.00007643062,0.00026140266,0.000052915682,0.0014552074,0.000028972478,0.0008827834,0.00041821282,0.00031039238,0.000007805518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019246758,0.0002332449,0.0067258277,0.0000407622,0.000028082506,0.000049779355,0.012924811,0.30386353,0.0018036892,0.013689076,0.00010582908,0.66051614],"study_design_scores_gemma":[0.0009350245,0.00010362549,0.0003394867,0.0005998855,0.0000046630084,0.000022344155,0.00026679115,0.9828518,0.013821574,0.00039641137,0.00020555985,0.00045284064],"about_ca_topic_score_codex":0.00029154783,"about_ca_topic_score_gemma":0.000107524254,"teacher_disagreement_score":0.6789883,"about_ca_system_score_codex":0.00037604905,"about_ca_system_score_gemma":0.00019327963,"threshold_uncertainty_score":0.99998385},"labels":[],"label_agreement":null},{"id":"W2123761815","doi":"10.1109/iscas.2008.4542170","title":"A dynamic address decode circuit for implementing range addressable look-up tables","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Lookup table; Decoding methods; Scalability; Table (database); Content-addressable memory; Matching (statistics); Electronic circuit; Computer architecture; Computer hardware; Logic gate; Computer engineering; Parallel computing; Embedded system; Algorithm; Engineering; Electrical engineering","score_opus":0.0440017271489153,"score_gpt":0.2787664733400701,"score_spread":0.23476474619115478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123761815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005501306,0.00045848172,0.98770154,0.00017295447,0.00029829482,0.0002755603,0.000008446145,0.000324664,0.005258746],"genre_scores_gemma":[0.7290932,0.00014405262,0.2578824,0.00056205585,0.00012747651,0.00014404238,0.000057596793,0.000035150722,0.011954037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984761,0.000028385424,0.0002738371,0.00043871193,0.00021094039,0.00057201926],"domain_scores_gemma":[0.99913126,0.00011199696,0.00012568917,0.00037781286,0.00016634016,0.00008691116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034304635,0.00015644354,0.00018486797,0.00009401738,0.00062603474,0.00019417622,0.0005878384,0.000060972892,0.00008015098],"category_scores_gemma":[0.00003587286,0.0001470614,0.000070634305,0.0003527754,0.000037742408,0.0007096007,0.00015119594,0.00007040444,0.000018923472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014712867,0.0007886187,0.028698124,0.0010392958,0.00039640313,0.00009501789,0.01222906,0.05239903,0.0023444518,0.18150094,0.2872784,0.43308353],"study_design_scores_gemma":[0.0012028113,0.0000522376,0.000311553,0.00005493013,0.000014274655,0.000037841208,0.00007242217,0.98089856,0.0009342647,0.0030500325,0.013014814,0.0003562416],"about_ca_topic_score_codex":0.00004215449,"about_ca_topic_score_gemma":0.00014012333,"teacher_disagreement_score":0.9284995,"about_ca_system_score_codex":0.0000419461,"about_ca_system_score_gemma":0.00010685562,"threshold_uncertainty_score":0.59969896},"labels":[],"label_agreement":null},{"id":"W2125619860","doi":"10.1109/pacrim.2003.1235745","title":"Network processors for communication security: a review","year":2004,"lang":"en","type":"review","venue":"","topic":"Network Packet Processing and Optimization","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; Flexibility (engineering); Wireless network; Wireless; Embedded system; Bandwidth (computing); Computer network; Computer security model; Network security; Design flow; Distributed computing; Computer architecture; Computer security; Telecommunications","score_opus":0.04733931110101443,"score_gpt":0.3436343091602911,"score_spread":0.29629499805927667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125619860","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.647746e-11,0.658811,0.33819017,0.00022636633,0.00010593077,0.0011233004,0.0000014507729,0.0002361339,0.0013057003],"genre_scores_gemma":[1.9768205e-8,0.8583613,0.13969511,0.00065782334,0.00013125293,0.00064210256,0.00016941305,0.000032372092,0.00031057541],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980977,0.00015402271,0.0006692021,0.0005244284,0.00019645324,0.00035817685],"domain_scores_gemma":[0.9977184,0.00021285306,0.0006320103,0.0011333624,0.00022422615,0.00007914662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008584962,0.00035701215,0.0012200641,0.000064935084,0.0002607975,0.00024918912,0.0018285286,0.00022238606,0.0000073833394],"category_scores_gemma":[0.00007861567,0.00027901077,0.00031020743,0.0012238952,0.000031827407,0.00037657417,0.0002587245,0.00026553328,0.000033981283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1359187e-7,0.00001703221,9.149038e-9,0.12052674,0.000018470026,2.686005e-7,0.000020265812,0.0000894368,4.757437e-11,0.018530464,0.028324336,0.83247274],"study_design_scores_gemma":[0.000058971,0.00001753751,1.0199833e-9,0.19201247,0.00020200743,0.00001528212,2.9402702e-7,0.0011741532,1.3745988e-8,0.016872615,0.7893813,0.0002653475],"about_ca_topic_score_codex":0.0000018259283,"about_ca_topic_score_gemma":0.000002843912,"teacher_disagreement_score":0.83220744,"about_ca_system_score_codex":0.000114047165,"about_ca_system_score_gemma":0.0006985697,"threshold_uncertainty_score":0.9999662},"labels":[],"label_agreement":null},{"id":"W2126258349","doi":"10.1109/ccece.2005.1556933","title":"Dynamic silicon firewall","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 Saskatchewan","funders":"","keywords":"Firewall (physics); Application firewall; Computer science; Stateful firewall; DMZ; Context-based access control; Computer network; Network packet; Denial-of-service attack; Operating system; Network interface controller; Embedded system; Network security; Computer hardware; Computer security; The Internet","score_opus":0.003945030596783554,"score_gpt":0.2048734706786295,"score_spread":0.20092844008184593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126258349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014321935,0.000119848366,0.9431454,0.00067556265,0.00013479902,0.000027989778,7.552797e-8,0.00034595665,0.04122844],"genre_scores_gemma":[0.9167317,0.0000042272827,0.075011,0.00021588842,0.000026030504,0.0000019935405,0.000003032811,0.0000033538306,0.008002786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957436,0.000009480883,0.000076449185,0.00014657107,0.000077039236,0.0001160671],"domain_scores_gemma":[0.9997488,0.000014022427,0.000022925886,0.00017149218,0.00002476442,0.000017998453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052752395,0.000047461675,0.000041709824,0.000026311947,0.000059506026,0.00011307215,0.00021788327,0.000023865843,0.000014039619],"category_scores_gemma":[0.0000024563346,0.000040557392,0.000015799636,0.00019121006,0.000009931605,0.0002298951,0.000037477654,0.000028692737,0.00005967556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074900386,0.00035840704,0.005131134,0.00004735368,0.000015158157,0.000030695624,0.00082665065,0.097014114,0.002124218,0.29048735,0.06862352,0.53533393],"study_design_scores_gemma":[0.000073898256,0.000009184926,0.0012064239,0.0000038526773,7.395944e-7,0.0000025692143,0.0000011347544,0.9876983,0.00027418847,0.008767665,0.0018931021,0.00006891319],"about_ca_topic_score_codex":0.000027198566,"about_ca_topic_score_gemma":0.000031169853,"teacher_disagreement_score":0.90240973,"about_ca_system_score_codex":0.000013493225,"about_ca_system_score_gemma":0.000015107776,"threshold_uncertainty_score":0.16538824},"labels":[],"label_agreement":null},{"id":"W2127308651","doi":"10.1109/ccece.2003.1226016","title":"Protocol convertibility in a network processing environment","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Protocol (science); Computer network; Distributed computing; Encryption; Field (mathematics); Set (abstract data type); Communications protocol; Convertibility; Programming language","score_opus":0.01426538129140994,"score_gpt":0.2514801207834292,"score_spread":0.23721473949201924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127308651","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.00054268114,0.00001333845,0.9836707,0.0004515143,0.000028956314,0.011946747,2.7474668e-8,0.00014695938,0.0031990358],"genre_scores_gemma":[0.4860375,0.0000018336945,0.49030632,0.000646654,0.00009825838,0.022692267,0.0000010539483,0.000011029229,0.00020510936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990129,0.000030813986,0.0002087602,0.0003301271,0.00015609179,0.0002613],"domain_scores_gemma":[0.9996094,0.000009647073,0.00005929282,0.00025508486,0.000015479334,0.00005110167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031858857,0.00009454475,0.00009663738,0.000029676663,0.00008553716,0.00011989683,0.00028265128,0.000044391403,0.000015254952],"category_scores_gemma":[0.0000069899197,0.00007946391,0.000017927669,0.00034046164,0.000032218923,0.00046573125,0.00009790179,0.00008752097,0.000027101129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017701339,0.00024141619,0.0059937835,0.00006732226,0.0000020624332,0.000010235163,0.0006428492,0.8517284,0.000023105904,0.009194259,0.00012222941,0.13195665],"study_design_scores_gemma":[0.0027001505,0.00014299869,0.006519933,0.00023108447,0.000002332683,0.000012107512,0.000021221342,0.9053582,0.0012226299,0.079255864,0.004068239,0.0004652522],"about_ca_topic_score_codex":0.000013147388,"about_ca_topic_score_gemma":0.000013933223,"teacher_disagreement_score":0.49336442,"about_ca_system_score_codex":0.0001075846,"about_ca_system_score_gemma":0.000105312894,"threshold_uncertainty_score":0.32404444},"labels":[],"label_agreement":null},{"id":"W2128120508","doi":"10.1109/infcom.2009.5062171","title":"Adaptive Early Packet Filtering for Defending Firewalls Against DoS Attacks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":60,"is_retracted":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; Firewall (physics); Network packet; Computer network; Intrusion detection system; Application firewall; Byte; Overhead (engineering); Bloom filter; The Internet; Filter (signal processing); Throughput; Real-time computing; Computer security; Stateful firewall; Computer hardware; Telecommunications","score_opus":0.022821314998745186,"score_gpt":0.25635553058942145,"score_spread":0.23353421559067628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128120508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011156347,0.00006343675,0.9795932,0.00043503207,0.00020403884,0.0001778171,0.0000014338044,0.00033438829,0.008034279],"genre_scores_gemma":[0.72205156,0.000011854971,0.2763641,0.0007144488,0.00011824321,0.000010751467,0.0000059492036,0.000007685853,0.00071544613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895006,0.000021445461,0.00018781355,0.00035176857,0.00014561757,0.00034330785],"domain_scores_gemma":[0.99939543,0.00007946428,0.00008279933,0.0002698382,0.00008626287,0.0000862132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900347,0.00014090657,0.00013893076,0.000072952724,0.00022094954,0.00032567894,0.00041547674,0.00006225219,0.00000447053],"category_scores_gemma":[0.000023836295,0.00012821014,0.000066373774,0.0002929349,0.000014362157,0.00069815567,0.000055836,0.000075804695,0.000020239228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058493093,0.00012936338,0.00039751935,0.000029947774,0.000039533734,0.000015730899,0.0036176627,0.02924885,0.0015169857,0.035210337,0.012302803,0.9174328],"study_design_scores_gemma":[0.0005278218,0.00031448796,0.00080135517,0.00009979207,0.0000068344266,0.000004611597,0.000034602508,0.9872807,0.0028400333,0.006332923,0.0013897946,0.00036698926],"about_ca_topic_score_codex":0.000001922914,"about_ca_topic_score_gemma":0.0000020324158,"teacher_disagreement_score":0.9580319,"about_ca_system_score_codex":0.000038430448,"about_ca_system_score_gemma":0.000031635693,"threshold_uncertainty_score":0.5228258},"labels":[],"label_agreement":null},{"id":"W2135300877","doi":"10.1109/fccm.2015.69","title":"Modular SRAM-Based Binary Content-Addressable Memories","year":2015,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Field-programmable gate array; Static random-access memory; Computer hardware; Embedded system; Content-addressable storage; Modular design; Content-addressable memory; Computer engineering; Artificial neural network; Artificial intelligence; Operating system","score_opus":0.09955275623906377,"score_gpt":0.25533296991368576,"score_spread":0.15578021367462197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135300877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057245987,0.0003078047,0.9753814,0.001436337,0.00048055945,0.00007311807,3.8010333e-7,0.00044026828,0.01615554],"genre_scores_gemma":[0.7462583,0.0000035590028,0.24649547,0.0011228425,0.00009705406,0.000010916392,0.000008935573,0.00001053887,0.0059923576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.00004304476,0.00013327804,0.00024845265,0.0002474803,0.00021350507],"domain_scores_gemma":[0.99919313,0.000026403664,0.000050986648,0.00036723126,0.00022859,0.00013366419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002696295,0.000098918725,0.000110624176,0.000056387868,0.0000967687,0.0002383488,0.00042681696,0.00004689631,0.000014020806],"category_scores_gemma":[0.000045017463,0.000081422724,0.00002761686,0.00036331944,0.000041743693,0.0005903234,0.00008669364,0.00006027083,0.00006496622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050254057,0.0002963636,0.0029811556,0.000048224392,0.000028690414,0.000057765716,0.00086425844,0.85583866,0.00056806614,0.050653186,0.06723509,0.02137832],"study_design_scores_gemma":[0.00047041115,0.000081010476,0.00007940727,0.000016661574,0.0000032042062,0.000002923079,0.000052379288,0.9894075,0.003053927,0.0023380774,0.0043537146,0.00014083143],"about_ca_topic_score_codex":0.00002009214,"about_ca_topic_score_gemma":0.0000036194251,"teacher_disagreement_score":0.7405337,"about_ca_system_score_codex":0.000028825587,"about_ca_system_score_gemma":0.00014411139,"threshold_uncertainty_score":0.33203223},"labels":[],"label_agreement":null},{"id":"W2140224728","doi":"10.1109/iwcmc.2011.5982806","title":"GBSA: A group based search algorithm for packet classification","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scalability; Network packet; Block (permutation group theory); Set (abstract data type); Key (lock); Routing algorithm; Routing (electronic design automation); Algorithm; Computer network; Routing protocol; Operating system","score_opus":0.08111997701042242,"score_gpt":0.2722088286724643,"score_spread":0.1910888516620419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140224728","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.0001107558,0.000021416581,0.99303824,0.00030004306,0.00015751104,0.00017582036,0.0000012877966,0.00024367489,0.005951259],"genre_scores_gemma":[0.08074764,0.000005446663,0.9182872,0.0003233352,0.00006590586,0.000046771653,0.00001749562,0.000008770911,0.0004974281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991755,0.00003797087,0.00013217365,0.0002921741,0.00014361802,0.00021857845],"domain_scores_gemma":[0.9993878,0.0000533134,0.000042997508,0.00030271293,0.00014520904,0.00006797814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003591457,0.00008133643,0.00007589145,0.00007198797,0.00013751276,0.0001064786,0.00036836034,0.000054798646,0.000026068665],"category_scores_gemma":[0.000010288391,0.00007017452,0.00003779027,0.00032883597,0.000027013288,0.00035861367,0.0000348175,0.000052673204,0.000023689456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006589074,0.00011731294,0.00018476314,0.000014275049,0.0000055886803,7.6390387e-7,0.00033838497,0.00006228595,0.000054431985,0.037220474,0.0023463974,0.9596487],"study_design_scores_gemma":[0.00029573392,0.00008414904,0.0007100909,0.000008547284,0.0000030569536,0.0000010868749,0.000022006338,0.99375784,0.0012589624,0.002963004,0.0007912147,0.00010431128],"about_ca_topic_score_codex":0.00001305192,"about_ca_topic_score_gemma":0.000004409089,"teacher_disagreement_score":0.99369556,"about_ca_system_score_codex":0.000023117786,"about_ca_system_score_gemma":0.000058643946,"threshold_uncertainty_score":0.2861634},"labels":[],"label_agreement":null},{"id":"W2140339261","doi":"10.1016/j.comnet.2005.11.007","title":"Origin authentication in interdomain routing","year":2005,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Authentication (law); Computer security; Delegation; The Internet; Computer network; Routing (electronic design automation); Address space; World Wide Web","score_opus":0.010750026952211068,"score_gpt":0.24208424885873356,"score_spread":0.2313342219065225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140339261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069707017,0.00017081406,0.99055445,0.0007369278,0.00058471266,0.00008974197,5.7685217e-8,0.00023775503,0.0006548235],"genre_scores_gemma":[0.70462835,0.000013932438,0.294072,0.0004723449,0.0007051919,0.000006356389,0.000004396367,0.000008469197,0.00008895155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880934,0.00007978215,0.00028977625,0.00036916058,0.00012478977,0.0003271266],"domain_scores_gemma":[0.9993694,0.00006414719,0.000096711374,0.00036396712,0.000042655345,0.00006313441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040147125,0.00012946755,0.00013652067,0.0001091796,0.0000889262,0.00026635575,0.0005887031,0.00007808357,0.000005179337],"category_scores_gemma":[0.0000041201038,0.00013046719,0.0000364167,0.00057049847,0.00002254397,0.0005549409,0.00021035623,0.00019442139,0.000033084612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002436566,0.00004229623,0.0017256471,0.000002851839,0.0000032546177,0.0000026747339,0.0006585479,0.5381748,0.0000022405518,0.006413427,0.0017215023,0.45125028],"study_design_scores_gemma":[0.00025089883,0.000017049788,0.0017330513,0.00007566938,0.0000017969406,0.000008521671,0.000003034114,0.9948334,0.000012734305,0.00048283636,0.0024336327,0.00014737874],"about_ca_topic_score_codex":0.000003182007,"about_ca_topic_score_gemma":0.000017936716,"teacher_disagreement_score":0.69765764,"about_ca_system_score_codex":0.000085762964,"about_ca_system_score_gemma":0.000025656273,"threshold_uncertainty_score":0.53202975},"labels":[],"label_agreement":null},{"id":"W2144476274","doi":"10.1109/mwscas.2009.5235948","title":"Ultra low leakage 90nm content addressable memory design for wireless sensor network applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless sensor network; Leakage (economics); Wireless; Content-addressable memory; Computer network; Embedded system; Telecommunications; Artificial neural network","score_opus":0.04380713554897916,"score_gpt":0.25163202290794706,"score_spread":0.2078248873589679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144476274","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.00012246212,0.00020335456,0.993,0.0010522407,0.00014117458,0.0007543197,0.0000013760013,0.00042448213,0.004300596],"genre_scores_gemma":[0.23356918,0.00007773959,0.75574946,0.0024177467,0.0005573034,0.00026503418,0.000022730723,0.000021224283,0.007319609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986579,0.000055369463,0.00025974843,0.00043055747,0.00016965604,0.00042678093],"domain_scores_gemma":[0.99889785,0.00020041686,0.00011789653,0.000463569,0.00020676528,0.00011350639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003878256,0.00016192174,0.00019030209,0.00004164335,0.0003704247,0.00026441368,0.0005255742,0.00008356355,0.000009861457],"category_scores_gemma":[0.000013785927,0.00014424814,0.0000652383,0.00044117813,0.00003252468,0.00037612958,0.000020991103,0.00008876434,0.000027685435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044187163,0.00025074554,0.000035276465,0.000045587956,0.000027630354,0.000002993537,0.00024998977,0.6725435,0.0017163339,0.050585326,0.048011217,0.22648717],"study_design_scores_gemma":[0.00065711344,0.00015138857,0.000069811875,0.00006227645,0.00001619095,0.000010279517,0.000045010118,0.97847027,0.010109889,0.007020889,0.0030236142,0.0003632489],"about_ca_topic_score_codex":0.000003216371,"about_ca_topic_score_gemma":0.000002070817,"teacher_disagreement_score":0.30592677,"about_ca_system_score_codex":0.00003308952,"about_ca_system_score_gemma":0.00007072386,"threshold_uncertainty_score":0.58822685},"labels":[],"label_agreement":null},{"id":"W2147310409","doi":"10.1109/mnet.2008.4476065","title":"A distributed and scalable routing table manager for the next generation of IP routers","year":2008,"lang":"en","type":"article","venue":"IEEE Network","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Routing table; IP forwarding; Scalability; Routing (electronic design automation); Virtual routing and forwarding; Table (database); Routing protocol; Next-generation network; Distributed computing; The Internet; Operating system; Database","score_opus":0.053793023278590424,"score_gpt":0.23931424869210363,"score_spread":0.1855212254135132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147310409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010761486,0.00079985935,0.98673207,0.00028701802,0.0010630181,0.00017649935,0.0000018923942,0.00005588053,0.00012226158],"genre_scores_gemma":[0.951188,0.00019873765,0.046361823,0.00025520622,0.0015842213,0.00003004525,0.00001587541,0.000010717748,0.00035534357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992383,0.000030706688,0.00017607461,0.00020644473,0.000111432026,0.00023700514],"domain_scores_gemma":[0.99939233,0.00014474851,0.0001198293,0.00022539694,0.00008396509,0.00003372612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028894836,0.000086082975,0.0001156642,0.000016278595,0.00048903143,0.00012734655,0.00022317262,0.00004409885,6.469797e-7],"category_scores_gemma":[0.000017129883,0.00006577,0.000027799615,0.00042984416,0.00005118189,0.00035688205,0.00004321896,0.000055372093,8.210962e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013669579,0.000016675252,0.0008222332,0.000016959946,0.000024063358,0.0000014034084,0.00030564316,0.9171069,0.00012473822,0.001317009,0.06678458,0.013466102],"study_design_scores_gemma":[0.00020710565,0.000026298307,0.00038040424,0.000029049506,0.000012133165,0.000007998874,0.000007862181,0.9959366,0.00030311785,0.0004336879,0.0025720971,0.00008364313],"about_ca_topic_score_codex":0.000015638385,"about_ca_topic_score_gemma":0.0000067644755,"teacher_disagreement_score":0.9404265,"about_ca_system_score_codex":0.000014727066,"about_ca_system_score_gemma":0.00003128663,"threshold_uncertainty_score":0.37612838},"labels":[],"label_agreement":null},{"id":"W2148656332","doi":"10.1109/jsac.2005.854119","title":"Conflict classification and analysis of distributed firewall policies","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":288,"is_retracted":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":"Firewall (physics); Computer science; Application firewall; Context-based access control; DMZ; Security policy; Computer security; Network security; Distributed computing; Stateful firewall; Entropy (arrow of time)","score_opus":0.04643447313465448,"score_gpt":0.31568186122946795,"score_spread":0.26924738809481347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148656332","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.50228,0.0022582975,0.47430098,0.018555136,0.00012645165,0.00022702223,0.000038282804,0.00017974585,0.002034115],"genre_scores_gemma":[0.97950524,0.0020892571,0.018137518,0.00015793052,0.000027923135,0.000005887614,0.00004433542,0.000005028288,0.000026850583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988699,0.00022956653,0.0004317729,0.0001355419,0.00017979328,0.00015343506],"domain_scores_gemma":[0.9980902,0.0003353914,0.00034608087,0.0007508724,0.00040371428,0.00007375997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035657646,0.00009537789,0.0002077646,0.000577462,0.00024506185,0.00014703134,0.0008977514,0.000062687235,0.0000034639131],"category_scores_gemma":[0.00011950559,0.0000897592,0.000047197613,0.0032110487,0.00008862789,0.00033230818,0.00006379578,0.0003146007,0.0000015002424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014527165,0.0035348742,0.20065859,0.000039347713,0.0021666114,0.0000052997557,0.029403796,0.34894392,0.007748872,0.08236247,0.0066383784,0.31835255],"study_design_scores_gemma":[0.0002352783,0.000033302833,0.14493091,0.000046192294,0.00008034092,0.0000134315815,0.00003135321,0.8515363,0.00020492049,0.00020764323,0.0025790774,0.000101275444],"about_ca_topic_score_codex":0.000015233459,"about_ca_topic_score_gemma":0.00013986182,"teacher_disagreement_score":0.5025923,"about_ca_system_score_codex":0.000098056196,"about_ca_system_score_gemma":0.00009664573,"threshold_uncertainty_score":0.3660274},"labels":[],"label_agreement":null},{"id":"W2150586899","doi":"10.1109/tnet.2005.857070","title":"Packet classification consuming small amount of memory","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Space Agency","funders":"","keywords":"Computer science; Bottleneck; Router; Network packet; The Internet; Algorithm; Speedup; Computer network; Parallel computing; Embedded system","score_opus":0.045177678743253,"score_gpt":0.25899352591856756,"score_spread":0.21381584717531454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150586899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011478236,0.0002988205,0.9845263,0.00071758445,0.0011355601,0.00015935318,0.000001802775,0.00027988167,0.0014024844],"genre_scores_gemma":[0.87762743,0.00023023496,0.121195406,0.00024116505,0.00039409462,0.000023579583,0.0000036587953,0.000021599952,0.00026280017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983973,0.00010447735,0.00044431956,0.00043630536,0.00026900528,0.00034857384],"domain_scores_gemma":[0.9985022,0.00024401824,0.00025275256,0.0007731274,0.00013411212,0.00009382322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041282922,0.0001978898,0.00022041495,0.00019904066,0.000338357,0.00012834901,0.00066986703,0.00012836693,0.000016118054],"category_scores_gemma":[0.000007891746,0.00020683518,0.00010443814,0.0007436739,0.000077995224,0.00039681923,0.000006766548,0.00028350682,0.000025211219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016090895,0.00011490763,0.000067324305,0.000020856038,0.000026676089,0.0000013184979,0.0006875741,0.3022881,0.0005179015,0.0002852183,0.00017550656,0.6957985],"study_design_scores_gemma":[0.0005965857,0.00008139162,0.00025913774,0.00030275484,0.000047009114,0.00002022971,0.00008251593,0.98150367,0.01021142,0.00078471925,0.005722235,0.00038831745],"about_ca_topic_score_codex":0.000009310926,"about_ca_topic_score_gemma":0.000059221846,"teacher_disagreement_score":0.86614925,"about_ca_system_score_codex":0.0001063711,"about_ca_system_score_gemma":0.00007592025,"threshold_uncertainty_score":0.84344935},"labels":[],"label_agreement":null},{"id":"W2150974686","doi":"10.1109/glocom.1991.188368","title":"A neural network shortest path algorithm for optimum routing in packet-switched communications networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Shortest path problem; Artificial neural network; Robustness (evolution); Network packet; Routing (electronic design automation); Computation; Path (computing); Algorithm; Computer network; Artificial intelligence; Theoretical computer science","score_opus":0.032498724169824925,"score_gpt":0.25807090722166615,"score_spread":0.22557218305184124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150974686","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.00013264292,0.00081657025,0.9943571,0.0013253903,0.00029977885,0.00033979415,9.939384e-7,0.0003242005,0.0024035268],"genre_scores_gemma":[0.42644477,0.00016352718,0.5721492,0.000587123,0.00023562826,0.00007553421,0.000021066706,0.00001866534,0.0003044915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982544,0.00010643521,0.00043309014,0.00042594018,0.00015229898,0.00062784244],"domain_scores_gemma":[0.99827844,0.00036541786,0.00014584526,0.000982166,0.00011939617,0.00010871227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055879314,0.00020141508,0.0002402999,0.000070149756,0.00039509052,0.00035166772,0.001224946,0.000120164405,0.000012527646],"category_scores_gemma":[0.000034509296,0.00019385517,0.00007676548,0.0010565178,0.0000555164,0.0005710545,0.00034111875,0.0002661831,0.0000064840888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017953164,0.00011423097,0.0012172298,0.0000029230882,0.000009591281,0.0000029379512,0.00037077506,0.45369443,9.3246473e-7,0.005754937,0.0039083995,0.5349218],"study_design_scores_gemma":[0.0004223822,0.000051658422,0.00020331782,0.000047247944,0.000006818754,0.00000855189,0.000028824023,0.9977901,0.0000017406777,0.000751588,0.00044493272,0.0002428397],"about_ca_topic_score_codex":0.0000147093,"about_ca_topic_score_gemma":0.00005243678,"teacher_disagreement_score":0.5440957,"about_ca_system_score_codex":0.000053880573,"about_ca_system_score_gemma":0.00002129833,"threshold_uncertainty_score":0.79051846},"labels":[],"label_agreement":null},{"id":"W2152966189","doi":"10.1109/fpt.2008.4762368","title":"PERG: A scalable FPGA-based pattern-matching engine with consolidated Bloomier filters","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"CMC Microsystems","keywords":"Bloom filter; Computer science; Byte; Pattern matching; String searching algorithm; Filter (signal processing); False positive paradox; Hash function; Data mining; Scalability; Field-programmable gate array; Intrusion detection system; Computer hardware; Pattern recognition (psychology); Algorithm; Database; Artificial intelligence; Computer vision","score_opus":0.010609997714917049,"score_gpt":0.19842803858901784,"score_spread":0.18781804087410078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152966189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103898026,0.000030853582,0.893128,0.00058001134,0.000078732286,0.00007649973,7.306907e-7,0.0003795648,0.0018276187],"genre_scores_gemma":[0.8395949,0.0000063495872,0.15799932,0.0011997407,0.00003495499,0.000008565571,0.000010570591,0.000013243329,0.0011323865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989592,0.00003754416,0.00015366024,0.00033115855,0.00022309514,0.00029533208],"domain_scores_gemma":[0.99933875,0.000056333578,0.00006358024,0.0003405435,0.00010022591,0.00010055169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001085329,0.00015076336,0.0001472745,0.00008856172,0.00024297947,0.0001410912,0.0003432403,0.00004484543,0.00006323449],"category_scores_gemma":[0.0000069407315,0.0001146661,0.00002810023,0.00046907872,0.0000550343,0.00041757873,0.000047556343,0.00010996448,0.000037584457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007291242,0.00042001824,0.010025813,0.00009340301,0.000092767674,0.00034045102,0.0029574495,0.91962,0.0005279886,0.0004936282,0.013934674,0.05142091],"study_design_scores_gemma":[0.00091972575,0.000088958186,0.00040064816,0.000077076904,0.000007866454,0.000079822195,0.000017848646,0.99109495,0.006448383,0.00005398169,0.0005273769,0.00028337588],"about_ca_topic_score_codex":0.000045771667,"about_ca_topic_score_gemma":0.000009492899,"teacher_disagreement_score":0.73569685,"about_ca_system_score_codex":0.000024275134,"about_ca_system_score_gemma":0.00012346315,"threshold_uncertainty_score":0.4675948},"labels":[],"label_agreement":null},{"id":"W2154088520","doi":"10.1109/lcn.2009.5355204","title":"A scalable cluster distributed BGP architecture for next generation routers","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Scalability; Router; Distributed computing; Computer network; Latency (audio); Load balancing (electrical power); Replication (statistics); Architecture; Routing protocol; Border Gateway Protocol; Routing (electronic design automation); Operating system; Link-state routing protocol; Grid","score_opus":0.02351402535581433,"score_gpt":0.24308144404822873,"score_spread":0.21956741869241442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154088520","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.0011840255,0.000049799222,0.9911626,0.006421168,0.00017587874,0.000172129,0.0000018853589,0.00020190718,0.00063058105],"genre_scores_gemma":[0.3817968,0.000005741248,0.61306316,0.0037101456,0.00031664968,0.00001607524,0.000109438966,0.0000061365454,0.0009758763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.000022934062,0.00013222435,0.0002599167,0.00010569104,0.00021099372],"domain_scores_gemma":[0.9995726,0.000026496067,0.000046196303,0.00022064056,0.000077416305,0.00005665168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013230238,0.00009446823,0.00008586818,0.00004302401,0.0001620739,0.00043649485,0.00025051864,0.000053842854,0.0000043223254],"category_scores_gemma":[0.000019156085,0.000076936645,0.000039918774,0.00026830874,0.000009550831,0.00047151707,0.000024537863,0.000051315445,0.000005628511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029500381,0.0001038713,0.000042093798,0.000016665608,0.000012860898,0.0000013326519,0.0005332386,0.41351712,0.0022378918,0.017844014,0.08892291,0.4767385],"study_design_scores_gemma":[0.00032938982,0.00008005513,0.000045631048,0.000008776746,0.000003842158,0.0000045778,0.0000031096426,0.9891713,0.0012974826,0.0039105928,0.005027286,0.000117935255],"about_ca_topic_score_codex":0.000002024452,"about_ca_topic_score_gemma":0.000007789172,"teacher_disagreement_score":0.5756542,"about_ca_system_score_codex":0.000019215691,"about_ca_system_score_gemma":0.000030178087,"threshold_uncertainty_score":0.42091298},"labels":[],"label_agreement":null},{"id":"W2157381862","doi":"10.1109/ccece.2011.6030538","title":"Design a hardware network firewall on FPGA","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Firewall (physics); Computer science; Header; Application firewall; Field-programmable gate array; Internet security; Computer network; Network packet; Network security; Stateful firewall; Embedded system; Network processor; DMZ; Context-based access control; Computer hardware; Operating system; Computer security; Information security; Security service","score_opus":0.05734253987275195,"score_gpt":0.22557253253965553,"score_spread":0.16822999266690358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157381862","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.000095666655,0.000057908626,0.95032245,0.00012225535,0.0002843652,0.00007299261,4.72524e-8,0.00035591936,0.048688397],"genre_scores_gemma":[0.2645899,0.000020042879,0.7297646,0.0016836828,0.00017176438,0.000013803935,0.0000011915763,0.000012053651,0.0037429526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992026,0.000056478897,0.00011071353,0.00025745103,0.00012787296,0.00024488108],"domain_scores_gemma":[0.99945956,0.00004537422,0.00004565846,0.00033461317,0.00004794493,0.000066863235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022171921,0.000096733405,0.000082577324,0.000029436618,0.00013109326,0.00009384459,0.00045567777,0.00004726418,0.0000826413],"category_scores_gemma":[0.000010111664,0.0000781177,0.000025324274,0.00031305235,0.000014615262,0.0002520916,0.00006635534,0.00007084388,0.00017137289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009812054,0.00032570705,0.0006630307,0.000023225819,0.00004959528,0.0000654096,0.010788193,0.14733046,0.000011085031,0.066481866,0.24332443,0.53083885],"study_design_scores_gemma":[0.00025642457,0.00027298488,0.00042484718,0.00006282265,0.0000054754905,0.000008133647,0.000007547464,0.97315806,0.0014002629,0.020457778,0.003650224,0.000295447],"about_ca_topic_score_codex":0.000006351409,"about_ca_topic_score_gemma":0.0000018828941,"teacher_disagreement_score":0.8258276,"about_ca_system_score_codex":0.000013661141,"about_ca_system_score_gemma":0.00003559898,"threshold_uncertainty_score":0.31855476},"labels":[],"label_agreement":null},{"id":"W2161388613","doi":"10.1109/socc.2006.283904","title":"Novel Ternary Storage Cells and Techniques for Leakage Reduction in Ternary CAM","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ternary operation; Leakage (economics); Reduction (mathematics); Computer science; Exploit; Leakage power; Content-addressable memory; Power (physics); Materials science; Power consumption; Physics; Thermodynamics","score_opus":0.008242802829672592,"score_gpt":0.22264056075787456,"score_spread":0.21439775792820195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161388613","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.016365254,0.00010124532,0.97997135,0.00025297815,0.00015840579,0.00017451501,0.0000010049922,0.0002198233,0.002755447],"genre_scores_gemma":[0.44529885,0.000022102164,0.5516561,0.00007208441,0.00017564821,0.000026598234,0.0000052635464,0.000009709812,0.0027335894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993535,0.000011397481,0.00014737318,0.00026276047,0.00007625218,0.00014866977],"domain_scores_gemma":[0.99972546,0.000019395122,0.000054920918,0.00014752019,0.000030577594,0.000022153325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015810909,0.00008569237,0.00008400142,0.00010107178,0.00006490448,0.00011260446,0.00015981878,0.000055251174,0.0000011006987],"category_scores_gemma":[0.0000023134144,0.00007962972,0.000016786904,0.00017049376,0.000024211047,0.00047344057,0.000056214576,0.000057218447,8.438135e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009899612,0.0011199131,0.0044368636,0.00034594993,0.000018642173,0.00003222864,0.0014421928,0.034034587,0.42124254,0.024332223,0.039896253,0.47299963],"study_design_scores_gemma":[0.0005161489,0.0001362055,0.0012436963,0.000083092316,0.000004516458,0.00006939434,0.000030706844,0.90876603,0.08081702,0.004988314,0.0030244668,0.0003204004],"about_ca_topic_score_codex":0.00016629933,"about_ca_topic_score_gemma":0.000022320859,"teacher_disagreement_score":0.8747314,"about_ca_system_score_codex":0.00002978105,"about_ca_system_score_gemma":0.000019325882,"threshold_uncertainty_score":0.32472056},"labels":[],"label_agreement":null},{"id":"W2162098989","doi":"10.1109/iscas.2005.1465343","title":"A Hardware-Based Longest Prefix Matching Scheme for TCAMs","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Content-addressable memory; Lookup table; Computer hardware; Prefix; Content-addressable storage; Scheme (mathematics); Power consumption; Dram; Table (database); Matching (statistics); Speedup; Parallel computing; Throughput; Embedded system; Memory management; Power (physics); Phase-change memory; Operating system; Semiconductor memory","score_opus":0.016532831220525342,"score_gpt":0.25419502512878017,"score_spread":0.23766219390825483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162098989","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.0020058977,0.00008714299,0.990841,0.003162795,0.000119399134,0.0001275199,6.2888586e-7,0.0003733184,0.0032823142],"genre_scores_gemma":[0.18737797,0.0000021492176,0.8092032,0.0013432449,0.00019090214,0.000027829012,0.0000061560813,0.0000094116995,0.0018391287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992303,0.0000132305995,0.0001374592,0.00026637883,0.00012932999,0.00022325419],"domain_scores_gemma":[0.9994808,0.000059615122,0.000054049728,0.0002639713,0.000081026315,0.00006058109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019746239,0.00009414287,0.00008810441,0.000048123766,0.00014818671,0.00025684052,0.00037082506,0.000044416647,0.000015339057],"category_scores_gemma":[0.000016226479,0.000082061284,0.000042601794,0.00018991761,0.000012719715,0.00049224927,0.000044195458,0.000054592198,0.00003498987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038470665,0.0002878717,0.00062697945,0.00014054317,0.00002615415,0.0000026168195,0.0010109772,0.33902523,0.0006240888,0.06285462,0.02206687,0.5732956],"study_design_scores_gemma":[0.00037755194,0.000033671033,0.00004175722,0.000030716288,0.000002704146,0.0000018450212,0.000004821197,0.9811295,0.0026079,0.001120791,0.014508879,0.00013983932],"about_ca_topic_score_codex":0.000003717734,"about_ca_topic_score_gemma":0.000013752458,"teacher_disagreement_score":0.64210427,"about_ca_system_score_codex":0.000028366398,"about_ca_system_score_gemma":0.00006616404,"threshold_uncertainty_score":0.33463618},"labels":[],"label_agreement":null},{"id":"W2162357283","doi":"10.1109/socc.2006.283892","title":"Low-Power Priority Encoder and Multiple Match Detection Circuit for Ternary Content Addressable Memory","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 Waterloo","funders":"","keywords":"Encoder; Content-addressable memory; Computer science; CMOS; Electronic circuit; Ternary operation; Power (physics); Content-addressable storage; Computer hardware; Electronic engineering; Electrical engineering; Engineering; Artificial intelligence; Artificial neural network","score_opus":0.02105443880539756,"score_gpt":0.21663448057403342,"score_spread":0.19558004176863586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162357283","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.054437544,0.00015073246,0.9419481,0.00011022215,0.00032411792,0.0002440679,0.0000013886377,0.00020466908,0.0025791384],"genre_scores_gemma":[0.96288395,0.000008335343,0.033980828,0.00014936598,0.0000997918,0.00002167688,0.000003846526,0.000009633068,0.0028425693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912834,0.000022114411,0.00017640529,0.0003247408,0.00013093419,0.00021746918],"domain_scores_gemma":[0.99947363,0.00007731498,0.00007202264,0.00020779717,0.00012201916,0.000047232203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019548112,0.0001079795,0.00011449402,0.000045423323,0.0001945206,0.00020447862,0.0001692929,0.000068368376,0.000008054182],"category_scores_gemma":[0.000019549689,0.000095916555,0.000033495333,0.00012608891,0.000029962615,0.00050022407,0.00006203406,0.000061002527,0.000005002426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036067405,0.0020681235,0.04495346,0.0010097646,0.00016621113,0.00004528279,0.0036311157,0.087544985,0.095370285,0.020642718,0.024903169,0.7193042],"study_design_scores_gemma":[0.001202736,0.00010343977,0.0037212253,0.00004172763,0.000008994528,0.000021270707,0.000051318166,0.941983,0.046675567,0.004986419,0.0009196383,0.00028465907],"about_ca_topic_score_codex":0.00011919786,"about_ca_topic_score_gemma":0.00009114486,"teacher_disagreement_score":0.90844643,"about_ca_system_score_codex":0.000030691095,"about_ca_system_score_gemma":0.000024203006,"threshold_uncertainty_score":0.39113635},"labels":[],"label_agreement":null},{"id":"W2163099178","doi":"10.1109/reconfig.2010.61","title":"An Efficient Non-blocking Data Cache for Soft Processors","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Blocking (statistics); Cache; Parallel computing; Stratix; CPU cache; Cache pollution; Embedded system; Cache algorithms; Field-programmable gate array; Computer network","score_opus":0.02499434622569165,"score_gpt":0.302972435304365,"score_spread":0.2779780890786734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163099178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01387205,0.000014151498,0.983967,0.00040338002,0.0004497141,0.00016328413,0.0000023257014,0.00024364876,0.0008844655],"genre_scores_gemma":[0.6295817,5.828609e-7,0.3698475,0.00016861489,0.00016049805,0.000010996907,0.000028006745,0.0000084225585,0.00019370043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998952,0.000009475717,0.0001399404,0.0004921517,0.00015732949,0.00024911427],"domain_scores_gemma":[0.9986458,0.000058044738,0.00006787757,0.001002995,0.00013571035,0.00008961404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170246,0.00009859341,0.00008802793,0.000048696,0.00023880826,0.00036482478,0.0016113551,0.00006258216,0.000006129459],"category_scores_gemma":[0.00006728489,0.00008093034,0.000015351945,0.0002792164,0.000026246826,0.0005542429,0.0001980184,0.00011533495,0.000007283678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026680524,0.00068836985,0.0015430439,0.0001820592,0.000027243632,0.0000040308564,0.0031067762,0.37015802,0.004748031,0.0182371,0.010303902,0.59097475],"study_design_scores_gemma":[0.00017538067,0.000030456811,0.000053298747,0.0000088883135,0.000004496269,0.000003733385,0.000015851727,0.996101,0.0014323819,0.00038446437,0.0016589308,0.00013111767],"about_ca_topic_score_codex":0.000007921458,"about_ca_topic_score_gemma":0.00003895539,"teacher_disagreement_score":0.625943,"about_ca_system_score_codex":0.0000058965325,"about_ca_system_score_gemma":0.00011142087,"threshold_uncertainty_score":0.3518014},"labels":[],"label_agreement":null},{"id":"W2164939341","doi":"10.1145/2463209.2488801","title":"Low-power area-efficient large-scale IP lookup engine based on binary-weighted clustered networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Throughput; CMOS; Content-addressable storage; Power (physics); Simple (philosophy); Content-addressable memory; Computer hardware; Architecture; Memory architecture; Binary number; Dissipation; Parallel computing; Embedded system; Electronic engineering; Operating system; Engineering; Artificial neural network","score_opus":0.005560747858275312,"score_gpt":0.19561414080014652,"score_spread":0.1900533929418712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164939341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010766274,0.00006172878,0.97925055,0.0012793177,0.0006396382,0.0003174459,0.0000012041729,0.0005430132,0.0071408013],"genre_scores_gemma":[0.919001,0.0000061616333,0.07563954,0.0031412337,0.00011122499,0.000046917532,0.000030699164,0.000027656755,0.001995576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801314,0.0000802638,0.00031341892,0.0005981046,0.00036900747,0.0006260818],"domain_scores_gemma":[0.99858475,0.00011156615,0.000112179856,0.0007641931,0.00021280271,0.00021450892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029267385,0.0002700055,0.00022346596,0.0001686708,0.00024605857,0.00038718423,0.00063313555,0.00014945124,0.00050690497],"category_scores_gemma":[0.000014170177,0.0002142497,0.000084223735,0.0008550387,0.000035595465,0.00030019277,0.00015219049,0.0002193954,0.00022705077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012399958,0.0003935042,0.00007024467,0.000009111983,0.000006739883,0.000005486502,0.000148741,0.9721927,0.000016031561,0.00039145883,0.019975891,0.0067776563],"study_design_scores_gemma":[0.0007406737,0.00016125404,0.00031831788,0.00007472686,0.0000049306927,0.000002029116,0.000014173324,0.99695927,0.0003010388,0.00007140229,0.0010563621,0.00029579806],"about_ca_topic_score_codex":0.000010317532,"about_ca_topic_score_gemma":0.00000618087,"teacher_disagreement_score":0.9082347,"about_ca_system_score_codex":0.00006373728,"about_ca_system_score_gemma":0.00006060872,"threshold_uncertainty_score":0.8736849},"labels":[],"label_agreement":null},{"id":"W2165172548","doi":"10.1109/cicc.2003.1249423","title":"Pipelined match-lines and hierarchical search-lines for low-power content-addressable memories","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Content-addressable storage; Power (physics); Line (geometry); Reduction (mathematics); CMOS; Architecture; Process (computing); Ternary operation; Parallel computing; Content-addressable memory; Electronic engineering; Engineering; Artificial intelligence; Operating system; Artificial neural network","score_opus":0.0350303170777592,"score_gpt":0.2680286524852757,"score_spread":0.2329983354075165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165172548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03363255,0.00029492928,0.95817435,0.0059680426,0.00034238407,0.00024652074,0.0000035542053,0.00028107548,0.0010565652],"genre_scores_gemma":[0.5460565,0.00009667669,0.44708472,0.0010518963,0.0003058803,0.000036228594,0.000016401473,0.000022873877,0.0053288196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873275,0.000025712328,0.0002600814,0.00040873303,0.00021503725,0.00035768066],"domain_scores_gemma":[0.99911165,0.00012472871,0.00005133236,0.00027353034,0.00030503646,0.00013370316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030040296,0.0001633244,0.00020676423,0.00007653001,0.0002614995,0.00039097716,0.00034986733,0.000080299884,0.000013789546],"category_scores_gemma":[0.0000953735,0.00012682195,0.000047574944,0.0002718162,0.00013787573,0.00056852103,0.00015251385,0.00010137826,0.000008847485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005876665,0.0009888195,0.0024915023,0.00078802725,0.00016491828,0.00004669093,0.0068524117,0.114533275,0.006065461,0.7697095,0.01573397,0.082037754],"study_design_scores_gemma":[0.007266043,0.0006972789,0.0006954773,0.0004167898,0.000036850663,0.00007967015,0.0005730262,0.8488568,0.056295414,0.07706988,0.0067723007,0.0012404313],"about_ca_topic_score_codex":0.00002165789,"about_ca_topic_score_gemma":0.000025223739,"teacher_disagreement_score":0.73432356,"about_ca_system_score_codex":0.000013962404,"about_ca_system_score_gemma":0.0001103577,"threshold_uncertainty_score":0.5171649},"labels":[],"label_agreement":null},{"id":"W2166422904","doi":"10.1109/noms.2012.6211932","title":"Firewall anomaly detection with a model checker for visibility logic","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Firewall (physics); Computer science; Modal logic; Anomaly detection; Model checking; Temporal logic; Modal; Visibility; Programming language; Algorithm; Theoretical computer science; Data mining; Mathematics; Physics","score_opus":0.02561072321850174,"score_gpt":0.2539770676491669,"score_spread":0.22836634443066514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166422904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033705745,0.000048851904,0.9642858,0.000067114626,0.000073280615,0.00014171534,2.5294855e-7,0.00019292842,0.001484307],"genre_scores_gemma":[0.63041764,0.0000010201011,0.3688896,0.0001816856,0.000042500702,0.000019992878,9.05545e-7,0.0000038451667,0.00044278408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999359,0.000013863867,0.00009492472,0.00020573648,0.000092893926,0.00023359181],"domain_scores_gemma":[0.99955046,0.000013959714,0.00004697909,0.00023561271,0.00008751088,0.00006544786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002726507,0.00008067159,0.000074313124,0.0000270217,0.00011640073,0.00007922789,0.00015608195,0.000044960692,0.0000032165028],"category_scores_gemma":[0.000012799954,0.00005679961,0.00002536653,0.00019240328,0.00001640587,0.0007431379,0.00003338474,0.000040081602,0.0000057941147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052417425,0.0017762656,0.028485708,0.00038882616,0.00012124861,0.0000016232555,0.012582907,0.44669142,0.0024257717,0.12567224,0.0030317018,0.3782981],"study_design_scores_gemma":[0.00018633125,0.00006925764,0.0005411988,0.000004220521,0.0000048722063,0.00000369623,0.0000049442497,0.9948801,0.0020955673,0.0020186591,0.00009186517,0.000099334844],"about_ca_topic_score_codex":0.0000052812584,"about_ca_topic_score_gemma":0.000018017763,"teacher_disagreement_score":0.59671193,"about_ca_system_score_codex":0.000029764959,"about_ca_system_score_gemma":0.00002896915,"threshold_uncertainty_score":0.2316221},"labels":[],"label_agreement":null},{"id":"W2168238105","doi":"10.1109/waina.2008.43","title":"Wireless Service Attributes Classification and Matching Mechanism Based on Decision Tree","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"St. Francis Xavier University","funders":"","keywords":"Decision tree; Computer science; Matching (statistics); Tree (set theory); Wireless; Node (physics); Service (business); Data mining; Wireless network; Incremental decision tree; Decision tree learning; Binary decision diagram; Decision tree model; Computer network; Decision rule; Artificial intelligence; Theoretical computer science; Mathematics; Statistics; Telecommunications; Engineering","score_opus":0.031963542295263395,"score_gpt":0.23937870515527568,"score_spread":0.20741516286001227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168238105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08902705,0.000014689384,0.9078998,0.0015903346,0.000097849384,0.000062249055,3.5278208e-7,0.00020236663,0.0011052914],"genre_scores_gemma":[0.82156664,0.000024330131,0.17712893,0.0011467091,0.000028148186,0.0000050491985,0.0000055298224,0.0000064786245,0.00008820584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999132,0.00003599016,0.00014150818,0.0003146918,0.00023194289,0.00014390363],"domain_scores_gemma":[0.9993245,0.0001657414,0.0000646359,0.00028202054,0.000099233854,0.00006386183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018794973,0.00010190025,0.000094910465,0.000081630154,0.0003037214,0.00012144467,0.00025542293,0.000059979313,0.000004786083],"category_scores_gemma":[0.000011502221,0.00008589033,0.000016016696,0.00040983708,0.000012357542,0.00035972657,0.000052716343,0.000072726005,0.000019608766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010754559,0.00039256722,0.0024860047,0.00008573444,0.000015837906,0.000032364307,0.002088412,0.0834302,0.0041414425,0.26655236,0.0027803853,0.6378871],"study_design_scores_gemma":[0.00030074827,0.000035975925,0.0032542762,0.000045945555,0.000001957489,0.000009666616,0.000014166346,0.986825,0.0014064363,0.007948647,0.000044677206,0.00011249557],"about_ca_topic_score_codex":0.0000107432015,"about_ca_topic_score_gemma":0.000016574155,"teacher_disagreement_score":0.9033948,"about_ca_system_score_codex":0.000022904112,"about_ca_system_score_gemma":0.000046779143,"threshold_uncertainty_score":0.3502506},"labels":[],"label_agreement":null},{"id":"W2168779419","doi":"10.1109/iscc.2003.1214105","title":"Packet classification using independent sets","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Computer science; Network packet; Table (database); Statistical classification; Speedup; Algorithm; Pattern recognition (psychology); Data mining; Artificial intelligence; Theoretical computer science; Parallel computing","score_opus":0.04411114856995365,"score_gpt":0.2842868704694376,"score_spread":0.24017572189948397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168779419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025686122,0.000031154934,0.96786916,0.0005867333,0.0001849913,0.000049515893,1.3259539e-7,0.00020069267,0.0053915163],"genre_scores_gemma":[0.7532155,0.0000059002773,0.24643764,0.00021437302,0.00003095368,0.0000015716682,0.0000021454816,0.000004010961,0.0000879339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932486,0.000019627034,0.00011839585,0.0002175213,0.00017387183,0.00014575516],"domain_scores_gemma":[0.9995727,0.000008225982,0.00005750933,0.00024764758,0.00006299032,0.000050952985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015601364,0.000067536406,0.00005632452,0.00005488484,0.000120246375,0.00018169358,0.00025860377,0.00004682989,0.0000074576033],"category_scores_gemma":[0.000008604271,0.000060120055,0.000019174124,0.00032442546,0.000014931391,0.0005124703,0.000054418906,0.000059762544,0.00003735992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008417454,0.00027123978,0.0021907864,0.000030477355,0.000024237837,0.00001817579,0.0020335068,0.35338557,0.0042457576,0.4420445,0.00077258726,0.19497474],"study_design_scores_gemma":[0.00043690592,0.000025647149,0.0026995956,0.000030963587,0.000004602767,0.0000314429,0.00004377206,0.96311224,0.0030545115,0.030115185,0.0002428612,0.00020226242],"about_ca_topic_score_codex":0.00001392989,"about_ca_topic_score_gemma":0.0000063439256,"teacher_disagreement_score":0.72752935,"about_ca_system_score_codex":0.00007580215,"about_ca_system_score_gemma":0.00009365014,"threshold_uncertainty_score":0.24516247},"labels":[],"label_agreement":null},{"id":"W2168916553","doi":"10.1109/4.913745","title":"A 1-V 128-kb four-way set-associative CMOS cache memory using wordline-oriented tag-compare (WLOTC) structure with the content-addressable-memory (CAM) 10-transistor tag cell","year":2001,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":43,"is_retracted":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":"Taiwan Semiconductor Manufacturing Company","keywords":"Content-addressable memory; CMOS; Cache; Computer science; Transistor; Very-large-scale integration; Computer hardware; Content-addressable storage; Memory cell; Set (abstract data type); Embedded system; Voltage; Parallel computing; Electronic engineering; Electrical engineering; Engineering; Artificial intelligence","score_opus":0.05058230669773604,"score_gpt":0.25855757670073326,"score_spread":0.2079752700029972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168916553","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.61805147,0.001111227,0.37756082,0.00069759914,0.0013671217,0.00042401766,0.00006271764,0.000102723214,0.0006223327],"genre_scores_gemma":[0.9924583,0.00013256485,0.0037969865,0.00069606403,0.0007049985,0.0000054035845,0.000008517342,0.00007099623,0.0021261554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959516,0.00045325825,0.0009711677,0.00054980046,0.0011956436,0.00087854546],"domain_scores_gemma":[0.99509853,0.00027878597,0.0018938717,0.00053990324,0.0018304308,0.00035849167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000928569,0.00053787185,0.00079782365,0.0002822712,0.00073160615,0.0003926174,0.001265746,0.0001582148,0.000049002818],"category_scores_gemma":[0.00006309601,0.00037758632,0.00022039757,0.0012815939,0.00022293255,0.0013779596,0.00006484115,0.0009733764,0.0000075752623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005530706,0.0004779677,0.0028621787,0.0002470299,0.0008260789,0.0011393136,0.033091556,0.89899665,0.028540712,0.00003144161,0.013000067,0.02023395],"study_design_scores_gemma":[0.033459112,0.00297224,0.00843575,0.004742276,0.0020897498,0.0074805724,0.018956829,0.7896094,0.11111782,0.0015815987,0.013341976,0.0062127183],"about_ca_topic_score_codex":0.00004418531,"about_ca_topic_score_gemma":0.00017774565,"teacher_disagreement_score":0.37440687,"about_ca_system_score_codex":0.0003964358,"about_ca_system_score_gemma":0.0006460718,"threshold_uncertainty_score":0.9998676},"labels":[],"label_agreement":null},{"id":"W2170582543","doi":"10.1109/iwsoc.2005.104","title":"Systolic array-based string matching unit for spam blocking","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Field-programmable gate array; Correctness; Computer science; Blocking (statistics); Systolic array; String searching algorithm; String (physics); Matching (statistics); Vertex (graph theory); Parallel computing; Computer hardware; Scheme (mathematics); Pattern matching; Embedded system; Algorithm; Theoretical computer science; Graph; Computer network; Mathematics; Artificial intelligence; Very-large-scale integration","score_opus":0.022448757770628585,"score_gpt":0.2623600622558101,"score_spread":0.23991130448518153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170582543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071895425,0.000069701266,0.9891482,0.00086305715,0.00013289877,0.00010883791,3.1048666e-7,0.00037284027,0.0021146329],"genre_scores_gemma":[0.56460506,0.0000010826666,0.4345555,0.0003576308,0.00015202872,0.0000083171235,0.0000020381306,0.000007183065,0.0003111618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999213,0.000017636818,0.0001579533,0.00023439158,0.00012809402,0.00024895451],"domain_scores_gemma":[0.9994882,0.00008706288,0.00007084003,0.00022908767,0.00006881654,0.000056015942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023799259,0.000096832955,0.000098176475,0.000085108615,0.0002310628,0.0002738319,0.00035291744,0.00003930133,0.0000061331048],"category_scores_gemma":[0.000013057041,0.000090053196,0.00003876302,0.00027435712,0.000009140983,0.00037326748,0.000029974923,0.00006523034,0.000011825076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050010017,0.000037861053,0.00024871225,0.000060049533,0.000008394514,8.319135e-7,0.00038378994,0.8701724,0.00048682216,0.031544223,0.0003248344,0.09672708],"study_design_scores_gemma":[0.00030484213,0.000017470127,0.000018768846,0.00007812589,0.0000046792443,0.0000033256595,0.000018551838,0.9874571,0.006530308,0.001400759,0.0040187677,0.00014728148],"about_ca_topic_score_codex":0.000007823481,"about_ca_topic_score_gemma":0.0000130197095,"teacher_disagreement_score":0.5574155,"about_ca_system_score_codex":0.000031292653,"about_ca_system_score_gemma":0.00006437452,"threshold_uncertainty_score":0.36722627},"labels":[],"label_agreement":null},{"id":"W2170945258","doi":"10.1109/lcn.2008.4664205","title":"Distributed and scalable control plane for next generation routers: A case study of OSPF","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scalability; Router; Computer network; Forwarding plane; Distributed computing; Core router; Open Shortest Path First; Exploit; Routing protocol; Routing (electronic design automation); Operating system; Link-state routing protocol; Computer security; Network packet","score_opus":0.04987158543193299,"score_gpt":0.2504955276534211,"score_spread":0.2006239422214881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170945258","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.4080209,0.000039473296,0.59162813,0.000048782917,0.000039280018,0.00017555364,0.0000026994003,0.000030823438,0.000014351988],"genre_scores_gemma":[0.9694513,0.0000062984504,0.030335478,0.00005542251,0.00004445105,0.000019780877,0.0000122667025,0.0000031085594,0.00007189891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994627,0.000026905484,0.00015060825,0.00017976563,0.00007818771,0.00010182228],"domain_scores_gemma":[0.9996101,0.000052712345,0.000060651717,0.0001406101,0.000097792945,0.00003808823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011003637,0.00006287631,0.00011200453,0.00002929041,0.00017181858,0.000076841745,0.00008091492,0.000025855377,0.0000013508295],"category_scores_gemma":[0.000013958977,0.000052669267,0.000011284048,0.00014236815,0.0000174772,0.00037248037,0.000021733043,0.00002267661,3.3877788e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000590047,0.007850816,0.08870947,0.00040909275,0.00067337445,0.002856152,0.05195846,0.5432813,0.008377136,0.009267907,0.05721325,0.22881298],"study_design_scores_gemma":[0.0016315271,0.00033650539,0.00009704465,0.000003829613,0.000010235635,0.0003884428,0.00020916578,0.9968903,0.00029801318,0.000028726929,0.000035743047,0.00007046043],"about_ca_topic_score_codex":0.000105793886,"about_ca_topic_score_gemma":0.00006779181,"teacher_disagreement_score":0.5614304,"about_ca_system_score_codex":0.000008328563,"about_ca_system_score_gemma":0.000022599108,"threshold_uncertainty_score":0.21477905},"labels":[],"label_agreement":null},{"id":"W2185362417","doi":"","title":"Low-Power High-Performance Ternary Content Addressable Memory Circuits","year":2006,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Content-addressable memory; Ternary operation; Content (measure theory); Power (physics); Computer science; Artificial intelligence; Mathematics; Programming language; Artificial neural network","score_opus":0.011057069940479525,"score_gpt":0.18130032617125397,"score_spread":0.17024325623077444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185362417","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900132,0.00024100252,0.004346061,0.00019935683,0.0010962836,0.00022121363,0.000010498502,0.00021544285,0.003656981],"genre_scores_gemma":[0.40384418,0.00014571197,0.005578687,0.000031847394,0.00006431012,8.045554e-7,0.00041116428,0.000028991391,0.5898943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983889,0.00005141412,0.00018577358,0.0005592789,0.00044023164,0.0003743874],"domain_scores_gemma":[0.9985711,0.000023145456,0.00042619187,0.0005502295,0.00033683382,0.000092521026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014753442,0.000292471,0.0004092443,0.0002673408,0.00031187618,0.000089145164,0.0011015077,0.00030282635,0.00006013109],"category_scores_gemma":[0.0000044711237,0.00033746668,0.00011012804,0.000360743,0.000071432674,0.0009106182,0.00011590444,0.00027294288,0.00007202189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092853693,0.0027221886,0.005544263,0.008214448,0.0012461634,0.0011053137,0.33734694,0.13703479,0.023815293,0.0037296356,0.13820776,0.34010467],"study_design_scores_gemma":[0.017789561,0.0033754278,0.14628722,0.016576743,0.0013185868,0.000106637475,0.11632796,0.40213683,0.27867943,0.0019136664,0.0039780713,0.011509862],"about_ca_topic_score_codex":0.0057656635,"about_ca_topic_score_gemma":0.0025188704,"teacher_disagreement_score":0.5862373,"about_ca_system_score_codex":0.000091725014,"about_ca_system_score_gemma":0.00014048726,"threshold_uncertainty_score":0.99990773},"labels":[],"label_agreement":null},{"id":"W2269673821","doi":"10.22215/etd/2005-06460","title":"Efficient table lookup algorithms for the next generation IP networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Table (database); Lookup table; Arithmetic; Algorithm; Humanities; Mathematics; Art; Data mining; Operating system","score_opus":0.03863602292370792,"score_gpt":0.275537446784861,"score_spread":0.23690142386115304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269673821","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.00014046117,0.0039984034,0.9877305,0.00028333082,0.0031352001,0.0005823529,0.0000015247833,0.00020441906,0.003923826],"genre_scores_gemma":[0.064253084,0.0016912785,0.7284466,0.0022731505,0.013413571,0.0011548861,0.0033416913,0.0001962657,0.18522948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837977,0.00003511358,0.00034538461,0.00055190496,0.0003047237,0.00038313487],"domain_scores_gemma":[0.9986761,0.00014568302,0.00025922997,0.0005122624,0.00034444846,0.00006225582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004289821,0.00027188574,0.00020717077,0.00007964967,0.00065748877,0.0009942616,0.0007590827,0.0002701995,0.000029269106],"category_scores_gemma":[0.000026106467,0.00019212232,0.00010309421,0.00048412828,0.000016247584,0.00021493295,0.000038100192,0.00021704068,0.000015227644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005346281,0.000027203838,3.9160705e-7,0.000013971166,0.000016718404,2.5086322e-7,0.00019011521,0.7508496,0.000011492991,0.0033415728,0.0121327285,0.23341058],"study_design_scores_gemma":[0.0001907283,0.000032956512,0.000010150234,0.000040607156,0.000040062445,0.0000022079214,0.00007247435,0.9922781,0.00021356874,0.000072348936,0.006791214,0.0002556082],"about_ca_topic_score_codex":0.000014702121,"about_ca_topic_score_gemma":0.00014210209,"teacher_disagreement_score":0.25928387,"about_ca_system_score_codex":0.000065258886,"about_ca_system_score_gemma":0.00017919358,"threshold_uncertainty_score":0.9587688},"labels":[],"label_agreement":null},{"id":"W2300744953","doi":"10.1145/2881025.2889473","title":"Node configuration for the Aho-Corasick algorithm in Intrusion Detection Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Intrusion detection system; Node (physics); Trie; Algorithm; Metric (unit); Set (abstract data type); Real-time computing; Data mining; Operating system; Data structure","score_opus":0.01231146707957387,"score_gpt":0.23097225958974973,"score_spread":0.21866079251017587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300744953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042396292,0.00009161919,0.9969302,0.0010858427,0.0007199735,0.00026352794,4.925502e-7,0.00011098892,0.0003734249],"genre_scores_gemma":[0.96345043,0.00005351593,0.035019577,0.00013986138,0.00021385623,0.00010037739,0.0000015154325,0.00000776809,0.0010130993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935794,0.000039608694,0.00016253618,0.00019166752,0.000110142726,0.00013812343],"domain_scores_gemma":[0.99940324,0.00020785657,0.00007181644,0.00019792645,0.00009847132,0.000020694813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035930166,0.00006790404,0.00006752158,0.00005416219,0.00014001757,0.00015816659,0.00021145304,0.000048562688,0.0000032090645],"category_scores_gemma":[0.000035757494,0.000034405017,0.000018863768,0.0002399637,0.000017098606,0.00043544982,0.000026730875,0.000032916385,0.000016761463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007247875,0.000011986663,0.000028465547,0.0000072773414,0.000002815182,2.6201226e-7,0.00011807965,0.0039933375,0.0015894201,0.004638828,0.00033687724,0.9892654],"study_design_scores_gemma":[0.00036273006,0.000034826357,0.00017205844,0.000042726,0.000002282804,0.0000038283056,0.00002428996,0.9910491,0.0056511913,0.0008713317,0.0017115626,0.000074060015],"about_ca_topic_score_codex":0.00004188653,"about_ca_topic_score_gemma":0.00003436358,"teacher_disagreement_score":0.98919135,"about_ca_system_score_codex":0.000051961662,"about_ca_system_score_gemma":0.000025979003,"threshold_uncertainty_score":0.1525204},"labels":[],"label_agreement":null},{"id":"W2350162228","doi":"","title":"Application of Firewall Technology in Digital Library","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Firewall (physics); Intranet; Context-based access control; Application firewall; Computer science; Network packet; Computer security; The Internet; Hacker; Computer network; Stateful firewall; Operating system; Telecommunications","score_opus":0.0030116975877603138,"score_gpt":0.2074381573484174,"score_spread":0.20442645976065707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350162228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004443684,0.00018009187,0.9932645,0.00060425006,0.000008202253,0.00030627495,0.0000032218602,0.00027192006,0.0009178346],"genre_scores_gemma":[0.5620362,0.000008726769,0.43765897,0.0000945854,0.000045032062,0.00006837032,0.000028760853,0.0000089993055,0.000050371124],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908686,0.0000042181855,0.0003234331,0.00031027308,0.00007996088,0.00019526528],"domain_scores_gemma":[0.99936116,0.000050049406,0.0001249635,0.0003712644,0.00005299872,0.000039577717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010472001,0.00009355682,0.00011669089,0.00034692156,0.000051269035,0.00007875049,0.0007179224,0.00009070259,0.0000012051614],"category_scores_gemma":[5.451291e-7,0.00009987799,0.000027681064,0.0017303551,0.00005370445,0.00050019566,0.0002107626,0.0000996194,0.000032862677],"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.0000023343734,0.00015721866,0.011131821,0.000018839224,0.0000039044758,8.508649e-7,0.00018716701,0.0004038965,0.0009605099,0.039869823,0.00028430918,0.94697934],"study_design_scores_gemma":[0.0011287722,0.00009049581,0.01259362,0.00009625186,0.000009117733,0.000066853085,0.00005076359,0.26482567,0.04460439,0.20082545,0.4749141,0.0007944962],"about_ca_topic_score_codex":0.0000016114967,"about_ca_topic_score_gemma":0.0000013104258,"teacher_disagreement_score":0.9461848,"about_ca_system_score_codex":0.00001960332,"about_ca_system_score_gemma":0.000035611945,"threshold_uncertainty_score":0.4072906},"labels":[],"label_agreement":null},{"id":"W2366420902","doi":"","title":"High Speed IP Lookup Algorithm with Scalability and Parallelism Based on ASIC Implementation","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"CAE (Canada)","funders":"","keywords":"Computer science; Scalability; Application-specific integrated circuit; Parallel computing; Prefix; Hash function; Scheme (mathematics); Lookup table; Computer hardware; Operating system","score_opus":0.006602054701736253,"score_gpt":0.23983985959666104,"score_spread":0.2332378048949248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366420902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025976084,0.00001607367,0.970198,0.0027139615,0.00005146616,0.00014029442,9.435924e-7,0.00015669412,0.00074652646],"genre_scores_gemma":[0.5011382,0.0000035365392,0.49781692,0.0008144603,0.000067289446,0.000003959792,0.00000955387,0.0000047300186,0.00014134996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991102,0.000043148037,0.00013851172,0.00032617874,0.00020843741,0.00017349061],"domain_scores_gemma":[0.99952435,0.000042668158,0.000057063982,0.00024169002,0.0000660607,0.000068175716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021737146,0.00010726463,0.00009415151,0.000050575247,0.00011768714,0.0001798459,0.00014106723,0.000031317362,0.00004720334],"category_scores_gemma":[0.0000034394502,0.00008062537,0.000012951543,0.00022377171,0.000033785145,0.00040097613,0.000028119714,0.000060264716,0.000011048601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001358831,0.00007311122,0.0010319371,0.000007322943,0.0000051795123,0.0000014828216,0.00013193829,0.04338067,0.0000085135125,0.0025222474,0.0006670838,0.9521569],"study_design_scores_gemma":[0.00090398826,0.00016735111,0.0060254643,0.000012258088,0.000005474521,0.0000024823817,0.000015581525,0.99062824,0.0011178857,0.00064640987,0.0003361975,0.0001386906],"about_ca_topic_score_codex":0.000035884594,"about_ca_topic_score_gemma":0.000039935814,"teacher_disagreement_score":0.95201826,"about_ca_system_score_codex":0.00003620489,"about_ca_system_score_gemma":0.0000466481,"threshold_uncertainty_score":0.3287807},"labels":[],"label_agreement":null},{"id":"W2371180955","doi":"","title":"Algorithm for Maximal Matching of Strings","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"CAE (Canada)","funders":"","keywords":"String searching algorithm; Computer science; String metric; Matching (statistics); Similarity (geometry); Approximate string matching; Pattern matching; Algorithm; String (physics); Commentz-Walter algorithm; Blossom algorithm; Pattern recognition (psychology); Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Image (mathematics)","score_opus":0.012168898790851878,"score_gpt":0.2375573386368082,"score_spread":0.22538843984595633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371180955","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.00071665616,0.000029573452,0.99487454,0.000041054915,0.00010211558,0.000048819144,3.1487534e-7,0.000054606633,0.0041323127],"genre_scores_gemma":[0.052264653,0.000002866399,0.9470378,0.00005791139,0.000013949131,0.0000033323774,6.0408087e-7,0.00000316327,0.0006156786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996122,0.000009447414,0.00009493052,0.000112910864,0.00006824535,0.00010226855],"domain_scores_gemma":[0.9997438,0.000031300406,0.00004310144,0.00010581316,0.000054726625,0.000021265922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001640314,0.0000406659,0.00005974861,0.000027741902,0.00004597337,0.00004052876,0.00014472003,0.00001985467,0.000005133576],"category_scores_gemma":[0.00000925405,0.000035781868,0.000022384995,0.00013913072,0.0000079696165,0.00019594579,0.000017015822,0.000021322752,0.0000013775696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000116658,0.000039437382,0.00006615165,0.00002221068,0.000007421364,4.836574e-7,0.00031379948,0.0042292764,0.00017125164,0.22263189,0.00035578638,0.7721611],"study_design_scores_gemma":[0.00040466784,0.000065033506,0.000028340477,0.00002143048,0.0000040217233,0.0000074555824,0.000040972478,0.9129784,0.02789276,0.056283798,0.0021353525,0.00013777468],"about_ca_topic_score_codex":0.000003104815,"about_ca_topic_score_gemma":3.300054e-7,"teacher_disagreement_score":0.9087491,"about_ca_system_score_codex":0.0000056065046,"about_ca_system_score_gemma":0.00002615045,"threshold_uncertainty_score":0.14591423},"labels":[],"label_agreement":null},{"id":"W2383773734","doi":"10.1109/rsp.2008.11","title":"Flexible Software-Hardware Network Intrusion Detection System","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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 New Brunswick","funders":"CMC Microsystems","keywords":"Field-programmable gate array; Computer science; Software; Embedded system; Scalability; Network packet; Computer hardware; String searching algorithm; Intrusion detection system; Packet processing; Process (computing); Real-time computing; Pattern matching; Operating system; Computer network","score_opus":0.013620257128372159,"score_gpt":0.20633274987686745,"score_spread":0.19271249274849528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383773734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017025868,0.00018592011,0.9901602,0.000054930537,0.0008972973,0.00008899719,1.3455907e-7,0.0017975823,0.0051123463],"genre_scores_gemma":[0.6834941,0.000039026083,0.31385097,0.00018257079,0.00045413576,0.000013185857,0.0000033306908,0.000013186193,0.0019495097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893266,0.00005178884,0.00019214749,0.00031909306,0.00022457224,0.0002797284],"domain_scores_gemma":[0.9993324,0.000039144154,0.000082998566,0.0003478644,0.00011646954,0.0000811034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018918277,0.00011875572,0.00012654085,0.000061181825,0.0005967881,0.00010560308,0.0003407295,0.00007963267,0.00001010156],"category_scores_gemma":[0.000018199036,0.0001037894,0.000042340285,0.00073134806,0.000024059189,0.00051900133,0.00013255201,0.00010024909,0.00011001256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004047061,0.00008227544,0.0036821393,0.00015337887,0.000032711,0.00007142671,0.00086530106,0.47396368,0.00018828997,0.01381727,0.024344914,0.48275816],"study_design_scores_gemma":[0.00044075437,0.00012696603,0.0009937529,0.00014937637,0.000008732691,0.00037720913,0.000031815274,0.9803439,0.007722987,0.0010375818,0.008324243,0.0004426938],"about_ca_topic_score_codex":0.000014909122,"about_ca_topic_score_gemma":0.000005696408,"teacher_disagreement_score":0.6817915,"about_ca_system_score_codex":0.00007397793,"about_ca_system_score_gemma":0.000052909458,"threshold_uncertainty_score":0.45900717},"labels":[],"label_agreement":null},{"id":"W2385203392","doi":"","title":"Comparison and Analysis of Multiple Methods for Packet Filtering in Windows","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Network packet; Computer network; Real-time computing","score_opus":0.02770503072701775,"score_gpt":0.3743176412726071,"score_spread":0.34661261054558934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2385203392","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.0057304054,0.00023231204,0.9934856,0.000059443737,0.0000110101055,0.00036789174,0.0000036865447,0.000050123934,0.000059474267],"genre_scores_gemma":[0.14853491,0.0000063333155,0.85126823,0.000055717686,0.000021434715,0.000073722156,0.000025208574,0.000005074714,0.000009394611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907154,0.00002960945,0.00036341336,0.00030591185,0.00004876701,0.00018078594],"domain_scores_gemma":[0.9990751,0.0004154846,0.00014091963,0.00024284357,0.00007931326,0.000046330315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000639524,0.00009040604,0.00025483224,0.0003821467,0.00007739025,0.000059603055,0.00029867637,0.00004931837,6.7487196e-7],"category_scores_gemma":[0.0000022467148,0.00009485493,0.000056582325,0.0013857628,0.000030597326,0.0001261882,0.00010932192,0.00005718765,4.1790256e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000636278,0.00010705822,0.030216144,0.00003580597,0.000075737575,1.07364e-7,0.0010419074,0.013948048,0.005671345,0.0020783423,0.000060459428,0.9467587],"study_design_scores_gemma":[0.0002854172,0.000015700538,0.029079556,0.000010998522,0.00004903251,0.000001054011,0.000017334109,0.94872636,0.009408779,0.00062492216,0.011663577,0.00011726549],"about_ca_topic_score_codex":0.000010737439,"about_ca_topic_score_gemma":0.00004151083,"teacher_disagreement_score":0.94664145,"about_ca_system_score_codex":0.000020642497,"about_ca_system_score_gemma":0.000013221306,"threshold_uncertainty_score":0.38680717},"labels":[],"label_agreement":null},{"id":"W2387915363","doi":"","title":"Security Probing System Based on Firewall Penetrating Technique Firewalking","year":2003,"lang":"en","type":"article","venue":"Jisuanji yingyong yanjiu","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Firewall (physics); Computer science; Application firewall; Internet Control Message Protocol; Stateful firewall; Context-based access control; Internet security; Network security; Computer network; Computer security; Operating system; Network packet; Information security; Physics; Astrophysics; Security service","score_opus":0.010538015922385565,"score_gpt":0.22873004064650437,"score_spread":0.2181920247241188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2387915363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0258575,0.00017801294,0.9318459,0.00019129967,0.00078824937,0.0007895669,0.0000014784993,0.0018983546,0.03844962],"genre_scores_gemma":[0.94058913,0.0000025154936,0.05873044,0.00029925053,0.00010845596,0.00009796257,0.000005734173,0.000040301104,0.00012621838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973135,0.00029995866,0.00047377826,0.00078416715,0.00051675865,0.0006118597],"domain_scores_gemma":[0.99838316,0.00022365789,0.0003137549,0.0007723952,0.00015404118,0.00015301586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013922278,0.0003392788,0.00029929823,0.00022757078,0.0006696111,0.00059118785,0.0006811843,0.0002021356,0.000011813027],"category_scores_gemma":[0.00019178295,0.00033294945,0.00011566229,0.000971547,0.000039155395,0.0005508394,0.00008245643,0.00041166047,0.00003128803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018741986,0.0026765768,0.039264284,0.007617638,0.0002707455,0.0010840258,0.033724666,0.41308692,0.019716784,0.39019462,0.009123803,0.08305249],"study_design_scores_gemma":[0.00042483688,0.00013182499,0.00011463399,0.0011358666,0.000013461071,0.000048971306,0.00009715846,0.9829337,0.012755002,0.0008736536,0.0009059218,0.00056495634],"about_ca_topic_score_codex":0.000018354072,"about_ca_topic_score_gemma":0.0000067192545,"teacher_disagreement_score":0.9147316,"about_ca_system_score_codex":0.00025757647,"about_ca_system_score_gemma":0.00021317859,"threshold_uncertainty_score":0.99991226},"labels":[],"label_agreement":null},{"id":"W2387957139","doi":"","title":"On Architecture of Multi-core Packet Processing System","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Packet processing; Architecture; Network processor; Network packet; Cache; Many core; Embedded system; Multi-core processor; Computer architecture; Processing delay; Computer network; Parallel computing; Transmission delay","score_opus":0.01056854894239253,"score_gpt":0.2448058946253723,"score_spread":0.23423734568297977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2387957139","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.004866372,0.000055928685,0.9935138,0.00017385335,0.00005035783,0.0003665709,0.00000435596,0.00034583535,0.0006229262],"genre_scores_gemma":[0.35262036,9.3828015e-7,0.6469774,0.00011502079,0.00011071208,0.00009795647,0.000010677813,0.0000124966955,0.0000543736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892735,0.000017963046,0.00026973448,0.00042318006,0.00015077261,0.00021097438],"domain_scores_gemma":[0.998976,0.00005400735,0.00019245682,0.0005311805,0.00016722066,0.00007912409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013896228,0.00015792015,0.00016458702,0.00013729768,0.00021956392,0.00013005204,0.000740814,0.00009653132,0.0000018591414],"category_scores_gemma":[0.0000010291195,0.00014131397,0.00005617298,0.00057455816,0.00006284963,0.00013117815,0.00012296923,0.00027468413,0.000028513983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041626286,0.00025063884,0.00011918187,0.00021925314,0.000011928793,0.000001232265,0.0007838251,0.007381314,0.016739976,0.059123248,0.0006486629,0.9147166],"study_design_scores_gemma":[0.0010752318,0.00008759637,0.0008669273,0.00030973082,0.000025316209,0.00014404612,0.000036296915,0.9217084,0.020932917,0.0061424193,0.04798037,0.000690756],"about_ca_topic_score_codex":0.0000027664532,"about_ca_topic_score_gemma":0.0000048678057,"teacher_disagreement_score":0.9143271,"about_ca_system_score_codex":0.000018354858,"about_ca_system_score_gemma":0.000070231894,"threshold_uncertainty_score":0.57626164},"labels":[],"label_agreement":null},{"id":"W2388273729","doi":"","title":"Research on Shortest Path Parallel Computing Method in Dynamic Routing Optimization","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Shortest path problem; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Equal-cost multi-path routing; Routing (electronic design automation); Path (computing); Path vector protocol; Mathematical optimization; Link-state routing protocol; Distributed computing; Routing protocol; Computer network; Theoretical computer science; Mathematics","score_opus":0.022506640806534806,"score_gpt":0.3586867498326547,"score_spread":0.3361801090261199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388273729","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.0014710835,0.000027978778,0.995599,0.00074003363,0.000064201864,0.0005962716,0.000001715125,0.00028726234,0.0012124942],"genre_scores_gemma":[0.2101595,0.000008390906,0.789256,0.00021048714,0.00013750259,0.000117594536,0.00003789233,0.000020947191,0.000051724455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771947,0.00019594662,0.0004278034,0.00081365486,0.0003111925,0.00053195946],"domain_scores_gemma":[0.99841243,0.00043089635,0.00012984697,0.00066180556,0.00025595055,0.00010906369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015595274,0.00019526503,0.00019499622,0.0004333743,0.00054161495,0.00046542377,0.0011206294,0.00015382047,0.000005335282],"category_scores_gemma":[0.0000047583258,0.00020495421,0.00004842624,0.001958284,0.000060178903,0.0003036164,0.00033120916,0.00086790696,0.000051363913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021288176,0.00015633991,0.0002222206,0.0000071558334,0.0000040765594,0.0000019356246,0.00037674012,0.76971275,0.00058231223,0.020486144,0.00019557563,0.20825265],"study_design_scores_gemma":[0.0002623329,0.000025684501,0.0009502003,0.00004349128,0.000002142143,0.000016737764,0.000026290094,0.99389184,0.00015205893,0.0014605388,0.0029565792,0.00021213306],"about_ca_topic_score_codex":0.000024524548,"about_ca_topic_score_gemma":0.00003569104,"teacher_disagreement_score":0.22417909,"about_ca_system_score_codex":0.000089111134,"about_ca_system_score_gemma":0.00010860549,"threshold_uncertainty_score":0.835779},"labels":[],"label_agreement":null},{"id":"W2509031698","doi":"10.20533/jitst.2046.3723.2014.0025","title":"Full Function Firewalls and Fast Routing Query on MANETs","year":2014,"lang":"en","type":"article","venue":"Journal of Internet Technology and Secured Transaction","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Function (biology); Information retrieval; Cell biology; Biology","score_opus":0.00426954867640811,"score_gpt":0.19423457125673618,"score_spread":0.18996502258032807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509031698","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.18724829,0.00017139717,0.8110367,0.0009299913,0.00034593116,0.000027512559,1.01632104e-7,0.000059874877,0.0001802284],"genre_scores_gemma":[0.9951215,0.0001178576,0.0044964068,0.00012283026,0.00006357476,9.367835e-7,4.3522755e-7,0.000005177915,0.000071329865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00004152593,0.00023817491,0.00015552863,0.00009975774,0.00011429834],"domain_scores_gemma":[0.9995506,0.000039424598,0.00021829038,0.00008554321,0.00006802347,0.00003815109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028816762,0.00009544257,0.00014478789,0.00032882192,0.000071953335,0.0000724182,0.00013017759,0.0001741117,0.000002916166],"category_scores_gemma":[0.000018803814,0.00008042574,0.000027781934,0.0001661244,0.00004858734,0.0003461282,0.000010826805,0.0003287995,0.000001257885],"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.00042482355,0.00009037709,0.0006836669,0.000049235987,0.000084843814,0.000013246127,0.0012880114,0.0018833107,0.0021121474,0.024388798,0.0002212961,0.96876025],"study_design_scores_gemma":[0.0026088578,0.0065556387,0.002818638,0.0008376944,0.00010352753,0.0022348228,0.00029354153,0.9389446,0.010261442,0.030604096,0.004279226,0.0004579119],"about_ca_topic_score_codex":0.0000015160188,"about_ca_topic_score_gemma":0.000009748461,"teacher_disagreement_score":0.9683023,"about_ca_system_score_codex":0.000018086657,"about_ca_system_score_gemma":0.000009961996,"threshold_uncertainty_score":0.32796666},"labels":[],"label_agreement":null},{"id":"W2538602044","doi":"10.1109/icm.2010.5696215","title":"A hardware/software co-design architecture for packet classification","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Header; Speedup; Network packet; Network processor; Preprocessor; Software; Processing delay; Packet processing; Parallel computing; Algorithm; Artificial intelligence; Computer network; Transmission delay; Programming language","score_opus":0.03034957808487861,"score_gpt":0.2765447089798274,"score_spread":0.2461951308949488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538602044","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.00027294463,0.00001394432,0.9957307,0.0014925234,0.0003384897,0.0002795929,0.000002448951,0.00050348125,0.0013658744],"genre_scores_gemma":[0.06163977,0.0000031558063,0.9363265,0.00048544948,0.0001768988,0.0000723939,0.000024561536,0.000013444546,0.0012578338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991143,0.00003334433,0.00014542355,0.00033998108,0.00014689851,0.00022009999],"domain_scores_gemma":[0.99907136,0.00019840496,0.00007998426,0.0004273817,0.00014309444,0.00007974809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032527334,0.000114154034,0.00009890625,0.00007153002,0.0002005962,0.0002671584,0.0004889293,0.00010058475,0.000020968499],"category_scores_gemma":[0.00013604335,0.000093891016,0.000044916844,0.00023702123,0.000035522145,0.00027325726,0.000029383105,0.00015969954,0.000026151163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043688226,0.00012954348,0.00054129964,0.000063352934,0.00002210849,0.0000017665178,0.0010020932,0.0064259255,0.005871824,0.06703165,0.10443202,0.8144347],"study_design_scores_gemma":[0.0007326624,0.00016465875,0.000999184,0.000025112808,0.000012486246,0.000026116777,0.000020558959,0.8620642,0.009503109,0.050426222,0.07554521,0.0004805149],"about_ca_topic_score_codex":0.0000016050437,"about_ca_topic_score_gemma":0.000008609928,"teacher_disagreement_score":0.85563827,"about_ca_system_score_codex":0.000010383114,"about_ca_system_score_gemma":0.000090501366,"threshold_uncertainty_score":0.38287646},"labels":[],"label_agreement":null},{"id":"W2566504438","doi":"10.1109/camad.2016.7790325","title":"Efficient algorithm selection for packet classification using machine learning","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Selection (genetic algorithm); Meta learning (computer science); Artificial neural network; Statistical classification; Algorithm; Network packet; Process (computing); Weighted Majority Algorithm; Feature selection; Selection algorithm; Wake-sleep algorithm; Data mining; Generalization error; Engineering","score_opus":0.029013091350473162,"score_gpt":0.26692435462966063,"score_spread":0.23791126327918746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566504438","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.0043902127,0.000034230994,0.9943617,0.00041719593,0.00018644145,0.00011826623,7.287382e-7,0.00026533534,0.00022591924],"genre_scores_gemma":[0.31765318,0.000007533195,0.6811123,0.000048774185,0.00011252903,0.000012062517,0.0000035987507,0.000010103412,0.0010399262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921966,0.000043726865,0.00014263038,0.0002774371,0.00012512789,0.00019139967],"domain_scores_gemma":[0.9995095,0.000079803554,0.000097324715,0.000116946976,0.00015306025,0.000043371772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003038386,0.000083302686,0.00007360933,0.000077244586,0.00026167568,0.00010428762,0.00014688399,0.00004702895,0.000008586232],"category_scores_gemma":[0.00004480215,0.000056217417,0.000031629912,0.00031747343,0.000015894442,0.00016690446,0.000030548552,0.000042353546,0.0000091488555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008371173,0.00005534135,0.001131164,0.000010940728,0.000009764389,1.5296187e-7,0.000120527795,0.06677497,0.008149466,0.008417731,0.00017478835,0.91514677],"study_design_scores_gemma":[0.00027477235,0.000045153774,0.000077592485,0.000020891393,0.0000043512755,0.0000058707606,0.0000049670516,0.994672,0.0033198788,0.00048597457,0.0009864268,0.0001021436],"about_ca_topic_score_codex":0.000009578179,"about_ca_topic_score_gemma":0.0000035990813,"teacher_disagreement_score":0.927897,"about_ca_system_score_codex":0.00007724938,"about_ca_system_score_gemma":0.00004266581,"threshold_uncertainty_score":0.22924797},"labels":[],"label_agreement":null},{"id":"W2569191381","doi":"10.1109/tnano.2017.2649547","title":"Design and Comparative Evaluation of a PCM-Based CAM (Content Addressable Memory) Cell","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Nanotechnology","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transistor; Power–delay product; CMOS; Sense amplifier; Non-volatile memory; Memory cell; Computer science; Electronic engineering; Polarity (international relations); Non-volatile random-access memory; Voltage; Electrical engineering; Content-addressable memory; Phase-change memory; Computer hardware; Semiconductor memory; Engineering; Computer memory; Memory refresh; Materials science; Nanotechnology; Chemistry","score_opus":0.15670599727684448,"score_gpt":0.3052713440647466,"score_spread":0.14856534678790212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569191381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03296745,0.000117624906,0.9654001,0.0005339492,0.00025755365,0.00034051013,0.0000017695677,0.00012343196,0.00025758834],"genre_scores_gemma":[0.9437535,0.000023760804,0.055995837,0.00003325706,0.0000050766657,0.00006796327,4.2921806e-7,0.0000055909427,0.00011458747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894094,0.00013137242,0.0001949293,0.0003214373,0.0002389042,0.00017241592],"domain_scores_gemma":[0.9986754,0.00009333075,0.00024289156,0.0006702468,0.00028323827,0.00003489908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051138265,0.00012532838,0.00020430537,0.00019876589,0.0004607183,0.00007867877,0.00048093437,0.00017015243,0.000010079399],"category_scores_gemma":[0.000011606919,0.00011992895,0.000034243698,0.00016382334,0.00021717613,0.00028601577,0.0000040141385,0.00017147746,0.0000064233136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063525826,0.00027209026,0.0000066363546,0.000025748917,0.00002729719,0.0000014078449,0.00031332832,0.8780305,0.016951567,0.00028046928,0.00007746509,0.10395],"study_design_scores_gemma":[0.0007326361,0.00015144737,0.00001066563,0.000026772012,0.000028563794,0.0000019274876,0.000018486231,0.56235486,0.4362538,0.00033558067,0.000011034414,0.00007421851],"about_ca_topic_score_codex":0.00003329322,"about_ca_topic_score_gemma":0.000025285646,"teacher_disagreement_score":0.91078603,"about_ca_system_score_codex":0.000046761437,"about_ca_system_score_gemma":0.00014785689,"threshold_uncertainty_score":0.48905605},"labels":[],"label_agreement":null},{"id":"W2579670073","doi":"10.1145/3017971.3017975","title":"Dynamic Ordering of Firewall Rules Using a Novel Swapping Window-based Paradigm","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Carleton University","funders":"","keywords":"Firewall (physics); Computer science; Computer network; Internet of Things; Application firewall; The Internet; Computer security; Stateful firewall; Window (computing); Distributed computing; World Wide Web; Traffic engineering","score_opus":0.020527986920646446,"score_gpt":0.24576716287571487,"score_spread":0.22523917595506843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579670073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07994337,0.00006351071,0.9189061,0.00035489904,0.00010449241,0.000052622032,8.196214e-7,0.00013223678,0.00044198355],"genre_scores_gemma":[0.64977866,0.00000420548,0.3500471,0.00006451508,0.0000106538755,0.0000014646344,5.6554853e-7,0.0000066548037,0.000086174485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999164,0.000016359507,0.00020788566,0.0002461142,0.00015281413,0.00021287017],"domain_scores_gemma":[0.99941033,0.00008223349,0.00012354465,0.00028264616,0.000056278142,0.000044957083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015693784,0.000103599275,0.00013240975,0.00009122562,0.000085792286,0.00006255569,0.00034041656,0.0000435033,0.000014925997],"category_scores_gemma":[0.000023562354,0.00007292689,0.000039217048,0.00027779286,0.00004058551,0.0003899876,0.00007165043,0.000033028406,0.0000062184545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006156063,0.00052774744,0.0043836413,0.00038498567,0.00011310186,0.000011420742,0.0021628737,0.37271115,0.28859627,0.037799172,0.000091926806,0.29315618],"study_design_scores_gemma":[0.00041969123,0.000018433184,0.0002367647,0.0002513008,0.000004161803,0.0000041893713,0.0000028076065,0.99472195,0.003028375,0.0010911985,0.00008909618,0.00013202097],"about_ca_topic_score_codex":0.000018624998,"about_ca_topic_score_gemma":0.000008470011,"teacher_disagreement_score":0.6220108,"about_ca_system_score_codex":0.000043754437,"about_ca_system_score_gemma":0.00010725696,"threshold_uncertainty_score":0.2973872},"labels":[],"label_agreement":null},{"id":"W2583746861","doi":"10.1145/3020078.3021770","title":"An FPGA Overlay Architecture for Cost Effective Regular Expression Search (Abstract Only)","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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; Field-programmable gate array; Regular expression; Control reconfiguration; Context (archaeology); Architecture; Filter (signal processing); Nondeterministic algorithm; Parallel computing; Throughput; Expression (computer science); Embedded system; Computer architecture; Algorithm; Operating system; Programming language","score_opus":0.0167046547984927,"score_gpt":0.30669570904428683,"score_spread":0.28999105424579413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583746861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01272559,0.000032113858,0.98185813,0.0005657632,0.00024220045,0.00073534186,0.0000028283937,0.00017914976,0.0036589007],"genre_scores_gemma":[0.8372237,0.0000051104394,0.16160332,0.00012629201,0.00023374328,0.00007713624,0.000011982373,0.000015323736,0.00070337235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882436,0.000052510863,0.00011969614,0.0004679228,0.0002289432,0.00030654846],"domain_scores_gemma":[0.99845755,0.00012695689,0.00011098973,0.0010334278,0.00013907348,0.00013203066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004429954,0.00014017498,0.00013929389,0.00005943801,0.00089855096,0.0009151343,0.0010720677,0.00009816804,0.000009952323],"category_scores_gemma":[0.00006929724,0.00010833805,0.00005560359,0.00006776757,0.00006449379,0.000937473,0.00014275868,0.00015211404,0.0000075476582],"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.00006331666,0.00010770262,0.00047630994,0.000048427057,0.000010234599,0.0000053689123,0.0005581751,0.026192993,0.005510641,0.0025904533,0.002151677,0.9622847],"study_design_scores_gemma":[0.0022028233,0.0006741515,0.029917851,0.00035903268,0.00001568499,0.000027840535,0.00004860714,0.7014029,0.2404724,0.011621946,0.0124679655,0.00078881276],"about_ca_topic_score_codex":0.00001735943,"about_ca_topic_score_gemma":0.00001932377,"teacher_disagreement_score":0.9614959,"about_ca_system_score_codex":0.000029330919,"about_ca_system_score_gemma":0.000074507974,"threshold_uncertainty_score":0.88246614},"labels":[],"label_agreement":null},{"id":"W2584636165","doi":"10.1145/3020078.3021752","title":"Packet Matching on FPGAs Using HMC Memory","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Packet processing; Network packet; Deep packet inspection; USable; Field-programmable gate array; Network processor; Processing delay; Embedded system; Computer network; Real-time computing; Computer hardware; Transmission delay","score_opus":0.0408427872375346,"score_gpt":0.29887604178463156,"score_spread":0.25803325454709697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584636165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048675057,0.000023142715,0.890896,0.00072980544,0.00055330934,0.000045660923,1.7223392e-7,0.00018464116,0.058892194],"genre_scores_gemma":[0.8243691,0.0000055366077,0.17324837,0.00049145427,0.00016520807,0.0000010909141,5.7936774e-7,0.000008336245,0.001710352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926305,0.000023857756,0.00010252775,0.00025155037,0.00016748704,0.00019152132],"domain_scores_gemma":[0.9990276,0.000026395126,0.00011733223,0.00073235604,0.000039474686,0.00005683279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022959369,0.000091328635,0.00008877613,0.000041774572,0.0007907733,0.0008986904,0.0007391513,0.00004075756,0.000014871592],"category_scores_gemma":[0.000027427555,0.00007672094,0.000029284001,0.000055398574,0.00003095961,0.00077439426,0.00018044017,0.00008633996,0.000050219074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024798048,0.00018595128,0.0012554136,0.00006267718,0.00004128392,0.00007692295,0.0027028657,0.2800855,0.0012574046,0.119425446,0.007850773,0.58703095],"study_design_scores_gemma":[0.00025713665,0.000031495478,0.00057076867,0.00009362498,0.0000045122915,0.0000137566285,0.000026348349,0.9807197,0.0030007416,0.0146613205,0.00039181698,0.000228793],"about_ca_topic_score_codex":0.000040642346,"about_ca_topic_score_gemma":0.0000076161364,"teacher_disagreement_score":0.775694,"about_ca_system_score_codex":0.00002381496,"about_ca_system_score_gemma":0.000038306578,"threshold_uncertainty_score":0.8666093},"labels":[],"label_agreement":null},{"id":"W2587091342","doi":"10.1109/icm.2016.7847907","title":"Design exploration of ASIP architectures for the K-Nearest Neighbor machine-learning algorithm","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; k-nearest neighbors algorithm; Machine learning; Algorithm; Context (archaeology); Artificial intelligence; Architecture; Computer architecture","score_opus":0.036737736698772935,"score_gpt":0.25368875600954105,"score_spread":0.2169510193107681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587091342","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.00003979756,0.00015053684,0.99754757,0.0016909298,0.00011381781,0.00017979827,9.443094e-7,0.000103110244,0.00017352769],"genre_scores_gemma":[0.24374907,0.000035101162,0.7551653,0.000102954094,0.00010036449,0.00004065161,0.0000014960962,0.000009573256,0.0007954863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935687,0.000077943005,0.00013559869,0.00016576947,0.00012926431,0.00013453883],"domain_scores_gemma":[0.99891686,0.0006737365,0.00009558354,0.00018965839,0.00009936131,0.00002477532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003651317,0.000074979966,0.00007458645,0.0000415644,0.0001709203,0.00007400368,0.00032978205,0.000028621447,0.0000078419025],"category_scores_gemma":[0.00009639178,0.00003538271,0.00003144219,0.0001727335,0.00003365018,0.00019798698,0.000046068682,0.00004330961,0.0000034277305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111597365,0.000012087644,0.000042684107,0.0000053736107,0.000009045001,1.8003921e-7,0.0004061253,0.072775014,0.00027454714,0.0026060934,0.00025682137,0.92360085],"study_design_scores_gemma":[0.00023278229,0.00010449387,0.000039196428,0.000021512167,0.0000047864005,0.0000015382212,0.000011459669,0.983938,0.007750245,0.00713408,0.0006935781,0.00006833656],"about_ca_topic_score_codex":0.0000066357993,"about_ca_topic_score_gemma":0.0000035230842,"teacher_disagreement_score":0.92353255,"about_ca_system_score_codex":0.000008542824,"about_ca_system_score_gemma":0.00003642042,"threshold_uncertainty_score":0.1442865},"labels":[],"label_agreement":null},{"id":"W2604587950","doi":"10.1016/j.comnet.2017.04.021","title":"Extensions to decision-tree based packet classification algorithms to address new classification paradigms","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision tree; Algorithm; Decision tree learning; Network packet; Statistical classification; Tree (set theory); ID3 algorithm; Artificial intelligence; Machine learning; Incremental decision tree; Data mining; Computer network","score_opus":0.05632261106630987,"score_gpt":0.3100486628883545,"score_spread":0.2537260518220446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604587950","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.000713939,0.00010072891,0.987941,0.0065462426,0.002841249,0.0005508196,0.0000023035695,0.0004140597,0.0008896149],"genre_scores_gemma":[0.35406116,0.000020624653,0.6410792,0.002730696,0.0016734631,0.000055223194,0.000042108248,0.000037622536,0.0002999279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703956,0.000107027736,0.00052880263,0.001172179,0.0005096329,0.0006428084],"domain_scores_gemma":[0.99536824,0.00028813723,0.00036343752,0.0028365212,0.00036263032,0.0007810418],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005344506,0.00035786477,0.00035416082,0.00024451467,0.001197902,0.0021307913,0.0027276354,0.00022403702,0.000011259452],"category_scores_gemma":[0.00012105421,0.00034734883,0.00011562409,0.0006693957,0.000060117767,0.0008254392,0.0006132629,0.000285525,0.00019981903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020432235,0.000053703894,0.0004284981,0.0000030687102,0.000008596682,0.000006260703,0.000115838964,0.24308853,0.000012169726,0.0025831496,0.075751126,0.6779286],"study_design_scores_gemma":[0.00045662295,0.0001134087,0.054831166,0.0002311946,0.000012480953,0.0000056145673,0.0000037415568,0.9272217,0.000023012344,0.0010354178,0.015652943,0.0004126571],"about_ca_topic_score_codex":0.000018745357,"about_ca_topic_score_gemma":0.00003959677,"teacher_disagreement_score":0.68413323,"about_ca_system_score_codex":0.00011153715,"about_ca_system_score_gemma":0.00019348004,"threshold_uncertainty_score":0.99989784},"labels":[],"label_agreement":null},{"id":"W2616855592","doi":"10.1145/3060403.3060429","title":"An FPGA Coarse Grained Intermediate Fabric for Regular Expression Search","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Regular expression; Computer science; Tree traversal; Parallel computing; Throughput; Field-programmable gate array; String (physics); Network packet; Set (abstract data type); Expression (computer science); Filter (signal processing); Virtex; Algorithm; Embedded system; Operating system; Mathematics; Programming language; Computer network","score_opus":0.028574736560112314,"score_gpt":0.3133145494706144,"score_spread":0.28473981291050204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616855592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01850309,0.000018920075,0.97913677,0.0005511197,0.0003231009,0.00015552973,8.8615485e-7,0.00018119227,0.0011294057],"genre_scores_gemma":[0.791701,0.000010069047,0.20626876,0.0001266778,0.00015864197,0.000020040085,0.000009455543,0.000010019895,0.0016952946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990638,0.000040459912,0.00012889731,0.00034574044,0.00016886085,0.00025225178],"domain_scores_gemma":[0.9986604,0.00003543647,0.000092523755,0.0009593632,0.0001384596,0.00011384827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040420765,0.000096033225,0.00010613085,0.000057745525,0.0006432639,0.0008065348,0.0012302564,0.00005774406,0.000007593217],"category_scores_gemma":[0.000057152203,0.000077071105,0.000038044545,0.000064916654,0.00006429768,0.0011673917,0.000194169,0.00006341049,0.000010158376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010294043,0.0002666276,0.0011337249,0.00011125955,0.000017942639,0.000016672297,0.002482465,0.008412801,0.011880338,0.015695695,0.018842844,0.9410367],"study_design_scores_gemma":[0.000511417,0.00012568015,0.0005193072,0.00004721882,0.0000027213873,0.0000022502845,0.000024786852,0.97005725,0.023373652,0.004469289,0.00071811234,0.00014831281],"about_ca_topic_score_codex":0.000007398447,"about_ca_topic_score_gemma":0.000004602463,"teacher_disagreement_score":0.9616445,"about_ca_system_score_codex":0.0000149904645,"about_ca_system_score_gemma":0.000046755285,"threshold_uncertainty_score":0.77774334},"labels":[],"label_agreement":null},{"id":"W2758109413","doi":"10.1109/iscas.2017.8050818","title":"Scalable memory-less architecture for string matching with FPGAs","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Parallel computing; Field-programmable gate array; Throughput; String (physics); Memory architecture; Content-addressable memory; Routing table; Routing (electronic design automation); Content-addressable storage; String searching algorithm; Lookup table; Computer hardware; Embedded system; Data structure; Operating system; Routing protocol","score_opus":0.01775539484387704,"score_gpt":0.24901310594143267,"score_spread":0.23125771109755563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758109413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016052533,0.000023560058,0.9737242,0.0010913195,0.00013352637,0.00011712451,3.9565148e-7,0.0001506071,0.00870677],"genre_scores_gemma":[0.5302897,0.0000017998052,0.467243,0.00011348122,0.00009349049,0.000011017139,0.000001073771,0.000008561562,0.0022378622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930155,0.000009273921,0.0000823423,0.0002600306,0.00012492361,0.00022189766],"domain_scores_gemma":[0.9992102,0.000037391423,0.00010145986,0.00053350074,0.000063499596,0.00005396297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017787566,0.000093031354,0.00009985073,0.000033096072,0.00077986217,0.000953769,0.00072850595,0.000033440258,0.0000024663145],"category_scores_gemma":[0.000014895846,0.00006652962,0.000022660965,0.000056234778,0.00003081684,0.0005338523,0.0001229079,0.000076017765,0.0000027204028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003357693,0.000050758874,0.0012173825,0.00013151322,0.000034280714,0.000008706334,0.0013498932,0.44546703,0.00023869412,0.04558853,0.0014348624,0.5044448],"study_design_scores_gemma":[0.0017730446,0.00015457127,0.0008314241,0.0003482864,0.000021546643,0.000045631554,0.00014816665,0.9327838,0.014244257,0.046839245,0.002172894,0.0006371317],"about_ca_topic_score_codex":0.000047197074,"about_ca_topic_score_gemma":0.000080777834,"teacher_disagreement_score":0.51423717,"about_ca_system_score_codex":0.000011544926,"about_ca_system_score_gemma":0.00004302887,"threshold_uncertainty_score":0.91972166},"labels":[],"label_agreement":null},{"id":"W2768096823","doi":"10.1109/tnet.2019.2926230","title":"SHIP: A Scalable High-Performance IPv6 Lookup Algorithm That Exploits Prefix Characteristics","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Trie; Prefix; Scalability; Parallel computing; IPv6; Data structure; Latency (audio); Exploit; Tree traversal; Algorithm; Operating system; The Internet","score_opus":0.032428039253844645,"score_gpt":0.2392706449452485,"score_spread":0.20684260569140384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768096823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077600237,0.00047502574,0.97285736,0.00027667737,0.016528878,0.0006536987,0.000033649263,0.00093601627,0.00047868383],"genre_scores_gemma":[0.8242359,0.002720571,0.16854404,0.00041002783,0.0016957102,0.00021882169,0.00009099722,0.0001352,0.0019487125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955851,0.00019446011,0.0007534608,0.0015783359,0.0008508331,0.0010378226],"domain_scores_gemma":[0.9960818,0.00026507874,0.00066158903,0.0025165959,0.00024231391,0.00023257878],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061695644,0.0008158576,0.0008254747,0.00040134022,0.00072922005,0.0011504224,0.0024573521,0.00073785114,0.000030593965],"category_scores_gemma":[0.00000773454,0.00086255453,0.0002384924,0.00082430465,0.0000897463,0.00086234586,0.00015481177,0.001977677,0.00017644532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002230058,0.00012643634,0.00013148709,0.0001912476,0.00008749849,0.000009037429,0.00030357164,0.50999725,0.000005971815,0.000015904054,0.00027695094,0.48883232],"study_design_scores_gemma":[0.00052497536,0.00013601783,0.00032426053,0.0023878205,0.00011371043,0.000024786266,0.000011904864,0.99072385,0.0011684418,0.0009984564,0.002529452,0.0010563408],"about_ca_topic_score_codex":0.000029705372,"about_ca_topic_score_gemma":0.000007273861,"teacher_disagreement_score":0.8164759,"about_ca_system_score_codex":0.00031941704,"about_ca_system_score_gemma":0.00034806825,"threshold_uncertainty_score":0.99988645},"labels":[],"label_agreement":null},{"id":"W2792475428","doi":"10.1155/2018/9595171","title":"Corrigendum to “PCIU: Hardware Implementations of an Efficient Packet Classification Algorithm with an Incremental Update Capability”","year":2018,"lang":"en","type":"erratum","venue":"International Journal of Reconfigurable Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Implementation; Network packet; Parallel computing; Algorithm; Computer architecture; Computer hardware; Computer network; Programming language","score_opus":0.0275247011780522,"score_gpt":0.3053172581238692,"score_spread":0.27779255694581695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792475428","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.015882254,0.00013009929,0.95145345,0.0006457406,0.029170068,0.00034993564,0.00013900606,0.000079799196,0.002149624],"genre_scores_gemma":[0.21729079,0.00011053926,0.76965684,0.000794385,0.0073356726,0.000014032114,0.0019758686,0.00013416764,0.002687728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607164,0.0002763638,0.0013592974,0.0006024387,0.0013170309,0.00037324283],"domain_scores_gemma":[0.9927497,0.0000639587,0.0024492906,0.00052652037,0.003917398,0.0002931201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014660894,0.00035535078,0.0005279364,0.0007053806,0.00024603953,0.00061889575,0.00230097,0.0001789763,0.0000950312],"category_scores_gemma":[0.0000847233,0.00032302336,0.00013362373,0.00052206934,0.00009912276,0.00087742234,0.00014025265,0.00057919056,0.00001075217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030129743,0.0011618976,0.0004967707,0.00013996578,0.0008488971,0.000101515856,0.0052682366,0.091936745,0.0003333813,0.0010213967,0.1918462,0.7065437],"study_design_scores_gemma":[0.0009332239,0.0013446099,0.0007219823,0.0010801661,0.000071853356,0.0003803135,0.0007702038,0.9707782,0.0010570645,0.00031689368,0.022039361,0.0005061182],"about_ca_topic_score_codex":0.00007766161,"about_ca_topic_score_gemma":0.0000822208,"teacher_disagreement_score":0.87884146,"about_ca_system_score_codex":0.0004453662,"about_ca_system_score_gemma":0.00093409483,"threshold_uncertainty_score":0.99992216},"labels":[],"label_agreement":null},{"id":"W2794657874","doi":"10.1155/2018/3489169","title":"Corrigendum to “Hardware Accelerators Targeting a Novel Group Based Packet Classification Algorithm”","year":2018,"lang":"en","type":"erratum","venue":"International Journal of Reconfigurable Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer hardware; Algorithm","score_opus":0.03416147638072677,"score_gpt":0.2820941755169756,"score_spread":0.2479326991362488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794657874","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.00006734905,0.0004246833,0.8854028,0.0013077318,0.106737636,0.00016574987,0.000026834441,0.0001170979,0.005750118],"genre_scores_gemma":[0.018893078,0.0002379096,0.9312389,0.0032933215,0.029293576,0.0000122223255,0.0006889822,0.00019588604,0.016146129],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955947,0.00016204157,0.0015440006,0.00071509666,0.0014397207,0.0005444696],"domain_scores_gemma":[0.9922072,0.0001625599,0.0028358945,0.00041996298,0.0040589883,0.00031537953],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017404987,0.0004896604,0.0006508253,0.0009925559,0.00032092977,0.0015504295,0.003496559,0.0004139077,0.00008813999],"category_scores_gemma":[0.00049235724,0.00048209605,0.00031592476,0.0007614074,0.000054660053,0.0008868067,0.00020977626,0.0012074541,0.00005034039],"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.00002590435,0.00012543173,0.0000622227,0.000041565614,0.00017903661,0.00004802006,0.00033786154,0.0035735255,0.00020504395,0.00018215703,0.7975747,0.19764455],"study_design_scores_gemma":[0.00056663656,0.00018261306,0.000113857976,0.0016547535,0.000027584409,0.00012811145,0.00006918372,0.6768648,0.00028490278,0.0001532292,0.31948766,0.0004666639],"about_ca_topic_score_codex":0.000019532823,"about_ca_topic_score_gemma":0.0000056942595,"teacher_disagreement_score":0.67329127,"about_ca_system_score_codex":0.0005807755,"about_ca_system_score_gemma":0.0010053909,"threshold_uncertainty_score":0.9997631},"labels":[],"label_agreement":null},{"id":"W2795675301","doi":"10.1109/tcsii.2018.2849925","title":"An Efficient I/O Architecture for RAM-Based Content-Addressable Memory on FPGA","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Latency (audio); Computer science; Field-programmable gate array; Parallel computing; Key (lock); Registered memory; CAS latency; Exploit; Architecture; Computer hardware; Arithmetic; Embedded system; Semiconductor memory; Memory controller; Operating system; Mathematics","score_opus":0.043078173092692525,"score_gpt":0.2651100135873482,"score_spread":0.22203184049465569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795675301","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.0047923503,0.00030986933,0.9805143,0.00024273594,0.009327066,0.0026606594,0.0003790595,0.0011102116,0.00066375063],"genre_scores_gemma":[0.9883305,0.000012902005,0.006768801,0.00059764215,0.0008679455,0.0016523768,0.00009037222,0.00015305274,0.0015264009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943898,0.000520827,0.0009685601,0.0021382682,0.0010539354,0.0009286073],"domain_scores_gemma":[0.994967,0.00039731074,0.0006921323,0.0027556096,0.0007715586,0.00041639683],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009197231,0.0008893328,0.0009636015,0.0005915142,0.0013592979,0.001128811,0.002198713,0.0007900999,0.000014653708],"category_scores_gemma":[0.000021599426,0.00087003177,0.00045289003,0.0004563073,0.00019719107,0.0002548648,0.000020755788,0.0010876728,0.000027795777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087770815,0.0007527702,5.1001757e-7,0.00063935964,0.000098286495,0.000006750908,0.0012621148,0.9776197,0.00080063316,0.00013126346,0.0017183454,0.016882503],"study_design_scores_gemma":[0.0022021043,0.0010903483,0.0000049458354,0.0030255737,0.00014045127,0.00002502926,0.00008505635,0.9570108,0.03101594,0.00014169938,0.0039208415,0.0013372292],"about_ca_topic_score_codex":0.00017107796,"about_ca_topic_score_gemma":0.000019498662,"teacher_disagreement_score":0.98353815,"about_ca_system_score_codex":0.0003157118,"about_ca_system_score_gemma":0.0006340295,"threshold_uncertainty_score":0.9999408},"labels":[],"label_agreement":null},{"id":"W2802262217","doi":"10.1109/iscas.2018.8351362","title":"Implementation of a Cache-Based IPv6 Lookup System with Hashing","year":2018,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cache; Cache algorithms; Hash function; Page cache; Packet forwarding; Cache pollution; Cache invalidation; Bottleneck; Hash table; Parallel computing; CPU cache; Cache coloring; Throughput; Table (database); Computer network; Network packet; Operating system; Embedded system; Database","score_opus":0.009603134004372214,"score_gpt":0.25104645869104036,"score_spread":0.24144332468666815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802262217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028608141,0.0000069071193,0.9665936,0.00011821183,0.0000629646,0.0000697881,2.6689196e-7,0.00013670858,0.00440336],"genre_scores_gemma":[0.83607733,2.3401616e-7,0.16375962,0.000065815344,0.00004090614,0.0000039039646,0.0000017029151,0.0000038812523,0.000046598958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994141,0.000026450642,0.00013222417,0.00015570309,0.00015575353,0.00011580495],"domain_scores_gemma":[0.9994968,0.000018347611,0.00010395273,0.00019086263,0.00016088976,0.0000291173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018291584,0.00005850611,0.000073135816,0.000052222196,0.0000850037,0.00008636824,0.00018905212,0.00001865341,0.0000104167],"category_scores_gemma":[0.0000018495147,0.000043799046,0.000011808543,0.00030849513,0.00003087829,0.00027924668,0.00002322862,0.000023234117,0.000006339114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014254321,0.0002523536,0.073893376,0.0010426944,0.0001530487,0.000020645335,0.013233557,0.07485896,0.0030347297,0.16771507,0.005404595,0.6602484],"study_design_scores_gemma":[0.0006608756,0.00028573468,0.00079914264,0.000111490335,0.000009293684,0.000005718357,0.00054291997,0.96302533,0.03428221,0.00003148658,0.000119411765,0.00012638821],"about_ca_topic_score_codex":0.00016382572,"about_ca_topic_score_gemma":0.00018635692,"teacher_disagreement_score":0.88816637,"about_ca_system_score_codex":0.000027470503,"about_ca_system_score_gemma":0.000101107915,"threshold_uncertainty_score":0.17860733},"labels":[],"label_agreement":null},{"id":"W2809060280","doi":"10.1155/2018/6075043","title":"Corrigendum to “An Impulse-C Hardware Accelerator for Packet Classification Based on Fine/Coarse Grain Optimization”","year":2018,"lang":"en","type":"erratum","venue":"International Journal of Reconfigurable Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Impulse (physics); Network packet; Parallel computing; Hardware acceleration; Computer hardware; Field-programmable gate array; Computer network; Physics; Quantum mechanics","score_opus":0.04460902250979722,"score_gpt":0.3096051765227184,"score_spread":0.2649961540129212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809060280","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.00004187076,0.00008778082,0.915168,0.0023375717,0.07676501,0.00036134504,0.0000613355,0.00011147057,0.00506565],"genre_scores_gemma":[0.013880684,0.00009454102,0.92299,0.005188528,0.02365233,0.000043576936,0.0016440528,0.00024684228,0.032259423],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996116,0.0002128972,0.0013290654,0.00075752725,0.0011034844,0.00048101493],"domain_scores_gemma":[0.9915818,0.0002162452,0.0022705828,0.0005853387,0.005008773,0.00033727637],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014371402,0.00048494263,0.00061032147,0.0010340554,0.00035311026,0.0011808835,0.0030588456,0.00040159284,0.00010787147],"category_scores_gemma":[0.00070779404,0.00047282735,0.0003091105,0.0005322029,0.0000482268,0.0008722956,0.00009186825,0.00073860306,0.000023478531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013040358,0.0001481718,0.000020212592,0.000042007807,0.000099545265,0.000021900309,0.0002513047,0.26187506,0.000017165014,0.0003369016,0.6552052,0.08185215],"study_design_scores_gemma":[0.0007578032,0.0006349924,0.000032837706,0.0011635248,0.000029319659,0.000062508145,0.000033000713,0.8775352,0.00017559287,0.00028283588,0.11886347,0.0004288791],"about_ca_topic_score_codex":0.000007409445,"about_ca_topic_score_gemma":0.000011391519,"teacher_disagreement_score":0.6156602,"about_ca_system_score_codex":0.00048069516,"about_ca_system_score_gemma":0.0012665935,"threshold_uncertainty_score":0.999856},"labels":[],"label_agreement":null},{"id":"W2840690492","doi":"10.1109/ccgrid.2018.00067","title":"A Low-Latency Memory-Efficient IPv6 Lookup Engine Implemented on FPGA Using High-Level Synthesis","year":2018,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Lookup table; Scalability; Field-programmable gate array; Latency (audio); Ethernet; Memory bandwidth; Computer architecture; Embedded system; Computer hardware; Parallel computing; Operating system","score_opus":0.031161343690214664,"score_gpt":0.26258703981666326,"score_spread":0.2314256961264486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2840690492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073719144,0.000018414996,0.92250085,0.00035877613,0.00057581096,0.00014255106,0.000003310244,0.00031849905,0.0023626343],"genre_scores_gemma":[0.8308382,0.0000041660264,0.16806087,0.00035834554,0.00024273466,0.0000085520105,0.0000028643876,0.000017832916,0.00046641473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829704,0.00006264925,0.00030411978,0.0005171825,0.00035925652,0.00045976412],"domain_scores_gemma":[0.99888647,0.00010395716,0.000121624274,0.0005499183,0.0002206547,0.000117385825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003887515,0.000210086,0.00019116436,0.00018682226,0.00034163558,0.00020732672,0.0005475497,0.0000694584,0.00020946257],"category_scores_gemma":[0.0000674326,0.00017472368,0.00005184301,0.0007308856,0.00005965147,0.00021816276,0.00017383946,0.000094623574,0.00013120241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075134274,0.0009373639,0.000067862326,0.00009189476,0.00011752555,0.00003468125,0.001755905,0.31733772,0.0039241565,0.012641959,0.0053785527,0.65763724],"study_design_scores_gemma":[0.0002860576,0.00011350231,0.00013033443,0.00011405475,0.000014461776,0.000007726628,0.00002305069,0.9037697,0.094938494,0.0002327447,0.000114687646,0.0002552202],"about_ca_topic_score_codex":0.000058981517,"about_ca_topic_score_gemma":0.000011737149,"teacher_disagreement_score":0.75711906,"about_ca_system_score_codex":0.00009276086,"about_ca_system_score_gemma":0.00009591893,"threshold_uncertainty_score":0.71250254},"labels":[],"label_agreement":null},{"id":"W2884096875","doi":"10.1002/dac.3773","title":"On optimizing firewall performance in dynamic networks by invoking a novel<i>swapping window</i>–based paradigm","year":2018,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Firewall (physics); Computer science; Stateful firewall; The Internet; Distributed computing; Application firewall; Computer network; Network packet; Entropy (arrow of time); World Wide Web","score_opus":0.014186334842152565,"score_gpt":0.2638186931382118,"score_spread":0.24963235829605926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884096875","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.041323274,0.0014209034,0.9537057,0.001263955,0.0011600829,0.00010734526,0.0000011526614,0.000040940606,0.0009766367],"genre_scores_gemma":[0.98650247,0.00029677266,0.012586949,0.00040814234,0.00014052575,0.000007509424,0.000010515267,0.000013167688,0.00003393464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998159,0.00017941937,0.00076225994,0.00016591103,0.00054722634,0.00018618401],"domain_scores_gemma":[0.9976944,0.00029558022,0.0009439614,0.000445515,0.00055888854,0.000061667066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969779,0.00013949293,0.00021194527,0.00034262254,0.00014600207,0.00044772468,0.0020522657,0.00008115568,0.0000029166788],"category_scores_gemma":[0.00006048536,0.0001340481,0.000057611087,0.00040732144,0.0000648158,0.0009042651,0.00012519729,0.00034453557,0.000005701899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008545409,0.00016122124,0.0011942567,0.000006745837,0.00005249729,0.000003821876,0.0011830679,0.98779255,0.00018358357,0.0022981192,0.00047300366,0.006565678],"study_design_scores_gemma":[0.00087344536,0.000101104575,0.000447599,0.0012953997,0.0000036117265,0.000041809733,0.000030503745,0.99477935,0.00009010269,0.00011444414,0.0020907996,0.00013182877],"about_ca_topic_score_codex":0.000014897388,"about_ca_topic_score_gemma":0.000008111446,"teacher_disagreement_score":0.9451792,"about_ca_system_score_codex":0.00028410158,"about_ca_system_score_gemma":0.00011304046,"threshold_uncertainty_score":0.5466323},"labels":[],"label_agreement":null},{"id":"W2888674064","doi":"10.1007/s00607-018-0655-0","title":"Policy expressions and the bottom-up design of computing policies","year":2018,"lang":"en","type":"article","venue":"Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Equivalence (formal languages); Computer science; Set (abstract data type); Generalization; Predicate (mathematical logic); Policy analysis; Expression (computer science); Representation (politics); Theoretical computer science; Mathematics; Discrete mathematics; Law; Programming language; Political science","score_opus":0.026249889761590837,"score_gpt":0.28960667376180615,"score_spread":0.26335678400021534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888674064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017827384,0.00018793788,0.9795576,0.00084006146,0.00025741916,0.00010649605,1.6749959e-7,0.00012889835,0.00109406],"genre_scores_gemma":[0.835442,0.000011525186,0.16371092,0.0003413182,0.00043748802,5.506005e-7,2.4005396e-7,0.000006987241,0.000048940692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884725,0.00020371558,0.00025812723,0.00022787372,0.0001981954,0.00026485807],"domain_scores_gemma":[0.998622,0.00057925197,0.0002148519,0.00031649068,0.00021552274,0.000051899733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828607,0.00011166255,0.00017745586,0.00010116217,0.0006246621,0.00017169976,0.0005440134,0.000042354786,7.571011e-7],"category_scores_gemma":[0.00029016912,0.00007739743,0.000030645828,0.00060361746,0.0004010486,0.00014629682,0.00052617525,0.00011659963,0.0000027097303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006953918,0.00008255465,0.0014668126,0.000112166585,0.000076477576,0.0000026572516,0.089294605,0.112402685,0.0022322708,0.3528989,0.0041335556,0.4372278],"study_design_scores_gemma":[0.00048513518,0.000032533575,0.00048268132,0.00014284966,0.0000048973798,0.0000142961935,0.00010786452,0.9928507,0.0010708176,0.0046673617,0.000045885638,0.000094932075],"about_ca_topic_score_codex":0.000054867432,"about_ca_topic_score_gemma":6.317337e-7,"teacher_disagreement_score":0.88044804,"about_ca_system_score_codex":0.000015873198,"about_ca_system_score_gemma":0.00011122197,"threshold_uncertainty_score":0.4804459},"labels":[],"label_agreement":null},{"id":"W2912891501","doi":"10.14778/3291264.3291270","title":"PS-tree-based efficient boolean expression matching for high-dimensional and dense workloads","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Disjoint sets; Matching (statistics); Predicate (mathematical logic); Memory footprint; Tree (set theory); Theoretical computer science; Algorithm; Parallel computing; Mathematics","score_opus":0.008289532133585992,"score_gpt":0.21845650172001987,"score_spread":0.21016696958643388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912891501","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.6591832,0.00024844642,0.33610868,0.0024012967,0.0006627058,0.0006770421,0.0000033511749,0.00015956457,0.0005556694],"genre_scores_gemma":[0.87046283,0.0000029457708,0.1289369,0.00031676964,0.00012266547,0.000033601853,9.779619e-7,0.000011544241,0.00011177719],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988123,0.000008069666,0.00023210225,0.000359062,0.0003344691,0.00025394934],"domain_scores_gemma":[0.9992129,0.00005328469,0.00024192098,0.00015052575,0.00027141132,0.000069908994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004094632,0.0001487528,0.0001475235,0.000072326795,0.00036144294,0.00014314901,0.0004694834,0.00004968543,0.0000025196093],"category_scores_gemma":[0.00004410829,0.00010166779,0.00005001475,0.00023987374,0.00010627544,0.00016581282,0.0003080567,0.000075843105,0.0000014041906],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012446111,0.0015241303,0.0050800955,0.0012492469,0.0001269869,0.0000020193586,0.007968274,0.064768896,0.6060919,0.0846747,0.040217888,0.18705124],"study_design_scores_gemma":[0.0015110222,0.00028103605,0.00083327206,0.0008653288,0.000033612374,0.0000069535554,0.000051032697,0.37054193,0.6110886,0.014170776,0.00032894005,0.0002875057],"about_ca_topic_score_codex":0.0000056324634,"about_ca_topic_score_gemma":8.8533926e-7,"teacher_disagreement_score":0.30577302,"about_ca_system_score_codex":0.000039963168,"about_ca_system_score_gemma":0.000037024365,"threshold_uncertainty_score":0.41458923},"labels":[],"label_agreement":null},{"id":"W2912902802","doi":"10.1109/mwscas.2018.8623871","title":"Extending a CPU Cache for Efficient IPv6 Lookup","year":2018,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cache; Parallel computing; Operating system","score_opus":0.018111852096838313,"score_gpt":0.2726904514711619,"score_spread":0.2545785993743236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912902802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002306484,0.000065286375,0.9858223,0.00036090423,0.000451017,0.00010301308,2.5491397e-7,0.00021416234,0.010676576],"genre_scores_gemma":[0.6171451,0.0000022963047,0.37967578,0.00039116072,0.00029935178,0.000013929374,0.0000013779689,0.0000071661607,0.0024638097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993,0.0000130221315,0.00010762105,0.00025094004,0.00010805987,0.00022035345],"domain_scores_gemma":[0.99950826,0.000049548835,0.000042100062,0.00022906392,0.00011952509,0.000051496612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025314366,0.000070653594,0.00006778125,0.000050056555,0.00022053967,0.00016904876,0.00031097734,0.000032650394,0.00001756924],"category_scores_gemma":[0.000029816123,0.000057371188,0.000029855444,0.0002663644,0.00003603991,0.00013056087,0.00007498825,0.000030381232,0.000048713326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034141907,0.00023317517,0.0002373954,0.00006674993,0.000031551972,0.000003991816,0.0033620906,0.033451848,0.001006809,0.28912923,0.039747685,0.6326953],"study_design_scores_gemma":[0.00018660403,0.00007175857,0.00003695654,0.000016556412,0.0000029731737,0.0000040946475,0.000012891949,0.98894835,0.0029300367,0.0013980442,0.0062922137,0.000099505916],"about_ca_topic_score_codex":0.0000030615427,"about_ca_topic_score_gemma":0.0000031671607,"teacher_disagreement_score":0.9554965,"about_ca_system_score_codex":0.000021568012,"about_ca_system_score_gemma":0.00003546841,"threshold_uncertainty_score":0.23395291},"labels":[],"label_agreement":null},{"id":"W2913097261","doi":"10.1145/3260807","title":"Session details: Network security","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Session (web analytics); Computer science; Network security; Computer security; World Wide Web","score_opus":0.01564225448425607,"score_gpt":0.23006626219294898,"score_spread":0.2144240077086929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913097261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073173055,0.00024037354,0.9629498,0.00031546116,0.00031150764,0.000040391842,4.6603247e-8,0.00040012726,0.028424973],"genre_scores_gemma":[0.8262818,0.000097002936,0.17142186,0.0006028371,0.00022603899,0.0000032213134,0.000001731208,0.000005132811,0.0013603985],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992734,0.000037940066,0.00011348715,0.00021284432,0.00014952025,0.00021280175],"domain_scores_gemma":[0.99954534,0.000030721076,0.000042230095,0.0002601481,0.000055174816,0.00006640057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013885931,0.00007440063,0.00007914777,0.000022209018,0.00030200728,0.00006190837,0.00031429328,0.000045633366,0.00002684269],"category_scores_gemma":[0.0000100983225,0.000060136732,0.000026845903,0.0004292813,0.000025741127,0.00046414734,0.00010583941,0.00007675781,0.00006402764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024207166,0.00031717707,0.03909591,0.000046861842,0.00003578612,0.00015888587,0.004354839,0.17291208,0.000058203328,0.14734492,0.47755125,0.15809989],"study_design_scores_gemma":[0.0002129914,0.000033873326,0.0011678699,0.000026303254,0.0000021934727,0.0000749051,0.0000071419067,0.97016245,0.00034574978,0.016510557,0.011245927,0.00021003358],"about_ca_topic_score_codex":0.0000040574673,"about_ca_topic_score_gemma":0.000003366909,"teacher_disagreement_score":0.8189645,"about_ca_system_score_codex":0.00001219112,"about_ca_system_score_gemma":0.00004753877,"threshold_uncertainty_score":0.24523048},"labels":[],"label_agreement":null},{"id":"W2923126305","doi":"10.1109/tpds.2019.2907537","title":"CASpMV: A Customized and Accelerative SpMV Framework for the Sunway TaihuLight","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":102,"is_retracted":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":"Hunan Provincial Innovation Foundation for Postgraduate; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Supercomputer; Scalability; Memory hierarchy; Overhead (engineering); Computer architecture; Operating system; Cache","score_opus":0.0177715680750364,"score_gpt":0.2503210929208687,"score_spread":0.23254952484583227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923126305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002877724,0.0007705959,0.9937147,0.0006683874,0.00087967893,0.0008298762,0.00007707865,0.000112434805,0.00006951953],"genre_scores_gemma":[0.99175787,0.0001759427,0.0070980806,0.00009871229,0.0000596769,0.00023084648,0.00001084424,0.000010747861,0.00055726944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.000080885926,0.00023977937,0.00037946546,0.0001569131,0.0002456507],"domain_scores_gemma":[0.9987666,0.0006054364,0.000109585846,0.00031823723,0.00010655209,0.000093585084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023962498,0.00018314614,0.00025186015,0.000049820723,0.00051277975,0.00046976624,0.00022516352,0.00013191729,0.000005754503],"category_scores_gemma":[0.0000067696506,0.00012288618,0.000060880768,0.0002869201,0.00005461529,0.000282492,0.0000034177194,0.00018631534,0.000011730179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029840384,0.00012726641,0.00010047726,0.00014707423,0.00017445917,0.0000028780662,0.0014565396,0.9643937,0.000061986524,0.022515565,0.0010991837,0.009622464],"study_design_scores_gemma":[0.001515792,0.00014175674,0.00008149511,0.0001098284,0.000042942647,0.000024625511,0.00035225818,0.9936381,0.000078341924,0.0011026866,0.0026723172,0.00023986706],"about_ca_topic_score_codex":0.000034235683,"about_ca_topic_score_gemma":0.0000079882975,"teacher_disagreement_score":0.98888016,"about_ca_system_score_codex":0.000027576441,"about_ca_system_score_gemma":0.00004298639,"threshold_uncertainty_score":0.5011153},"labels":[],"label_agreement":null},{"id":"W3021117606","doi":"","title":"Utilizing Strain Criteria to Predict Highwall Stability Performance","year":2003,"lang":"en","type":"article","venue":"10th ISRM Congress","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Stability (learning theory); Strain (injury); Computer science; Biology","score_opus":0.028677000321328562,"score_gpt":0.26533158721976946,"score_spread":0.2366545868984409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021117606","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.49004796,0.00031132094,0.48550144,0.00060953444,0.0032649275,0.00046961883,0.000018497949,0.00073249516,0.019044187],"genre_scores_gemma":[0.95445853,0.000014127456,0.04472885,0.00037262237,0.00006760354,0.00002045409,0.000004597475,0.000012580803,0.00032062168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984191,0.00012901708,0.00026451878,0.0004955225,0.0002734775,0.00041834606],"domain_scores_gemma":[0.9989233,0.000058437974,0.00007914117,0.0005840531,0.00017452642,0.00018053985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000659212,0.00017134611,0.00017496308,0.00007442727,0.00022062505,0.00033675696,0.00056673866,0.00006934272,0.0000784056],"category_scores_gemma":[0.00011533889,0.00016371092,0.000034058758,0.000484187,0.000050395643,0.0006649821,0.00010634841,0.00013015176,0.000040290248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002074851,0.0010193229,0.11573619,0.0012051255,0.00015497868,0.00010468818,0.022972763,0.02208353,0.009567138,0.077188976,0.0229566,0.7268032],"study_design_scores_gemma":[0.0012540652,0.0004408547,0.014078857,0.00036869847,0.000021619338,0.000040413932,0.00025405572,0.9143786,0.022260424,0.0015802522,0.044211276,0.0011109096],"about_ca_topic_score_codex":0.0000040372583,"about_ca_topic_score_gemma":0.0000076249016,"teacher_disagreement_score":0.89229506,"about_ca_system_score_codex":0.000051652623,"about_ca_system_score_gemma":0.000108101565,"threshold_uncertainty_score":0.6675938},"labels":[],"label_agreement":null},{"id":"W3034257221","doi":"10.1109/tifs.2020.3001669","title":"Atomos: Constant-Size Path Validation Proof","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Zhejiang University; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Mathematical proof; Theoretical computer science; Cryptography; Homomorphic encryption; Encryption; Network packet; Path (computing); Computer network; Distributed computing; Algorithm; Mathematics","score_opus":0.010610844411680276,"score_gpt":0.20873129150892647,"score_spread":0.1981204470972462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034257221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036648626,0.000019324443,0.99301076,0.0013729169,0.00026176427,0.000178047,0.000018352555,0.00018478479,0.0012891771],"genre_scores_gemma":[0.98721707,0.00006474286,0.011253453,0.0014062566,0.000025487745,0.000012063102,0.000009428138,0.0000044363564,0.0000070903975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991521,0.000029453906,0.0002870398,0.00015344979,0.00023089557,0.00014704592],"domain_scores_gemma":[0.99938864,0.000044754157,0.00012616902,0.0001485186,0.00016572377,0.00012618724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013424671,0.00012424075,0.00011982374,0.00004898095,0.0002810423,0.000314374,0.00013627174,0.00007716504,0.000010625279],"category_scores_gemma":[0.000012465018,0.000118860364,0.000041328974,0.00037502538,0.000050605555,0.002038192,0.0000032258556,0.00017283726,0.000020141484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018881162,0.00016445073,0.000086392654,0.00047494797,0.00009952801,0.0000049790765,0.043032095,0.10012778,0.00006870239,0.10827805,0.0048980587,0.7425762],"study_design_scores_gemma":[0.00071399315,0.0001860222,0.000014565167,0.000044243432,0.000016678156,0.000012239049,0.00017562909,0.97847885,0.007181721,0.009170237,0.0037488935,0.00025695085],"about_ca_topic_score_codex":0.0000037511256,"about_ca_topic_score_gemma":0.0000013714703,"teacher_disagreement_score":0.98355216,"about_ca_system_score_codex":0.000020867643,"about_ca_system_score_gemma":0.000058127232,"threshold_uncertainty_score":0.4846985},"labels":[],"label_agreement":null},{"id":"W3081214814","doi":"10.1109/cjece.2019.2897277","title":"A New TCAM Architecture for IP Routing With Update Complexity Equal to O(1)","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Routing table; Computer science; Computer network; Network packet; Routing (electronic design automation); Loose Source Routing; Table (database); Content-addressable memory; Packet forwarding; The Internet; IP forwarding; Virtual routing and forwarding; Prefix; Distributed computing; Routing protocol; Operating system; Database","score_opus":0.01312849984266621,"score_gpt":0.18764509852991032,"score_spread":0.17451659868724412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081214814","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.0025468555,0.00020895166,0.9926104,0.0044501675,0.0000877507,0.00006515871,6.708996e-7,0.00002450816,0.000005562024],"genre_scores_gemma":[0.4927274,9.486662e-7,0.50551707,0.0013173568,0.00042660054,5.973769e-7,4.865553e-7,0.000007507115,0.0000020426103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999293,0.0000098208675,0.00016792624,0.00015114048,0.00008757315,0.00029048408],"domain_scores_gemma":[0.9988181,0.000055608143,0.000051912113,0.00005941097,0.00007863863,0.00093633094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076468685,0.00010675412,0.00017725385,0.000118966964,0.00007969189,0.00021996266,0.00029381487,0.000028949053,7.9484795e-7],"category_scores_gemma":[0.000030396128,0.00008889534,0.000034342134,0.000466421,0.0000073352003,0.00012944081,0.000021404678,0.00017925428,4.6473826e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003412947,0.0000046913897,0.00025910494,0.00003016427,0.000044595545,0.00004619552,0.0010252795,0.73499686,0.00006537176,0.023377027,0.0033749247,0.23674165],"study_design_scores_gemma":[0.00032526432,0.00051984936,0.0003355033,0.000054522316,0.000008093016,0.00014164817,9.784085e-7,0.99016076,0.00008718006,0.0007513845,0.0074647013,0.00015013655],"about_ca_topic_score_codex":0.00004192566,"about_ca_topic_score_gemma":0.00007450214,"teacher_disagreement_score":0.49018052,"about_ca_system_score_codex":0.000029980969,"about_ca_system_score_gemma":0.00030548827,"threshold_uncertainty_score":0.36250466},"labels":[],"label_agreement":null},{"id":"W3140960237","doi":"10.1109/netwks.2008.4763723","title":"An efficient algorithm for designing reliable IP networks with an access/edge/core hierarchical structure","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tabu search; Core network; Enhanced Data Rates for GSM Evolution; Computer network; Core (optical fiber); Router; Routing (electronic design automation); Access network; IP forwarding; Distributed computing; Algorithm; Routing table; Routing protocol; Telecommunications","score_opus":0.02440810673463958,"score_gpt":0.2702274489614741,"score_spread":0.24581934222683452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140960237","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.010396447,0.000069572256,0.9883755,0.00006356678,0.00021998312,0.00027155917,0.0000014611829,0.00039779302,0.00020413766],"genre_scores_gemma":[0.22639818,0.000008146263,0.77276224,0.00032680767,0.0002934907,0.000018254028,0.00003547992,0.000022652579,0.00013473239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983549,0.00004493002,0.00020608526,0.0006395025,0.0002710273,0.0004835647],"domain_scores_gemma":[0.9988541,0.00006619038,0.000097858145,0.0005333723,0.00021153768,0.00023696951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020970791,0.00020972732,0.0001951542,0.00008900102,0.00069465494,0.0004279542,0.00093457673,0.00012603802,0.000009529764],"category_scores_gemma":[0.000007720858,0.00015545251,0.000031528576,0.0006436974,0.00008871013,0.000948934,0.0000875077,0.00021449097,7.6338824e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023623312,0.00006659424,0.0002582969,0.0000055855216,0.000006561006,0.000009441767,0.0002683675,0.9169261,0.000008956406,0.0008336423,0.0005240736,0.08106876],"study_design_scores_gemma":[0.0004833647,0.0004769825,0.00026943276,0.000026816284,0.000008007058,0.00006744038,0.0000127713565,0.9970511,0.00036746557,0.000842064,0.00012787414,0.00026664534],"about_ca_topic_score_codex":0.000010871992,"about_ca_topic_score_gemma":0.000006922997,"teacher_disagreement_score":0.21600173,"about_ca_system_score_codex":0.000032306478,"about_ca_system_score_gemma":0.00015213926,"threshold_uncertainty_score":0.6339169},"labels":[],"label_agreement":null},{"id":"W4236334230","doi":"10.22215/etd/2008-06297","title":"High performance transducer architecture for content inspection engines","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Architecture; Computer science; Humanities; Art; Visual arts","score_opus":0.01754640847545559,"score_gpt":0.2259192704497383,"score_spread":0.20837286197428273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236334230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04948258,0.00038907,0.944468,0.00021710743,0.002445372,0.00039654158,0.000002508078,0.00063751376,0.00196126],"genre_scores_gemma":[0.69080555,0.0013206332,0.2619896,0.0002917177,0.0010521685,0.0003118992,0.0012867455,0.00008034753,0.042861313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989045,0.000013564616,0.00024443,0.00041225326,0.00020020387,0.0002249976],"domain_scores_gemma":[0.9992986,0.00003332387,0.00013498645,0.00024018939,0.00024593776,0.000046962534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007015999,0.00023652315,0.0002274157,0.00016091517,0.00027933117,0.00010890852,0.00035004344,0.00020542431,0.0000052449845],"category_scores_gemma":[0.0000109269295,0.00019959641,0.00008967173,0.00027381745,0.0000136682565,0.0002747963,0.000007002559,0.00018719216,0.0000061202268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035668717,0.0002446921,0.00010171747,0.0014692917,0.00016848717,0.000004982674,0.01004425,0.16704348,0.0010694062,0.009531125,0.0131275,0.7968384],"study_design_scores_gemma":[0.0030840891,0.0009990907,0.005329426,0.0010053201,0.00014478357,0.00009272356,0.00032624812,0.89299905,0.07191662,0.002496193,0.019056356,0.0025500963],"about_ca_topic_score_codex":0.000012976109,"about_ca_topic_score_gemma":0.00008264671,"teacher_disagreement_score":0.7942883,"about_ca_system_score_codex":0.000036202484,"about_ca_system_score_gemma":0.000106551335,"threshold_uncertainty_score":0.8139306},"labels":[],"label_agreement":null},{"id":"W4236761937","doi":"10.51348/tuitmct446","title":"Application of the Aho-Corasick algorithm to create a network intrusion detection system","year":2021,"lang":"en","type":"article","venue":"Bulletin of TUIT Management and Communication Technologies","topic":"Network Packet Processing and Optimization","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":"Canadian Bulletin of Medical History","funders":"","keywords":"Computer science; Intrusion detection system; Matching (statistics); Pattern matching; Algorithm; The Internet; Computer network; Computer security; Real-time computing; Artificial intelligence; Operating system; Mathematics","score_opus":0.004797110538787135,"score_gpt":0.19225725713078115,"score_spread":0.187460146591994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236761937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011809354,0.0015461368,0.9897474,0.004044916,0.000058056794,0.00031972642,5.478375e-7,0.0003772569,0.0027250382],"genre_scores_gemma":[0.73470294,0.0007638061,0.26415405,0.00004897347,0.000005983162,0.00007502879,0.0000026243083,0.0000050777676,0.0002414953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920106,0.000081906095,0.00025596796,0.00020338006,0.00015100528,0.00010669292],"domain_scores_gemma":[0.9984052,0.000046644655,0.0002477916,0.0011406285,0.00014865966,0.0000110526935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029353952,0.0000856305,0.00013246258,0.00007042552,0.00021404956,0.000054515578,0.0009050722,0.00006468671,9.971577e-7],"category_scores_gemma":[0.00002526188,0.00007100006,0.00002768242,0.0007374686,0.000078063094,0.000042204305,0.0014751054,0.000083324776,0.000003534989],"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.0000048952943,0.000031360287,0.00017983337,0.000109801076,0.000020050176,2.63506e-7,0.00008047041,0.0022111435,0.00014879633,0.054951772,0.000829838,0.94143176],"study_design_scores_gemma":[0.0017504921,0.00039093485,0.010754908,0.0029313723,0.0002620493,0.0000432786,0.007394218,0.48628289,0.15430191,0.050016735,0.28477412,0.0010971151],"about_ca_topic_score_codex":0.00001909178,"about_ca_topic_score_gemma":0.0000056605486,"teacher_disagreement_score":0.9403347,"about_ca_system_score_codex":0.000027698445,"about_ca_system_score_gemma":0.000006690191,"threshold_uncertainty_score":0.28952983},"labels":[],"label_agreement":null},{"id":"W4239755158","doi":"10.22215/etd/2006-08385","title":"An automatic verification tool for firewall configurations","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Firewall (physics); Computer science; Physics; Astronomy","score_opus":0.010005635622277045,"score_gpt":0.27362084398297604,"score_spread":0.263615208360699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239755158","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.005717995,0.000073683615,0.9830167,0.00010924666,0.0007769553,0.00057542714,0.000007237131,0.0007067936,0.009015923],"genre_scores_gemma":[0.31713733,0.00002602297,0.62206155,0.00027651686,0.0005345607,0.00079671404,0.013570282,0.000080256286,0.04551678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987706,0.00003430544,0.00035939747,0.0004464454,0.00019497782,0.00019430088],"domain_scores_gemma":[0.9987558,0.000079270714,0.00026301667,0.0005355973,0.00032450698,0.00004182344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016854017,0.0001946703,0.00018007941,0.00011981825,0.00027868836,0.00058506936,0.0005308218,0.00021821173,0.00002105396],"category_scores_gemma":[0.000036194397,0.00019331927,0.00006629286,0.00026953334,0.00000918662,0.0006907515,0.000004918146,0.000084813844,0.000021991542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028919778,0.00055814616,0.000045439236,0.00091370073,0.00006824575,0.0000018366397,0.004836741,0.012541092,0.0029002908,0.10379281,0.05244985,0.82186294],"study_design_scores_gemma":[0.00017778299,0.00006301879,0.00068766763,0.00005858817,0.000026410482,9.3417293e-7,0.00004455578,0.9912127,0.0014114681,0.0046773446,0.0013436727,0.00029580784],"about_ca_topic_score_codex":0.000016279859,"about_ca_topic_score_gemma":0.00007517074,"teacher_disagreement_score":0.97867167,"about_ca_system_score_codex":0.000043115913,"about_ca_system_score_gemma":0.00022210284,"threshold_uncertainty_score":0.7883331},"labels":[],"label_agreement":null},{"id":"W4249833116","doi":"10.22215/etd/2014-10407","title":"Combining SPF and Source Routing for an Efficient Probing Solution in IPv6 Topology Discovery","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Static routing; Computer network; Hierarchical routing; Distributed computing; Policy-based routing; Routing protocol; Routing table; Dynamic Source Routing; Enhanced Interior Gateway Routing Protocol; Link-state routing protocol; Routing domain; Routing (electronic design automation); Topology (electrical circuits); Engineering","score_opus":0.013740441334918443,"score_gpt":0.2653603695518348,"score_spread":0.25161992821691637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249833116","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.13586922,0.00007947828,0.86157864,0.000057614143,0.0005507302,0.00029277135,3.2043062e-7,0.00011414205,0.0014570607],"genre_scores_gemma":[0.96630067,0.0000068523245,0.03135439,0.00007667335,0.00010876584,0.000043893117,0.00019879978,0.000022769498,0.0018872124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858445,0.00007800701,0.00032355564,0.00055849913,0.00012489781,0.0003305765],"domain_scores_gemma":[0.999308,0.00011976536,0.00023980733,0.00021090599,0.00007459692,0.000046947924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061271986,0.00019243082,0.00025850805,0.00018028136,0.00025864615,0.00041240745,0.00026466875,0.0002099977,5.3667753e-7],"category_scores_gemma":[0.000059705988,0.00018760886,0.000034100103,0.00020240262,0.000022612738,0.000408549,0.000054163676,0.00017470922,7.221258e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019709047,0.0003631677,0.001557516,0.0011325857,0.000039089602,0.0000026427883,0.030512951,0.5293505,0.0010372943,0.14813034,0.00020422964,0.2874726],"study_design_scores_gemma":[0.0003917987,0.00011986246,0.00024242497,0.00025045997,0.000009984756,0.000002961997,0.00046850953,0.9969269,0.0003667827,0.0009247392,0.000049222825,0.00024632757],"about_ca_topic_score_codex":0.00008114391,"about_ca_topic_score_gemma":0.00044017605,"teacher_disagreement_score":0.8304314,"about_ca_system_score_codex":0.000050592036,"about_ca_system_score_gemma":0.00008474236,"threshold_uncertainty_score":0.7650467},"labels":[],"label_agreement":null},{"id":"W4254480172","doi":"10.7551/mitpress/9747.003.0005","title":"How Insight Emerges in a Distributed, Content-Addressable Memory","year":2013,"lang":"en","type":"book-chapter","venue":"The MIT Press eBooks","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Vlaamse regering","keywords":"Computer science; Content (measure theory); Content-addressable memory; Cognitive science; Neuroscience; Psychology; Artificial intelligence; Mathematics; Artificial neural network","score_opus":0.05845022030845099,"score_gpt":0.21864060430335303,"score_spread":0.16019038399490204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254480172","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001709313,0.006609002,0.06844697,0.00071891857,0.00067244284,0.00073267263,0.000024324863,0.00027026547,0.9225083],"genre_scores_gemma":[0.004016361,0.0002631279,0.0014347603,0.000230383,0.0002501808,0.00009569707,0.00003647145,0.000053840147,0.9936192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822026,0.000075291464,0.00034534777,0.0005637704,0.00038915873,0.00040615533],"domain_scores_gemma":[0.9981958,0.000103189865,0.00034592388,0.001074724,0.0001881352,0.000092174596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023085903,0.00040900934,0.00042031615,0.00009579315,0.00018342398,0.00075129635,0.0015716748,0.0002948363,0.000021516646],"category_scores_gemma":[0.000021621405,0.00028982828,0.00011584936,0.00002397392,0.00017203538,0.0003215751,0.0005274176,0.00054993306,0.000029695768],"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.000043714583,0.00005277568,0.0000054171305,0.00026196556,0.0002689453,0.00008922693,0.0030304359,0.0021142366,0.00008357485,0.77015144,0.059778415,0.16411988],"study_design_scores_gemma":[0.0010141034,0.0000863208,0.000011558905,0.0010628068,0.00011099138,0.000029911473,0.000029274712,0.039133064,0.0013404257,0.035865903,0.9201116,0.0012040465],"about_ca_topic_score_codex":0.000112223686,"about_ca_topic_score_gemma":0.00005412974,"teacher_disagreement_score":0.8603332,"about_ca_system_score_codex":0.00005704561,"about_ca_system_score_gemma":0.00006955945,"threshold_uncertainty_score":0.9999554},"labels":[],"label_agreement":null},{"id":"W4255230808","doi":"10.1007/978-1-4939-7131-2_100132","title":"Collecting Network Data","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.06935621359603573,"score_gpt":0.27287774393107367,"score_spread":0.20352153033503795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255230808","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.6137046e-8,0.00042650846,0.45778018,0.00008080508,0.0005426608,0.00004969055,0.000001346202,0.00021735816,0.5409014],"genre_scores_gemma":[0.000009805741,0.00015177518,0.24928142,0.0004063221,0.0016728835,8.6944834e-7,0.000070542366,0.000025664096,0.7483807],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985707,0.000011295523,0.00023443597,0.00069405616,0.00023438256,0.00025517165],"domain_scores_gemma":[0.9978703,0.000077190605,0.0002002714,0.0016553209,0.00012981222,0.00006710539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038466253,0.00020969183,0.00020810704,0.000055258268,0.00027611383,0.00038439728,0.0020401226,0.00020430263,0.00047741996],"category_scores_gemma":[0.00001830563,0.00019271637,0.00003156847,0.000109738394,0.000046915153,0.00038234403,0.0012953925,0.00019506789,0.00036876014],"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.000001411843,0.000002482337,0.0000011840593,0.000010234372,0.000023879,0.000005128529,0.000038072358,0.00059299264,4.3581622e-8,0.10528194,0.867559,0.026483618],"study_design_scores_gemma":[0.000057717254,0.000024894847,2.0439745e-7,0.00014847695,0.00001299945,0.000011066894,5.6309773e-7,0.2966974,9.2940485e-7,0.07325153,0.6295395,0.00025468154],"about_ca_topic_score_codex":0.0000021600517,"about_ca_topic_score_gemma":0.000025383813,"teacher_disagreement_score":0.29610443,"about_ca_system_score_codex":0.000028593253,"about_ca_system_score_gemma":0.00016399639,"threshold_uncertainty_score":0.7858745},"labels":[],"label_agreement":null},{"id":"W4281719745","doi":"10.1145/3526241.3530336","title":"A Novel 2T2R CR-based TCAM Design for High-speed and Energy-efficient Applications","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Great Lakes Symposium on VLSI 2022","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer architecture; Energy (signal processing); Embedded system; Physics","score_opus":0.014800759080312762,"score_gpt":0.21256295433311412,"score_spread":0.19776219525280136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281719745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010063305,0.00021369208,0.98094684,0.005524651,0.00039472146,0.0009662535,0.00005065975,0.0002504224,0.0015894404],"genre_scores_gemma":[0.94379145,0.000016475302,0.051837664,0.0009018378,0.00013240008,0.0012982518,0.000012961748,0.000046016674,0.0019629158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846274,0.000018826211,0.00026358737,0.0005271624,0.00044858662,0.0002791195],"domain_scores_gemma":[0.9990038,0.00014391968,0.0003035994,0.00025201924,0.00022741806,0.00006919583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049826445,0.00019233704,0.00020055563,0.00015009132,0.0008928072,0.00016071911,0.0009959977,0.000044847264,0.0000062466347],"category_scores_gemma":[0.000024499155,0.00015939934,0.00008260671,0.0008670359,0.00008393665,0.00012456905,0.00035020435,0.0001389394,4.8118e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000208867,0.00075473636,0.00015716236,0.00018592448,0.000054318465,2.9999185e-7,0.00088771887,0.63431257,0.12144012,0.22915785,0.0049713138,0.007869129],"study_design_scores_gemma":[0.0010464849,0.00044218198,0.000040115418,0.000043872566,0.00005327369,0.000015738098,0.00006537229,0.9497566,0.039999507,0.0023671533,0.0058757477,0.00029393475],"about_ca_topic_score_codex":0.000008157397,"about_ca_topic_score_gemma":6.322912e-7,"teacher_disagreement_score":0.93372816,"about_ca_system_score_codex":0.000102022175,"about_ca_system_score_gemma":0.000089365254,"threshold_uncertainty_score":0.6866842},"labels":[],"label_agreement":null},{"id":"W4285104669","doi":"10.1109/tnsm.2022.3181063","title":"A Learned Bloom Filter-Assisted Scheme for Packet Classification in Software-Defined Networking","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Bloom filter; Network packet; Tuple space; Hash function; Header; Packet forwarding; Hash table; Computer network; Tuple","score_opus":0.03887829327121172,"score_gpt":0.2502355229666417,"score_spread":0.21135722969542997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285104669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021698528,0.00014923951,0.99282,0.0025961967,0.00087278296,0.00061093475,0.0000044159906,0.0002682625,0.00050826103],"genre_scores_gemma":[0.7417713,0.0006582608,0.24960238,0.0049541225,0.00024364672,0.0016528951,0.00006260675,0.00006355357,0.0009912831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817944,0.00014407461,0.00034656766,0.0006103861,0.00027499683,0.0004445256],"domain_scores_gemma":[0.9991606,0.00014570741,0.00014082796,0.00042545117,0.00005330198,0.00007414345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005779295,0.00020947041,0.00020704577,0.00020056838,0.0008977091,0.00020260859,0.00043189173,0.00005715104,0.000016965932],"category_scores_gemma":[0.0000010260926,0.00023664077,0.000064493455,0.0015353652,0.000015896272,0.00022102689,0.000024976378,0.00025760423,0.0000036372423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012540996,0.00023070067,0.00007291477,0.00009953679,0.000054431053,0.000005847121,0.0003388902,0.63948166,0.000006948978,0.0011874597,0.0009616285,0.35743454],"study_design_scores_gemma":[0.0013475127,0.000158895,0.00061251863,0.0000817839,0.000041925457,0.000006407261,0.00017203209,0.978461,0.000008544928,0.0016862715,0.017115587,0.0003075101],"about_ca_topic_score_codex":0.000019453957,"about_ca_topic_score_gemma":0.00013865187,"teacher_disagreement_score":0.74321765,"about_ca_system_score_codex":0.00011220617,"about_ca_system_score_gemma":0.00003168904,"threshold_uncertainty_score":0.96499306},"labels":[],"label_agreement":null},{"id":"W4300521050","doi":"","title":"Algorithm and Architecture of Fully-Parallel Associative Memories Based on Sparse Clustered Networks","year":2014,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Associative property; Computer science; Parallel computing; Architecture; Content-addressable memory; Computer architecture; Algorithm; Artificial intelligence; Mathematics; Artificial neural network; History","score_opus":0.006234172587318105,"score_gpt":0.19570148566777965,"score_spread":0.18946731308046155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300521050","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.0013984556,0.00016100152,0.9856323,0.003971658,0.00009499875,0.00012748044,0.000003699427,0.00012381934,0.008486558],"genre_scores_gemma":[0.33318323,0.000049012193,0.6655506,0.0002539362,0.000023754503,0.000010986522,0.000037884343,0.000014431535,0.0008762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964038,0.0023873362,0.0002686023,0.0004121995,0.00028910578,0.00023896157],"domain_scores_gemma":[0.99655575,0.0014296413,0.0003374358,0.0008052826,0.00076688,0.00010503665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027689082,0.00016969739,0.00022912762,0.00010785683,0.00027128696,0.00022668333,0.0006331738,0.000107042724,0.000006874095],"category_scores_gemma":[0.0005793997,0.00016196701,0.00006013623,0.00047101078,0.00015712557,0.00016419232,0.00022043887,0.00021189394,0.00000231838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020190333,0.00031626175,0.0010450145,0.0000439714,0.00003405647,0.0000012622895,0.0063244067,0.0616105,0.00006135516,0.039277438,0.00047629126,0.8907893],"study_design_scores_gemma":[0.0005336289,0.0000020273253,0.0011154241,0.0003050362,0.000009318201,0.0000019450138,0.000018589668,0.9916853,0.001828073,0.0032866288,0.0010497266,0.00016434767],"about_ca_topic_score_codex":0.00003756973,"about_ca_topic_score_gemma":0.000092998,"teacher_disagreement_score":0.93007475,"about_ca_system_score_codex":0.00002956289,"about_ca_system_score_gemma":0.00006527638,"threshold_uncertainty_score":0.6604823},"labels":[],"label_agreement":null},{"id":"W4379231030","doi":"10.23977/jeis.2023.080204","title":"Analysis of Computer Network Security and Prevention Technology","year":2023,"lang":"en","type":"article","venue":"Journal of Electronics and Information Science","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Firewall (physics); Application firewall; Context-based access control; Computer science; DMZ; Computer security; Internet security; Network security; Stateful firewall; Network packet; Computer network; Security service; Information security; Business","score_opus":0.005327807289168493,"score_gpt":0.2485213227727579,"score_spread":0.24319351548358942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379231030","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.28713506,0.00034304714,0.7117663,0.0004532251,0.00010239418,0.000033118085,2.3670643e-7,0.000019945013,0.00014668347],"genre_scores_gemma":[0.982702,0.0012877941,0.015924444,0.0000613092,0.00001935727,3.6711893e-7,9.369349e-7,7.3480834e-7,0.0000030399844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992086,0.000012274076,0.0003199388,0.00006263451,0.0002456103,0.00015089351],"domain_scores_gemma":[0.999021,0.000026347776,0.00044111165,0.00008735258,0.00038556277,0.00003863222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001431136,0.000041334064,0.0001295453,0.0009498891,0.000132676,0.00015012246,0.00024361936,0.000030107212,5.6140897e-7],"category_scores_gemma":[0.000036203302,0.000034011875,0.000025757821,0.0058016307,0.00010034007,0.003527635,0.00009716841,0.00008841837,3.5252026e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001663858,0.000023341929,0.007861722,0.000041088962,0.00012781593,9.229516e-7,0.002861383,0.2762214,0.00016809229,0.22058843,0.00047616454,0.491613],"study_design_scores_gemma":[0.000111067005,0.00017237972,0.0049020494,0.000017409806,0.000027646136,0.000014175059,0.000027106555,0.9841885,0.00010930685,0.009552166,0.0008380885,0.000040101535],"about_ca_topic_score_codex":2.837575e-7,"about_ca_topic_score_gemma":8.028886e-7,"teacher_disagreement_score":0.7079671,"about_ca_system_score_codex":0.00001877863,"about_ca_system_score_gemma":0.00015960005,"threshold_uncertainty_score":0.27874914},"labels":[],"label_agreement":null},{"id":"W4385221119","doi":"10.23919/ifipnetworking57963.2023.10186433","title":"On the (dis)Advantages of Programmable NICs for Network Security Services","year":2023,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Cummings Foundation","keywords":"Computer science; Server; Overhead (engineering); Cryptography; Embedded system; Key (lock); Operating system; Multi-core processor; Interface (matter); Network processor; Computer network; Computer security","score_opus":0.011436902492897307,"score_gpt":0.25499833223803486,"score_spread":0.24356142974513756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385221119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031037882,0.00025430467,0.9536816,0.0045958934,0.0007230715,0.0007950538,0.000003933376,0.00096479466,0.00794346],"genre_scores_gemma":[0.9420981,0.000120873534,0.054691073,0.0009344752,0.00021609389,0.00009594873,0.000022735676,0.000017416936,0.0018032995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930096,0.00002811599,0.00012747885,0.00017717852,0.00013688437,0.00022937627],"domain_scores_gemma":[0.9992477,0.0002835569,0.00007737989,0.0002861961,0.00007971983,0.000025417965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047659487,0.00007195355,0.00008715331,0.000025070904,0.00018328973,0.00011542561,0.00047368585,0.000033056393,0.000004889758],"category_scores_gemma":[0.000014020029,0.000044844983,0.00003925024,0.0007054021,0.000020990303,0.0001667105,0.00009993958,0.000048045895,0.000011249481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028935492,0.00008670258,0.0010226136,0.00027654838,0.000034655226,0.0000012976234,0.0014009334,0.21523258,0.000012996057,0.7011956,0.03866112,0.042045992],"study_design_scores_gemma":[0.00009795297,0.00007056294,0.00005394666,0.000044184002,0.0000034970933,3.6246024e-7,0.00005189956,0.89383984,0.00029723457,0.1006682,0.004806069,0.00006627989],"about_ca_topic_score_codex":0.0000056528656,"about_ca_topic_score_gemma":0.00001932895,"teacher_disagreement_score":0.9110602,"about_ca_system_score_codex":0.000005266456,"about_ca_system_score_gemma":0.000021839955,"threshold_uncertainty_score":0.18287253},"labels":[],"label_agreement":null},{"id":"W4386242165","doi":"10.1109/infocom53939.2023.10229089","title":"Search in the Expanse: Towards Active and Global IPv6 Hitlists","year":2023,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"IPv6; Prefix; Computer science; Alias; IPv6 address; The Internet; Scale (ratio); Quality (philosophy); Heuristic; World Wide Web; Information retrieval; Computer network; Data mining; Artificial intelligence; Geography","score_opus":0.027576039073054386,"score_gpt":0.30578487801128806,"score_spread":0.27820883893823367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386242165","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.43840647,0.00014642993,0.4867101,0.016807895,0.0003138655,0.00026377058,0.0000028482186,0.0005461247,0.056802496],"genre_scores_gemma":[0.9935882,0.0000408671,0.005563192,0.0003876474,0.00003351401,0.0000067127107,0.0000020976984,0.0000020249574,0.00037576226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937767,0.000059195074,0.00005990562,0.00016825134,0.00017364009,0.00016132474],"domain_scores_gemma":[0.9997481,0.00004164686,0.000010406163,0.00014912657,0.000026195845,0.000024487448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027469292,0.000048419333,0.000047261205,0.000032348315,0.000073038085,0.00018081447,0.0003073191,0.00002604866,0.0000032161797],"category_scores_gemma":[0.0000143064235,0.000031591437,0.000009056766,0.0010178683,0.000027344564,0.00022818406,0.0001153979,0.00005967234,0.000019093179],"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.00001135432,0.000038899812,0.0039932006,0.000019034202,0.000006572778,0.000040090144,0.008747041,0.0047316123,0.000014212614,0.038585797,0.008013902,0.9357983],"study_design_scores_gemma":[0.00045681975,0.000065293374,0.11786716,0.000030771233,0.000002508262,0.000028817358,0.001177425,0.8649511,0.0004227653,0.01350562,0.0012872723,0.00020445112],"about_ca_topic_score_codex":0.00006635139,"about_ca_topic_score_gemma":0.000036379577,"teacher_disagreement_score":0.93559384,"about_ca_system_score_codex":0.000020066922,"about_ca_system_score_gemma":0.00004984794,"threshold_uncertainty_score":0.17435981},"labels":[],"label_agreement":null},{"id":"W4386736466","doi":"10.1109/tdsc.2023.3315457","title":"SwiftParade: Anti-Burst Multipath Validation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Network packet; Multipath propagation; Overhead (engineering); Computer network; Encryption; Network topology; Reliability (semiconductor); Distributed computing; Algorithm; Channel (broadcasting)","score_opus":0.018848902036462726,"score_gpt":0.2532331007049002,"score_spread":0.23438419866843746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386736466","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.101405546,0.000059448063,0.89656866,0.0003056732,0.00069168996,0.000107372354,0.0000028486763,0.0006647554,0.00019398965],"genre_scores_gemma":[0.9858488,0.00009562445,0.0136475535,0.00010053799,0.000076072385,0.0000047770354,0.0000073431943,0.000016924632,0.00020235544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.00006711731,0.00022625377,0.0004443888,0.00022968672,0.00033421983],"domain_scores_gemma":[0.99935365,0.0001495505,0.00008221994,0.00025267393,0.000067693596,0.00009421804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003217254,0.00016691064,0.00016730592,0.00022886832,0.0006874609,0.00031658006,0.00025021067,0.00009413834,0.000005501616],"category_scores_gemma":[0.000005341388,0.00016592913,0.000052155192,0.0010159606,0.000026580321,0.00045353046,0.000006791517,0.00023322488,0.000059875536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006504706,0.00006774451,0.00012106701,0.000046036967,0.000024418787,0.000025417774,0.0012542746,0.86000156,0.00040852625,0.00053717295,0.0002881066,0.13721916],"study_design_scores_gemma":[0.00034507635,0.000049450828,0.00017544963,0.00007637567,0.000011575317,0.000030323821,0.000055216566,0.9912039,0.007192327,0.00028332823,0.00037005608,0.00020691167],"about_ca_topic_score_codex":0.00001370878,"about_ca_topic_score_gemma":0.0000049958076,"teacher_disagreement_score":0.8844433,"about_ca_system_score_codex":0.000022363192,"about_ca_system_score_gemma":0.000039839975,"threshold_uncertainty_score":0.6766394},"labels":[],"label_agreement":null},{"id":"W4388838011","doi":"10.1109/les.2023.3334288","title":"DSCAM: Latency-Guaranteed and High-Capacity Content-Addressable Memory on FPGAs","year":2023,"lang":"en","type":"article","venue":"IEEE Embedded Systems Letters","topic":"Network Packet Processing and Optimization","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Field-programmable gate array; Latency (audio); Lookup table; Throughput; Embedded system; Parallel computing; Computer architecture; Computer hardware; Operating system","score_opus":0.050077750816771106,"score_gpt":0.23056301213602207,"score_spread":0.18048526131925097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388838011","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.77205616,0.0001506448,0.21689324,0.0023200526,0.005697685,0.0004913374,0.00001006741,0.0012778429,0.0011029609],"genre_scores_gemma":[0.995032,0.000022279904,0.0013324064,0.0018408592,0.00039941107,0.00005057584,0.000008423564,0.000031687283,0.0012823273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997696,0.00026770163,0.0003891392,0.0006340119,0.0004800683,0.0005331074],"domain_scores_gemma":[0.99877375,0.00019620027,0.0001993665,0.0006129595,0.0000852202,0.00013251464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084364286,0.00026466823,0.00035840893,0.00024300776,0.00030532628,0.000480647,0.0005311858,0.0001187332,0.0000029209798],"category_scores_gemma":[0.000038351573,0.00023741252,0.00006127565,0.0007403618,0.00011594507,0.00046388424,0.00006714956,0.00023009737,0.00021820593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010146544,0.00015459204,0.000990698,0.00076524477,0.00026660084,0.00040873574,0.00707747,0.56661874,0.09674882,0.011556045,0.3070876,0.008223977],"study_design_scores_gemma":[0.0016090134,0.0001233508,0.0004888047,0.000642044,0.000026713396,0.00007192062,0.0002825965,0.9895491,0.005342866,0.00027359836,0.0008510972,0.00073889905],"about_ca_topic_score_codex":0.000114678405,"about_ca_topic_score_gemma":0.0000042175807,"teacher_disagreement_score":0.42293036,"about_ca_system_score_codex":0.000055598284,"about_ca_system_score_gemma":0.00002757072,"threshold_uncertainty_score":0.9681402},"labels":[],"label_agreement":null},{"id":"W4393141812","doi":"10.1109/hpcc-dss-smartcity-dependsys60770.2023.00050","title":"DSCAM+: Latency-Guaranteed FPGA-Based Content Addressable Memory for SDN-Enabled Forwarding Plane","year":2023,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Forwarding plane; Computer science; Latency (audio); Field-programmable gate array; Computer network; Content-addressable memory; CAS latency; Embedded system; Computer hardware; Semiconductor memory; Memory controller; Telecommunications; Artificial neural network","score_opus":0.05588157631670607,"score_gpt":0.2605625583185832,"score_spread":0.20468098200187715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393141812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044479547,0.00009447808,0.9860187,0.0010269578,0.00068531267,0.00044683626,0.0000072627913,0.0012945842,0.005977873],"genre_scores_gemma":[0.79111856,0.0000372974,0.17614254,0.0022692203,0.0003602549,0.00029771533,0.00018407985,0.000072295814,0.029518032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983214,0.000042827847,0.00031315014,0.00048195105,0.000275753,0.0005648941],"domain_scores_gemma":[0.9989105,0.00026860254,0.00011709741,0.00041375845,0.00018718436,0.000102869126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067086925,0.00018808589,0.0002601933,0.00019797194,0.0003508107,0.00029935673,0.00058881746,0.00009383614,0.000032821976],"category_scores_gemma":[0.00007603167,0.00016000244,0.00010885526,0.00086211873,0.00003821748,0.00040836772,0.00009746933,0.000093771676,0.00010061898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032548432,0.00027026163,0.00093119015,0.0006948491,0.00018789693,0.000080826074,0.0012875316,0.6604555,0.004995373,0.025969775,0.22269845,0.08210285],"study_design_scores_gemma":[0.001412014,0.00009430995,0.000046241406,0.00009368136,0.000014631044,0.0000041943017,0.000095956224,0.98290884,0.011738057,0.0012155579,0.0021174527,0.00025903783],"about_ca_topic_score_codex":0.000023713765,"about_ca_topic_score_gemma":0.000012116376,"teacher_disagreement_score":0.8098762,"about_ca_system_score_codex":0.000038837083,"about_ca_system_score_gemma":0.00012437186,"threshold_uncertainty_score":0.652471},"labels":[],"label_agreement":null},{"id":"W4399115506","doi":"10.48550/arxiv.2405.16325","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Mechanical Engineering, University of Texas at Austin; Alliance de recherche numérique du Canada; DeepMind; Canada Research Chairs; University of Texas at Austin; National Science Foundation","keywords":"Adapter (computing); Rank (graph theory); Computer science; Psychology; Mathematics; Combinatorics; Computer hardware","score_opus":0.07694164391039529,"score_gpt":0.1976297395737091,"score_spread":0.12068809566331382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399115506","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.10700507,0.00044030303,0.86886567,0.00015786203,0.0017621488,0.00036604886,0.000011783306,0.00056478096,0.020826329],"genre_scores_gemma":[0.98675483,0.0001741901,0.008930844,0.000073085044,0.00013788379,0.0000013056392,0.00002092631,0.0000333525,0.003873603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785435,0.00008362634,0.00032256806,0.0011811834,0.00016440595,0.00039385541],"domain_scores_gemma":[0.99814284,0.000070039794,0.00033010638,0.001075513,0.00022999132,0.00015150185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000359445,0.00036569973,0.000449481,0.00035038384,0.00012183642,0.00023863929,0.0015806529,0.00036696746,0.000034895573],"category_scores_gemma":[0.000013797069,0.00040411807,0.0002228528,0.0010274483,0.00014182822,0.00036377634,0.0021535975,0.00074032514,0.00007195191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099897996,0.000050376977,0.00012301054,0.0004424388,0.0001227665,0.00022874973,0.0014519308,0.92790586,0.000019936915,0.06622057,0.00059447123,0.0027399673],"study_design_scores_gemma":[0.00080471265,0.00004462931,0.00003720747,0.0008388981,0.00010655391,0.0000050674234,0.00006545623,0.9782819,0.0002719643,0.018821182,0.0002714877,0.00045094357],"about_ca_topic_score_codex":0.00006488863,"about_ca_topic_score_gemma":0.000026947233,"teacher_disagreement_score":0.8797497,"about_ca_system_score_codex":0.00017001404,"about_ca_system_score_gemma":0.0004886379,"threshold_uncertainty_score":0.9998411},"labels":[],"label_agreement":null},{"id":"W4401769134","doi":"10.18280/isi.290429","title":"Evaluating Bandwidth Management Techniques on Mikrotik Routers: A Multiple Linear Regression Approach","year":2024,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bandwidth (computing); Linear regression; Computer science; Regression; Computer network; Engineering; Mathematics; Statistics; Machine learning","score_opus":0.031302332844287135,"score_gpt":0.293867238662986,"score_spread":0.26256490581869885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401769134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030634785,0.00019062126,0.97315294,0.0000745069,0.00040502436,0.0004652702,0.0000025169616,0.0012846452,0.021361025],"genre_scores_gemma":[0.5127597,0.000057104335,0.4864168,0.00019588786,0.00012146238,0.0001485148,0.00008164505,0.000014479445,0.00020440407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984232,0.000085010404,0.00046628836,0.0002814274,0.00046057496,0.00028345466],"domain_scores_gemma":[0.99917775,0.000073338066,0.00016474571,0.00038148728,0.00014000454,0.0000626653],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000872826,0.00021192525,0.0001571505,0.00040248132,0.0003255125,0.0010645824,0.0004074336,0.00010524055,0.0000038301314],"category_scores_gemma":[0.00007630624,0.00017114394,0.000067575376,0.00081248494,0.00004401166,0.003905646,0.0001518072,0.00017578671,0.00006887892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021223419,0.000029473345,0.000040940613,0.0008135937,0.000027387754,0.000004089658,0.004708828,0.017471794,0.00002881689,0.008185813,0.0010778634,0.96759015],"study_design_scores_gemma":[0.0001851308,0.00013369849,0.00007006291,0.0014369293,0.000012180583,0.00001951607,0.00017782125,0.99129456,0.0014006806,0.0021787395,0.002870471,0.00022023272],"about_ca_topic_score_codex":0.0000067107826,"about_ca_topic_score_gemma":3.3414753e-7,"teacher_disagreement_score":0.9738227,"about_ca_system_score_codex":0.00023870713,"about_ca_system_score_gemma":0.00005073453,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W4405564895","doi":"10.1016/j.jss.2024.112307","title":"COMET: Generating commit messages using delta graph context representation","year":2024,"lang":"en","type":"article","venue":"Journal of Systems and Software","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Commit; Comet; Context (archaeology); Representation (politics); Computer science; Graph; Delta; Theoretical computer science; Engineering; Astrobiology; Geology; Physics; Database; Aerospace engineering; Political science","score_opus":0.033878428124723824,"score_gpt":0.2861078364238319,"score_spread":0.2522294082991081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405564895","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.06466331,0.024483927,0.909381,0.00011651677,0.0012438212,0.000045697325,0.0000013110472,0.000047949805,0.000016517757],"genre_scores_gemma":[0.9448072,0.00021065213,0.054444548,0.000047987203,0.00039974053,9.0499003e-7,0.0000011259053,0.000009136711,0.00007874757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990766,0.00009127152,0.00037550778,0.00013004783,0.00022233077,0.000104243016],"domain_scores_gemma":[0.99925405,0.0001319093,0.00022841182,0.0001098626,0.00021324397,0.00006253999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053554197,0.00008208061,0.00019011917,0.00015780548,0.00017532067,0.0008827182,0.00015592606,0.000046613477,0.0000010722983],"category_scores_gemma":[0.0000497067,0.000063384556,0.00005184423,0.00033446672,0.000021003605,0.00077066995,0.000038919978,0.00013127587,4.7646674e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002770211,0.00008333487,0.03685078,0.0015831699,0.0004805484,0.00058411603,0.011490475,0.44554892,0.0014492741,0.009757149,0.01457699,0.47756752],"study_design_scores_gemma":[0.00026439037,0.000077777906,0.0002475789,0.0014466072,0.000037194648,0.00085954566,0.0005566252,0.9945007,0.00010187068,0.00060583715,0.0011527363,0.00014914898],"about_ca_topic_score_codex":0.000034290944,"about_ca_topic_score_gemma":0.0000032705088,"teacher_disagreement_score":0.8801438,"about_ca_system_score_codex":0.000025944348,"about_ca_system_score_gemma":0.000060109218,"threshold_uncertainty_score":0.8512072},"labels":[],"label_agreement":null},{"id":"W4409894979","doi":"10.3390/electronics14091765","title":"HLSCAM: Fine-Tuned HLS-Based Content Addressable Memory Implementation for Packet Processing on FPGA","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Content-addressable memory; Embedded system; Computer architecture; Computer hardware","score_opus":0.028493882038514724,"score_gpt":0.30766072146500445,"score_spread":0.27916683942648973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409894979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005678073,0.0026010934,0.9861322,0.003039085,0.0002908598,0.0005913325,0.0000047296785,0.00028633096,0.0013763021],"genre_scores_gemma":[0.92319673,0.000118355085,0.066819035,0.0047311867,0.00021961772,0.0004878988,0.0002520346,0.000050314855,0.004124828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847174,0.000054161042,0.00028983885,0.00044254743,0.00021761257,0.0005240827],"domain_scores_gemma":[0.99909693,0.00011673619,0.00016673378,0.0003248305,0.00024539375,0.00004939563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004123217,0.00018208937,0.00018445155,0.0001445769,0.00037702252,0.00029066796,0.00041532656,0.00007572857,0.000009583489],"category_scores_gemma":[0.000047351885,0.00017634605,0.00006901941,0.0005954416,0.000023443632,0.00031456893,0.000039357343,0.00015018373,0.0000049524965],"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.00015793875,0.00018994795,0.00013768261,0.0002118146,0.000041970423,0.000001454106,0.00023802592,0.017579766,0.0013225705,0.019192772,0.02369002,0.937236],"study_design_scores_gemma":[0.0046845167,0.0009136191,0.00018183001,0.00033691587,0.00007185384,0.000002082036,0.00012200666,0.7028549,0.23854461,0.01076803,0.0408996,0.0006200485],"about_ca_topic_score_codex":0.000004172989,"about_ca_topic_score_gemma":0.000084590465,"teacher_disagreement_score":0.936616,"about_ca_system_score_codex":0.00021798453,"about_ca_system_score_gemma":0.000742322,"threshold_uncertainty_score":0.7191183},"labels":[],"label_agreement":null},{"id":"W4411143146","doi":"10.1109/mnet.2025.3577627","title":"Enabling Scalability and Flexibility Into Network Routing Protocol Using Behavior Tree","year":2025,"lang":"en","type":"article","venue":"IEEE Network","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Key Research and Development Program of China","keywords":"Computer science; Computer network; Scalability; Routing protocol; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Flexibility (engineering); Protocol (science); Routing (electronic design automation); Distributed computing; Dynamic Source Routing; Hierarchical routing; Wireless Routing Protocol","score_opus":0.02780907083687121,"score_gpt":0.32014787248153914,"score_spread":0.2923388016446679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411143146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038200833,0.00026635895,0.93964803,0.00016658701,0.0028302905,0.016865974,3.517327e-7,0.0005573918,0.0014641765],"genre_scores_gemma":[0.64041406,0.000009627276,0.34059024,0.00073327887,0.0050323806,0.012893555,0.000003949732,0.000042571293,0.00028037082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739736,0.0002678016,0.0005593597,0.0008604596,0.00023932756,0.00067567633],"domain_scores_gemma":[0.9985191,0.00022321113,0.00021142281,0.00074691285,0.00017308017,0.00012622359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016251391,0.00027197198,0.00033806625,0.00006149244,0.00091247156,0.0005090284,0.0005335879,0.00018250936,0.000002292944],"category_scores_gemma":[0.00007191964,0.00026538852,0.000075271164,0.0016038427,0.00014095419,0.0005572926,0.0003294528,0.00032090198,0.0000020131388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000816095,0.00013468642,0.06203155,0.00015695585,0.000026281346,0.0000073639117,0.0003210524,0.70454687,0.00008096477,0.0017314323,0.0021265259,0.22875473],"study_design_scores_gemma":[0.0006657352,0.000055983994,0.0060978807,0.0004989623,0.00004485298,0.000007115599,0.000012839189,0.96278423,0.00024415032,0.026712831,0.0024713143,0.00040412837],"about_ca_topic_score_codex":0.00005160877,"about_ca_topic_score_gemma":0.00006952608,"teacher_disagreement_score":0.6022132,"about_ca_system_score_codex":0.00015409019,"about_ca_system_score_gemma":0.00021447553,"threshold_uncertainty_score":0.99997985},"labels":[],"label_agreement":null},{"id":"W4415933928","doi":"10.1109/nof66640.2025.11223326","title":"Using Path Identifiers for Efficient Loop-Free Routing in Computer Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Identifier; Equal-cost multi-path routing; Private Network-to-Network Interface; Link-state routing protocol; Open Shortest Path First; Static routing; Path (computing); Shortest path problem; Routing (electronic design automation)","score_opus":0.021594589782584557,"score_gpt":0.27673461072336625,"score_spread":0.2551400209407817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415933928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053885314,0.00090730545,0.9860414,0.0003960752,0.005637084,0.0007396153,0.0000018064467,0.00013783731,0.0007502969],"genre_scores_gemma":[0.59128743,0.00004522087,0.4063935,0.0009027525,0.00043281235,0.000017737793,0.0000071427385,0.000026939684,0.0008864805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963125,0.00017984043,0.0009989288,0.0011488306,0.00030905494,0.0010508632],"domain_scores_gemma":[0.99794364,0.000335486,0.00031907394,0.0009504688,0.00032735814,0.00012396915],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016595544,0.0003999335,0.00048551805,0.0004132806,0.00066358893,0.0014443831,0.0013565995,0.00028447152,0.000009305106],"category_scores_gemma":[0.00010264459,0.0004225969,0.00018284953,0.0025362193,0.000117648364,0.00041309136,0.0010172712,0.000347503,0.0000025410766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025677326,0.00012630814,0.0007013698,0.00010158419,0.000025446769,0.000005493281,0.00041247645,0.8733261,0.000004834715,0.010006033,0.0013888851,0.113875754],"study_design_scores_gemma":[0.0016011389,0.000048543676,0.00014920627,0.0013166569,0.00004574908,0.000003507499,0.00005748274,0.9948564,0.000053902426,0.0014108716,0.000043232187,0.00041331185],"about_ca_topic_score_codex":0.00006403916,"about_ca_topic_score_gemma":0.000036217065,"teacher_disagreement_score":0.5858989,"about_ca_system_score_codex":0.0003020062,"about_ca_system_score_gemma":0.0003970672,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W4416004483","doi":"10.1145/3731599.3767460","title":"SmartNIC Data Exchange Framework","year":2025,"lang":"","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Leverage (statistics); Data exchange; Variety (cybernetics); Field (mathematics); Context (archaeology); Big data; Interface (matter)","score_opus":0.04544818903282006,"score_gpt":0.3242539326110232,"score_spread":0.27880574357820315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416004483","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.000026475496,0.010260707,0.9019541,0.0072246594,0.003972335,0.00016846087,0.000005540189,0.00024594128,0.07614178],"genre_scores_gemma":[0.16499844,0.004756062,0.7154346,0.010163665,0.0010776351,0.000015973803,0.000086434855,0.000031831634,0.10343537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734896,0.0001466306,0.0004322908,0.0012081731,0.0003053374,0.00055859395],"domain_scores_gemma":[0.9957191,0.00026745567,0.00013374626,0.0035922576,0.00016649887,0.00012097881],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008289259,0.00026931186,0.00027621147,0.00019315629,0.00046655332,0.0012154912,0.003912658,0.0002843153,0.00050916104],"category_scores_gemma":[0.00025394882,0.0002632395,0.000048196525,0.0025246046,0.00011575781,0.0012708008,0.003329356,0.00041049905,0.000246731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091644715,0.00012404656,0.0004177197,0.00018188266,0.000050861952,0.000006185343,0.000372382,0.0009169552,9.424658e-7,0.0912827,0.1326039,0.77403325],"study_design_scores_gemma":[0.00019365647,0.000028927223,0.00016001328,0.00061459956,0.000043311622,0.0000020630605,0.000023387263,0.8902179,0.000033006265,0.021844005,0.08657699,0.00026215726],"about_ca_topic_score_codex":0.000021860855,"about_ca_topic_score_gemma":0.000022504388,"teacher_disagreement_score":0.88930094,"about_ca_system_score_codex":0.0000484557,"about_ca_system_score_gemma":0.00047135394,"threshold_uncertainty_score":0.999982},"labels":[],"label_agreement":null},{"id":"W56021634","doi":"10.3233/978-1-60750-629-4-229","title":"Network Security: Formal and Optimized Configuration","year":2010,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Computer security","score_opus":0.020303401633908938,"score_gpt":0.24512133240157485,"score_spread":0.22481793076766593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56021634","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.000004005444,0.0014226458,0.960034,0.0004333088,0.0003457479,0.0004679936,0.0000046719447,0.00007938909,0.037208248],"genre_scores_gemma":[0.020614391,0.008703666,0.94323677,0.0010140848,0.002199561,0.0005653965,0.00025257503,0.00009961906,0.023313928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986555,0.000014095565,0.00042890993,0.00050061924,0.00013848979,0.00026241268],"domain_scores_gemma":[0.99923134,0.000051325645,0.00020595365,0.00032919736,0.00008779251,0.00009441622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002863544,0.00022320483,0.00027687463,0.00014559725,0.0003424065,0.00030760356,0.00030138635,0.00034196064,0.000013376441],"category_scores_gemma":[0.000008548351,0.00023865378,0.000033801734,0.000139576,0.00022448375,0.00038726526,0.00011759851,0.0004685027,0.000011822497],"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.00000818013,0.000010697444,0.0000066272446,0.000014988178,0.0000070515785,9.3166983e-7,0.00019728344,0.0016188413,0.000003047258,0.60992134,0.0004608456,0.38775015],"study_design_scores_gemma":[0.00002947366,0.000021201895,0.0000021144122,0.000059280246,0.000016509115,0.0000051016364,0.000032360706,0.17316793,0.000115451025,0.7884313,0.0378578,0.0002614825],"about_ca_topic_score_codex":0.0000043814466,"about_ca_topic_score_gemma":0.000023215352,"teacher_disagreement_score":0.38748866,"about_ca_system_score_codex":0.000021702133,"about_ca_system_score_gemma":0.000062014886,"threshold_uncertainty_score":0.9732019},"labels":[],"label_agreement":null},{"id":"W6892762830","doi":"10.5281/zenodo.12623802","title":"Read online: De pierre et d'os","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"CONQUEST; Order (exchange); Western europe","score_opus":0.04645686348917537,"score_gpt":0.28102378844687015,"score_spread":0.23456692495769477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892762830","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037312733,0.0028815847,0.22782512,0.0040195794,0.0007314595,0.0003663525,0.00022351941,0.0019307816,0.7619843],"genre_scores_gemma":[0.0030578778,0.0022389377,0.024079572,0.0012781024,0.0016720422,9.154887e-8,0.003191414,0.010866379,0.9536156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966005,0.0007577321,0.0003931411,0.001013851,0.0005200404,0.00071470026],"domain_scores_gemma":[0.99793696,0.000035688096,0.00022874067,0.000864364,0.0006070065,0.00032724623],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010690229,0.00038061358,0.00029620383,0.00043339186,0.0012526119,0.004297263,0.0022569802,0.0003111084,0.048740767],"category_scores_gemma":[0.0005737725,0.00041425278,0.00011378109,0.0013551598,0.00025417478,0.00042651023,0.0022456627,0.00093468884,0.04555474],"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.000012308735,0.00015966194,4.439793e-7,0.0003338282,0.00006615421,0.00006925462,0.0025264628,0.0009654264,0.000059424394,0.031494293,0.6061619,0.35815087],"study_design_scores_gemma":[0.00025266805,0.00017796535,0.000042432865,0.00078420737,0.00004855933,0.00033924312,0.00009643613,0.046255924,0.000016169994,0.0016302163,0.94995356,0.00040259468],"about_ca_topic_score_codex":0.000029742492,"about_ca_topic_score_gemma":0.0000027312349,"teacher_disagreement_score":0.35774827,"about_ca_system_score_codex":0.00033552168,"about_ca_system_score_gemma":0.000038572376,"threshold_uncertainty_score":0.9998309},"labels":[],"label_agreement":null},{"id":"W6892775603","doi":"10.5281/zenodo.12061700","title":"medical textiles pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Paraphernalia; Fusible alloy; Work (physics); Medical care; Articular cartilage damage","score_opus":0.019282773749915987,"score_gpt":0.2455371287645673,"score_spread":0.2262543550146513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892775603","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.3655674e-7,0.00080314465,0.15218797,0.0008263895,0.00037843568,0.00015096582,0.000024225854,0.002757949,0.84287035],"genre_scores_gemma":[0.00047208817,0.00062541926,0.004245985,0.00033855313,0.00096451805,4.7566807e-8,0.0008537198,0.007546183,0.98495346],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979297,0.00019816401,0.00020968917,0.00063704903,0.00068682036,0.00033857586],"domain_scores_gemma":[0.99886817,0.00001266273,0.0001117528,0.000616383,0.0001654651,0.00022559131],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005493422,0.00019888631,0.00018058142,0.00040112526,0.0005709804,0.0018202434,0.0023334105,0.0002292057,0.08041503],"category_scores_gemma":[0.00027553647,0.00019427216,0.000057434252,0.0007764284,0.00013208852,0.00015282781,0.0018096685,0.0004323311,0.14379439],"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.0000015662072,0.000029637704,2.8735617e-8,0.000108432054,0.000026399975,0.000031028147,0.00016196413,0.000011943499,0.0000031182317,0.007391555,0.85678977,0.13544454],"study_design_scores_gemma":[0.00012796065,0.000049618317,8.2076247e-7,0.00033226734,0.00001019627,0.00011147664,0.000014166667,0.0074297097,0.000006265247,0.0006688247,0.9910412,0.00020748848],"about_ca_topic_score_codex":0.0000071038476,"about_ca_topic_score_gemma":4.715063e-7,"teacher_disagreement_score":0.14794199,"about_ca_system_score_codex":0.00006762453,"about_ca_system_score_gemma":0.000011513185,"threshold_uncertainty_score":0.99921596},"labels":[],"label_agreement":null},{"id":"W6946211077","doi":"10.3389/fmed.2022.997277.s001","title":"Data_Sheet_1_Decision making under uncertainty in the diagnosis and management of Alzheimer's Disease in primary care: A study protocol applying concepts from neuroeconomics.pdf","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Protocol (science); Primary care; Disease; Disease management; MEDLINE; Risk management","score_opus":0.06275428352234723,"score_gpt":0.3375551680541819,"score_spread":0.27480088453183465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946211077","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020864678,0.0004288684,0.000018143248,0.000021110094,0.000053117343,0.041461915,0.957953,0.000015769256,0.000027230479],"genre_scores_gemma":[0.00028309744,0.000028146516,0.00019933151,0.00026354587,0.000024198598,0.19514114,0.8040491,0.000010700648,7.7305623e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978404,0.00030604677,0.00047177688,0.0007778465,0.00038927936,0.00021466725],"domain_scores_gemma":[0.99828225,0.00029213275,0.00037656853,0.00097613176,0.000029109218,0.00004381325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001910198,0.00025875014,0.0003181621,0.00017094704,0.0001291868,0.00032975423,0.0015377323,0.000058339017,0.007369486],"category_scores_gemma":[0.00003380414,0.00022479893,0.000040328283,0.0004587519,0.000011557338,0.00033277954,0.001863144,0.00034678873,0.00001712154],"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.000053171214,0.00030247887,0.00029080073,0.0007570511,0.00003736463,0.0002510742,0.0004052641,0.052820943,5.552964e-9,0.000002317712,0.9206434,0.024436116],"study_design_scores_gemma":[0.0025568006,0.00017670903,0.018720873,0.006936284,0.00012217514,0.0000018811855,0.0009213878,0.020339163,2.3773964e-7,0.00014091976,0.94936866,0.0007148894],"about_ca_topic_score_codex":0.000098898236,"about_ca_topic_score_gemma":0.00014272814,"teacher_disagreement_score":0.15390392,"about_ca_system_score_codex":0.00013041029,"about_ca_system_score_gemma":0.00012395695,"threshold_uncertainty_score":0.9935379},"labels":[],"label_agreement":null},{"id":"W6976822200","doi":"10.60692/dsx85-ay933","title":"Additional file 5 of QKI degradation in macrophage by RNF6 protects mice from MRSA infection via enhancing PI3K p110β dependent autophagy","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Network Packet Processing and Optimization","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":"McMaster University","funders":"","keywords":"Autophagy; Macrophage; PI3K/AKT/mTOR pathway; Degradation (telecommunications); Downregulation and upregulation; Proteolysis","score_opus":0.008706999620207843,"score_gpt":0.17318833434576655,"score_spread":0.1644813347255587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976822200","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.043533664,0.000011712133,0.91202134,0.000016370495,0.00043966112,0.00058447674,0.042299736,0.00031683056,0.0007762103],"genre_scores_gemma":[0.9756071,2.014925e-7,0.008352958,0.00007761212,0.000047177753,0.0008668914,0.014815125,0.000010069308,0.00022288796],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815255,0.00018477089,0.00068344106,0.00023759589,0.0005275029,0.00021416196],"domain_scores_gemma":[0.99879014,0.000067630666,0.0006835352,0.00026017198,0.00014550169,0.000053029908],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029367075,0.00015963109,0.00019271448,0.0003169665,0.00027618223,0.00017346973,0.00028395985,0.00007815456,0.01017797],"category_scores_gemma":[0.000045218752,0.00016880417,0.000047842215,0.00069479935,0.000013655114,0.0015334266,0.00016339356,0.000185356,0.00013182306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035244008,0.00017313036,0.005173051,0.0018786585,0.00022192096,0.000032496017,0.13658088,0.20303397,0.00070386997,0.00031499608,0.57533556,0.076198995],"study_design_scores_gemma":[0.0013935928,0.00017264586,0.0068896315,0.0005696192,0.000014018046,0.00005141744,0.0014818667,0.9696682,0.0107264165,0.00002690777,0.008434214,0.00057143363],"about_ca_topic_score_codex":0.000096696815,"about_ca_topic_score_gemma":0.0000045568113,"teacher_disagreement_score":0.9320734,"about_ca_system_score_codex":0.0003436154,"about_ca_system_score_gemma":0.0001069148,"threshold_uncertainty_score":0.9907269},"labels":[],"label_agreement":null},{"id":"W6977568172","doi":"10.6084/m9.figshare.c.6178585","title":"Acceptability and feasibility of community-based provision of urine pregnancy tests to support linkages to reproductive health services in Western Kenya: a qualitative analysis","year":2022,"lang":"en","type":"other","venue":"Figshare","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Referral; Focus group; Intervention (counseling); Qualitative research; Reproductive health; Health care; Pregnancy; Program evaluation; Prenatal care","score_opus":0.06954062672238281,"score_gpt":0.39403628889720427,"score_spread":0.32449566217482145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977568172","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087357156,0.0125196725,0.02080241,0.0075108674,0.0005525234,0.038656153,0.7994321,0.0027641526,0.030404946],"genre_scores_gemma":[0.7435524,0.000034234232,0.09127056,0.0017076385,0.00013797122,0.0017371785,0.1456178,0.00041773432,0.0155244665],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.997115,0.00116135,0.0005158327,0.0006569483,0.0003462117,0.00020465822],"domain_scores_gemma":[0.99728966,0.0002724664,0.000715677,0.0013788777,0.00023262837,0.00011069833],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008197693,0.00022710962,0.00071054726,0.0006097376,0.000081735656,0.000041411477,0.0008088371,0.00009305379,0.004545239],"category_scores_gemma":[0.0003791717,0.0002230979,0.00007623186,0.0023945072,0.000016816859,0.0001409001,0.00080885954,0.00029024624,0.000004873487],"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.00021500819,0.004653728,0.17939144,0.071104854,0.0006227505,0.00001296906,0.47895747,0.03210501,0.000008869703,0.000013196497,0.11945954,0.11345516],"study_design_scores_gemma":[0.0035903875,0.0098201735,0.8704133,0.04972298,0.0002851172,0.0000041015037,0.011602139,0.009289841,0.00053197826,0.00056223414,0.04107344,0.0031042835],"about_ca_topic_score_codex":0.00065973937,"about_ca_topic_score_gemma":0.0032806979,"teacher_disagreement_score":0.69102186,"about_ca_system_score_codex":0.00011401042,"about_ca_system_score_gemma":0.00027649297,"threshold_uncertainty_score":0.9963647},"labels":[],"label_agreement":null},{"id":"W6980492542","doi":"","title":"CBD Energy Secures US$25 Million Line of Credit Sufficient for CBD to generate A$35 million in revenue per quarter developing European solar projects","year":2012,"lang":"en","type":"other","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Revenue; Quarter (Canadian coin); Line (geometry); Renewable energy; Solar energy","score_opus":0.020713904507151548,"score_gpt":0.24647662590091302,"score_spread":0.22576272139376147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980492542","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.0003547213,0.0012760613,0.9808102,0.00022814555,0.001028891,0.0004051544,0.00001896786,0.00012775566,0.015750054],"genre_scores_gemma":[0.02438635,0.00072079647,0.7430919,0.0016660145,0.0034805639,0.00013857744,0.00029966296,0.0005636204,0.22565256],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801874,0.00018658924,0.0004510594,0.0006052563,0.0002754878,0.00046289276],"domain_scores_gemma":[0.9989668,0.00003256007,0.00031937537,0.00044071648,0.00014363136,0.00009691246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005545139,0.00032622073,0.0003660667,0.00060390926,0.00007470583,0.00011211658,0.00056304486,0.00019232114,0.000032686494],"category_scores_gemma":[0.000022588178,0.00028456465,0.00007441433,0.0006211339,0.000024899344,0.00014698028,0.00016833964,0.00011769289,0.000019056815],"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.000052226264,0.00033618222,0.00021099387,0.0008113451,0.000075321506,0.000012898088,0.0044385316,0.0187018,0.0008704671,0.0049319225,0.9290626,0.04049573],"study_design_scores_gemma":[0.0008169146,0.00034192164,0.00012717878,0.002086177,0.000032847227,0.000010064373,0.000051553703,0.10977823,0.003937382,0.00009885423,0.88162756,0.0010913091],"about_ca_topic_score_codex":0.00011089069,"about_ca_topic_score_gemma":0.00037167475,"teacher_disagreement_score":0.23771839,"about_ca_system_score_codex":0.0000663416,"about_ca_system_score_gemma":0.00012816522,"threshold_uncertainty_score":0.99996066},"labels":[],"label_agreement":null},{"id":"W6992463843","doi":"","title":"Malice, Qualified Privilege and the New Responsible Communication Defence to Defamation: Which Way Forward for Investigative Journalism in Canada?","year":2012,"lang":"en","type":"article","venue":"Research Portal (Queen's University Belfast)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Privilege (computing); Confidentiality; Journalism; Social responsibility","score_opus":0.032154943194822906,"score_gpt":0.2848946222992175,"score_spread":0.2527396791043946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992463843","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.31594396,0.00049129146,0.40389577,0.26534978,0.00029726114,0.0031643487,0.00003424646,0.00014005226,0.0106833195],"genre_scores_gemma":[0.97006977,0.00014265535,0.02758779,0.00027614733,0.00005098089,0.000007294261,0.0000119261285,0.000008736713,0.001844703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99760693,0.0008521746,0.00020656142,0.00024910216,0.00056153635,0.0005237006],"domain_scores_gemma":[0.9976102,0.0008826662,0.00012249844,0.0004605821,0.00051861577,0.00040542078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029840646,0.00011423026,0.00017342177,0.00028123194,0.0006839595,0.0001530304,0.000885617,0.00006198259,0.000008634163],"category_scores_gemma":[0.0005881916,0.000101136975,0.000026189655,0.0016918696,0.00015544739,0.00109563,0.00047058915,0.00036591492,0.0000033946942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005033368,0.000066683504,0.010181265,0.000072799885,0.00005086645,0.000015158339,0.016081158,0.0046096225,0.000047188794,0.90136164,0.063084446,0.0039258096],"study_design_scores_gemma":[0.027550016,0.0011423157,0.24521817,0.0031153625,0.00019925587,0.00012036186,0.05920543,0.24195051,0.008864242,0.16794963,0.24056666,0.004118038],"about_ca_topic_score_codex":0.15541972,"about_ca_topic_score_gemma":0.23450701,"teacher_disagreement_score":0.733412,"about_ca_system_score_codex":0.00034692377,"about_ca_system_score_gemma":0.0023542447,"threshold_uncertainty_score":0.8502044},"labels":[],"label_agreement":null},{"id":"W7021170413","doi":"","title":"Nothing behind the mask: an Arenditian approach to virtual worlds and the politics of online education","year":2012,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Politics; Identity (music); Nothing; Articulation (sociology); Reading (process); Postmodernism; Space (punctuation); Metaverse; Identity politics","score_opus":0.01453950590257157,"score_gpt":0.25267760384092225,"score_spread":0.23813809793835067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021170413","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.90988505,0.0020486047,0.0014101182,0.0005643706,0.0050882674,0.0020690917,0.00047650127,0.0004129611,0.07804502],"genre_scores_gemma":[0.97580266,0.000066312445,0.016414735,0.00089643884,0.0002960726,0.00008673633,0.00087428925,0.00007957202,0.005483211],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969578,0.00047795582,0.00065811555,0.0007097589,0.0006662968,0.00053012226],"domain_scores_gemma":[0.9974254,0.0002673012,0.0006089648,0.0010182742,0.00039166422,0.00028844646],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012946976,0.00046198428,0.00045526272,0.0002836278,0.0015129653,0.00032681393,0.001481017,0.00034224105,0.0000059849367],"category_scores_gemma":[0.00025800572,0.00032356867,0.00012632576,0.00060468743,0.00012476981,0.0012402175,0.00021051205,0.00095582684,0.0000075706935],"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.000071902614,0.0005103492,0.000014343315,0.00016020113,0.00007583459,5.092818e-7,0.0017293063,0.0013665017,0.00022833573,0.49372467,0.000014393547,0.5021036],"study_design_scores_gemma":[0.015373557,0.0027929035,0.031179128,0.00913918,0.004847397,0.0007443971,0.066376224,0.20031601,0.03746914,0.36729294,0.24796149,0.016507635],"about_ca_topic_score_codex":0.00018448607,"about_ca_topic_score_gemma":0.00030078343,"teacher_disagreement_score":0.485596,"about_ca_system_score_codex":0.0001477223,"about_ca_system_score_gemma":0.00016944812,"threshold_uncertainty_score":0.9999216},"labels":[],"label_agreement":null},{"id":"W7029498614","doi":"","title":"Is Social Media the Answer to the Support Desired by People with Rheumatoid Arthritis? A Qualitative Exploration","year":2018,"lang":"en","type":"article","venue":"University of Brighton Repository (University of Brighton)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Arthritis Society","keywords":"Social media; Qualitative research; Perspective (graphical); Perception; Process (computing)","score_opus":0.01398545586503902,"score_gpt":0.20350689422175597,"score_spread":0.18952143835671695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029498614","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.37905982,0.00007052917,0.6101722,0.0065729585,0.00026201626,0.00036022026,0.000025824163,0.000121309306,0.0033551187],"genre_scores_gemma":[0.9890107,0.000079487036,0.008735464,0.00009576315,0.000061937535,1.4157585e-7,0.000019786059,0.000009353897,0.0019873912],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9983341,0.00031343507,0.00015860326,0.0004256171,0.00051939575,0.00024882992],"domain_scores_gemma":[0.99827194,0.00017015527,0.00039689694,0.00044425548,0.00061093795,0.00010580811],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00036794675,0.00016658498,0.0002784244,0.00010257456,0.0017478222,0.000066596695,0.0011331406,0.00010187691,0.000076300545],"category_scores_gemma":[0.000008551349,0.00014239481,0.00011167694,0.00077618135,0.0007716887,0.0011464953,0.0002048222,0.00014014087,0.00003091102],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057456054,0.0002335332,0.000370254,0.000036667076,0.00024048045,0.000040607643,0.8413721,0.00020787191,0.0009198958,0.0051680556,0.1437236,0.0071123648],"study_design_scores_gemma":[0.014125663,0.004341325,0.023645664,0.0016273198,0.000572362,0.00036699531,0.51166743,0.065967776,0.05991023,0.005739811,0.30788818,0.004147246],"about_ca_topic_score_codex":0.00088092155,"about_ca_topic_score_gemma":0.0024433718,"teacher_disagreement_score":0.60995084,"about_ca_system_score_codex":0.000075727214,"about_ca_system_score_gemma":0.00020858161,"threshold_uncertainty_score":0.9995518},"labels":[],"label_agreement":null},{"id":"W7029755899","doi":"","title":"Label-free biosensor arrays using silicon photonic technology","year":2007,"lang":"en","type":"other","venue":"NPARC","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Biosensor; Silicon; Photonics; Silicon photonics; Noise (video)","score_opus":0.018354196953086408,"score_gpt":0.25947430832589985,"score_spread":0.24112011137281344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029755899","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053497326,0.0007150666,0.39332715,0.0002761047,0.00064122275,0.00015941559,0.0000040561827,0.0011348815,0.6036886],"genre_scores_gemma":[0.00095251785,0.00017672178,0.7809995,0.0003167646,0.00044610573,0.000008193025,0.000008507539,0.00028251778,0.2168092],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998552,0.000027000715,0.00019919165,0.00055088836,0.00023841194,0.00043249415],"domain_scores_gemma":[0.998509,0.000022994627,0.00024243392,0.0011022545,0.0000567062,0.00006663047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016570729,0.0002599141,0.00028490767,0.0008620792,0.000091867034,0.000099553195,0.0012149602,0.0005621648,0.00024929727],"category_scores_gemma":[0.00003715734,0.00025680702,0.00004253763,0.0011865338,0.00011481334,0.000077245764,0.00026776828,0.00029765413,0.00010393723],"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.000013926261,0.0002672832,0.000107464744,0.00029657397,0.00015973161,0.00015564352,0.00021552503,0.00059523585,0.022470081,0.06430858,0.6649553,0.24645463],"study_design_scores_gemma":[0.0013557428,0.00013722133,0.0000017820472,0.0010058157,0.00006162203,0.000095391035,0.000019358511,0.3251055,0.015016112,0.025196161,0.63064796,0.0013573667],"about_ca_topic_score_codex":0.0000081101,"about_ca_topic_score_gemma":0.000014600373,"teacher_disagreement_score":0.38767233,"about_ca_system_score_codex":0.00006518892,"about_ca_system_score_gemma":0.00011785712,"threshold_uncertainty_score":0.99998844},"labels":[],"label_agreement":null},{"id":"W7029763260","doi":"","title":"The legal status of letters of comfort","year":2023,"lang":"en","type":"dissertation","venue":"Boloka Institutional Repository (North-west University)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Appeal; Loan; Collateral; Liability; Circumstantial evidence; Supreme court; Disclaimer; Subject (documents); Debt; Surety","score_opus":0.008190702174510137,"score_gpt":0.19797210939015503,"score_spread":0.1897814072156449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029763260","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.92406577,0.0004850823,0.020639908,0.00007869477,0.0053577167,0.00040487372,0.00005089617,0.00030464877,0.048612386],"genre_scores_gemma":[0.9541498,0.0006530819,0.003001249,0.000026307387,0.00021927178,0.0000038244966,0.0007329711,0.000030131909,0.041183405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982735,0.000077002565,0.0003964105,0.00037874002,0.00055990316,0.00031447105],"domain_scores_gemma":[0.9982908,0.00013550806,0.0006336745,0.0004412472,0.0003941619,0.00010460636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084967294,0.00021433312,0.0002665427,0.00033381968,0.00087381894,0.000083399165,0.000977782,0.0001413195,0.0000011584898],"category_scores_gemma":[0.000047986672,0.00020230563,0.00016534395,0.0010984795,0.00031773263,0.0005008553,0.00011788914,0.00026696693,0.0000069466664],"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.0011396018,0.0006313983,0.0550567,0.0013330326,0.001188614,0.0016882068,0.0033125617,0.37374339,0.0033146834,0.53165966,0.006756044,0.020176124],"study_design_scores_gemma":[0.002320363,0.00050743716,0.6066729,0.0015164181,0.00059368764,0.00012633712,0.0013530514,0.020242509,0.005710418,0.00031220439,0.35861018,0.0020344958],"about_ca_topic_score_codex":0.00044705954,"about_ca_topic_score_gemma":0.0010077893,"teacher_disagreement_score":0.5516162,"about_ca_system_score_codex":0.00020879878,"about_ca_system_score_gemma":0.0016041084,"threshold_uncertainty_score":0.8249784},"labels":[],"label_agreement":null},{"id":"W7029766494","doi":"","title":"Longitudinal Flight Control Methodologies for Commercial Aircraft with Handling Quality Requirements","year":2022,"lang":"fr","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pilotage; Quality (philosophy); Limiting; Reliability (semiconductor)","score_opus":0.06513113365753065,"score_gpt":0.31870440973318154,"score_spread":0.2535732760756509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029766494","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.0003040216,0.0057390914,0.9736015,0.008382405,0.0010581991,0.0025543445,0.00019733029,0.0011725526,0.0069905156],"genre_scores_gemma":[0.022130013,0.00037521232,0.90949136,0.0036250658,0.0010542116,0.0026675516,0.0002038793,0.0004270263,0.060025696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929359,0.0015751187,0.0011967757,0.001672221,0.0009582834,0.001661722],"domain_scores_gemma":[0.9945614,0.0013755236,0.0014937677,0.0016831973,0.00048240315,0.00040375124],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0042978437,0.0010656326,0.0015073434,0.00063837797,0.001502578,0.0010169212,0.0020578387,0.0007659255,0.0007869816],"category_scores_gemma":[0.00081691396,0.0010245779,0.0004339017,0.0011347033,0.00038750662,0.0007678944,0.0006617804,0.0010726448,0.000015682512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028167465,0.0012833612,0.11346192,0.0014638002,0.001627141,0.00023710082,0.0020444107,0.21050502,0.00033661412,0.19950189,0.041116502,0.4256055],"study_design_scores_gemma":[0.00703326,0.0022567285,0.021615388,0.0010507592,0.00087597343,0.00020960307,0.00021670318,0.70777214,0.0007934877,0.009050412,0.24566688,0.0034586552],"about_ca_topic_score_codex":0.0043324046,"about_ca_topic_score_gemma":0.0074536437,"teacher_disagreement_score":0.49726713,"about_ca_system_score_codex":0.0012860025,"about_ca_system_score_gemma":0.001083443,"threshold_uncertainty_score":0.99979734},"labels":[],"label_agreement":null},{"id":"W7030264063","doi":"","title":"Montreal water works : the reports of Walter Shanly, Esq., T. C. Keefer, Esq., and James B. Francis, Esq., of Lowell, Mass.","year":2014,"lang":"en","type":"article","venue":"QSpace (Queen's University Library)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Excuse; Subject (documents); Property (philosophy); Water supply; Duty; Real property","score_opus":0.0033451899089359306,"score_gpt":0.15586673744916896,"score_spread":0.15252154754023303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030264063","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.20807005,0.0005168214,0.7098515,0.06341059,0.0007535099,0.0005904952,0.000009739605,0.0005761757,0.01622109],"genre_scores_gemma":[0.97345763,0.00034497093,0.018679453,0.00025957037,0.0000698596,6.3839553e-7,0.00001730886,0.00002279054,0.0071477913],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984353,0.00017333688,0.00026389214,0.00048239063,0.0002978883,0.00034716318],"domain_scores_gemma":[0.99862677,0.00013601189,0.00028071753,0.00073556177,0.000088908986,0.0001320359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018222253,0.00022476203,0.00033315012,0.00017778133,0.00020338748,0.00014003064,0.0006516317,0.00016534649,0.000045519737],"category_scores_gemma":[0.000017788549,0.00016452337,0.00010187652,0.00045393754,0.00022072441,0.0018521347,0.00047402468,0.00022400221,0.0000036756749],"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.0011302602,0.0011841685,0.17524308,0.001346251,0.00086226955,0.00091840315,0.033061225,0.070816055,0.00050170044,0.028772807,0.48751593,0.19864784],"study_design_scores_gemma":[0.0101869805,0.0027038038,0.07775489,0.003297021,0.0009509193,0.000065229455,0.0041116197,0.28662252,0.16838253,0.06721188,0.37236255,0.0063500535],"about_ca_topic_score_codex":0.00086377613,"about_ca_topic_score_gemma":0.0000135636365,"teacher_disagreement_score":0.7653876,"about_ca_system_score_codex":0.000017522349,"about_ca_system_score_gemma":0.000055233053,"threshold_uncertainty_score":0.67090684},"labels":[],"label_agreement":null},{"id":"W7034503387","doi":"","title":"What Do We Know? What Do We Need To Know? The state of research on work, employment and climate change in Canada","year":2022,"lang":"en","type":"report","venue":"York University Digital Library (York University)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Climate change; State (computer science); Economic impact analysis; Global warming; International comparisons","score_opus":0.03997031311453019,"score_gpt":0.23788962709637554,"score_spread":0.19791931398184534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034503387","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15659486,0.3890436,0.0018691451,0.11257698,0.022813011,0.016161766,0.0051598074,0.0029885017,0.29279232],"genre_scores_gemma":[0.08069832,0.8318768,0.0007454968,0.00030272407,0.00026575007,0.0000039185043,0.00033451448,0.00013747679,0.08563499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958193,0.00042845405,0.0003176829,0.0010966281,0.0014722579,0.0008657314],"domain_scores_gemma":[0.99760485,0.0005188441,0.00036217246,0.0009370053,0.00018219536,0.0003949255],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003567913,0.00045629378,0.0005691882,0.001821193,0.00063155807,0.001985518,0.0025886062,0.00017101962,0.000054819415],"category_scores_gemma":[0.000013760339,0.00047451197,0.00013487821,0.006763868,0.00022065047,0.0075793914,0.003927802,0.0009844383,0.000010300802],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008821776,0.00031583823,0.008413399,0.0004363664,0.00017632867,0.0022461093,0.006472852,0.009988205,2.518517e-7,0.0043804725,0.07746269,0.8892253],"study_design_scores_gemma":[0.00045715686,0.00024212252,0.0002658861,0.0051925434,0.000026151156,0.000010340771,0.01870976,0.00032897425,0.0000058896253,0.00015789183,0.9740438,0.000559485],"about_ca_topic_score_codex":0.013140636,"about_ca_topic_score_gemma":0.020765213,"teacher_disagreement_score":0.8965811,"about_ca_system_score_codex":0.0016390443,"about_ca_system_score_gemma":0.0033713854,"threshold_uncertainty_score":0.99977064},"labels":[],"label_agreement":null},{"id":"W7036426834","doi":"","title":"Beyond multinational federalism: reflections on nations and nationalism in Canada","year":2012,"lang":"en","type":"article","venue":"BIROn (Birkbeck, University of London)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nationalism; Multinational corporation; Economic nationalism; Quality (philosophy)","score_opus":0.016618401198528875,"score_gpt":0.22233471320250728,"score_spread":0.2057163120039784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036426834","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.6590597,0.00081972627,0.25310656,0.016398767,0.0016078005,0.0006298425,0.00007395669,0.0002520404,0.06805163],"genre_scores_gemma":[0.9753854,0.000048100395,0.02338501,0.00020321479,0.000033845645,4.6225705e-7,0.000019247902,0.0000043990167,0.0009203033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99922615,0.00005609547,0.000108145265,0.00017457189,0.00026433478,0.00017070588],"domain_scores_gemma":[0.9994414,0.00014975254,0.00009511727,0.0001180269,0.00011281721,0.0000829143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013934143,0.00008230247,0.000095774194,0.00024097886,0.00031399945,0.000024757268,0.0001984014,0.00004310546,0.000023018032],"category_scores_gemma":[0.000034384775,0.00010032642,0.000019542835,0.00048285807,0.000043034557,0.00057676266,0.00007150701,0.00009746883,0.0000038432777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005471972,0.0004849918,0.057677567,0.00006422587,0.00004784394,0.000015824997,0.00499508,0.040882476,0.00022493764,0.87647766,0.00722021,0.011854484],"study_design_scores_gemma":[0.0054071764,0.00017514771,0.6994822,0.00023068297,0.000047237623,0.000059245933,0.0023776838,0.22587378,0.0008047732,0.009200233,0.055112343,0.001229468],"about_ca_topic_score_codex":0.1061306,"about_ca_topic_score_gemma":0.5151735,"teacher_disagreement_score":0.8672774,"about_ca_system_score_codex":0.0003345896,"about_ca_system_score_gemma":0.00041291016,"threshold_uncertainty_score":0.89982176},"labels":[],"label_agreement":null},{"id":"W7039448333","doi":"","title":"A network impairment tool based on the IXDP425 network processor","year":2005,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Artificial neural network; Range (aeronautics); Key (lock); Process (computing); Pipeline (software)","score_opus":0.010073941001072157,"score_gpt":0.19360519241034652,"score_spread":0.18353125140927437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039448333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095771536,0.002456712,0.76851594,0.028592605,0.005948003,0.0043934737,0.000028337254,0.001812485,0.09248089],"genre_scores_gemma":[0.77384454,0.0006118127,0.19642043,0.003696907,0.0037851646,0.000023369004,0.0007861506,0.00020277787,0.020628838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980103,0.00015470502,0.00017291858,0.00056249904,0.00060283433,0.00049677567],"domain_scores_gemma":[0.99822134,0.00017594015,0.0005538769,0.00072004856,0.00025143058,0.00007737665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052173994,0.00033241962,0.0003542711,0.00011588257,0.00079099386,0.00015090586,0.0014549023,0.0002743953,0.00001587009],"category_scores_gemma":[0.000020673784,0.00032226252,0.00017075262,0.00093911256,0.000055893306,0.0003117945,0.00011005752,0.00041864094,0.00005307615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039367258,0.000279036,0.001958545,0.00035202765,0.00010233877,0.000034426936,0.00095613743,0.80013514,0.0000029932305,0.00803698,0.1725294,0.015219312],"study_design_scores_gemma":[0.0009800766,0.0004656977,0.024566162,0.0016591516,0.00016385729,0.000002896559,0.0027364574,0.9501698,0.00002715092,0.0018646732,0.01644303,0.0009210556],"about_ca_topic_score_codex":0.000050011087,"about_ca_topic_score_gemma":0.02311635,"teacher_disagreement_score":0.678073,"about_ca_system_score_codex":0.00015535687,"about_ca_system_score_gemma":0.00032702828,"threshold_uncertainty_score":0.99992293},"labels":[],"label_agreement":null},{"id":"W7097227856","doi":"","title":"Exploring Visible Internet Hosts through Census and Survey","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"The Internet; Census; Server; Population; Quarter (Canadian coin); Internet access; Reserved IP addresses; Software deployment","score_opus":0.14795516892694263,"score_gpt":0.29265835166826576,"score_spread":0.14470318274132313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097227856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08321806,0.00013796252,0.9079881,0.000081675236,0.000291235,0.00003031616,2.530044e-7,0.00015632024,0.008096102],"genre_scores_gemma":[0.8893207,0.00008497335,0.10977046,0.00017072086,0.000046708043,0.0000012947859,0.0000035020005,0.0000054490106,0.0005962264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932534,0.000026348176,0.00012052809,0.00022395859,0.000104562496,0.00019925767],"domain_scores_gemma":[0.9995922,0.000104533436,0.000033160464,0.00016280424,0.000057444562,0.000049847647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005849725,0.000071955634,0.00007151542,0.000037588026,0.00005610986,0.00016985621,0.00019313957,0.000023782099,0.000003506595],"category_scores_gemma":[0.000028961664,0.00006216997,0.000009769288,0.00032311,0.000019659326,0.0008537213,0.00012777986,0.000056909652,0.000009002643],"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.00006584765,0.00015818015,0.07845802,0.000066158755,0.000042712432,0.000056077155,0.008275134,0.0016650439,0.00013198069,0.10296365,0.0106969485,0.79742026],"study_design_scores_gemma":[0.0018045957,0.0004102312,0.42764354,0.00026342846,0.000012893838,0.000101172474,0.00033280934,0.50976914,0.030165015,0.007634934,0.02034563,0.001516591],"about_ca_topic_score_codex":0.00018254294,"about_ca_topic_score_gemma":0.000115804956,"teacher_disagreement_score":0.8061026,"about_ca_system_score_codex":0.000012876232,"about_ca_system_score_gemma":0.000009415676,"threshold_uncertainty_score":0.25352177},"labels":[],"label_agreement":null},{"id":"W7131095932","doi":"10.1109/iccvw69036.2025.00594","title":"LiteRT-Optimized INT8 LLM for Raspberry Pi4 Deployment","year":2025,"lang":"","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"BlueDot (Canada)","funders":"","keywords":"Software deployment; Enhanced Data Rates for GSM Evolution; Edge computing; Edge device; Raspberry pi; Acceleration","score_opus":0.014516571888914333,"score_gpt":0.2806029705816465,"score_spread":0.2660863986927322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131095932","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.0002344994,0.0029988766,0.9670162,0.006570794,0.0032263375,0.0009574976,0.0000036230144,0.00039955977,0.018592613],"genre_scores_gemma":[0.1007979,0.0008508538,0.79166853,0.006943745,0.0003920636,0.00028882222,0.000028055103,0.000050937047,0.0989791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670106,0.0001465955,0.00086695905,0.0011364062,0.00032634885,0.000822638],"domain_scores_gemma":[0.99773115,0.00038895378,0.00025628717,0.0009092306,0.0005207272,0.00019362872],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008585849,0.0004561445,0.00053566834,0.00032897704,0.0006315578,0.0013666592,0.0011611191,0.00026762253,0.00013381444],"category_scores_gemma":[0.00013986316,0.00042999352,0.00027078632,0.0014336236,0.000117819785,0.000792352,0.0005124467,0.00023522071,0.00004572795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037595019,0.00079522684,0.0001520758,0.0004933121,0.00023666362,0.000005507402,0.0012390198,0.09557187,0.000042646727,0.04786553,0.086217344,0.76700485],"study_design_scores_gemma":[0.0027805467,0.00023163296,0.00003769447,0.00052620174,0.00010268606,0.0000032677133,0.00003962114,0.95921415,0.0011923439,0.008033749,0.027382195,0.000455902],"about_ca_topic_score_codex":0.000017766773,"about_ca_topic_score_gemma":0.0000086005775,"teacher_disagreement_score":0.8636423,"about_ca_system_score_codex":0.00017568162,"about_ca_system_score_gemma":0.0006081557,"threshold_uncertainty_score":0.99981517},"labels":[],"label_agreement":null},{"id":"W7133310114","doi":"10.1109/icee67165.2025.11409793","title":"MAC-based Mapping of Adder Architectures to RRAM Crossbars","year":2025,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","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":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Adder; Scalability; Crossbar switch; Logic gate; Parallelism (grammar); Logic synthesis; Carry-save adder","score_opus":0.009289663041668905,"score_gpt":0.2575203184304343,"score_spread":0.24823065538876543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133310114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065641063,0.000052972126,0.9772727,0.001691017,0.00014920988,0.00007256782,3.538496e-7,0.00012541053,0.014071683],"genre_scores_gemma":[0.63882244,4.5783568e-7,0.35755107,0.0020898571,0.00001418883,0.0000055902005,8.246686e-7,0.0000026578662,0.0015128795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999395,0.000020910711,0.00013904733,0.00019565917,0.00010709733,0.00014226766],"domain_scores_gemma":[0.9995455,0.000055834873,0.000031877375,0.00025889633,0.00007199751,0.00003587929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011623707,0.00006706075,0.00009031114,0.00016562977,0.000070870025,0.00009562987,0.0003684673,0.000028971772,0.00001544558],"category_scores_gemma":[0.000031816286,0.000057289762,0.00002978066,0.00076374586,0.000023404351,0.000042004285,0.00008641504,0.00004798754,0.0000053000263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015455409,0.000065126405,0.0017094943,0.00009921066,0.000018383345,0.0000018886469,0.00073200354,0.67718613,0.0009887674,0.017361263,0.01120208,0.29062018],"study_design_scores_gemma":[0.0003683123,0.000045331373,0.00303658,0.00019116014,0.0000042117235,8.1480766e-7,0.000023731305,0.9594132,0.02454961,0.006091002,0.0060951295,0.0001809732],"about_ca_topic_score_codex":0.0000120055365,"about_ca_topic_score_gemma":0.0000074962913,"teacher_disagreement_score":0.63225836,"about_ca_system_score_codex":0.000010195995,"about_ca_system_score_gemma":0.00009151786,"threshold_uncertainty_score":0.23362087},"labels":[],"label_agreement":null}]}