{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012789073,0.00007735508,0.9951231,0.00019297878,0.00007794542,0.00005870727,0.000055911216,0.0006940419,0.0024411608],"genre_scores_gemma":[0.11854977,0.00046532275,0.87358356,0.00038757912,0.00021025518,0.00048942707,0.00033111082,0.0004461127,0.0055367057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99439454,0.0011451829,0.00058529305,0.0005674018,0.0028098503,0.0004976946],"domain_scores_gemma":[0.9954659,0.0022845913,0.0002527979,0.0008147247,0.0009528091,0.00022916583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064238524,0.00085968047,0.0010864343,0.0012545013,0.0023564333,0.004029683,0.0029629471,0.0020776372,0.003269627],"category_scores_gemma":[0.010141262,0.0011390857,0.0027327999,0.0012866227,0.0043987804,0.005174082,0.004037903,0.0041464446,0.0010548336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029889397,0.000041139294,0.0001405244,0.00006737267,0.000020486357,0.00027719903,0.00030324684,0.012513527,0.0034011807,0.96817845,0.0015246065,0.013502403],"study_design_scores_gemma":[0.00009755534,0.00003507634,0.000100893594,0.00008209,0.000053921693,0.00022528395,0.00006574532,0.14360386,0.006246276,0.81364316,0.03578402,0.00006211974],"about_ca_topic_score_codex":0.006185142,"about_ca_topic_score_gemma":0.003979281,"teacher_disagreement_score":0.0064238524,"about_ca_system_score_codex":0.002308298,"about_ca_system_score_gemma":0.005114251,"threshold_uncertainty_score":0.03397298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062631376,0.0011255855,0.9193288,0.00049385004,0.0002103369,0.00022948206,0.0001976375,0.0035141509,0.012268809],"genre_scores_gemma":[0.57654685,0.00075851905,0.40820575,0.00057582394,0.00018782078,0.00022300887,0.00049012405,0.0004506489,0.012561471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936813,0.00010323093,0.00004050887,0.00007095411,0.00033624546,0.00008095706],"domain_scores_gemma":[0.9990163,0.0003027567,0.000058786725,0.00035945667,0.00023871173,0.000023966144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003619037,0.0006413315,0.0005045848,0.0009372664,0.00053830515,0.0006852389,0.0014083245,0.00047932233,0.00529049],"category_scores_gemma":[0.0022258128,0.0002863087,0.0004247546,0.0016401767,0.00042830457,0.0012894198,0.000595673,0.0006858017,0.0008487619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052735634,0.00023165085,0.0009565961,0.0002790264,0.00007713036,0.00031299287,0.00024579838,0.09884406,0.091782115,0.053568937,0.010762779,0.7424116],"study_design_scores_gemma":[0.00008176501,0.00046242037,0.00072774926,0.00006491937,0.00009390913,0.0006302378,0.00010358159,0.8059693,0.13862227,0.03228544,0.020920802,0.000037549024],"about_ca_topic_score_codex":0.001878302,"about_ca_topic_score_gemma":0.003851679,"teacher_disagreement_score":0.00529049,"about_ca_system_score_codex":0.0006034154,"about_ca_system_score_gemma":0.0010512583,"threshold_uncertainty_score":0.017698407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021728497,0.0002422357,0.96143967,0.00045594719,0.00015864312,0.00024623857,0.00034865658,0.009383576,0.0059966003],"genre_scores_gemma":[0.49995923,0.00025208967,0.49171582,0.00030159907,0.00015409256,0.00029587848,0.0013972837,0.0013401265,0.004583947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901502,0.0028829,0.0006513139,0.0017534466,0.0033085174,0.0012535783],"domain_scores_gemma":[0.9624379,0.022842566,0.0009721398,0.010510852,0.002762147,0.00047433306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054783574,0.0013693385,0.0015767713,0.0015433824,0.0012704821,0.0040625622,0.004788679,0.0016574606,0.009539078],"category_scores_gemma":[0.03127443,0.0015334242,0.0030384995,0.0014161349,0.0032784878,0.007412281,0.0064722504,0.0042969636,0.0022245666],"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.0014968686,0.00048061018,0.0030450244,0.000969379,0.00027521348,0.0005294402,0.00067975884,0.18765837,0.024939056,0.33417824,0.012383296,0.43336472],"study_design_scores_gemma":[0.00013060476,0.00011389257,0.00042170408,0.00009100316,0.00010791517,0.00013194884,0.000103610015,0.6475964,0.029149318,0.3161599,0.005935725,0.000057893918],"about_ca_topic_score_codex":0.0055798776,"about_ca_topic_score_gemma":0.006415217,"teacher_disagreement_score":0.009539078,"about_ca_system_score_codex":0.0027593814,"about_ca_system_score_gemma":0.0043938756,"threshold_uncertainty_score":0.031911373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082865834,0.0069924043,0.87927437,0.00045902265,0.00073874905,0.00021716034,0.0007028373,0.013247163,0.015502473],"genre_scores_gemma":[0.5112069,0.0014985215,0.46793056,0.0002844102,0.00017067647,0.00021435962,0.0009620519,0.00047995278,0.01725246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997402,0.000035637717,0.00002290953,0.00004049636,0.00012160668,0.00003923627],"domain_scores_gemma":[0.99925333,0.00012821489,0.000042974512,0.0003160429,0.00021441569,0.000044943066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043609322,0.00046178853,0.0006029607,0.00094195525,0.0007320327,0.0012170167,0.0028312558,0.0006832416,0.006896842],"category_scores_gemma":[0.0011402251,0.00041575744,0.00037273965,0.0015341019,0.00035637405,0.0018299312,0.0008399008,0.001090993,0.0009673969],"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.00249098,0.00045911246,0.0021932356,0.00082912314,0.00016826781,0.00032401143,0.00023223239,0.08815193,0.12475517,0.081437826,0.042538125,0.65641993],"study_design_scores_gemma":[0.0004082915,0.0010362489,0.00083037507,0.0001389929,0.00028284197,0.000595653,0.00009989509,0.8092917,0.08965736,0.032144804,0.065410495,0.00010336515],"about_ca_topic_score_codex":0.0020208594,"about_ca_topic_score_gemma":0.0050648116,"teacher_disagreement_score":0.006896842,"about_ca_system_score_codex":0.0009828241,"about_ca_system_score_gemma":0.001127979,"threshold_uncertainty_score":0.023072302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94387394,0.0023983486,0.037897736,0.00038306645,0.00023850634,0.00009142722,0.0007170711,0.0021860977,0.012213761],"genre_scores_gemma":[0.9583648,0.00047320532,0.028681215,0.00024744577,0.00006689767,0.00005154373,0.0008062377,0.00006006049,0.0112485755],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999052,0.000005315479,0.000004723917,0.00002613732,0.000038383077,0.000020174024],"domain_scores_gemma":[0.9999217,0.0000072089497,0.000014407171,0.000012417758,0.00003362051,0.000010637092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068155285,0.00022327731,0.00025470465,0.00021724739,0.0002630835,0.00041258134,0.0013977361,0.0003455853,0.0018102024],"category_scores_gemma":[0.00012322255,0.00014337931,0.00017052902,0.00042178473,0.00010478711,0.00080965715,0.0002804908,0.00019856136,0.00053801434],"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.0003071574,0.00014208307,0.0028300458,0.00037349144,0.0000851044,0.00057717593,0.00015353001,0.00080672535,0.93180376,0.0011672715,0.0046751145,0.0570786],"study_design_scores_gemma":[0.00013759805,0.003044993,0.0069587273,0.000049898434,0.00023355377,0.0024561503,0.00020282024,0.01362326,0.9402794,0.00034888467,0.03260522,0.000059413618],"about_ca_topic_score_codex":0.0008165147,"about_ca_topic_score_gemma":0.0033072631,"teacher_disagreement_score":0.0018102024,"about_ca_system_score_codex":0.00037228636,"about_ca_system_score_gemma":0.00043742906,"threshold_uncertainty_score":0.0060557127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016288145,0.00027768465,0.97432816,0.00013684334,0.00023346937,0.000038241058,0.000057102054,0.001763143,0.0068772063],"genre_scores_gemma":[0.37022856,0.00043391384,0.615155,0.00026169987,0.00016056097,0.00014033765,0.000308569,0.00011491444,0.013196409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974734,0.000046775323,0.000019415205,0.000039992,0.000110860085,0.00003561823],"domain_scores_gemma":[0.9997173,0.000054855725,0.000022210754,0.00004417684,0.0001388776,0.000022597129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033548445,0.00039681667,0.00029008507,0.00032059738,0.0003001779,0.0007394778,0.0011390087,0.0005513962,0.0049232794],"category_scores_gemma":[0.0007539881,0.00017854893,0.00024134576,0.00041180567,0.00028202654,0.0007978897,0.0004311323,0.0005814138,0.0012245319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039185883,0.00025190727,0.0007623954,0.0002322794,0.000078332014,0.00039905915,0.00012286297,0.12989305,0.10650899,0.10434863,0.009139527,0.64787114],"study_design_scores_gemma":[0.00006166049,0.000275781,0.00033738554,0.00002873937,0.000035804096,0.0003017425,0.00002095073,0.8935056,0.061289456,0.017095055,0.027021203,0.000026643858],"about_ca_topic_score_codex":0.0014944744,"about_ca_topic_score_gemma":0.002507447,"teacher_disagreement_score":0.0049232794,"about_ca_system_score_codex":0.0004973891,"about_ca_system_score_gemma":0.00080223876,"threshold_uncertainty_score":0.016470015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.702749,0.0032491295,0.24307826,0.0009079813,0.00036624674,0.0001271878,0.00060576724,0.0030917104,0.045824714],"genre_scores_gemma":[0.9550682,0.00018953245,0.036945414,0.00020060182,0.00004952078,0.000030294057,0.00017035347,0.0000476194,0.0072984984],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998399,0.00001319068,0.000007233509,0.00002738743,0.00008469691,0.000027509126],"domain_scores_gemma":[0.99975806,0.00006185672,0.000059185357,0.00003989647,0.00006158543,0.000019305668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007178438,0.0002035494,0.00029672755,0.00026632927,0.0002623276,0.00068043405,0.0011199985,0.00043711936,0.0063473005],"category_scores_gemma":[0.00050859357,0.00011871641,0.0001077707,0.00044474992,0.00020878017,0.0012350901,0.00043725083,0.00031663547,0.0010599958],"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.0011403864,0.00015739299,0.002745586,0.000430758,0.000046852365,0.0006372304,0.00014512171,0.0067624715,0.75465155,0.020033332,0.007985365,0.20526393],"study_design_scores_gemma":[0.00016178336,0.0016510591,0.0020095105,0.000045234035,0.000109320266,0.002353329,0.00010775389,0.16449028,0.7883129,0.00569814,0.03501948,0.000041170035],"about_ca_topic_score_codex":0.00031293547,"about_ca_topic_score_gemma":0.00095057243,"teacher_disagreement_score":0.0063473005,"about_ca_system_score_codex":0.00039478592,"about_ca_system_score_gemma":0.00034742992,"threshold_uncertainty_score":0.021233857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008308477,0.00006649776,0.98907787,0.000049152048,0.000014762666,0.00009769385,0.0000803705,0.0013134034,0.0009917271],"genre_scores_gemma":[0.28551254,0.00041513125,0.71098053,0.00009334526,0.000029587802,0.0004627296,0.0004951104,0.00036648993,0.0016445941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950932,0.0015506179,0.0005849608,0.0008867992,0.0015015882,0.0003828244],"domain_scores_gemma":[0.9935761,0.0037411686,0.00072197034,0.0013383139,0.0005424241,0.000080017024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041619,0.0010888501,0.0007519972,0.0014896876,0.0006323026,0.0021336086,0.0032889144,0.0013282652,0.001751046],"category_scores_gemma":[0.007165641,0.0009768965,0.0026356857,0.0007833828,0.0023421615,0.003200391,0.0017684216,0.0017518938,0.00051285955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038752094,0.0002954583,0.004949036,0.0007086655,0.00024177584,0.0019084002,0.00067574024,0.626258,0.04922927,0.24812122,0.0015494215,0.06567558],"study_design_scores_gemma":[0.00008664308,0.00007320661,0.00028625925,0.00006286651,0.00007059736,0.00021607673,0.00004359455,0.9291069,0.029221328,0.03354043,0.0072541386,0.00003787192],"about_ca_topic_score_codex":0.0056923646,"about_ca_topic_score_gemma":0.0033387756,"teacher_disagreement_score":0.0056923646,"about_ca_system_score_codex":0.0010384006,"about_ca_system_score_gemma":0.0023135145,"threshold_uncertainty_score":0.022010446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29461,0.009357865,0.67257327,0.0005535014,0.00035577556,0.00014685123,0.00042733797,0.00850275,0.013472702],"genre_scores_gemma":[0.74933285,0.00103956,0.2416339,0.00013564859,0.000088029636,0.00014506758,0.0004114744,0.0001985607,0.0070149926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947566,0.00009958077,0.00004084067,0.00006146794,0.00023133005,0.00009104858],"domain_scores_gemma":[0.9971064,0.0010444282,0.00028045053,0.000761997,0.00071795,0.00008892498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065932114,0.0004661959,0.00044001697,0.0008888867,0.0005107954,0.0010464899,0.002607403,0.0006160197,0.0045593567],"category_scores_gemma":[0.0029402673,0.00034895074,0.00027414632,0.0016794269,0.00025621324,0.0025976708,0.00070437946,0.0007579381,0.0009435177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024299384,0.0004608586,0.0067679775,0.0008852506,0.00019997575,0.00042086252,0.00035774216,0.1783517,0.2192196,0.08834967,0.023929087,0.47862732],"study_design_scores_gemma":[0.00023498695,0.00097486,0.0014544612,0.00009876687,0.00023294224,0.0008234509,0.00012058566,0.725447,0.2088436,0.018313566,0.043374572,0.000081235965],"about_ca_topic_score_codex":0.0015881427,"about_ca_topic_score_gemma":0.0057559144,"teacher_disagreement_score":0.0045593567,"about_ca_system_score_codex":0.0010700367,"about_ca_system_score_gemma":0.0008024887,"threshold_uncertainty_score":0.01525259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41819662,0.0031287032,0.5513497,0.00078427285,0.00031164993,0.00025088966,0.00043715848,0.009516828,0.01602419],"genre_scores_gemma":[0.86923826,0.00034444075,0.12435247,0.00020451921,0.000070006485,0.00015407048,0.00043279046,0.00010826244,0.0050951717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962735,0.000053917713,0.00003586724,0.00006028957,0.00012716769,0.000095434945],"domain_scores_gemma":[0.99838054,0.00033253583,0.00011161651,0.00045508123,0.0006195299,0.00010068846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040783198,0.0005985772,0.00067884487,0.0010944183,0.00066411175,0.0012635931,0.0032126417,0.00073640153,0.003744218],"category_scores_gemma":[0.0016896091,0.00036332587,0.00037906208,0.0018267618,0.00031276455,0.0022476858,0.00071453146,0.00074833306,0.0008169397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016172526,0.0015698646,0.013787322,0.00053973345,0.00024668555,0.0005070558,0.00033299866,0.27150533,0.12796475,0.030691177,0.02512715,0.52611077],"study_design_scores_gemma":[0.00020900837,0.0006882781,0.0011974884,0.000024110863,0.000098530756,0.00033461102,0.000054035987,0.9446207,0.03908537,0.004214858,0.009419416,0.000053597785],"about_ca_topic_score_codex":0.00476301,"about_ca_topic_score_gemma":0.012221809,"teacher_disagreement_score":0.00476301,"about_ca_system_score_codex":0.001401034,"about_ca_system_score_gemma":0.0019117766,"threshold_uncertainty_score":0.012525618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038380034,0.00030945826,0.9508803,0.00020156411,0.00007399214,0.00008183173,0.00011204693,0.0015996278,0.008361216],"genre_scores_gemma":[0.36956146,0.00037484503,0.6218992,0.00025708234,0.00007856287,0.0003103767,0.0004011531,0.00012795563,0.006989359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980193,0.000040558694,0.000019339757,0.000034978555,0.00007008463,0.00003319605],"domain_scores_gemma":[0.9995976,0.00010123144,0.000046156667,0.000049404724,0.00018668064,0.000018961817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000258854,0.00040726454,0.00026124512,0.000415744,0.00034366315,0.00065245887,0.00095527637,0.00036067117,0.004797589],"category_scores_gemma":[0.00079371507,0.0002165453,0.00021692883,0.0006959447,0.00019727793,0.00092560705,0.00036512935,0.00059357856,0.0014649113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048826978,0.0002593503,0.0025119828,0.000393886,0.00010790779,0.00020090291,0.00015202424,0.12886259,0.19139403,0.052284747,0.014531544,0.6088128],"study_design_scores_gemma":[0.00012680741,0.00084363547,0.00083828694,0.000042540305,0.00009875638,0.00037043204,0.00007042619,0.7785381,0.16768438,0.018176341,0.033165574,0.000044657303],"about_ca_topic_score_codex":0.0005545415,"about_ca_topic_score_gemma":0.0014830669,"teacher_disagreement_score":0.004797589,"about_ca_system_score_codex":0.00060609245,"about_ca_system_score_gemma":0.000908871,"threshold_uncertainty_score":0.016049504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98540974,0.00029560184,0.010317927,0.00013416132,0.00003518508,0.00010112919,0.00011062428,0.00042158426,0.0031740668],"genre_scores_gemma":[0.99461836,0.00010563006,0.004320187,0.000026857135,0.00000921375,0.000026987256,0.00016811489,0.000036323014,0.0006884465],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971132,0.0010596397,0.0002319463,0.0002537631,0.00086369057,0.00047781202],"domain_scores_gemma":[0.98532295,0.006238818,0.00084520795,0.0021780194,0.004793194,0.00062181766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028089148,0.00076997903,0.00052488444,0.0011676624,0.0004938304,0.0007394898,0.00096641725,0.0008971534,0.0014663271],"category_scores_gemma":[0.010107892,0.00025630047,0.0004209661,0.0007718902,0.00054814236,0.0018848726,0.0004436689,0.0006438924,0.0003983792],"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.0078120106,0.009403356,0.12507902,0.0012612293,0.0004458593,0.0012378794,0.0015798811,0.24076894,0.18144783,0.008185577,0.007565067,0.41521326],"study_design_scores_gemma":[0.0004954525,0.020343088,0.051653154,0.00013057886,0.000281511,0.00095946324,0.0009992808,0.61307645,0.3026227,0.0031496587,0.0061724517,0.000116193856],"about_ca_topic_score_codex":0.0019431433,"about_ca_topic_score_gemma":0.0014411543,"teacher_disagreement_score":0.0028089148,"about_ca_system_score_codex":0.0008942275,"about_ca_system_score_gemma":0.000366818,"threshold_uncertainty_score":0.014855146},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024790196,0.048928153,0.5846304,0.0022506106,0.0065159737,0.00032167148,0.0033068745,0.005128738,0.34643853],"genre_scores_gemma":[0.026288282,0.065291815,0.26374543,0.0015729707,0.0036037401,0.00051067147,0.0054283766,0.0032422463,0.63031656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952626,0.000044102817,0.000026678683,0.00008920007,0.0002851227,0.000028681177],"domain_scores_gemma":[0.99945635,0.00020020078,0.00002841439,0.0001425157,0.00014831829,0.000024207422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057633343,0.0015117567,0.0008142716,0.0015429173,0.0004878506,0.0035263193,0.0016794829,0.0010405722,0.03467458],"category_scores_gemma":[0.0019175366,0.000995056,0.00043757627,0.0035963545,0.0007323453,0.0042071654,0.0008053427,0.0025743062,0.022568671],"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.0000681696,0.00007021484,0.00012323135,0.000413803,0.000016035247,0.00007378556,0.000095122334,0.007756743,0.004839827,0.23712014,0.22744437,0.5219786],"study_design_scores_gemma":[0.0000135898945,0.00005842692,0.00033217476,0.000285658,0.000025484162,0.000557559,0.000049856088,0.017570434,0.004947396,0.1433365,0.8327775,0.00004538782],"about_ca_topic_score_codex":0.0008153454,"about_ca_topic_score_gemma":0.00097618013,"teacher_disagreement_score":0.03467458,"about_ca_system_score_codex":0.0006849154,"about_ca_system_score_gemma":0.0009152967,"threshold_uncertainty_score":0.11599803},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033930834,0.0008449745,0.9475192,0.0003103668,0.00025398747,0.00060676504,0.0005072741,0.012999524,0.0030271115],"genre_scores_gemma":[0.1719521,0.00033045647,0.82052565,0.0002679604,0.0001547885,0.00049485953,0.0018115949,0.0003889225,0.004073689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991543,0.000084308296,0.00005791369,0.0001470241,0.0004473331,0.00010909305],"domain_scores_gemma":[0.9987312,0.00038031884,0.0001426918,0.00024736207,0.00042546046,0.00007281565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993238,0.000734047,0.0011606965,0.00254258,0.00081154413,0.00149931,0.0031410048,0.00082245737,0.0025996047],"category_scores_gemma":[0.0043251994,0.00057026,0.0004765638,0.0028351585,0.000453536,0.0018095028,0.001348639,0.0011291289,0.00083914597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026520478,0.00017434686,0.0028429455,0.000111982394,0.000054171134,0.00010825422,0.000053594016,0.029434994,0.005223161,0.0034083235,0.017651957,0.9406709],"study_design_scores_gemma":[0.000063604486,0.00018118351,0.0012933175,0.000014505127,0.00003629532,0.00025135485,0.00003450401,0.9783902,0.008574466,0.002414656,0.008716906,0.000028952281],"about_ca_topic_score_codex":0.009396344,"about_ca_topic_score_gemma":0.0063927956,"teacher_disagreement_score":0.009396344,"about_ca_system_score_codex":0.00083712983,"about_ca_system_score_gemma":0.0025824746,"threshold_uncertainty_score":0.018683314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093860544,0.0060167294,0.8712181,0.0008703107,0.0010673911,0.00032726538,0.00014789602,0.0022106864,0.024281185],"genre_scores_gemma":[0.5083798,0.002715965,0.47942027,0.00051292434,0.0003913887,0.00028256804,0.00022057751,0.00012726845,0.007949197],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989235,0.0000139917465,0.0000076959195,0.000021608703,0.000042837488,0.000021491598],"domain_scores_gemma":[0.9997757,0.000054037017,0.000024102357,0.000042115913,0.00009219556,0.000011823369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021299579,0.0005619451,0.0005178425,0.00059804745,0.0006293818,0.0008070486,0.0014742848,0.00093170657,0.003260696],"category_scores_gemma":[0.00070831605,0.0002030727,0.00031832137,0.00049014576,0.0003409318,0.0014387682,0.00037265013,0.00078758376,0.0008217761],"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.00040774437,0.00018510959,0.00087123906,0.0009137702,0.00007235583,0.0002915946,0.00018636564,0.01158333,0.5946292,0.101200454,0.0044988994,0.28515992],"study_design_scores_gemma":[0.00026002963,0.001640167,0.0009397494,0.000111978865,0.0002738235,0.0014056902,0.000095725365,0.16733754,0.71048987,0.023020023,0.09434011,0.00008530171],"about_ca_topic_score_codex":0.00044649988,"about_ca_topic_score_gemma":0.0007030184,"teacher_disagreement_score":0.003260696,"about_ca_system_score_codex":0.00039243084,"about_ca_system_score_gemma":0.00048189057,"threshold_uncertainty_score":0.010908127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008442705,0.0026171422,0.96456903,0.00030736573,0.00008016791,0.00013090977,0.000017475139,0.00012107337,0.02371409],"genre_scores_gemma":[0.2368623,0.008012141,0.7382973,0.00035028133,0.0001433204,0.00062927615,0.00007263513,0.00032775503,0.015305001],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987047,0.00050458894,0.00005306852,0.00013086235,0.00054710737,0.00005976461],"domain_scores_gemma":[0.99876887,0.0007071323,0.000096216216,0.00009961792,0.0003061515,0.000022060342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015222236,0.0008591654,0.0003078399,0.0005108998,0.0005463757,0.0011864428,0.0010850545,0.00064755563,0.003960103],"category_scores_gemma":[0.0041330517,0.0005508376,0.000503922,0.00068933226,0.0006760281,0.0018028677,0.0005246503,0.0011275617,0.0010069511],"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.00013218806,0.00008200686,0.0006863025,0.0011983023,0.000057659592,0.00012167612,0.0006450521,0.22477208,0.023363609,0.34864038,0.0028993755,0.39740133],"study_design_scores_gemma":[0.00011772248,0.00089097995,0.000767707,0.00062383903,0.00013296558,0.00072571443,0.00041459934,0.56759644,0.03116271,0.1768516,0.2206558,0.00005990434],"about_ca_topic_score_codex":0.000669876,"about_ca_topic_score_gemma":0.0009216922,"teacher_disagreement_score":0.003960103,"about_ca_system_score_codex":0.00091796875,"about_ca_system_score_gemma":0.0007795871,"threshold_uncertainty_score":0.013247848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145310685,0.022310859,0.32679564,0.003071373,0.0032460403,0.0004434402,0.0044753677,0.008087018,0.6170392],"genre_scores_gemma":[0.3749865,0.036878645,0.28687915,0.0046654223,0.0018665266,0.0008192117,0.0062742257,0.00093008106,0.28670022],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956936,0.000031907286,0.000025645366,0.00007402384,0.00023857593,0.000060586415],"domain_scores_gemma":[0.9998215,0.00003009053,0.00001860029,0.00003318983,0.00008818815,0.0000084781705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021563853,0.0006862738,0.00047502926,0.0008106407,0.0007054227,0.0016779429,0.0010124217,0.00078642694,0.035487033],"category_scores_gemma":[0.0006185038,0.0002365006,0.00034665855,0.0010537128,0.00040807208,0.0012999994,0.00065844384,0.00086325576,0.015616306],"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.00016723428,0.00008559782,0.000544206,0.0012735017,0.00006436465,0.0003528529,0.00031801465,0.006333678,0.058880463,0.3998359,0.12472278,0.40742132],"study_design_scores_gemma":[0.000036199384,0.00014240823,0.00023820138,0.00013722107,0.00003757581,0.000855341,0.000079058664,0.010190103,0.03358442,0.04690194,0.90776175,0.000035704743],"about_ca_topic_score_codex":0.00057611073,"about_ca_topic_score_gemma":0.0011628888,"teacher_disagreement_score":0.035487033,"about_ca_system_score_codex":0.0009162164,"about_ca_system_score_gemma":0.00052952894,"threshold_uncertainty_score":0.11871594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018711042,0.00053600443,0.92249125,0.0007911775,0.00024423297,0.00031722174,0.00050541473,0.020892551,0.03551106],"genre_scores_gemma":[0.61436373,0.0010668904,0.35099187,0.00046679808,0.00012903658,0.00060107897,0.0022988322,0.006801514,0.023280226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962811,0.0012821561,0.00028157502,0.0003600359,0.0014458379,0.0003492467],"domain_scores_gemma":[0.9886125,0.0041463915,0.0005796032,0.004904339,0.0014139821,0.0003432238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004098084,0.0015658544,0.000819602,0.0010180033,0.0010691314,0.0038882259,0.0029837396,0.0023676767,0.017476063],"category_scores_gemma":[0.020275783,0.0008400957,0.00068476755,0.0008793778,0.0009828864,0.0062925313,0.0027331442,0.0017930262,0.0059366077],"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.0007515326,0.0004214074,0.007171271,0.0009821095,0.00017535122,0.0029059784,0.0011897143,0.164509,0.029443456,0.12771326,0.060953747,0.60378313],"study_design_scores_gemma":[0.0001330347,0.000232716,0.0023238456,0.0005889649,0.000097858356,0.002822762,0.0005685235,0.5977771,0.046055872,0.18261275,0.16660032,0.00018611297],"about_ca_topic_score_codex":0.00074718375,"about_ca_topic_score_gemma":0.0011917743,"teacher_disagreement_score":0.017476063,"about_ca_system_score_codex":0.00067769265,"about_ca_system_score_gemma":0.001092436,"threshold_uncertainty_score":0.058463216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17322843,0.0028980302,0.7878641,0.0008782111,0.0006145565,0.00011776051,0.00021590653,0.0024600262,0.03172298],"genre_scores_gemma":[0.9408386,0.00030351002,0.05091134,0.00010346874,0.00009083696,0.000028361927,0.000062818275,0.00006464925,0.0075964145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996995,0.0000648933,0.000019455127,0.000044038246,0.0000949066,0.00007728659],"domain_scores_gemma":[0.9994771,0.00023104993,0.000045141038,0.000111219866,0.00010200086,0.00003350003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040710656,0.00038469047,0.0006016449,0.00034279667,0.00045848853,0.00086567004,0.0007598802,0.0004484013,0.007344853],"category_scores_gemma":[0.0019868664,0.00021265932,0.00019604409,0.0003451912,0.00028071206,0.0006319203,0.00030718817,0.0005237011,0.0006844309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014352561,0.0001367645,0.0023174013,0.00020717793,0.00005539884,0.00036022597,0.00008075487,0.39159447,0.022199761,0.05170093,0.015805969,0.5141059],"study_design_scores_gemma":[0.000044417095,0.0001775351,0.00084420166,0.00002604993,0.000027037853,0.00034452885,0.000024200292,0.97405803,0.008281206,0.011245787,0.004911562,0.0000154646],"about_ca_topic_score_codex":0.002273518,"about_ca_topic_score_gemma":0.004443458,"teacher_disagreement_score":0.007344853,"about_ca_system_score_codex":0.0005616043,"about_ca_system_score_gemma":0.0011298481,"threshold_uncertainty_score":0.024570942},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03786091,0.0019325601,0.92883027,0.00029268287,0.00041607453,0.00009370904,0.00019559644,0.004356545,0.026021583],"genre_scores_gemma":[0.48710874,0.0015922002,0.48947346,0.000306426,0.0003099479,0.00019513637,0.0006049091,0.00020938559,0.020199772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998122,0.000029763523,0.000015292484,0.000034715973,0.00007462908,0.00003354538],"domain_scores_gemma":[0.9997781,0.00005813639,0.000024784405,0.000067407695,0.00005604535,0.000015514255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030799845,0.00036718257,0.00027390075,0.00055692164,0.0003768309,0.00081362744,0.0010588695,0.0003539238,0.0060010296],"category_scores_gemma":[0.0006916902,0.00022566688,0.00035184206,0.0008121441,0.0003854864,0.0010419968,0.00073571794,0.00047476665,0.002089684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043936056,0.00010273771,0.0007590967,0.00031713996,0.000052683434,0.00021256102,0.00021940986,0.07340186,0.052728605,0.25755116,0.012446511,0.60176885],"study_design_scores_gemma":[0.0002559962,0.0010007875,0.0010516528,0.00012221604,0.00009799723,0.0008136313,0.0001785664,0.5410916,0.090744205,0.18965027,0.17487116,0.000121917896],"about_ca_topic_score_codex":0.0005418797,"about_ca_topic_score_gemma":0.0008737351,"teacher_disagreement_score":0.0060010296,"about_ca_system_score_codex":0.0006543741,"about_ca_system_score_gemma":0.0004806868,"threshold_uncertainty_score":0.02007544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09929201,0.0044755354,0.8816148,0.0005925814,0.00029245517,0.00011068275,0.00037876447,0.0022577688,0.010985468],"genre_scores_gemma":[0.7861152,0.004632085,0.19962876,0.00021424245,0.00027015724,0.00011750987,0.001020426,0.00010222626,0.0078994185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995596,0.00011062067,0.000030194342,0.00007114009,0.00020417299,0.000024362138],"domain_scores_gemma":[0.99936956,0.00026964783,0.00010175701,0.00003922001,0.00021081122,0.000008943798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053441746,0.0005000181,0.0003916322,0.0014219568,0.00018625436,0.00068527483,0.00039323972,0.00090697734,0.00086087035],"category_scores_gemma":[0.002662808,0.00017361135,0.00023703698,0.001893169,0.000333911,0.0009878258,0.00018367771,0.00034325125,0.00038633033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017771278,0.00014889191,0.008414925,0.0004265835,0.00012667615,0.0002977916,0.00006335398,0.5112268,0.019040665,0.009601452,0.0040901685,0.44638494],"study_design_scores_gemma":[0.000003067286,0.000037531194,0.0018864223,0.0000337797,0.0000193506,0.000106528336,0.00001329013,0.9873812,0.0050911843,0.0035139387,0.0018971008,0.000016582666],"about_ca_topic_score_codex":0.0019014665,"about_ca_topic_score_gemma":0.0012689492,"teacher_disagreement_score":0.0019014665,"about_ca_system_score_codex":0.00038964787,"about_ca_system_score_gemma":0.00023650783,"threshold_uncertainty_score":0.0037807822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009660409,0.00011915833,0.8000654,0.00039183558,0.00006329206,0.0001450239,0.0012500179,0.1840284,0.004276515],"genre_scores_gemma":[0.20189826,0.00064043014,0.77294225,0.00035862235,0.00005225406,0.00047821162,0.0043500806,0.010267469,0.0090122875],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935275,0.00013973817,0.000060555554,0.00010508813,0.00027757755,0.00006427383],"domain_scores_gemma":[0.99861,0.00059362844,0.00012399699,0.0002826685,0.00025464356,0.00013496404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014119638,0.0011129725,0.0005222263,0.0017708045,0.00047807643,0.002333913,0.0014124393,0.0013351542,0.0077765984],"category_scores_gemma":[0.0046045994,0.00065118563,0.0006913185,0.0006744585,0.00060922105,0.0026427838,0.0016403251,0.001323558,0.0018090508],"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.0012682973,0.0005487848,0.009230141,0.00096342707,0.00018058332,0.0011233239,0.0032249554,0.037051518,0.08820314,0.061539575,0.14401866,0.6526476],"study_design_scores_gemma":[0.00017988573,0.0001660683,0.0043426948,0.00025064903,0.000055775712,0.0011046457,0.00047516768,0.6229933,0.13732792,0.040868174,0.19208539,0.00015048303],"about_ca_topic_score_codex":0.003181989,"about_ca_topic_score_gemma":0.001968506,"teacher_disagreement_score":0.0077765984,"about_ca_system_score_codex":0.0005974387,"about_ca_system_score_gemma":0.0012173041,"threshold_uncertainty_score":0.026015282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88896793,0.002396166,0.09609887,0.00023334364,0.000107433676,0.0001391915,0.00034388775,0.0018442435,0.009868983],"genre_scores_gemma":[0.986239,0.00018118236,0.011157787,0.000030988253,0.00004041491,0.000043084023,0.00023269645,0.00006491827,0.0020097946],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995623,0.00008215339,0.00003095941,0.000058728507,0.000157345,0.00010853911],"domain_scores_gemma":[0.9985684,0.00065578916,0.00013718806,0.00026639103,0.00033134944,0.000040821382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000519671,0.0004611234,0.0004776102,0.000611045,0.0003288588,0.0008458799,0.0012671165,0.00046156143,0.004806104],"category_scores_gemma":[0.0019075812,0.0002291538,0.00022818336,0.00069604424,0.00029997906,0.0013339053,0.00033520663,0.00037695453,0.0005804645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00665583,0.0007337035,0.011030354,0.0010661246,0.00031198398,0.0005421079,0.00037632132,0.19517803,0.472865,0.05341979,0.011424952,0.2463959],"study_design_scores_gemma":[0.000112556256,0.0014952614,0.002582979,0.000028220253,0.00013160791,0.0004071178,0.00008821693,0.79230404,0.19299795,0.006598003,0.0032141586,0.0000397736],"about_ca_topic_score_codex":0.00071123004,"about_ca_topic_score_gemma":0.000800754,"teacher_disagreement_score":0.004806104,"about_ca_system_score_codex":0.0007945502,"about_ca_system_score_gemma":0.00054645014,"threshold_uncertainty_score":0.016077995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023095716,0.059294995,0.7861125,0.031371027,0.0011562097,0.00038625085,0.00014583927,0.0009414075,0.09749608],"genre_scores_gemma":[0.2593192,0.066787295,0.62148345,0.0035150563,0.0020243856,0.0007793735,0.00026740707,0.00063091435,0.045192946],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969891,0.0009442943,0.00024030627,0.00033003348,0.0013249671,0.00017137153],"domain_scores_gemma":[0.99411905,0.0023719056,0.00023954276,0.00059953955,0.0025242446,0.00014582294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052212724,0.0006658914,0.00068632705,0.0008615966,0.00077340886,0.0039486405,0.0027011505,0.0019677642,0.0052016666],"category_scores_gemma":[0.009509267,0.0006652615,0.00034893493,0.0014901934,0.0014344567,0.005456565,0.0011114972,0.0015430806,0.0030793531],"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.00008913535,0.00013818133,0.0011049226,0.0022468886,0.000030343845,0.00020933659,0.00046254104,0.03384247,0.0069042384,0.25694427,0.019976385,0.6780512],"study_design_scores_gemma":[0.000071468465,0.00036356674,0.0011172162,0.00089637307,0.000054191903,0.0016611553,0.0012210984,0.14388159,0.015098949,0.37412912,0.46143344,0.00007184213],"about_ca_topic_score_codex":0.0011448222,"about_ca_topic_score_gemma":0.0013705159,"teacher_disagreement_score":0.0052212724,"about_ca_system_score_codex":0.0013100285,"about_ca_system_score_gemma":0.0020418337,"threshold_uncertainty_score":0.027613103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03839713,0.000652969,0.9563218,0.00024502832,0.00018885377,0.00014820968,0.00019947806,0.0014621071,0.0023843932],"genre_scores_gemma":[0.54047954,0.0009896145,0.45201862,0.00026099052,0.0004734535,0.00034352456,0.0008520814,0.00012734956,0.004454873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678826,0.0008637896,0.00033933597,0.0005852175,0.0011817361,0.00024165527],"domain_scores_gemma":[0.9899603,0.0074223722,0.00048350607,0.00041792315,0.0016061706,0.00010976749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044466043,0.001146606,0.0020003524,0.0043769847,0.0010117163,0.0024748552,0.0012604251,0.0023178998,0.0021525146],"category_scores_gemma":[0.022915803,0.00065257767,0.000989091,0.001769181,0.0006779944,0.0030446027,0.00063060096,0.0014311266,0.0015842573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010226294,0.00028989246,0.02482415,0.0003096233,0.00028462315,0.00046638527,0.00029619478,0.14935969,0.008591615,0.022925347,0.009403221,0.7822266],"study_design_scores_gemma":[0.000033308548,0.000067252084,0.0017404082,0.00004239942,0.000058774385,0.00028028194,0.000042429394,0.9741537,0.0042510685,0.017181654,0.0021113125,0.000037396167],"about_ca_topic_score_codex":0.004287642,"about_ca_topic_score_gemma":0.0019693298,"teacher_disagreement_score":0.0044466043,"about_ca_system_score_codex":0.000852975,"about_ca_system_score_gemma":0.0011726063,"threshold_uncertainty_score":0.023516178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301823,0.0016216232,0.7192988,0.00044174996,0.00029234737,0.00033234188,0.0005659676,0.004755929,0.069673],"genre_scores_gemma":[0.6139156,0.000379033,0.3668119,0.00031173337,0.00007223737,0.00024337697,0.00045047462,0.0001402586,0.017675398],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.00002047048,0.000008625674,0.000037740883,0.00007090278,0.000028873976],"domain_scores_gemma":[0.99985147,0.000014063494,0.000014518332,0.000037053782,0.000068788606,0.00001405266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013845038,0.0002805617,0.00025798453,0.00021459187,0.00019476764,0.0005148447,0.0011227903,0.00039274895,0.005655016],"category_scores_gemma":[0.00021623871,0.00021405873,0.00020945027,0.00019903695,0.00013247506,0.0006570836,0.00029388428,0.00033892517,0.0014432012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006035808,0.00023410365,0.0015921408,0.00050051586,0.00012526305,0.0004818126,0.00012105659,0.04972892,0.5026846,0.0364346,0.011433414,0.3960601],"study_design_scores_gemma":[0.00020723733,0.0014830648,0.00234268,0.00006540799,0.000115867755,0.0020017738,0.00006275767,0.49541363,0.41496873,0.012166469,0.07110546,0.00006701442],"about_ca_topic_score_codex":0.0005354007,"about_ca_topic_score_gemma":0.0012779904,"teacher_disagreement_score":0.005655016,"about_ca_system_score_codex":0.0003618699,"about_ca_system_score_gemma":0.0004884199,"threshold_uncertainty_score":0.018917918},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83803433,0.0017754614,0.13883893,0.00039451837,0.0004217012,0.00014484751,0.00046137508,0.0027645386,0.017164249],"genre_scores_gemma":[0.9496509,0.00026503127,0.045446374,0.00017382398,0.00009227894,0.00004800219,0.00017789453,0.00004571638,0.004100074],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999113,0.000006364055,0.000005220461,0.000015756055,0.00004565122,0.000015640091],"domain_scores_gemma":[0.99974793,0.00007039607,0.000046286073,0.000036733407,0.00008083728,0.000017857878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077205645,0.00015915454,0.00022705528,0.0002269107,0.00016067861,0.00037819095,0.0009757441,0.0003629231,0.0024730817],"category_scores_gemma":[0.00030881728,0.00009830992,0.00014900064,0.0002282937,0.00018700743,0.0006763071,0.00024663346,0.00025813092,0.00041656458],"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.00032055352,0.00005821646,0.0009833819,0.00018878546,0.000022325537,0.00023271644,0.00007995738,0.0011404967,0.9262103,0.004118072,0.0016945592,0.06495072],"study_design_scores_gemma":[0.00012337175,0.0016043874,0.0022828346,0.000025204667,0.00009178734,0.0015702124,0.000057450223,0.03229665,0.9400338,0.0016816698,0.020194616,0.000038079004],"about_ca_topic_score_codex":0.0003019152,"about_ca_topic_score_gemma":0.00077499874,"teacher_disagreement_score":0.0024730817,"about_ca_system_score_codex":0.0002366463,"about_ca_system_score_gemma":0.00021583003,"threshold_uncertainty_score":0.0082733035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057246103,0.0026874847,0.9605374,0.0009275677,0.00013548044,0.00011908052,0.0002512484,0.0005057159,0.029111497],"genre_scores_gemma":[0.21162446,0.007913062,0.74242544,0.0005515618,0.00028941393,0.0006888044,0.0015554343,0.0004440036,0.0345078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980843,0.00048118367,0.00018763867,0.0002074243,0.00088534586,0.00015416037],"domain_scores_gemma":[0.99827456,0.0010712516,0.0001062077,0.00021440002,0.0003023401,0.000031293068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021986992,0.0009004188,0.00054470834,0.0011644402,0.00072549196,0.0031070686,0.0017996517,0.0013233955,0.003912682],"category_scores_gemma":[0.003976755,0.00073327165,0.0014195436,0.0011442231,0.0029849766,0.0033665358,0.0014652321,0.0020387191,0.0011148443],"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.000012948884,0.000031882137,0.00010846891,0.00015917612,0.000009058048,0.00015705904,0.00035738718,0.015888717,0.002506492,0.9590817,0.0021762797,0.019510785],"study_design_scores_gemma":[0.00003037508,0.000024862116,0.00012352176,0.0002624362,0.000017212291,0.00023788903,0.00011850899,0.08105464,0.0055727283,0.8301367,0.08239217,0.0000289562],"about_ca_topic_score_codex":0.0030974655,"about_ca_topic_score_gemma":0.0020778636,"teacher_disagreement_score":0.003912682,"about_ca_system_score_codex":0.0023050022,"about_ca_system_score_gemma":0.0021520671,"threshold_uncertainty_score":0.01672405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55704254,0.0011891989,0.42573625,0.00046060822,0.00043778814,0.00028467472,0.0004760213,0.006607798,0.007765071],"genre_scores_gemma":[0.9184621,0.000104155995,0.07659754,0.00016314871,0.000057282377,0.00008696536,0.00024132473,0.00012826492,0.0041592587],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977773,0.00003536218,0.000019879602,0.000041160278,0.00008690344,0.000039018632],"domain_scores_gemma":[0.999238,0.00014109006,0.000080973085,0.0001410466,0.00030809938,0.00009084275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004142715,0.00019854394,0.00021800787,0.00031972138,0.00047683163,0.00068753946,0.0019367011,0.00035525413,0.0037653171],"category_scores_gemma":[0.0010431231,0.00017507988,0.00016865789,0.0003653564,0.000277935,0.0011586248,0.00037158641,0.00039440035,0.00067776337],"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.0029186078,0.0005386985,0.006772325,0.00029444974,0.000063408705,0.00038112258,0.00017354717,0.011077838,0.76290494,0.042756747,0.01198625,0.16013215],"study_design_scores_gemma":[0.00053294824,0.0029785412,0.0033579574,0.000037314145,0.00017278237,0.0014430294,0.00008568378,0.3100058,0.64402646,0.009018259,0.02825529,0.00008588725],"about_ca_topic_score_codex":0.0009104459,"about_ca_topic_score_gemma":0.0016059368,"teacher_disagreement_score":0.0037653171,"about_ca_system_score_codex":0.0005988474,"about_ca_system_score_gemma":0.0009882264,"threshold_uncertainty_score":0.01259625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11946534,0.00034602027,0.86180365,0.00021103006,0.00013851824,0.000101643505,0.00028046907,0.004935124,0.01271823],"genre_scores_gemma":[0.6622902,0.000120097604,0.3315358,0.00012907296,0.000029878696,0.00009996353,0.00033367047,0.00004917007,0.005412157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990785,0.000013778507,0.000006432679,0.000024419762,0.000033611293,0.000013861195],"domain_scores_gemma":[0.99983966,0.00003388843,0.000019381809,0.000030778945,0.00006684241,0.000009378582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010165067,0.0002340202,0.00015248643,0.00018230175,0.00012031418,0.00023924552,0.0007250123,0.00025097732,0.004016265],"category_scores_gemma":[0.00029685037,0.00014037272,0.00015541079,0.00017149973,0.00009666434,0.0003281069,0.00016732694,0.00022646287,0.00073817425],"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.00028144568,0.00012542155,0.0020085636,0.00026033318,0.00010555068,0.00035236852,0.00007443819,0.06265958,0.47507015,0.009614093,0.008534816,0.44091326],"study_design_scores_gemma":[0.00007029679,0.0007494742,0.003882698,0.000025560723,0.000085403924,0.00088797515,0.000022268196,0.73713005,0.2308192,0.0022059071,0.024084523,0.000036606227],"about_ca_topic_score_codex":0.0006748169,"about_ca_topic_score_gemma":0.001422976,"teacher_disagreement_score":0.004016265,"about_ca_system_score_codex":0.00029037838,"about_ca_system_score_gemma":0.00025292163,"threshold_uncertainty_score":0.013435721},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035743378,0.011300481,0.91438943,0.003154652,0.0034560133,0.00009078083,0.00016145987,0.0041008056,0.059772044],"genre_scores_gemma":[0.1140385,0.021346094,0.75296736,0.0021023618,0.006699227,0.00026645674,0.0002521861,0.0025098368,0.099817954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994062,0.00012397153,0.00006225452,0.000080151425,0.000279371,0.00004795198],"domain_scores_gemma":[0.99912935,0.0004216952,0.000044509743,0.0001692748,0.000183806,0.000051390653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060698966,0.0010416762,0.000408516,0.0009915815,0.00080081506,0.002495316,0.000936372,0.001365625,0.0084589785],"category_scores_gemma":[0.0029799163,0.00071612216,0.0007426359,0.001133488,0.0010758989,0.0046861996,0.0013323203,0.0030757003,0.0041213706],"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.000086853775,0.000103574916,0.0006017284,0.0003375455,0.000032518707,0.0003013732,0.0002632575,0.009496515,0.0093517,0.4956942,0.08004262,0.40368813],"study_design_scores_gemma":[0.000014042957,0.00011272212,0.0006627132,0.00022245773,0.000038292234,0.000996965,0.00007121428,0.03828112,0.0053945812,0.305193,0.6489065,0.00010636884],"about_ca_topic_score_codex":0.0007363439,"about_ca_topic_score_gemma":0.0009959276,"teacher_disagreement_score":0.0084589785,"about_ca_system_score_codex":0.00063722586,"about_ca_system_score_gemma":0.00039644062,"threshold_uncertainty_score":0.02829808},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57128507,0.0038112262,0.40235385,0.00027938135,0.00031799663,0.0001688389,0.00036845784,0.005839844,0.0155753745],"genre_scores_gemma":[0.9383987,0.0002122205,0.057985947,0.000101207035,0.00003480751,0.00005949995,0.00014411965,0.00007107615,0.0029924624],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998536,0.00001549276,0.000010890066,0.000034381632,0.00005905304,0.000026628286],"domain_scores_gemma":[0.99967945,0.00006586928,0.00006778381,0.000073014184,0.00009239122,0.000021553948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012503586,0.00025551216,0.0003404016,0.00047950193,0.00025611752,0.00040585533,0.0017260589,0.00030396404,0.0023856289],"category_scores_gemma":[0.00039879774,0.00016136505,0.00018689407,0.00048166368,0.00018680873,0.000929176,0.00032577637,0.00022413024,0.00034988575],"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.0011870816,0.00021657691,0.0024645529,0.000509025,0.00009707253,0.0008677911,0.00024981922,0.026307605,0.74558467,0.016698195,0.005993955,0.19982368],"study_design_scores_gemma":[0.00026493796,0.0014818797,0.0021867224,0.00005615799,0.00016287305,0.0018345199,0.00008453902,0.4204306,0.5460583,0.003679285,0.023673112,0.000087101216],"about_ca_topic_score_codex":0.0006020072,"about_ca_topic_score_gemma":0.0016453548,"teacher_disagreement_score":0.0023856289,"about_ca_system_score_codex":0.00035476257,"about_ca_system_score_gemma":0.00044412355,"threshold_uncertainty_score":0.007980704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029123751,0.0003444778,0.95142555,0.000166686,0.00009354349,0.00017037833,0.00015188256,0.014390393,0.004133359],"genre_scores_gemma":[0.25593513,0.00020410282,0.73830557,0.00019838549,0.00004299734,0.00023551851,0.00042397252,0.0006584839,0.0039958325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994924,0.00011171162,0.000038558523,0.00008282953,0.0002246264,0.000049816652],"domain_scores_gemma":[0.9990632,0.0003378175,0.000097451906,0.00029266303,0.0001824025,0.000026465794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394745,0.00051688036,0.00040786463,0.00070764165,0.0004957289,0.0007181998,0.0013700442,0.0005190832,0.002932631],"category_scores_gemma":[0.0016812626,0.00032112811,0.000317487,0.000777572,0.00056697836,0.0013550726,0.0007288581,0.00072590687,0.00077683316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007879525,0.0001474256,0.002264967,0.00057679124,0.00006661102,0.00071959046,0.00042567652,0.02534185,0.22112806,0.04069499,0.018987365,0.6888587],"study_design_scores_gemma":[0.00021724342,0.0008231543,0.002002461,0.00010566587,0.00008891461,0.0010217888,0.00013183583,0.45153603,0.47432214,0.015352219,0.05430063,0.000097926095],"about_ca_topic_score_codex":0.0012684882,"about_ca_topic_score_gemma":0.001508774,"teacher_disagreement_score":0.002932631,"about_ca_system_score_codex":0.00035465113,"about_ca_system_score_gemma":0.0010250414,"threshold_uncertainty_score":0.0098106265},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022823684,0.0013403943,0.20299128,0.0006872995,0.0006351822,0.001262006,0.013180129,0.52608746,0.23099262],"genre_scores_gemma":[0.26054063,0.0015338486,0.26839858,0.002039416,0.0002328935,0.0019388766,0.071659155,0.10721755,0.2864391],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987098,0.00008682195,0.00006406632,0.00019205778,0.0007422874,0.0002049182],"domain_scores_gemma":[0.99868757,0.00038244243,0.00006743898,0.0003600193,0.0004172093,0.00008543814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193841,0.0013080101,0.00074499426,0.0015634595,0.0008229104,0.0013963598,0.0031418216,0.0013587711,0.1302162],"category_scores_gemma":[0.003562971,0.00085556967,0.0011267284,0.00076078007,0.00084150094,0.002948521,0.002951848,0.0017608075,0.034708887],"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.001525931,0.0002191743,0.0022052957,0.0016796545,0.00010979621,0.00086226483,0.00035822275,0.012283231,0.037661042,0.037327614,0.5018877,0.4038801],"study_design_scores_gemma":[0.0003803006,0.00037577355,0.0029203338,0.00025002164,0.00008937618,0.0012826531,0.00010597775,0.068235226,0.07965576,0.02459132,0.8219443,0.0001689614],"about_ca_topic_score_codex":0.003505187,"about_ca_topic_score_gemma":0.003588997,"teacher_disagreement_score":0.1302162,"about_ca_system_score_codex":0.0008712113,"about_ca_system_score_gemma":0.0012021345,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8634561,0.0027577952,0.10328143,0.0003502642,0.00025672535,0.00044272564,0.000821703,0.017627822,0.011005462],"genre_scores_gemma":[0.9226896,0.000660784,0.07181326,0.00006500257,0.000040554547,0.00014577009,0.0013533721,0.00057185465,0.0026595842],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9920167,0.0020893146,0.0010970745,0.0013295647,0.0020954395,0.0013719684],"domain_scores_gemma":[0.9858499,0.007643498,0.0010627583,0.0021121781,0.0027385773,0.0005930154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042087417,0.0017823889,0.0012851383,0.002634052,0.000977106,0.002181347,0.0023156242,0.0015596146,0.0023932834],"category_scores_gemma":[0.013128375,0.00033567208,0.00056955795,0.002784086,0.0008159434,0.0030191648,0.0014099188,0.0010295102,0.0010291635],"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.010407357,0.0023028704,0.025770618,0.0010355329,0.0005584947,0.00040854188,0.00055131887,0.3383165,0.05171229,0.006598646,0.00889674,0.5534411],"study_design_scores_gemma":[0.0002910084,0.0018122257,0.0052091703,0.00003974615,0.00012446221,0.00045099566,0.0003205519,0.89991903,0.086983174,0.0016028574,0.0031576916,0.00008894896],"about_ca_topic_score_codex":0.0040062196,"about_ca_topic_score_gemma":0.0021747747,"teacher_disagreement_score":0.0042087417,"about_ca_system_score_codex":0.0019377292,"about_ca_system_score_gemma":0.0021025643,"threshold_uncertainty_score":0.022258222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90905386,0.0036140971,0.07527798,0.00040046035,0.00021120736,0.00016807138,0.0005188083,0.0050006704,0.0057548555],"genre_scores_gemma":[0.9254839,0.0004998172,0.07101398,0.00008128249,0.000031237774,0.00006766555,0.0007458933,0.00009818726,0.0019781487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738175,0.00053095125,0.0004095188,0.00049600337,0.0008325797,0.0003491316],"domain_scores_gemma":[0.9947331,0.0025103053,0.0004595538,0.0006528267,0.0014268071,0.00021751676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016481009,0.0008930299,0.0011060791,0.001680897,0.0005827956,0.0009784399,0.0012625025,0.0009355587,0.0027849253],"category_scores_gemma":[0.0070291674,0.00025236976,0.00045000875,0.0023344439,0.00027727944,0.0017331452,0.000669974,0.0003767219,0.0005149203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058047394,0.0011810303,0.024092242,0.0006894061,0.0005987311,0.000368033,0.00016340043,0.2759041,0.034841325,0.00280012,0.007846636,0.6457103],"study_design_scores_gemma":[0.000114943796,0.00069559604,0.00503812,0.0000136134795,0.0000697051,0.0002570471,0.00008846671,0.97012895,0.021991886,0.0006245745,0.0009492328,0.000027896627],"about_ca_topic_score_codex":0.0082344385,"about_ca_topic_score_gemma":0.004712812,"teacher_disagreement_score":0.0082344385,"about_ca_system_score_codex":0.0010470938,"about_ca_system_score_gemma":0.0011015276,"threshold_uncertainty_score":0.016373038},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8872007,0.0005095354,0.09714325,0.00018362564,0.00021605026,0.0005866062,0.0014326518,0.004137979,0.008589482],"genre_scores_gemma":[0.96694374,0.00012915982,0.0301027,0.00003370968,0.000007685593,0.00016684247,0.0004173067,0.00007609521,0.0021227214],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997092,0.000057028283,0.000022507174,0.000043799017,0.00010877777,0.000058635836],"domain_scores_gemma":[0.9992199,0.0002505602,0.000060477963,0.0001873287,0.00020946832,0.0000722014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034869366,0.00043283653,0.00035827488,0.00043971965,0.00025599496,0.00036880933,0.0011502836,0.00037767735,0.0052389456],"category_scores_gemma":[0.00095844385,0.000183152,0.00014806264,0.0005013174,0.00024761385,0.0005610315,0.0001951022,0.00033175873,0.0005314139],"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.0035691983,0.0016542434,0.013781302,0.0018738018,0.00026591108,0.0020014772,0.00067384593,0.1600564,0.6306683,0.011185573,0.010146345,0.16412368],"study_design_scores_gemma":[0.0007882879,0.011029633,0.009976232,0.00008759172,0.00016963654,0.0011068751,0.00020494412,0.27721354,0.67243576,0.0009976731,0.025910277,0.00007957653],"about_ca_topic_score_codex":0.001212149,"about_ca_topic_score_gemma":0.0010283936,"teacher_disagreement_score":0.0052389456,"about_ca_system_score_codex":0.00046705283,"about_ca_system_score_gemma":0.00034413082,"threshold_uncertainty_score":0.01752603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93464804,0.00095684576,0.05012374,0.0002318426,0.00017692948,0.00017404246,0.0006790383,0.0033492404,0.009660178],"genre_scores_gemma":[0.9778136,0.0001831153,0.019359207,0.000033180342,0.0000106819125,0.00003861425,0.000260892,0.00006049517,0.0022400853],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974626,0.000057701498,0.000017516923,0.00003612576,0.000089987225,0.000052375875],"domain_scores_gemma":[0.9991912,0.0002563152,0.000085869004,0.00014884297,0.00026496802,0.000052755095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037252775,0.000327863,0.0003198875,0.00055744685,0.00039339907,0.00047093662,0.0011072641,0.00036123052,0.0063070506],"category_scores_gemma":[0.0011016489,0.00019498,0.0001279811,0.00065250584,0.00016148727,0.000626604,0.00016086377,0.00023763189,0.00039623433],"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.008887968,0.0015308909,0.014177362,0.0015475295,0.00035207855,0.0010268011,0.000355835,0.16958861,0.53447264,0.009647048,0.011257862,0.2471553],"study_design_scores_gemma":[0.000818471,0.005870787,0.008948577,0.000082757135,0.00025703077,0.0008131328,0.00015599577,0.388174,0.57609296,0.0006000827,0.018120436,0.00006580655],"about_ca_topic_score_codex":0.0026317942,"about_ca_topic_score_gemma":0.0045028212,"teacher_disagreement_score":0.0063070506,"about_ca_system_score_codex":0.00066329644,"about_ca_system_score_gemma":0.0005516883,"threshold_uncertainty_score":0.02109915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7145893,0.0022600952,0.265444,0.00021454353,0.00017303575,0.00011038005,0.00019768937,0.0033928598,0.013618149],"genre_scores_gemma":[0.9625995,0.0001588089,0.034684774,0.00006398879,0.00002576279,0.0000428166,0.00007938041,0.000030397705,0.002314572],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999145,0.000009729094,0.000006995985,0.000016754862,0.000035385714,0.000016600377],"domain_scores_gemma":[0.99982065,0.00004285771,0.000044484586,0.000027691742,0.00005171244,0.000012690553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095835654,0.00015455573,0.00024174694,0.000350656,0.00020414998,0.0003201023,0.0011490444,0.00021552734,0.0015711638],"category_scores_gemma":[0.00027097217,0.000115099865,0.00012521901,0.00034202466,0.00016771494,0.00073564856,0.0002511947,0.00014719648,0.00026429706],"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.00063779525,0.0001374017,0.0019800898,0.00033825208,0.000056184002,0.00058545405,0.00017708653,0.008666982,0.8428141,0.015722878,0.0035672477,0.12531652],"study_design_scores_gemma":[0.0001995541,0.0010700697,0.0018103578,0.000033167602,0.00014155808,0.0016716032,0.00006669337,0.20102234,0.7727764,0.0037028068,0.017448043,0.000057335157],"about_ca_topic_score_codex":0.00031589373,"about_ca_topic_score_gemma":0.0008384782,"teacher_disagreement_score":0.0015711638,"about_ca_system_score_codex":0.00025813855,"about_ca_system_score_gemma":0.0002893989,"threshold_uncertainty_score":0.0052561164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2837321,0.00051994296,0.6970704,0.00036712133,0.0003588089,0.00023924197,0.0002990231,0.0077295783,0.009683863],"genre_scores_gemma":[0.5860787,0.00015198764,0.40606445,0.00017943823,0.000054146727,0.00010702083,0.00046787862,0.00006675251,0.0068296185],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998267,0.000017230064,0.000012583396,0.000029505869,0.000079137455,0.00003479275],"domain_scores_gemma":[0.99970394,0.000077782126,0.000038162725,0.000053964133,0.000098563534,0.000027544604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022414584,0.00034854127,0.00028814838,0.0004833671,0.00030071352,0.0005583615,0.001120285,0.00038924487,0.0032418005],"category_scores_gemma":[0.0006233512,0.00016934761,0.00022550943,0.00056534866,0.00016795179,0.00058772834,0.00030102907,0.00047687645,0.0007209119],"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.0016644051,0.0005590574,0.0073223007,0.0003393216,0.00016478918,0.00036862638,0.00014569453,0.09286057,0.19320638,0.013610444,0.01599233,0.67376614],"study_design_scores_gemma":[0.00013133425,0.0005497772,0.0020308427,0.000013490271,0.000056534333,0.0002643241,0.000028308052,0.91372037,0.07084354,0.0016101442,0.010727535,0.000023869345],"about_ca_topic_score_codex":0.0020943207,"about_ca_topic_score_gemma":0.0027890308,"teacher_disagreement_score":0.0032418005,"about_ca_system_score_codex":0.00042647365,"about_ca_system_score_gemma":0.0008871137,"threshold_uncertainty_score":0.010844946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27614602,0.003984564,0.69740933,0.0006706206,0.0006333215,0.00027625717,0.0004681128,0.004707542,0.015704269],"genre_scores_gemma":[0.87346923,0.0004748455,0.121275075,0.00026190793,0.00007007606,0.00009898588,0.000163188,0.00008859297,0.004098082],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998541,0.00001680932,0.000013013364,0.000031329397,0.00006635357,0.000018396378],"domain_scores_gemma":[0.9997795,0.000038071023,0.00004125903,0.000043765183,0.00008026522,0.000017177603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012875322,0.00026493156,0.00024035762,0.00046185675,0.0004195449,0.00050872914,0.0015282414,0.00029044953,0.0017884524],"category_scores_gemma":[0.00044335154,0.00013412285,0.00016486128,0.00043118163,0.00017789044,0.0005683085,0.00024798408,0.00027169107,0.00030460313],"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.0004839449,0.00014592888,0.0037394061,0.00075449055,0.000083123115,0.0004969194,0.0002568352,0.026889557,0.6560085,0.021780644,0.009257344,0.2801034],"study_design_scores_gemma":[0.00014060506,0.0019772484,0.0022385104,0.000091761896,0.00023478748,0.0016320912,0.00009969374,0.41291273,0.50116265,0.004426567,0.07500944,0.00007385161],"about_ca_topic_score_codex":0.0007419317,"about_ca_topic_score_gemma":0.0021877454,"teacher_disagreement_score":0.0017884524,"about_ca_system_score_codex":0.0006922256,"about_ca_system_score_gemma":0.00064174965,"threshold_uncertainty_score":0.005982995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015108993,0.00007903511,0.99710244,0.000075331,0.000024588084,0.000055679993,0.00004770631,0.00057587365,0.0005284156],"genre_scores_gemma":[0.15762734,0.0004911366,0.83930606,0.00015188767,0.000120175035,0.0004572898,0.00034679877,0.00027471426,0.0012245608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913526,0.0024685482,0.0009545011,0.0012775181,0.0030522412,0.00089455507],"domain_scores_gemma":[0.98856866,0.0063141407,0.001084824,0.0024490803,0.0013096149,0.00027375593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008058842,0.0017901575,0.0014110471,0.002292077,0.0014072955,0.0046041473,0.004765818,0.002235684,0.0029242493],"category_scores_gemma":[0.015039119,0.0014738265,0.0051028165,0.0015244358,0.0050540343,0.0052849473,0.0035473376,0.0042250906,0.00071785465],"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.00011332427,0.0002327627,0.0008223993,0.00052888104,0.00016675342,0.00061586575,0.00044472583,0.2663813,0.014296201,0.6734365,0.0014130002,0.04154837],"study_design_scores_gemma":[0.000117372096,0.00014517146,0.00023582765,0.0001936817,0.00017632196,0.0002817786,0.000084455096,0.64694417,0.0122982,0.32770294,0.011740098,0.00007992778],"about_ca_topic_score_codex":0.00794054,"about_ca_topic_score_gemma":0.004322929,"teacher_disagreement_score":0.008058842,"about_ca_system_score_codex":0.0026269325,"about_ca_system_score_gemma":0.005938684,"threshold_uncertainty_score":0.042619765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06960386,0.0003015718,0.9204635,0.00028243187,0.00008089185,0.0001310015,0.00013592464,0.0009842989,0.00801647],"genre_scores_gemma":[0.55569834,0.00024296936,0.43652722,0.000111669324,0.00003498163,0.00025559825,0.00030566726,0.000065767315,0.0067577893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999348,0.000010799334,0.0000044920625,0.000015503389,0.000022466014,0.000011930267],"domain_scores_gemma":[0.99985945,0.0000269757,0.000010787055,0.000018646377,0.000075441385,0.000008640085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015295374,0.0002775672,0.00030467924,0.00033148998,0.00044492798,0.00044183104,0.0012597026,0.00044774672,0.0030159757],"category_scores_gemma":[0.00042153132,0.00017754982,0.00020226228,0.0003912911,0.00020008099,0.00058784377,0.00042548042,0.00031795164,0.00039311158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002557076,0.000087879125,0.001212788,0.00017354774,0.000070695336,0.00009591714,0.000099598605,0.7105182,0.019950679,0.03321225,0.0051778965,0.22914484],"study_design_scores_gemma":[0.000019259684,0.00003532547,0.00011951752,0.0000047652197,0.000012483596,0.000040551135,0.000014855447,0.9902845,0.003706704,0.0049071913,0.0008494032,0.0000053810204],"about_ca_topic_score_codex":0.0040381732,"about_ca_topic_score_gemma":0.007279957,"teacher_disagreement_score":0.0040381732,"about_ca_system_score_codex":0.00051930733,"about_ca_system_score_gemma":0.0010036248,"threshold_uncertainty_score":0.010089397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032044698,0.00065357867,0.9611618,0.000121801066,0.00018602332,0.00018901906,0.0001687847,0.0018910952,0.003583087],"genre_scores_gemma":[0.38477486,0.00036079125,0.6087872,0.00014528888,0.00015833954,0.0001907231,0.0005830174,0.00010106995,0.0048987074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993243,0.00010927157,0.00006567279,0.00009999771,0.00030512488,0.00009565528],"domain_scores_gemma":[0.9985996,0.00025502802,0.000103029044,0.0005992551,0.0003724967,0.000070722075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076486106,0.00034694537,0.0006114615,0.00100848,0.0007091431,0.0006432591,0.0013938327,0.0005356123,0.0034714853],"category_scores_gemma":[0.0021810078,0.0003159591,0.00035719413,0.0015951496,0.000480335,0.0021385674,0.0013823557,0.00071217003,0.0018980281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057913776,0.0002839011,0.0016687147,0.0002825824,0.000072179864,0.00020971679,0.00028694046,0.059026252,0.17005123,0.07041073,0.013535999,0.6835926],"study_design_scores_gemma":[0.00022796492,0.00090618065,0.001721711,0.000031115622,0.00009661963,0.00095708686,0.00014295548,0.8058582,0.11970036,0.03642119,0.03377355,0.00016316828],"about_ca_topic_score_codex":0.0013265604,"about_ca_topic_score_gemma":0.001164408,"teacher_disagreement_score":0.0034714853,"about_ca_system_score_codex":0.00055264536,"about_ca_system_score_gemma":0.0009718362,"threshold_uncertainty_score":0.011613309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22657616,0.003255312,0.6280575,0.0003609009,0.00079183414,0.00048205073,0.00026888668,0.010765904,0.12944156],"genre_scores_gemma":[0.72340465,0.0012314935,0.22684108,0.00026175563,0.00005517292,0.00016657966,0.00040323666,0.00025386125,0.04738221],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998,0.00003088658,0.000014904327,0.00003078559,0.00008289224,0.00004060142],"domain_scores_gemma":[0.99987495,0.000027539412,0.000017435206,0.00002750319,0.000042437976,0.000010114636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015404665,0.0003634184,0.00023353408,0.00033849716,0.00019128242,0.0005258399,0.00054833107,0.00028911288,0.006855115],"category_scores_gemma":[0.00023900704,0.00016765865,0.00018083538,0.0002082636,0.00010580705,0.00049294345,0.00018461268,0.00035272382,0.0012372184],"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.0009940705,0.00033729474,0.0036007587,0.0011253617,0.00013399932,0.0013732931,0.00022483719,0.07377605,0.28022528,0.034672093,0.016338935,0.58719796],"study_design_scores_gemma":[0.00043291,0.0023213285,0.005905094,0.0003908987,0.00021400828,0.0033134231,0.0001153858,0.32754165,0.4019221,0.004119544,0.2536202,0.00010346736],"about_ca_topic_score_codex":0.00078562135,"about_ca_topic_score_gemma":0.0010906372,"teacher_disagreement_score":0.006855115,"about_ca_system_score_codex":0.00035018547,"about_ca_system_score_gemma":0.00032769988,"threshold_uncertainty_score":0.022932589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15265256,0.00088689645,0.81066096,0.00029649842,0.00026946957,0.0004208602,0.00058764353,0.01587185,0.018353287],"genre_scores_gemma":[0.58123976,0.00040808323,0.40750867,0.00030977285,0.00011616331,0.0004260504,0.0015240349,0.00033794303,0.008129507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973005,0.00003973913,0.000020405721,0.000056583347,0.0001009635,0.000052339725],"domain_scores_gemma":[0.9996451,0.00008063172,0.00002892051,0.00006526761,0.0001577496,0.000022236682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022212644,0.0004922797,0.00032398116,0.0006484452,0.00030500125,0.0007701967,0.0015861569,0.00030626994,0.006356884],"category_scores_gemma":[0.0007187568,0.00018836788,0.00021404709,0.0011516332,0.00021333844,0.00070534943,0.00034184585,0.000702792,0.0017759883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009232831,0.00054005656,0.0036153356,0.00056634017,0.00008852168,0.00024083027,0.00012462931,0.01919304,0.22619432,0.015488062,0.032978967,0.7000466],"study_design_scores_gemma":[0.00020730493,0.0014901571,0.0029351606,0.000055208522,0.00018736292,0.00076072145,0.00008394317,0.48885426,0.43211377,0.003741543,0.06950669,0.00006400009],"about_ca_topic_score_codex":0.0009241504,"about_ca_topic_score_gemma":0.0012188647,"teacher_disagreement_score":0.006356884,"about_ca_system_score_codex":0.00048026245,"about_ca_system_score_gemma":0.0010472739,"threshold_uncertainty_score":0.021265924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4652725,0.0027592394,0.5036202,0.00049245486,0.00020047063,0.00021479934,0.0005789894,0.004697823,0.02216356],"genre_scores_gemma":[0.83800304,0.0002311568,0.15742137,0.00016172811,0.000031654487,0.00004158476,0.00021134844,0.00003096087,0.0038671463],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994075,0.000006238945,0.0000047701806,0.000013034415,0.000022090057,0.00001314444],"domain_scores_gemma":[0.99983764,0.00003202891,0.000027596063,0.000036395482,0.00005147051,0.000014722954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079252386,0.00014092434,0.00016726281,0.0002758558,0.00027246485,0.0002959873,0.00093373447,0.0002607601,0.0027514177],"category_scores_gemma":[0.00029060768,0.000087994595,0.000121976,0.00046932691,0.00021492524,0.0008092444,0.00025494467,0.00021004566,0.0003597481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005120005,0.00009576888,0.0014032099,0.00039678483,0.00003376069,0.00028154804,0.00015997741,0.013766154,0.5589332,0.021216614,0.006769295,0.39643168],"study_design_scores_gemma":[0.00022073596,0.0016091677,0.0040477216,0.000055731936,0.00017610921,0.0019288339,0.000109656445,0.3604028,0.57959026,0.009039154,0.04275008,0.00006977157],"about_ca_topic_score_codex":0.0014003143,"about_ca_topic_score_gemma":0.0032416082,"teacher_disagreement_score":0.0027514177,"about_ca_system_score_codex":0.00037887294,"about_ca_system_score_gemma":0.0005057968,"threshold_uncertainty_score":0.009204388},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8248846,0.0056695966,0.14135452,0.0006503024,0.00037167958,0.00032616316,0.00080210814,0.0047011394,0.021239866],"genre_scores_gemma":[0.9697826,0.00064999197,0.025471702,0.000053082556,0.000036907983,0.000079435966,0.00056356477,0.00006668783,0.0032959445],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969214,0.00071978214,0.00027730866,0.0003135757,0.0013350653,0.00043296124],"domain_scores_gemma":[0.9949687,0.0021028288,0.00037203517,0.0006784413,0.001704897,0.00017311121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001791084,0.00069036544,0.00057551387,0.0016002061,0.00072868343,0.0011266635,0.0012094359,0.00053212076,0.0057131075],"category_scores_gemma":[0.0055324407,0.00016203731,0.00028479585,0.0015958104,0.00045465535,0.0016813794,0.00061772414,0.00042401731,0.0011323587],"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.013691911,0.0008705515,0.01791275,0.0016651194,0.00040556534,0.000430975,0.00044450976,0.26814398,0.09476933,0.024862964,0.015628595,0.5611738],"study_design_scores_gemma":[0.00041821733,0.0071272296,0.008164675,0.00014565971,0.00023009084,0.0010210283,0.00043788963,0.7491238,0.21681131,0.0036152157,0.012789006,0.000115864656],"about_ca_topic_score_codex":0.0012034188,"about_ca_topic_score_gemma":0.001007142,"teacher_disagreement_score":0.0057131075,"about_ca_system_score_codex":0.0014897358,"about_ca_system_score_gemma":0.0011714603,"threshold_uncertainty_score":0.01911223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19483548,0.001237943,0.6083238,0.00069688534,0.0006955422,0.0010118376,0.0014626833,0.1361157,0.055620138],"genre_scores_gemma":[0.8655753,0.00030487965,0.10309236,0.00062202895,0.00015491588,0.00033775388,0.0021790855,0.000467319,0.027266387],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914575,0.000096689895,0.00007252783,0.00019591482,0.00038895564,0.00010014617],"domain_scores_gemma":[0.99898463,0.00014871062,0.00009940103,0.00021339509,0.00047455062,0.000079200305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044458377,0.0005128195,0.00053992204,0.000868885,0.00042221777,0.00091354764,0.0010995666,0.00044117807,0.013199857],"category_scores_gemma":[0.001271895,0.00019302573,0.00020347681,0.00053817104,0.00022826104,0.0008992322,0.00065954105,0.0004266843,0.0045928564],"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.0024175965,0.0009935929,0.012585816,0.00066255574,0.00025593812,0.0009097037,0.0002717021,0.027850002,0.17180789,0.010881687,0.09464917,0.67671436],"study_design_scores_gemma":[0.0005394537,0.0022821254,0.010586945,0.000074726384,0.00030922907,0.0022884547,0.00008088322,0.56654334,0.2851108,0.0036302377,0.12836456,0.0001892238],"about_ca_topic_score_codex":0.0013503053,"about_ca_topic_score_gemma":0.0013850591,"teacher_disagreement_score":0.013199857,"about_ca_system_score_codex":0.00060212053,"about_ca_system_score_gemma":0.000767924,"threshold_uncertainty_score":0.044157922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38998044,0.001534085,0.5883392,0.0003351624,0.0001657953,0.00019879162,0.0003897842,0.0026912878,0.0163654],"genre_scores_gemma":[0.8753858,0.0003079671,0.11930272,0.0001299801,0.00004945613,0.000086503365,0.00022286428,0.00002751475,0.0044872225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993694,0.000007374122,0.000003834882,0.0000144835885,0.000025625504,0.000011772693],"domain_scores_gemma":[0.99985015,0.000030753974,0.000024243813,0.000028125085,0.00005582539,0.000010961967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006145221,0.00020164858,0.00021603015,0.00035652186,0.00023542947,0.0003732106,0.001539443,0.00026283532,0.0017526755],"category_scores_gemma":[0.0002035554,0.00011237214,0.00014050034,0.0005799621,0.00018508469,0.0007938512,0.00028855226,0.00020028753,0.0003459733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070191163,0.0002845848,0.0027120383,0.0006602876,0.00012017061,0.00047669254,0.00013051441,0.06046147,0.5226901,0.03035496,0.008616745,0.3727905],"study_design_scores_gemma":[0.000118308366,0.0014784127,0.0022492611,0.000046525663,0.00020537189,0.0013593601,0.00008426741,0.65548795,0.30669034,0.00621349,0.02600237,0.00006430119],"about_ca_topic_score_codex":0.0009453335,"about_ca_topic_score_gemma":0.0032036128,"teacher_disagreement_score":0.0017526755,"about_ca_system_score_codex":0.0003765092,"about_ca_system_score_gemma":0.00032237286,"threshold_uncertainty_score":0.005863309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.191753,0.0018509165,0.70147705,0.001451046,0.0011789199,0.0008276646,0.0018508087,0.043046005,0.056564536],"genre_scores_gemma":[0.65308875,0.00049593876,0.30538929,0.0010040725,0.00019710833,0.0003478971,0.0019722069,0.00058171526,0.036923043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996878,0.000034055727,0.000024964056,0.00006486816,0.00012807874,0.00006025654],"domain_scores_gemma":[0.9996424,0.00008586306,0.000048780734,0.00005044419,0.000127222,0.000045304037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034052233,0.0004632094,0.0004256995,0.00047695258,0.00038419646,0.000700073,0.001208403,0.0005754146,0.0128902225],"category_scores_gemma":[0.00064408634,0.00031885962,0.00029229463,0.0005025328,0.00013833426,0.00081099535,0.00044894253,0.00069673377,0.0028818687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002248918,0.00053619465,0.005908881,0.00084475696,0.00016578204,0.0006801985,0.00030354978,0.032512385,0.40335554,0.0299357,0.066183835,0.45732424],"study_design_scores_gemma":[0.00043169243,0.0022733696,0.005946216,0.00011670038,0.00021516993,0.001830706,0.00008848951,0.419135,0.30792627,0.004323191,0.25752014,0.00019301032],"about_ca_topic_score_codex":0.0010907131,"about_ca_topic_score_gemma":0.0013426732,"teacher_disagreement_score":0.0128902225,"about_ca_system_score_codex":0.00060543686,"about_ca_system_score_gemma":0.001205294,"threshold_uncertainty_score":0.043122053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007883564,0.00012769148,0.9875031,0.00012484707,0.000041474974,0.00006406004,0.00007781023,0.0020839768,0.0020934385],"genre_scores_gemma":[0.099844985,0.00019673127,0.89462006,0.00014483093,0.00004242473,0.00019596654,0.0004455159,0.00065644045,0.003853053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783933,0.00045038093,0.00022381218,0.00048812656,0.00075458206,0.00024361355],"domain_scores_gemma":[0.99790394,0.00063989905,0.00016922416,0.00076261885,0.00045911386,0.0000652411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015896125,0.00076606387,0.0010411281,0.0013999277,0.00078992726,0.0019181552,0.0024381066,0.0008306725,0.00429368],"category_scores_gemma":[0.003893698,0.00053840654,0.0011113351,0.0025927385,0.0014499928,0.0031141243,0.0020707578,0.0015934608,0.0026881977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005782136,0.00018137957,0.0014952418,0.00028053156,0.000064512285,0.0002523264,0.00035088323,0.08657317,0.031481456,0.15178278,0.009061989,0.7178976],"study_design_scores_gemma":[0.00011228398,0.00013047051,0.0002768815,0.000039729453,0.00002820275,0.00029712616,0.000091772876,0.7197747,0.05067543,0.2105681,0.017953133,0.00005210125],"about_ca_topic_score_codex":0.0019630427,"about_ca_topic_score_gemma":0.0022916389,"teacher_disagreement_score":0.00429368,"about_ca_system_score_codex":0.0010683938,"about_ca_system_score_gemma":0.001740388,"threshold_uncertainty_score":0.014363766},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022046115,0.57918847,0.33643717,0.0013140343,0.00081235275,0.0001702399,0.00034385044,0.0014010633,0.058286674],"genre_scores_gemma":[0.1942211,0.47434795,0.2838245,0.0012856656,0.0016103406,0.00043853399,0.0009324465,0.00023876528,0.04310067],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999038,0.000012158918,0.000009328551,0.000017755028,0.000041989275,0.000014990381],"domain_scores_gemma":[0.99984264,0.000079403304,0.000017722274,0.000011825852,0.000042007174,0.0000064312417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001998661,0.00071092707,0.0005126589,0.0009331888,0.00024154627,0.00084086374,0.0011443229,0.00082839443,0.0068885973],"category_scores_gemma":[0.0004128298,0.00032001256,0.00027545632,0.0015106644,0.00026707558,0.001780838,0.00034596917,0.0004802105,0.0018167131],"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.00009607931,0.00008392495,0.0005800931,0.003732631,0.000047209,0.00016848106,0.00013398896,0.009609952,0.028546935,0.06873127,0.022068636,0.86620086],"study_design_scores_gemma":[0.000048986458,0.0005777305,0.00082036917,0.00071228226,0.00017801335,0.0028646945,0.00013691765,0.055848394,0.04442983,0.039964307,0.85434645,0.00007206815],"about_ca_topic_score_codex":0.00044662392,"about_ca_topic_score_gemma":0.0007935404,"teacher_disagreement_score":0.0068885973,"about_ca_system_score_codex":0.00039589056,"about_ca_system_score_gemma":0.00031994242,"threshold_uncertainty_score":0.023044646},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7495332,0.0044174846,0.22656128,0.002630436,0.00025429644,0.00010579882,0.00039060303,0.001706149,0.014400789],"genre_scores_gemma":[0.96645075,0.00027110954,0.030422386,0.00014023016,0.000050021874,0.000035477115,0.000120318706,0.000051721392,0.0024579673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910283,0.0003205038,0.000051664378,0.000101854,0.00023808691,0.00018505994],"domain_scores_gemma":[0.9927921,0.005474267,0.0002693926,0.00051872287,0.00080537604,0.00014015866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015648886,0.000479997,0.00058590225,0.0010793204,0.0009334734,0.0015117646,0.0013406542,0.000859061,0.0042336877],"category_scores_gemma":[0.009491011,0.00032544823,0.00024585516,0.0015621857,0.00046437435,0.0029202143,0.00075257145,0.0005722629,0.000395346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021773404,0.00035249375,0.0067871767,0.00032914474,0.00009189637,0.00014652459,0.00042078865,0.49636263,0.020186918,0.054012507,0.012232296,0.4069002],"study_design_scores_gemma":[0.00003235816,0.00018512894,0.0007591752,0.000014013401,0.000029786715,0.00007029913,0.00009375796,0.98296887,0.005369251,0.00966839,0.0007978099,0.000011198454],"about_ca_topic_score_codex":0.004139545,"about_ca_topic_score_gemma":0.011933112,"teacher_disagreement_score":0.0042336877,"about_ca_system_score_codex":0.0018059234,"about_ca_system_score_gemma":0.0019258922,"threshold_uncertainty_score":0.014163077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.474228,0.00076082465,0.5114597,0.0002358834,0.000066130626,0.000060093298,0.00014017435,0.0014238375,0.01162531],"genre_scores_gemma":[0.9155572,0.00027362694,0.080479346,0.00006954809,0.000021067694,0.000040410738,0.00010453317,0.000029218232,0.0034250047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999187,0.000013692698,0.0000057305356,0.000014455699,0.00003165827,0.000015750284],"domain_scores_gemma":[0.999783,0.00007218065,0.000027690145,0.000039845905,0.000063601474,0.00001370304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011678696,0.00016613936,0.00019710023,0.00028052749,0.0001980212,0.00032727618,0.00062815985,0.00023180264,0.001298377],"category_scores_gemma":[0.00052085996,0.00011002125,0.000112347596,0.00038472333,0.00025836533,0.0006795621,0.00027783963,0.00020741545,0.00027312472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060060626,0.00017758095,0.0020674164,0.0002750897,0.00006642965,0.00045736379,0.00016147002,0.38429496,0.18981987,0.09301095,0.0040805116,0.32498768],"study_design_scores_gemma":[0.00004498584,0.00021478992,0.000632078,0.000014174551,0.000022272581,0.00023369251,0.00004355589,0.88721263,0.08685453,0.02038523,0.004323413,0.000018583685],"about_ca_topic_score_codex":0.00144716,"about_ca_topic_score_gemma":0.003520383,"teacher_disagreement_score":0.00144716,"about_ca_system_score_codex":0.00033242328,"about_ca_system_score_gemma":0.0003815726,"threshold_uncertainty_score":0.00434345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17055437,0.00060668454,0.77799064,0.00048147413,0.00037890853,0.00029393693,0.0004529141,0.020015972,0.029225012],"genre_scores_gemma":[0.6702654,0.0001603494,0.31421557,0.0002677075,0.000050794668,0.00013172196,0.0006155256,0.00024664184,0.014046151],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998491,0.000014698431,0.000009477059,0.000021198668,0.00007450376,0.00003097606],"domain_scores_gemma":[0.9996939,0.000085959815,0.000033660875,0.000050611496,0.00010284277,0.00003311967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002298194,0.0003067185,0.00025988175,0.0003864605,0.0002527946,0.0005103482,0.0011789848,0.0002871028,0.008278892],"category_scores_gemma":[0.00067164423,0.0001773336,0.00019281675,0.0005413481,0.00017386381,0.00040413655,0.00030488786,0.0006581035,0.0013660763],"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.0021112128,0.0005548212,0.007660978,0.0005059216,0.00012925465,0.00043232524,0.0002132651,0.17729679,0.17661428,0.027705371,0.04243504,0.5643408],"study_design_scores_gemma":[0.000108491295,0.0004902102,0.0013757637,0.000015228578,0.000030858835,0.00015051039,0.000023472556,0.9327578,0.04678728,0.0015067159,0.016724883,0.0000287407],"about_ca_topic_score_codex":0.0026735526,"about_ca_topic_score_gemma":0.0037839278,"teacher_disagreement_score":0.008278892,"about_ca_system_score_codex":0.00061963726,"about_ca_system_score_gemma":0.0010694329,"threshold_uncertainty_score":0.027695715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15716569,0.0010531401,0.83612764,0.00033768752,0.00016665466,0.00013272253,0.00007711844,0.0012701285,0.00366922],"genre_scores_gemma":[0.89448404,0.00015441078,0.10330031,0.00020847276,0.00006283206,0.0000588613,0.000038442296,0.000040295905,0.0016523479],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997433,0.000044546734,0.000023297063,0.00006421285,0.000101588004,0.000023117022],"domain_scores_gemma":[0.99960726,0.00013166732,0.00007321641,0.00008695586,0.000085412656,0.000015580827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022104221,0.0003298457,0.000239894,0.00033688374,0.0003676982,0.00041172048,0.00088840874,0.0003521699,0.0016738941],"category_scores_gemma":[0.0010360325,0.0001877156,0.00013719965,0.0004285378,0.00035576982,0.0011313984,0.00046618344,0.000302717,0.00032840387],"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.0005990955,0.000115580595,0.0009839719,0.00016335204,0.00003705253,0.00017936162,0.00017354806,0.009370058,0.6483819,0.011315314,0.0013797067,0.32730103],"study_design_scores_gemma":[0.00007463404,0.0008648719,0.0012339146,0.000026836655,0.0000634642,0.00090626813,0.000072698116,0.1883282,0.79316425,0.005886832,0.009330996,0.000047135254],"about_ca_topic_score_codex":0.00021201873,"about_ca_topic_score_gemma":0.00051469164,"teacher_disagreement_score":0.0016738941,"about_ca_system_score_codex":0.00031941972,"about_ca_system_score_gemma":0.0002380076,"threshold_uncertainty_score":0.005599797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025655512,0.00031418217,0.9691399,0.0001087426,0.0000540562,0.0001269394,0.00006880216,0.0013150825,0.003216857],"genre_scores_gemma":[0.31013012,0.00020549292,0.6844042,0.00010910639,0.000028806338,0.00025850983,0.00021801569,0.00007338271,0.004572373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998934,0.000010003296,0.0000093645995,0.000025994674,0.000041286054,0.000019964476],"domain_scores_gemma":[0.99987805,0.000025650521,0.00001106567,0.000021325935,0.000054065848,0.000009749991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017998989,0.0003430952,0.00039617578,0.00053558295,0.00035114054,0.00050110766,0.0013498565,0.0005693446,0.0035914993],"category_scores_gemma":[0.00037940897,0.0002322234,0.0002849781,0.00048914255,0.00018361292,0.00075183064,0.00054269243,0.00042509224,0.0007797401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033554743,0.00021381573,0.0019247418,0.00028537502,0.00012844056,0.00022180774,0.000102385726,0.29204035,0.054884702,0.03182353,0.005645379,0.61239386],"study_design_scores_gemma":[0.000057513033,0.000100589394,0.00033690195,0.000011998747,0.000028917271,0.00017192274,0.000025000241,0.98013407,0.010854765,0.0051446226,0.0031180985,0.000015599817],"about_ca_topic_score_codex":0.0027678933,"about_ca_topic_score_gemma":0.00473884,"teacher_disagreement_score":0.0035914993,"about_ca_system_score_codex":0.00040251363,"about_ca_system_score_gemma":0.001284179,"threshold_uncertainty_score":0.012014806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013269823,0.0015530841,0.969085,0.00040381114,0.0001573754,0.00013298258,0.00012943325,0.0061671315,0.0091014225],"genre_scores_gemma":[0.12045165,0.0017651288,0.866489,0.0003814926,0.00015844965,0.00023087072,0.00050637446,0.0007524779,0.00926457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852127,0.00020063741,0.00011596907,0.00025702108,0.00068580307,0.00021940446],"domain_scores_gemma":[0.9986142,0.00030070238,0.00009573355,0.0004614533,0.00046774893,0.00006021531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011119514,0.0007714057,0.00050956797,0.001001274,0.0008092807,0.0016257393,0.0017147216,0.0006404653,0.0053544333],"category_scores_gemma":[0.003473322,0.00069114164,0.00094243954,0.0020470258,0.001318891,0.0035174317,0.0014294711,0.0020007675,0.0024314034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007348353,0.0001573243,0.0019125637,0.0007111832,0.00009550633,0.00020675058,0.0004200948,0.060407843,0.06421051,0.20199485,0.028066602,0.64108187],"study_design_scores_gemma":[0.0002342211,0.0005144662,0.0013850321,0.0002687405,0.00012008691,0.00046841116,0.00013865724,0.6041622,0.108986355,0.12979215,0.15374883,0.00018086522],"about_ca_topic_score_codex":0.006501799,"about_ca_topic_score_gemma":0.0067065023,"teacher_disagreement_score":0.006501799,"about_ca_system_score_codex":0.0011768793,"about_ca_system_score_gemma":0.0021280341,"threshold_uncertainty_score":0.017912388},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069792554,0.14930208,0.7027472,0.013168027,0.0014264775,0.00036945127,0.00015660195,0.0020639447,0.060973637],"genre_scores_gemma":[0.19149244,0.08498902,0.69566107,0.0022425617,0.000882285,0.00024450314,0.00072405895,0.00032775692,0.02343629],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999008,0.00016957449,0.000087336506,0.00017562117,0.0004778483,0.00008179996],"domain_scores_gemma":[0.9978309,0.00032802872,0.00013427164,0.00027036044,0.0012978503,0.00013850034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034249218,0.00047125592,0.00045499418,0.0010396695,0.00032803087,0.002162817,0.001996061,0.001727263,0.0013462169],"category_scores_gemma":[0.002332145,0.00045943857,0.0004371929,0.0012452139,0.0006309177,0.004575536,0.0007424711,0.0023046099,0.00064540806],"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.000211162,0.00029247935,0.0038378777,0.0012959411,0.00012480785,0.00019067967,0.00033982375,0.028375473,0.03122962,0.27415547,0.013805304,0.64614135],"study_design_scores_gemma":[0.00013772446,0.0012761062,0.0060638255,0.000672893,0.00036449492,0.0024945135,0.00049743656,0.2923382,0.03363028,0.0808282,0.58147395,0.00022243071],"about_ca_topic_score_codex":0.0014114577,"about_ca_topic_score_gemma":0.0017124107,"teacher_disagreement_score":0.0034249218,"about_ca_system_score_codex":0.0015252082,"about_ca_system_score_gemma":0.001803993,"threshold_uncertainty_score":0.018112957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093793304,0.000044189746,0.9980934,0.000032801818,0.00001590752,0.00002711703,0.0000042535244,0.000056842524,0.0007875199],"genre_scores_gemma":[0.2656208,0.00017354214,0.73003215,0.00010981928,0.000059152953,0.0005041207,0.000039842205,0.0001125582,0.0033480725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821115,0.0009678974,0.000048509555,0.00013455897,0.0005418602,0.000095904405],"domain_scores_gemma":[0.99847144,0.00075400266,0.00012480654,0.00015363269,0.00042410893,0.000071932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002969557,0.00081460417,0.00096219283,0.000637399,0.00070789666,0.0010389963,0.001470805,0.0011184707,0.005487898],"category_scores_gemma":[0.0034724441,0.000619288,0.00097003556,0.0003656268,0.00065563037,0.0007577098,0.0013045501,0.0011852849,0.0007035831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016175293,0.00014018509,0.00043894807,0.00015761943,0.00009770233,0.00007973228,0.00013713111,0.8581006,0.006335514,0.0398299,0.0011662144,0.0933548],"study_design_scores_gemma":[0.000013704277,0.00005055839,0.000036511225,0.000007583089,0.000007720221,0.0000115018665,0.000006068641,0.994779,0.00059422036,0.0035345955,0.00095220935,0.000006460379],"about_ca_topic_score_codex":0.0015760185,"about_ca_topic_score_gemma":0.0020026327,"teacher_disagreement_score":0.005487898,"about_ca_system_score_codex":0.00068053656,"about_ca_system_score_gemma":0.0013449481,"threshold_uncertainty_score":0.018358827},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53064,0.0024401427,0.4297284,0.00034249268,0.000200454,0.00021896488,0.00030331252,0.0054752654,0.030650955],"genre_scores_gemma":[0.7392531,0.00041145016,0.2531387,0.00010624654,0.00002538111,0.00006489049,0.00023656974,0.000076250115,0.0066873995],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998785,0.000018663419,0.000010690542,0.000021067684,0.000046269128,0.000024752548],"domain_scores_gemma":[0.9997291,0.00008518844,0.00005656948,0.000064288346,0.0000486179,0.000016203192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119836135,0.0003455507,0.00020685536,0.0003624527,0.00018358124,0.0004329681,0.0006403185,0.00024041653,0.002135342],"category_scores_gemma":[0.00039036173,0.00014645474,0.00015659396,0.00031294295,0.00021138776,0.00083759584,0.00030958612,0.0002603373,0.00052967557],"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.0005464207,0.000118761964,0.0017593526,0.0003924003,0.000048857648,0.00038869274,0.00016630153,0.018779468,0.50780916,0.014699682,0.0029710843,0.4523199],"study_design_scores_gemma":[0.00023419832,0.002185296,0.0035933668,0.00014511145,0.0001573023,0.0014902332,0.00015755814,0.17602746,0.7597582,0.005500639,0.050682575,0.00006799744],"about_ca_topic_score_codex":0.0005969458,"about_ca_topic_score_gemma":0.001623637,"teacher_disagreement_score":0.002135342,"about_ca_system_score_codex":0.00029279024,"about_ca_system_score_gemma":0.0003313867,"threshold_uncertainty_score":0.007143438},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077290826,0.0008072062,0.90628946,0.00035474842,0.000038469163,0.00010428739,0.00006242078,0.0021800345,0.012872465],"genre_scores_gemma":[0.71524554,0.0008123933,0.2797918,0.00015143405,0.00008316472,0.0001611231,0.00013632959,0.00012716238,0.0034911125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936336,0.00022860144,0.00002694296,0.00006487246,0.00022439058,0.00009176113],"domain_scores_gemma":[0.9991762,0.00033560736,0.000089712594,0.0002311342,0.0001404287,0.000026908438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083868037,0.00036119693,0.0005981449,0.00069073366,0.00062876695,0.0007822843,0.000738727,0.00065497216,0.0011407324],"category_scores_gemma":[0.0028653299,0.0002537639,0.00028058898,0.00057079125,0.0005791009,0.0013152293,0.0013625213,0.00059974275,0.00058396795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040606386,0.00013507955,0.0022175186,0.00046020828,0.00009610847,0.00068523147,0.0016476269,0.08695519,0.11936028,0.28197566,0.0068006204,0.49926046],"study_design_scores_gemma":[0.000082643106,0.00042510228,0.0011694533,0.000089896406,0.00012288189,0.0012694224,0.00031807338,0.7833827,0.043026105,0.116656914,0.0533751,0.00008176711],"about_ca_topic_score_codex":0.000670824,"about_ca_topic_score_gemma":0.0011216754,"teacher_disagreement_score":0.0011407324,"about_ca_system_score_codex":0.00037785363,"about_ca_system_score_gemma":0.0004939095,"threshold_uncertainty_score":0.00443542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22216213,0.0004992405,0.7695235,0.00026751714,0.00008670139,0.00013880129,0.000048844282,0.0021338987,0.0051394426],"genre_scores_gemma":[0.8915425,0.00008032506,0.10595744,0.00006606792,0.00003172835,0.000080042424,0.000050766488,0.00008342135,0.0021077262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996911,0.000102166414,0.000013983729,0.000054990473,0.00007765209,0.00006006317],"domain_scores_gemma":[0.99943537,0.00023374522,0.0000859794,0.00012738963,0.00007753899,0.000039923932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048806248,0.00056678813,0.00038705728,0.00047464634,0.00053961255,0.00049288775,0.0009512302,0.00024488172,0.0018262836],"category_scores_gemma":[0.0015827925,0.00024394329,0.00018367771,0.0003805462,0.00038513064,0.00095475896,0.00058899657,0.00042493787,0.00034661972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012172951,0.000322584,0.0023231797,0.00017765952,0.00004626056,0.00016820691,0.00018322843,0.63122493,0.062305067,0.012384588,0.0033804,0.28626662],"study_design_scores_gemma":[0.000026791615,0.000107991735,0.00029189346,0.000004804022,0.000007674337,0.000034285073,0.000021401163,0.98438984,0.0093627935,0.0049351775,0.0008101072,0.000007331688],"about_ca_topic_score_codex":0.0014787813,"about_ca_topic_score_gemma":0.0022396296,"teacher_disagreement_score":0.0018262836,"about_ca_system_score_codex":0.00052890443,"about_ca_system_score_gemma":0.0005743418,"threshold_uncertainty_score":0.0061095357},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067589626,0.0015526614,0.4646731,0.00041764296,0.0004045094,0.00090418017,0.008498617,0.39773417,0.058225445],"genre_scores_gemma":[0.46151417,0.0010475926,0.43457356,0.0011416017,0.00011802372,0.0006907916,0.0321413,0.011355217,0.05741774],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988675,0.00013708738,0.00009124537,0.000274658,0.00046990483,0.00015968006],"domain_scores_gemma":[0.9987691,0.00022821747,0.00010515674,0.0006089869,0.00023323389,0.00005533344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084031513,0.0009062509,0.00076747814,0.0012731034,0.0003479565,0.0015936709,0.0029077162,0.00079164124,0.010900826],"category_scores_gemma":[0.0024977042,0.0005539123,0.00046616836,0.0010021916,0.0005254348,0.0021079888,0.0012627665,0.0007222707,0.0060681654],"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.0033237287,0.0004711236,0.008163842,0.0011783899,0.00024230304,0.0007932424,0.0004030425,0.024291132,0.084190555,0.048158523,0.19139364,0.6373905],"study_design_scores_gemma":[0.0004284082,0.0011418776,0.004262814,0.00011003166,0.00015142548,0.0021966957,0.00012230259,0.43282062,0.20056382,0.030094828,0.32792228,0.00018496011],"about_ca_topic_score_codex":0.0017451206,"about_ca_topic_score_gemma":0.0015447292,"teacher_disagreement_score":0.010900826,"about_ca_system_score_codex":0.00071472075,"about_ca_system_score_gemma":0.0009797409,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7287663,0.0034127492,0.2547309,0.001444354,0.00039545563,0.00015568969,0.00015377098,0.002181113,0.00875968],"genre_scores_gemma":[0.9448698,0.00031167187,0.05083345,0.00023347842,0.00010796925,0.000041910025,0.000038533766,0.000041365387,0.0035217982],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996897,0.000063625266,0.00002034575,0.000048314032,0.00014521212,0.00003279236],"domain_scores_gemma":[0.9994098,0.00022034587,0.00013106895,0.000084015264,0.00013001845,0.00002479423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033509667,0.00035103326,0.00022669273,0.0002049133,0.0003091269,0.00069496455,0.0011112012,0.0005474284,0.0026497205],"category_scores_gemma":[0.00096118264,0.0002518866,0.00018170061,0.00026394604,0.000342992,0.00128707,0.00039088845,0.0004251214,0.0005650974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040549078,0.00006843668,0.001349041,0.00010669213,0.00003319133,0.00025077016,0.00014866258,0.0017542788,0.94133586,0.0052635088,0.0010436982,0.048240494],"study_design_scores_gemma":[0.00012523656,0.0012996958,0.0017802063,0.000029781004,0.00009333438,0.0010302715,0.000117079144,0.043807067,0.936336,0.0024663717,0.012874042,0.00004093506],"about_ca_topic_score_codex":0.00020831308,"about_ca_topic_score_gemma":0.0009099199,"teacher_disagreement_score":0.0026497205,"about_ca_system_score_codex":0.00024328042,"about_ca_system_score_gemma":0.00021188679,"threshold_uncertainty_score":0.008864224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062056147,0.00096279115,0.8860768,0.00027001053,0.00034721554,0.0003845465,0.0005378749,0.0408987,0.008465911],"genre_scores_gemma":[0.30346254,0.00027650638,0.686857,0.00022890687,0.00010390087,0.00032149962,0.00141941,0.0006860199,0.006644284],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942493,0.00006378263,0.00005332797,0.0001223643,0.00023803856,0.00009752402],"domain_scores_gemma":[0.99904567,0.00023621811,0.00012049456,0.00027856638,0.00027104712,0.000047997117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045445774,0.0007681323,0.00055798376,0.0015040855,0.00049388595,0.0013131246,0.0028587733,0.00047598136,0.006670495],"category_scores_gemma":[0.0022167324,0.0005258073,0.0003724823,0.0014195004,0.00034608215,0.001489694,0.0007178755,0.0008997318,0.0020138083],"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.00061531516,0.00026148476,0.0034236806,0.00027224206,0.00008295442,0.00014881315,0.000098374025,0.02875953,0.028830905,0.0065828953,0.021932064,0.9089917],"study_design_scores_gemma":[0.00012369565,0.00059597264,0.0028255282,0.00003182632,0.00007397766,0.00048196962,0.000052070638,0.87585986,0.08469653,0.0026518342,0.032536227,0.00007060278],"about_ca_topic_score_codex":0.004572714,"about_ca_topic_score_gemma":0.0042283656,"teacher_disagreement_score":0.006670495,"about_ca_system_score_codex":0.000978153,"about_ca_system_score_gemma":0.0015622907,"threshold_uncertainty_score":0.022315085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086935215,0.0006600224,0.89219695,0.0003034668,0.00017278195,0.0002829952,0.00044415373,0.0020605046,0.016943872],"genre_scores_gemma":[0.4808029,0.0005801847,0.5030964,0.00018920102,0.00012144972,0.00032682388,0.00096404634,0.000087907305,0.013831103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999813,0.00001934237,0.000021043754,0.00003274459,0.00008533554,0.000028428189],"domain_scores_gemma":[0.99970573,0.00004733705,0.000028799646,0.00009613084,0.0001072053,0.000014724746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002643888,0.00030530468,0.0005434922,0.00077598164,0.0006906543,0.00059834786,0.00073636783,0.00044136547,0.003236471],"category_scores_gemma":[0.00057476864,0.0001695596,0.00025358927,0.0008720991,0.0002759484,0.0013682786,0.00077598164,0.00029747508,0.00093183614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005981258,0.00022598794,0.0014702125,0.00025225495,0.00005008975,0.0005336826,0.00016840379,0.020456389,0.17501917,0.07849259,0.01188115,0.71085185],"study_design_scores_gemma":[0.00022975271,0.00039220194,0.0020141655,0.000041086696,0.00012254399,0.0014164654,0.00005854334,0.7422188,0.15336958,0.04883413,0.051215645,0.00008714884],"about_ca_topic_score_codex":0.000978076,"about_ca_topic_score_gemma":0.0011887153,"teacher_disagreement_score":0.003236471,"about_ca_system_score_codex":0.0003921844,"about_ca_system_score_gemma":0.00048338049,"threshold_uncertainty_score":0.0108270645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07183486,0.00664885,0.81371737,0.001099102,0.0014862178,0.0006973956,0.0028441297,0.033185836,0.06848624],"genre_scores_gemma":[0.46953556,0.0010166684,0.45817012,0.0011377495,0.0004157742,0.0005500008,0.00401741,0.00059623906,0.06456051],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996263,0.000041116225,0.00002838233,0.000065575085,0.00017927153,0.00005945145],"domain_scores_gemma":[0.99962807,0.00005960961,0.000047469435,0.00010801166,0.00012173472,0.00003509352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027227192,0.00048671776,0.00059181015,0.0007787818,0.0004193076,0.0012101306,0.0029056391,0.000826173,0.022842644],"category_scores_gemma":[0.0008262734,0.00020633177,0.0003324274,0.00068874954,0.0003067989,0.0015439661,0.0010158573,0.00057869183,0.0062361034],"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.0017065695,0.00035216214,0.0012010084,0.00046283155,0.00010086632,0.0005972898,0.00008243853,0.014625001,0.10770583,0.05577662,0.109566934,0.7078225],"study_design_scores_gemma":[0.0005423926,0.0021224942,0.0014427267,0.00012093376,0.00016585662,0.0024596015,0.00011269766,0.34623682,0.2565983,0.045827884,0.34419873,0.00017161349],"about_ca_topic_score_codex":0.0004223349,"about_ca_topic_score_gemma":0.00087193795,"teacher_disagreement_score":0.022842644,"about_ca_system_score_codex":0.00045889057,"about_ca_system_score_gemma":0.0005213102,"threshold_uncertainty_score":0.076416254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15754141,0.004690047,0.79828423,0.00095321896,0.0004953018,0.0001686279,0.00025518038,0.004982113,0.03262975],"genre_scores_gemma":[0.7824972,0.0010213314,0.20007361,0.00062812207,0.0001632392,0.00009586806,0.00024269648,0.00017581452,0.015102113],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998834,0.000010709982,0.000007875205,0.000017626044,0.00006192214,0.000018381626],"domain_scores_gemma":[0.999775,0.00005795575,0.000039467242,0.000040280105,0.000080086014,0.000007196264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007899223,0.00038636161,0.00024296099,0.000506146,0.0004423608,0.0003854151,0.00093437213,0.00039928695,0.0047606057],"category_scores_gemma":[0.0005297771,0.0001405321,0.00030615812,0.0007783704,0.00027236147,0.0008603725,0.0003428694,0.00033616205,0.0007900349],"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.00026589644,0.00015827378,0.0009131039,0.00033754896,0.0000685533,0.00045908144,0.00021577024,0.02286581,0.45667678,0.025294192,0.00949601,0.48324904],"study_design_scores_gemma":[0.00008310993,0.00095172855,0.0016836914,0.00008666959,0.00030219098,0.0030230659,0.00014219213,0.29183003,0.6393743,0.014863603,0.04761018,0.000049255756],"about_ca_topic_score_codex":0.00059889304,"about_ca_topic_score_gemma":0.0014686518,"teacher_disagreement_score":0.0047606057,"about_ca_system_score_codex":0.00034751455,"about_ca_system_score_gemma":0.00036459684,"threshold_uncertainty_score":0.015925765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027988728,0.00005051595,0.9633655,0.0002926715,0.00003279968,0.00009784596,0.00025643402,0.006284088,0.001631396],"genre_scores_gemma":[0.6622664,0.00013693284,0.3338333,0.00024732135,0.00004506381,0.00030334757,0.00067995477,0.0007589326,0.0017288337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942538,0.0016376424,0.00034328652,0.0010105462,0.0021589776,0.0005957647],"domain_scores_gemma":[0.98002625,0.012727796,0.0015921729,0.0035927885,0.0017945362,0.00026656312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954098,0.001273064,0.0011120326,0.0014047407,0.0009669123,0.0031470712,0.0033985774,0.0012761354,0.003400133],"category_scores_gemma":[0.018825792,0.0010744578,0.0025817957,0.000988377,0.0032999401,0.003953627,0.0025860697,0.0027717985,0.000564858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002852899,0.00028649197,0.0045779785,0.00023955504,0.00018171297,0.00047555004,0.00033608597,0.8613708,0.01098269,0.070685476,0.0020038579,0.048574444],"study_design_scores_gemma":[0.00002954802,0.000016278022,0.000072184564,0.0000123752125,0.000024520781,0.000018713727,0.000014379449,0.97756493,0.0037840444,0.018101932,0.000352313,0.000008810879],"about_ca_topic_score_codex":0.015211576,"about_ca_topic_score_gemma":0.02284919,"teacher_disagreement_score":0.015211576,"about_ca_system_score_codex":0.003116097,"about_ca_system_score_gemma":0.005289063,"threshold_uncertainty_score":0.030246079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08643248,0.0033177023,0.75542724,0.001117276,0.0009803677,0.00060960837,0.0026898747,0.081334315,0.068091035],"genre_scores_gemma":[0.52724946,0.0009336124,0.39926067,0.0011576207,0.00015256902,0.0005798048,0.006157859,0.0013191082,0.063189276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996289,0.000031457774,0.000019891262,0.000066290304,0.00018653789,0.00006696977],"domain_scores_gemma":[0.99971515,0.00006636003,0.00003370926,0.00005750694,0.00008637064,0.000040810468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032992463,0.00070133543,0.00047695008,0.0006723993,0.0003311542,0.0009140196,0.0024491092,0.00068010343,0.03010749],"category_scores_gemma":[0.0008333709,0.00041347253,0.00031556655,0.001004591,0.00022889285,0.0014715294,0.0008119267,0.0007068733,0.0071838703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026454118,0.00043587148,0.0036880835,0.00081541005,0.00021319985,0.00076416926,0.0001600797,0.03517802,0.13697842,0.027456159,0.21843614,0.573229],"study_design_scores_gemma":[0.0008265074,0.0014491249,0.0029361115,0.00008533857,0.00014579332,0.0012172669,0.00012014441,0.61484265,0.14760719,0.01603583,0.21459542,0.00013866622],"about_ca_topic_score_codex":0.0015408971,"about_ca_topic_score_gemma":0.0019109806,"teacher_disagreement_score":0.03010749,"about_ca_system_score_codex":0.00079904776,"about_ca_system_score_gemma":0.0008614386,"threshold_uncertainty_score":0.10071963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021265974,0.0009363844,0.94710034,0.00029203022,0.00016961852,0.00013286811,0.000108402324,0.0010023612,0.02899201],"genre_scores_gemma":[0.48541886,0.001488833,0.49896616,0.0003933778,0.000114583,0.00021122294,0.00046054838,0.00017064385,0.012775784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949133,0.00013165631,0.000039211624,0.00011201447,0.00015896722,0.00006683863],"domain_scores_gemma":[0.9996126,0.00004407627,0.00004378242,0.00010401722,0.00016447944,0.00003110127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006741979,0.00044604234,0.0003875402,0.0005186096,0.00032112873,0.0011757078,0.00073790096,0.0005074355,0.0028003904],"category_scores_gemma":[0.00083579327,0.0002407707,0.00026461374,0.0007736562,0.0006681902,0.0013109721,0.0010513038,0.0005169501,0.0006908808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036436747,0.00008496228,0.0022630168,0.00036722276,0.000053731597,0.00042568072,0.00040278162,0.07723995,0.026131233,0.5472818,0.015344562,0.33004063],"study_design_scores_gemma":[0.00016294526,0.0008094074,0.002549859,0.000109530316,0.00013963378,0.0027504517,0.0002828273,0.56307554,0.034505047,0.17753522,0.21798214,0.00009750388],"about_ca_topic_score_codex":0.0014434762,"about_ca_topic_score_gemma":0.0013962487,"teacher_disagreement_score":0.0028003904,"about_ca_system_score_codex":0.00052914047,"about_ca_system_score_gemma":0.0008698807,"threshold_uncertainty_score":0.0093683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021587308,0.0001818,0.97547853,0.00016920237,0.000044891927,0.00007377607,0.000031743526,0.00059035694,0.0018423442],"genre_scores_gemma":[0.30608937,0.00012214154,0.6913568,0.000070126815,0.000056520166,0.00014657363,0.00014793329,0.000055555935,0.0019550123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994382,0.00014369498,0.000032514155,0.00011624662,0.00021238867,0.000056912762],"domain_scores_gemma":[0.999241,0.00017747228,0.000058316054,0.00032309763,0.00016157124,0.000038617745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009183358,0.0003380626,0.0004897369,0.0004602118,0.0008611058,0.00083175045,0.0014269068,0.00047556908,0.0013670425],"category_scores_gemma":[0.0014879891,0.00024242832,0.00034108557,0.00076614163,0.0005913977,0.0013840748,0.0010916356,0.00065811543,0.00038585096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004716708,0.000385782,0.002153757,0.0001479839,0.000095507145,0.00022941823,0.00026582947,0.43507963,0.04130336,0.059824217,0.0072277905,0.45281506],"study_design_scores_gemma":[0.000106014704,0.00014665593,0.00046725586,0.000006966635,0.000031423988,0.00021257311,0.00004908692,0.95561093,0.010567675,0.027205708,0.005575243,0.00002048147],"about_ca_topic_score_codex":0.0018466093,"about_ca_topic_score_gemma":0.003755223,"teacher_disagreement_score":0.0018466093,"about_ca_system_score_codex":0.0006627379,"about_ca_system_score_gemma":0.0011719888,"threshold_uncertainty_score":0.004856646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48585737,0.0014354686,0.50303364,0.00036307325,0.0001625273,0.00013467808,0.0001213291,0.002096649,0.006795236],"genre_scores_gemma":[0.9459084,0.00007896021,0.052608527,0.00012837768,0.0000301582,0.000029114899,0.00003323146,0.000029764036,0.001153534],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975926,0.000038964885,0.000017554494,0.000056105364,0.00010423755,0.000023919962],"domain_scores_gemma":[0.999268,0.00026420035,0.0001746421,0.000105043844,0.00016397268,0.000024056735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002370406,0.00023882915,0.00020952479,0.00040796085,0.00030961918,0.00048580416,0.0008969077,0.00045491505,0.0011873308],"category_scores_gemma":[0.0012808547,0.00017977945,0.0001246719,0.00041972773,0.00043509292,0.0013214735,0.0005294159,0.0002814858,0.00026658844],"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.0007448993,0.00007864557,0.0023552838,0.00020783738,0.000032913515,0.00031426476,0.00028781337,0.012172563,0.7767362,0.012563568,0.0016616783,0.19284435],"study_design_scores_gemma":[0.000046450587,0.0005594865,0.0011824155,0.00001844761,0.000037729933,0.00062263926,0.000058110432,0.16656785,0.8215192,0.003571667,0.0057834527,0.000032666147],"about_ca_topic_score_codex":0.00032915582,"about_ca_topic_score_gemma":0.00080567045,"teacher_disagreement_score":0.0011873308,"about_ca_system_score_codex":0.00046318336,"about_ca_system_score_gemma":0.0002353911,"threshold_uncertainty_score":0.003971994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113867186,0.00038131687,0.8791904,0.00055078533,0.00010656601,0.0001496466,0.00006515381,0.0006601584,0.005028772],"genre_scores_gemma":[0.5915771,0.0004653273,0.40121686,0.0003190827,0.00004366135,0.00023367465,0.0003390577,0.00015588402,0.0056493618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980786,0.0008440069,0.0002466967,0.00014201933,0.00050086965,0.00018781624],"domain_scores_gemma":[0.99761766,0.00086533604,0.00030893888,0.0006090505,0.0005103675,0.000088658875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033988634,0.000420566,0.00037164276,0.00057308056,0.0007373425,0.0027697654,0.0014810382,0.0012241825,0.0014893117],"category_scores_gemma":[0.0033887767,0.00044228317,0.0005773159,0.00055282685,0.0012756774,0.0051876428,0.0014892033,0.0017480894,0.00028062993],"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.00043927258,0.00038763654,0.0046573225,0.00030844263,0.000057637935,0.0007375686,0.0013183238,0.08568108,0.03927312,0.7895067,0.0028845174,0.0747483],"study_design_scores_gemma":[0.00018337906,0.0002711904,0.0016026027,0.00024895207,0.00014649142,0.00079267623,0.00047007442,0.6981259,0.09048427,0.12382988,0.083754085,0.0000905177],"about_ca_topic_score_codex":0.0023003707,"about_ca_topic_score_gemma":0.0015728237,"teacher_disagreement_score":0.0033988634,"about_ca_system_score_codex":0.0010709944,"about_ca_system_score_gemma":0.0017511578,"threshold_uncertainty_score":0.017975152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038456585,0.0010530823,0.953313,0.0005050369,0.00021264804,0.00013497513,0.00008122079,0.0012966815,0.0049468325],"genre_scores_gemma":[0.1674797,0.000785939,0.8288005,0.00021917724,0.0001533098,0.00011305229,0.00026604725,0.00016157217,0.002020682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983133,0.00036238163,0.000112806956,0.00019510822,0.0009085133,0.00010788966],"domain_scores_gemma":[0.9967263,0.0015474858,0.0002277255,0.00048037936,0.0009381676,0.00007990997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015736402,0.00064995955,0.00072526594,0.001022715,0.00061313174,0.00089783885,0.0013411932,0.0012052784,0.0016738216],"category_scores_gemma":[0.005735367,0.00021165598,0.00054150296,0.001606382,0.00047502562,0.0019006766,0.00086849934,0.0010644824,0.00040223033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073228346,0.0003787434,0.0020456424,0.00027362132,0.00012896158,0.00014257044,0.00010489932,0.27482602,0.026138417,0.026309723,0.0039347755,0.6649843],"study_design_scores_gemma":[0.00017592918,0.00032115637,0.000819752,0.000026156818,0.000061960236,0.0004206254,0.00005241564,0.9700605,0.011989957,0.0076165856,0.0084337955,0.000021129377],"about_ca_topic_score_codex":0.0023384085,"about_ca_topic_score_gemma":0.0026236973,"teacher_disagreement_score":0.0023384085,"about_ca_system_score_codex":0.0006555783,"about_ca_system_score_gemma":0.0009635166,"threshold_uncertainty_score":0.0083222985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22917388,0.0009857985,0.72587097,0.00044780315,0.00028956975,0.0004112146,0.0006082315,0.009865551,0.03234701],"genre_scores_gemma":[0.7552277,0.00034928595,0.22798511,0.00026889678,0.00004745681,0.00015845316,0.00044081974,0.0002629548,0.015259276],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988747,0.000010753297,0.000008898674,0.00002149184,0.00004848733,0.000022821463],"domain_scores_gemma":[0.9998635,0.00004387468,0.00001961299,0.000026398757,0.000038544746,0.000008028532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007524182,0.00031123566,0.00020880882,0.0002667481,0.00023397358,0.00053883984,0.0007794946,0.0003442795,0.005191227],"category_scores_gemma":[0.000431031,0.00016007776,0.00018979287,0.00024042248,0.00016336358,0.00064803043,0.00026752413,0.00033869097,0.0008159777],"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.00032424764,0.00014982047,0.0009775364,0.00041485947,0.000043884156,0.0006803517,0.00019784037,0.015262703,0.664543,0.036524113,0.007898787,0.27298293],"study_design_scores_gemma":[0.000096848315,0.000719741,0.001043491,0.000054826694,0.00008500005,0.0013933667,0.00005482073,0.15214466,0.79416233,0.0037919763,0.046397086,0.000055854554],"about_ca_topic_score_codex":0.0010353989,"about_ca_topic_score_gemma":0.0021124864,"teacher_disagreement_score":0.005191227,"about_ca_system_score_codex":0.00044430266,"about_ca_system_score_gemma":0.00045949375,"threshold_uncertainty_score":0.01736641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025357038,0.99154824,0.0012142695,0.00029438056,0.000356968,0.000020713414,0.000029163999,0.000027418631,0.006255357],"genre_scores_gemma":[0.0011223413,0.99339163,0.0014184213,0.00019518411,0.00030738296,0.00002836673,0.00006209321,0.000006656558,0.0034679037],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996972,0.000038940547,0.000034070177,0.000052235486,0.0001519056,0.000025652413],"domain_scores_gemma":[0.99937147,0.00024952268,0.00006092638,0.00002898545,0.00024747205,0.000041764455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538854,0.0013458309,0.0015188153,0.002184462,0.0005237068,0.0013547732,0.001698086,0.0016338356,0.009076666],"category_scores_gemma":[0.0009043012,0.0005377177,0.00045842456,0.0037179324,0.00054449734,0.0024776515,0.0007205396,0.0014608263,0.009633426],"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.00005233351,0.00010186367,0.00016852336,0.009548587,0.00004330102,0.00019287974,0.000058220343,0.0008287368,0.0021070815,0.006648823,0.035576973,0.94467264],"study_design_scores_gemma":[0.000011746187,0.000072193376,0.00029310657,0.0016095209,0.000040077954,0.00082243246,0.000033720997,0.0001671457,0.00065435044,0.002244364,0.9940357,0.000015474048],"about_ca_topic_score_codex":0.0014527937,"about_ca_topic_score_gemma":0.0018625249,"teacher_disagreement_score":0.009076666,"about_ca_system_score_codex":0.0006428644,"about_ca_system_score_gemma":0.0013803185,"threshold_uncertainty_score":0.030364454},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041245412,0.0025041709,0.38664117,0.0013201279,0.0016560308,0.00079341064,0.0016209164,0.024609853,0.53960884],"genre_scores_gemma":[0.4476727,0.0041601993,0.16730581,0.0040829293,0.00038670117,0.00078159635,0.007718432,0.0020523937,0.3658393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823254,0.000110367764,0.00008066473,0.00020749982,0.0010575464,0.00031142758],"domain_scores_gemma":[0.9987779,0.00013726477,0.00013468713,0.00035745473,0.0004889008,0.00010381882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083499606,0.00082247413,0.00048449566,0.0011612169,0.0008650895,0.00281825,0.0019603232,0.0015141339,0.027393812],"category_scores_gemma":[0.0011670336,0.00051054225,0.00065776525,0.0007672145,0.00054233667,0.0026379093,0.0019245122,0.0015164729,0.012793548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006484114,0.00062139635,0.004372605,0.0008277537,0.00013211266,0.0007049984,0.00030256264,0.00825777,0.07289497,0.13961388,0.19972374,0.57189983],"study_design_scores_gemma":[0.00016074536,0.00041071142,0.0014413787,0.00019578171,0.00007977121,0.0016973456,0.00011397019,0.041332442,0.07345143,0.012486513,0.8685385,0.000091397116],"about_ca_topic_score_codex":0.0010848008,"about_ca_topic_score_gemma":0.0015547342,"teacher_disagreement_score":0.027393812,"about_ca_system_score_codex":0.0010697335,"about_ca_system_score_gemma":0.0016846065,"threshold_uncertainty_score":0.091641426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13815896,0.00048391803,0.84060854,0.00033515258,0.00011351672,0.00019521576,0.000115120405,0.0024899244,0.0174997],"genre_scores_gemma":[0.71014816,0.0006958857,0.27954358,0.00013481935,0.000118113705,0.0001933426,0.00031437722,0.00024661317,0.008605142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840516,0.00039573657,0.00015071512,0.00031740018,0.0005687886,0.00016224268],"domain_scores_gemma":[0.9972447,0.0013111539,0.00020263778,0.0009881608,0.00020694466,0.000046315712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014098368,0.00051067176,0.0003861429,0.0007696684,0.00063761644,0.0021252958,0.0007897188,0.0005210092,0.0034638364],"category_scores_gemma":[0.0051778555,0.00039464768,0.00046212692,0.000878188,0.0013262792,0.0048240316,0.0017227198,0.0014948358,0.0006172933],"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.00078282924,0.00021897767,0.0011961454,0.00027124863,0.000050194398,0.0014205643,0.0006299377,0.06665451,0.04786141,0.6550857,0.0022058624,0.22362271],"study_design_scores_gemma":[0.00012068963,0.00037905033,0.000725859,0.000093637085,0.000099141376,0.0013645064,0.00021181852,0.36679798,0.105454765,0.4963075,0.028377866,0.00006721368],"about_ca_topic_score_codex":0.00029512955,"about_ca_topic_score_gemma":0.00023258725,"teacher_disagreement_score":0.0034638364,"about_ca_system_score_codex":0.00039617033,"about_ca_system_score_gemma":0.0004258107,"threshold_uncertainty_score":0.011587679},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05669484,0.00029603846,0.93982065,0.00011562646,0.00004650004,0.00007189146,0.00004641617,0.0012760385,0.0016319425],"genre_scores_gemma":[0.7212228,0.00038245172,0.27623403,0.000115105184,0.000026459298,0.000084950334,0.00012936107,0.00009700606,0.0017078326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912804,0.00030759224,0.00006489765,0.00010896043,0.0003001919,0.00009031232],"domain_scores_gemma":[0.9981824,0.0011746148,0.00017891446,0.00018931911,0.00023515822,0.000039641985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016460104,0.00049456366,0.000331182,0.0007506576,0.0003635211,0.0009313533,0.0007097583,0.0005294732,0.0013159328],"category_scores_gemma":[0.0036386084,0.00027913693,0.00040778378,0.00044654284,0.00051973964,0.0013247518,0.00032005532,0.0007416741,0.00027317574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009423151,0.000345334,0.003744798,0.00032353168,0.00006377354,0.0001712757,0.00015140243,0.46224052,0.08967191,0.07616589,0.0019490322,0.36423025],"study_design_scores_gemma":[0.000047940997,0.00017037844,0.0003390824,0.000022167678,0.000034731936,0.00005247132,0.000012283322,0.9596677,0.024732443,0.012908862,0.001995606,0.000016351036],"about_ca_topic_score_codex":0.001603857,"about_ca_topic_score_gemma":0.0018911177,"teacher_disagreement_score":0.0016460104,"about_ca_system_score_codex":0.0009448684,"about_ca_system_score_gemma":0.0008202646,"threshold_uncertainty_score":0.00870502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3791141,0.0018555806,0.59463024,0.0001708135,0.00017018242,0.00020573095,0.00071804627,0.0074257,0.015709521],"genre_scores_gemma":[0.7501143,0.00031835647,0.24412647,0.00010024263,0.000028401155,0.00007516373,0.0004888966,0.00009554387,0.004652515],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992216,0.000008562592,0.0000068253653,0.000017595807,0.000031142128,0.000013743506],"domain_scores_gemma":[0.99977607,0.000051067258,0.000048707436,0.00004784422,0.000064600696,0.000011714067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007854275,0.00026571954,0.00018782141,0.00042677502,0.00015672795,0.00028731447,0.000988643,0.00021014642,0.0028296234],"category_scores_gemma":[0.00042749633,0.000127229,0.00018569296,0.00044909833,0.00014322913,0.0006765304,0.00027230126,0.00019025725,0.00065506797],"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.00036251254,0.000114137365,0.0017370525,0.00046569802,0.00006109409,0.0002838389,0.0000909959,0.056255635,0.41099823,0.016614974,0.00580872,0.50720716],"study_design_scores_gemma":[0.00008539426,0.0010329338,0.003062448,0.0000654655,0.00014027562,0.001004799,0.000052954034,0.46841723,0.4887734,0.008018535,0.029295001,0.00005150653],"about_ca_topic_score_codex":0.00055589806,"about_ca_topic_score_gemma":0.0012502177,"teacher_disagreement_score":0.0028296234,"about_ca_system_score_codex":0.00029988756,"about_ca_system_score_gemma":0.00030544907,"threshold_uncertainty_score":0.009465992},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013197842,0.0003834688,0.98301756,0.0001572782,0.00012410374,0.00013953118,0.00010522467,0.0018814018,0.0009935863],"genre_scores_gemma":[0.14444289,0.00023236938,0.850561,0.0002417861,0.00010193248,0.00042095437,0.00066270336,0.00024043932,0.0030959484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999172,0.0002326749,0.00006104547,0.000117094074,0.00031723708,0.000100030345],"domain_scores_gemma":[0.9987413,0.0005791248,0.00012362517,0.00016795297,0.00032477683,0.00006328908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252715,0.0010676013,0.0014794575,0.0022203962,0.0008206255,0.00081733556,0.0020004942,0.0016092921,0.0030974387],"category_scores_gemma":[0.0035402302,0.00040039004,0.00075912673,0.0021961129,0.00076835265,0.0013788588,0.001196314,0.0011893978,0.0016438289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006078169,0.00032418678,0.002331592,0.00017156824,0.00018471669,0.00007359493,0.00011781923,0.2887925,0.006656124,0.0070637125,0.013286238,0.6803902],"study_design_scores_gemma":[0.00006885114,0.000103919316,0.00019664904,0.000009061172,0.000016010074,0.000039212362,0.000019780815,0.991608,0.001409707,0.004050738,0.0024685354,0.000009659854],"about_ca_topic_score_codex":0.005629563,"about_ca_topic_score_gemma":0.004718721,"teacher_disagreement_score":0.005629563,"about_ca_system_score_codex":0.00055414444,"about_ca_system_score_gemma":0.0018565606,"threshold_uncertainty_score":0.0111935735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055011872,0.001041799,0.9349905,0.0015808863,0.00019492189,0.00007330939,0.000062274754,0.0002611195,0.0067832386],"genre_scores_gemma":[0.921324,0.0010375417,0.07199887,0.00016755472,0.00025650434,0.00008441482,0.00009273587,0.00009816125,0.004940266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967121,0.0018090012,0.0001099968,0.00037778873,0.00056259497,0.00042845056],"domain_scores_gemma":[0.98251027,0.012173229,0.0009254154,0.0023442023,0.0015496277,0.00049720606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005525171,0.0007333751,0.0016263811,0.0012229495,0.0016950261,0.003326765,0.0022559576,0.0022941555,0.003750689],"category_scores_gemma":[0.026849676,0.00077698054,0.00051717635,0.002177274,0.002934109,0.007702456,0.0035645799,0.0028582977,0.0007147211],"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.0007180125,0.00014857424,0.0019635241,0.000117497155,0.000046055968,0.00015105333,0.0002792988,0.32988492,0.0013071803,0.59512657,0.0058517563,0.0644056],"study_design_scores_gemma":[0.000031620715,0.000038077862,0.0001803096,0.000014564081,0.000017928858,0.000038778297,0.0000692098,0.767099,0.0005624697,0.23094358,0.0009923712,0.000012118783],"about_ca_topic_score_codex":0.0014972612,"about_ca_topic_score_gemma":0.0015108602,"teacher_disagreement_score":0.005525171,"about_ca_system_score_codex":0.0015415304,"about_ca_system_score_gemma":0.0017761885,"threshold_uncertainty_score":0.029220223},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.602729,0.007773474,0.36358294,0.0012626972,0.00031402818,0.00014556268,0.000256577,0.0015455079,0.022390166],"genre_scores_gemma":[0.9146376,0.0014080324,0.07885555,0.00023749673,0.00004770131,0.0001008525,0.00012675616,0.00008335226,0.0045027314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999083,0.000014114828,0.0000062081826,0.000014681089,0.000039461367,0.000017179325],"domain_scores_gemma":[0.9998646,0.000019610186,0.00004302574,0.000020268235,0.000046326142,0.0000061096202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011970731,0.00020676859,0.0001574073,0.00016900434,0.00015473695,0.00036167452,0.0008232955,0.00028493328,0.0011043388],"category_scores_gemma":[0.0003066904,0.00012674803,0.00017817224,0.00023244668,0.00014268931,0.00056181144,0.00015995264,0.00019984989,0.00033032935],"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.00040754216,0.0001359685,0.002266667,0.00072441506,0.00014872376,0.00032027974,0.00022809974,0.039056554,0.7853294,0.024425345,0.0070091127,0.13994795],"study_design_scores_gemma":[0.00021960707,0.0017684427,0.0022236202,0.00010377264,0.00035414993,0.0013606406,0.00014171531,0.24355133,0.68302196,0.009823867,0.057375595,0.000055271717],"about_ca_topic_score_codex":0.0003559486,"about_ca_topic_score_gemma":0.0009197526,"teacher_disagreement_score":0.0011043388,"about_ca_system_score_codex":0.00043359512,"about_ca_system_score_gemma":0.0004348831,"threshold_uncertainty_score":0.0036943555},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041297358,0.0013045383,0.9393452,0.000584031,0.00029039432,0.00023502123,0.00019446148,0.010410069,0.006338871],"genre_scores_gemma":[0.44595844,0.0005436302,0.54235876,0.00027270376,0.0003170873,0.0002328929,0.0007311808,0.00022219119,0.009363127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944526,0.000088809786,0.000043267573,0.00012858231,0.00024520935,0.000048894854],"domain_scores_gemma":[0.99930763,0.00010149649,0.000074937874,0.000198384,0.00022537788,0.00009214079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095988135,0.00033756354,0.00046314675,0.00046849952,0.0005582649,0.0012458924,0.0016048369,0.0005156197,0.002126274],"category_scores_gemma":[0.0011595136,0.0002758311,0.00030135497,0.00041187537,0.00025811713,0.0016443712,0.0006874262,0.0006609594,0.00071020727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009678252,0.0004185359,0.0035194126,0.0003019478,0.0001768114,0.0005728695,0.00029626407,0.071222134,0.17533444,0.06095662,0.04145981,0.64477336],"study_design_scores_gemma":[0.00033661726,0.000729946,0.00274646,0.00003934961,0.00021030226,0.0010217308,0.00012427171,0.8316978,0.05936695,0.013291467,0.09031322,0.00012186913],"about_ca_topic_score_codex":0.0014177948,"about_ca_topic_score_gemma":0.0018663566,"teacher_disagreement_score":0.002126274,"about_ca_system_score_codex":0.0006692318,"about_ca_system_score_gemma":0.0011185617,"threshold_uncertainty_score":0.007113099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5335922,0.00036788196,0.45862946,0.00049425714,0.00007253427,0.0002303595,0.0006241314,0.001729316,0.0042598085],"genre_scores_gemma":[0.8991303,0.00005541197,0.099312544,0.000046100962,0.000027519114,0.00008326608,0.0006906692,0.000046238518,0.0006079188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952282,0.001278034,0.00043859807,0.00070894643,0.0019682406,0.0003780521],"domain_scores_gemma":[0.9775963,0.013685286,0.0022242537,0.0024893314,0.0034937437,0.00051119184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041493773,0.0004317286,0.00074068597,0.0029248612,0.0008899333,0.0016823602,0.0014638535,0.00079021644,0.0014264196],"category_scores_gemma":[0.020962773,0.0002381068,0.0005472059,0.0015785543,0.000699024,0.0017940352,0.0007971206,0.0009966185,0.00021760272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001570673,0.00077169976,0.21370335,0.00027179756,0.00031362078,0.0009992196,0.0009497964,0.21411343,0.014818593,0.04663569,0.005396324,0.50045586],"study_design_scores_gemma":[0.000024503692,0.00004100044,0.0065503526,0.000011603449,0.00002564986,0.00019108545,0.00012070081,0.972639,0.006245898,0.013166005,0.0009696792,0.00001443146],"about_ca_topic_score_codex":0.002858972,"about_ca_topic_score_gemma":0.002052871,"teacher_disagreement_score":0.0041493773,"about_ca_system_score_codex":0.001179128,"about_ca_system_score_gemma":0.0012765396,"threshold_uncertainty_score":0.021944284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07504954,0.0028814508,0.8489774,0.0015755782,0.0008923253,0.0006468692,0.001107096,0.03100931,0.037860464],"genre_scores_gemma":[0.40842918,0.0014017504,0.5327566,0.0008898782,0.0004528441,0.0008330202,0.0038910988,0.00087491336,0.050470643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998589,0.000117365526,0.00010986572,0.00036662022,0.00061258546,0.00020455816],"domain_scores_gemma":[0.9972844,0.0007873766,0.00015025877,0.0009487351,0.0007220377,0.0001071905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279887,0.0013339517,0.0012513447,0.0019439464,0.0010775647,0.0028515875,0.0034130497,0.0009676749,0.018511822],"category_scores_gemma":[0.0034683053,0.0006314158,0.0008160111,0.0024228273,0.000441478,0.004534547,0.001295045,0.0010458207,0.013992984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006585187,0.00020277507,0.0016797609,0.00022382312,0.00010320612,0.00019807856,0.000065753695,0.012596454,0.027252318,0.004548457,0.02566612,0.92680466],"study_design_scores_gemma":[0.00039312456,0.0005402284,0.005062222,0.00011872857,0.0003925229,0.0013460338,0.00028794238,0.73240936,0.14086616,0.020539818,0.09788821,0.00015564289],"about_ca_topic_score_codex":0.004640172,"about_ca_topic_score_gemma":0.004383175,"teacher_disagreement_score":0.018511822,"about_ca_system_score_codex":0.0012981669,"about_ca_system_score_gemma":0.0017223778,"threshold_uncertainty_score":0.061928272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003449452,0.00034165182,0.9940958,0.00018330553,0.000053235428,0.000030344061,0.000024309606,0.00022282584,0.0015990321],"genre_scores_gemma":[0.17392632,0.000857942,0.8186912,0.00014801693,0.000096189964,0.00028342856,0.00014824381,0.00009534334,0.0057533705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997645,0.000069152986,0.000014416767,0.000038388876,0.0000905468,0.000022948527],"domain_scores_gemma":[0.99971336,0.00015360652,0.000024837953,0.000016273088,0.00007849451,0.000013441037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590306,0.00058287807,0.000645385,0.0006053007,0.000430004,0.00068941346,0.00091345544,0.0011581762,0.002596659],"category_scores_gemma":[0.0018917902,0.00031013144,0.0003280112,0.00082450727,0.00049266865,0.0011843126,0.00067389343,0.0009813476,0.00044136736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006602374,0.00002914417,0.00019360927,0.00006710506,0.00003023387,0.00003416093,0.000033135817,0.8313948,0.001639994,0.025147779,0.0026454495,0.13871859],"study_design_scores_gemma":[0.000009973722,0.000011723349,0.000024922334,0.0000041717094,0.0000035311198,0.000009085907,0.0000027770186,0.9931946,0.00029845984,0.005489776,0.0009478026,0.000003167625],"about_ca_topic_score_codex":0.0044486034,"about_ca_topic_score_gemma":0.0042576403,"teacher_disagreement_score":0.0044486034,"about_ca_system_score_codex":0.0008011467,"about_ca_system_score_gemma":0.0011179226,"threshold_uncertainty_score":0.008845389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077782795,0.0025225575,0.77750653,0.00031541666,0.00037067328,0.00063197047,0.0016180032,0.10981149,0.029440576],"genre_scores_gemma":[0.47081563,0.0008640704,0.49837476,0.0007792895,0.00008817812,0.00040902768,0.0039677904,0.0012526814,0.023448545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993711,0.000054186236,0.00005087419,0.00013705608,0.0002834032,0.00010341659],"domain_scores_gemma":[0.9995895,0.000096311705,0.000050828316,0.0001174634,0.00011145505,0.000034425895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040379475,0.0009787346,0.000588052,0.0013127414,0.00034103435,0.0011526534,0.0027174512,0.00054190675,0.010029372],"category_scores_gemma":[0.00091393595,0.00052246184,0.0003625306,0.0011076519,0.00034992065,0.0017808923,0.0007657413,0.0005464168,0.0034273362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023440246,0.0004162761,0.005116611,0.0007994781,0.00023676472,0.0008067407,0.00017405703,0.04003056,0.0902666,0.016869366,0.06875329,0.7741862],"study_design_scores_gemma":[0.0005827522,0.0009657834,0.002430882,0.00010733832,0.00017220996,0.0013215594,0.00008518745,0.69433963,0.19272147,0.011016057,0.09610403,0.0001530683],"about_ca_topic_score_codex":0.0039622984,"about_ca_topic_score_gemma":0.0043622702,"teacher_disagreement_score":0.010029372,"about_ca_system_score_codex":0.00110408,"about_ca_system_score_gemma":0.0010340214,"threshold_uncertainty_score":0.033551633},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040997613,0.0006730082,0.9444515,0.00054242753,0.00012179139,0.00016532333,0.00013193589,0.005654489,0.007261889],"genre_scores_gemma":[0.4496918,0.000373924,0.5421707,0.00013830927,0.00007400798,0.0002233439,0.00058779167,0.00016733573,0.006572805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997807,0.00004684197,0.00000878253,0.000034778437,0.00010423015,0.000024544594],"domain_scores_gemma":[0.9998273,0.000018377441,0.000011641098,0.000049529972,0.00007300124,0.000020140042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051055715,0.00020659063,0.00021877626,0.00036046767,0.00042656655,0.00044162472,0.0010127564,0.00041316324,0.0015438043],"category_scores_gemma":[0.00053552934,0.00017549607,0.00019034126,0.0004918229,0.00024813283,0.0005910427,0.000459556,0.0004447874,0.00044556125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049692247,0.00019859154,0.0016666523,0.00021955554,0.00010612549,0.0003605121,0.00018991926,0.3906749,0.074642494,0.08288882,0.032993365,0.41556215],"study_design_scores_gemma":[0.00009172447,0.00015698874,0.0011050986,0.000010267281,0.00003646505,0.00015856912,0.000028552284,0.9486285,0.010626013,0.014585703,0.024538081,0.00003407654],"about_ca_topic_score_codex":0.0038962695,"about_ca_topic_score_gemma":0.0054223463,"teacher_disagreement_score":0.0038962695,"about_ca_system_score_codex":0.00072470354,"about_ca_system_score_gemma":0.0009542375,"threshold_uncertainty_score":0.0077471733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12694168,0.0016776146,0.81431764,0.00035112601,0.0006287968,0.00090036774,0.00022425287,0.0058892877,0.04906922],"genre_scores_gemma":[0.56309646,0.0007282649,0.41929153,0.00026970304,0.000058517864,0.0003155842,0.00033928273,0.00015541703,0.015745245],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980944,0.000023244784,0.000012923318,0.000038139537,0.000069497255,0.0000467954],"domain_scores_gemma":[0.9998547,0.000020432588,0.000022128806,0.00002086635,0.000070041744,0.000011773173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020871825,0.0005442905,0.00031631475,0.0005450355,0.0003001447,0.0005790587,0.0007708851,0.00038184298,0.004637191],"category_scores_gemma":[0.000247951,0.00021196174,0.00028309118,0.00030686328,0.00012277112,0.00040209462,0.00018851574,0.00029632018,0.0012639047],"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.00068332494,0.00029567053,0.007380758,0.0013505863,0.00023379564,0.0008035328,0.00021781947,0.10982253,0.2370926,0.024470313,0.014254387,0.6033947],"study_design_scores_gemma":[0.0007204662,0.0026134464,0.0065630525,0.00034761542,0.000369368,0.00231448,0.00016186462,0.44405255,0.38127673,0.004871598,0.15659907,0.00010980293],"about_ca_topic_score_codex":0.0016468744,"about_ca_topic_score_gemma":0.0018941719,"teacher_disagreement_score":0.004637191,"about_ca_system_score_codex":0.0004582836,"about_ca_system_score_gemma":0.0005989239,"threshold_uncertainty_score":0.015512943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30198863,0.013225744,0.6396223,0.0017706355,0.00117643,0.0002521356,0.0010892409,0.002363199,0.038511693],"genre_scores_gemma":[0.81799155,0.0023346015,0.17059474,0.0004358963,0.0001714545,0.00011829395,0.00019460218,0.00008400779,0.008074987],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999902,0.000009931518,0.00001389982,0.00001334743,0.00004709092,0.000013722418],"domain_scores_gemma":[0.9997416,0.00006118365,0.000055941207,0.00005260671,0.00007822045,0.000010544334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117501535,0.00023104472,0.00030477712,0.00036997354,0.00035791728,0.0008200379,0.00076685526,0.00048019443,0.0032437826],"category_scores_gemma":[0.00056815526,0.00012253103,0.00022371885,0.0006094011,0.0003055516,0.0012591933,0.00042133746,0.0003201429,0.00058128],"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.0003999981,0.00007085478,0.0007926393,0.0008592699,0.000052582793,0.00058912014,0.00035498687,0.011847642,0.6594902,0.09502078,0.0050284173,0.22549352],"study_design_scores_gemma":[0.00009040874,0.0006110817,0.00070083083,0.000105442,0.00012706076,0.0024234909,0.00016273529,0.09102962,0.8155998,0.018272286,0.07081762,0.000059602182],"about_ca_topic_score_codex":0.00037736478,"about_ca_topic_score_gemma":0.000930461,"teacher_disagreement_score":0.0032437826,"about_ca_system_score_codex":0.00038817804,"about_ca_system_score_gemma":0.0004163143,"threshold_uncertainty_score":0.010851502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075979635,0.0016349248,0.9031493,0.0004615679,0.00045641675,0.00032177247,0.00036901567,0.0039063194,0.013721125],"genre_scores_gemma":[0.5238067,0.0005046845,0.46775576,0.00026681123,0.00012201409,0.00019305093,0.00029918313,0.00009640563,0.0069554434],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996393,0.00006842974,0.000051022056,0.000058962676,0.00013950604,0.000042833755],"domain_scores_gemma":[0.9995746,0.0000778658,0.00006604528,0.00016957828,0.000096106225,0.000015765205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030946452,0.00029473225,0.00027665254,0.00045997035,0.00054482877,0.0005091829,0.0010934419,0.00039056886,0.0044376333],"category_scores_gemma":[0.0010908559,0.00017086708,0.00018700851,0.0009797987,0.0003008698,0.000998989,0.00053737574,0.00037915696,0.0008757334],"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.0005103446,0.00012411016,0.00067040743,0.0006145079,0.000060422175,0.00028504842,0.00018451735,0.01766692,0.35587418,0.09226486,0.011127213,0.52061754],"study_design_scores_gemma":[0.0002739948,0.0017311457,0.0009715682,0.00010818309,0.00012809354,0.0016376158,0.00011566594,0.27920946,0.55517995,0.03701868,0.12353988,0.00008582015],"about_ca_topic_score_codex":0.00047546686,"about_ca_topic_score_gemma":0.0011093651,"teacher_disagreement_score":0.0044376333,"about_ca_system_score_codex":0.00057874975,"about_ca_system_score_gemma":0.0009032514,"threshold_uncertainty_score":0.014845312},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29033107,0.0023489026,0.6939521,0.00040906185,0.00036551562,0.00017928238,0.0002603406,0.0029458257,0.009207891],"genre_scores_gemma":[0.85033935,0.00025883142,0.14439563,0.00022656903,0.00006411282,0.000041035255,0.000111541034,0.000032198986,0.004530765],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998234,0.000023642915,0.000013936861,0.000030331857,0.00008183622,0.000026858957],"domain_scores_gemma":[0.9996289,0.0001391465,0.00007195052,0.00004922539,0.00008837523,0.000022350427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021175548,0.00022122372,0.0002270938,0.0004031926,0.0002626309,0.0004731951,0.0010834081,0.00032946258,0.0022313742],"category_scores_gemma":[0.0007562029,0.00019842811,0.00010294916,0.0003703871,0.0001724745,0.00076646183,0.0003525964,0.0002847079,0.00037839558],"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.0006806629,0.00015110437,0.0020056895,0.0002856749,0.000037679303,0.00028910328,0.00011846616,0.0024107685,0.6365638,0.014254078,0.0030586675,0.34014428],"study_design_scores_gemma":[0.000118180724,0.0007833422,0.0014915478,0.00002618145,0.00010155378,0.0016591414,0.00003815556,0.10586603,0.873527,0.002562993,0.01379013,0.000035762492],"about_ca_topic_score_codex":0.00065129553,"about_ca_topic_score_gemma":0.0016092383,"teacher_disagreement_score":0.0022313742,"about_ca_system_score_codex":0.0004551931,"about_ca_system_score_gemma":0.00047441653,"threshold_uncertainty_score":0.0074646473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31982255,0.004437867,0.6335742,0.00078127213,0.00039926925,0.0002662762,0.0004526199,0.003965248,0.036300667],"genre_scores_gemma":[0.82093745,0.0007190294,0.15722355,0.00028713665,0.00006126347,0.00010616254,0.0004316631,0.00013821389,0.020095576],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997627,0.000026169182,0.000016520413,0.000022626276,0.00012347668,0.000048511156],"domain_scores_gemma":[0.99963176,0.0000605891,0.000045722445,0.00007925131,0.00014566083,0.00003699092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017972666,0.00025427854,0.0002726946,0.00032753623,0.00041755373,0.0007568554,0.0011333044,0.00028624214,0.0037228367],"category_scores_gemma":[0.0004988439,0.00017590115,0.00013899207,0.00052495126,0.00018447069,0.0007498037,0.0003889539,0.0004964276,0.00097171817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016499187,0.00036862955,0.0030257285,0.0009416536,0.00010604712,0.00063213817,0.00020756078,0.033543874,0.57525015,0.052970126,0.016743837,0.31456044],"study_design_scores_gemma":[0.00042975854,0.001309078,0.0024564818,0.000121379584,0.00015901893,0.0012038763,0.00014406074,0.33075526,0.5488954,0.008346459,0.10608158,0.00009760847],"about_ca_topic_score_codex":0.0014386612,"about_ca_topic_score_gemma":0.004569136,"teacher_disagreement_score":0.0037228367,"about_ca_system_score_codex":0.0006779446,"about_ca_system_score_gemma":0.0012075503,"threshold_uncertainty_score":0.012454152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37636775,0.0012534645,0.60495174,0.00022456261,0.0001304468,0.00017081852,0.00026326286,0.003932773,0.012705209],"genre_scores_gemma":[0.80887,0.0001958665,0.18576528,0.0000914905,0.000022310163,0.000050983846,0.00026056162,0.000042593238,0.004700877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990237,0.000009756897,0.00000751873,0.00002079985,0.00004227618,0.000017233704],"domain_scores_gemma":[0.99986315,0.000021023405,0.000018143543,0.000027186465,0.00006099491,0.000009479823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009572203,0.00024911517,0.00025725624,0.0004224966,0.0002560218,0.00049504545,0.0014633853,0.0002436618,0.0021195526],"category_scores_gemma":[0.00026768973,0.00017713656,0.00014181795,0.0006048402,0.00013604827,0.0009171373,0.00028402224,0.0001642838,0.00044842588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072956283,0.00035166988,0.0032931347,0.00046312713,0.00015802313,0.00042452876,0.00011657519,0.11149335,0.31236964,0.019642562,0.011184721,0.53977317],"study_design_scores_gemma":[0.000097275515,0.00037023137,0.0019162288,0.0000157416,0.0001053975,0.00042702197,0.00004989444,0.84633744,0.13889912,0.003917307,0.0078199385,0.000044364],"about_ca_topic_score_codex":0.0025252767,"about_ca_topic_score_gemma":0.006639914,"teacher_disagreement_score":0.0025252767,"about_ca_system_score_codex":0.0004151402,"about_ca_system_score_gemma":0.0005008705,"threshold_uncertainty_score":0.0070905685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27386212,0.0027778728,0.70504916,0.00034553139,0.00009581982,0.00014746074,0.0002865337,0.0035601372,0.01387536],"genre_scores_gemma":[0.78107864,0.0004102523,0.21265042,0.00013955949,0.000044051463,0.00007305546,0.0002227801,0.00007842791,0.005302818],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999933,0.0000094290535,0.0000048246056,0.00001336704,0.00002752998,0.000011903492],"domain_scores_gemma":[0.99985576,0.00004216329,0.000027294074,0.000028249166,0.000037865422,0.00000862118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008637107,0.00019917477,0.00011555933,0.00021835923,0.00024539756,0.00030342175,0.000685265,0.00027791754,0.0035724654],"category_scores_gemma":[0.0003070447,0.00014503556,0.0001653974,0.00036016316,0.0002134821,0.00083274534,0.00021908018,0.00024492914,0.00048445436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006906445,0.000106572305,0.0016761462,0.00044376892,0.000060745482,0.00028502688,0.00015867708,0.03351135,0.50308424,0.031673457,0.0058870814,0.4224222],"study_design_scores_gemma":[0.00020429985,0.0017299327,0.0029867978,0.000051577805,0.00016838263,0.0010775141,0.00012811596,0.37827268,0.53941756,0.017956318,0.057946254,0.000060540042],"about_ca_topic_score_codex":0.00067838666,"about_ca_topic_score_gemma":0.0023478009,"teacher_disagreement_score":0.0035724654,"about_ca_system_score_codex":0.00032348675,"about_ca_system_score_gemma":0.00031634793,"threshold_uncertainty_score":0.011951089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029241659,0.000074277465,0.94968826,0.00036353603,0.00008441619,0.00017460475,0.00056777755,0.017488072,0.0023173313],"genre_scores_gemma":[0.42406943,0.00019113629,0.56899667,0.0004443158,0.000076938326,0.0003263077,0.0012083125,0.0012526093,0.0034342567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488646,0.0011946084,0.00044063665,0.0008721677,0.0020059047,0.0006003277],"domain_scores_gemma":[0.9912821,0.004760198,0.0006038966,0.0020139124,0.0011738766,0.00016601577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003130946,0.0012571166,0.0010715893,0.0017497004,0.0008609228,0.0032657755,0.0031392241,0.0013731917,0.003725965],"category_scores_gemma":[0.013413456,0.0012920592,0.0032277526,0.00097068696,0.0021319035,0.0046445434,0.0029133484,0.0028954204,0.0005866709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011210465,0.00092545984,0.0093844645,0.00086040836,0.0006690153,0.0009751048,0.00045986226,0.6125005,0.044020705,0.16359127,0.011963412,0.15352874],"study_design_scores_gemma":[0.00013324713,0.000060259415,0.00018306234,0.00003362627,0.00010324328,0.0000705495,0.000020802549,0.9574523,0.015964486,0.023473252,0.0024782557,0.000026953532],"about_ca_topic_score_codex":0.015450904,"about_ca_topic_score_gemma":0.022617511,"teacher_disagreement_score":0.015450904,"about_ca_system_score_codex":0.0021113106,"about_ca_system_score_gemma":0.005811744,"threshold_uncertainty_score":0.030721903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022802308,0.00018231993,0.9749043,0.0002033662,0.000028111665,0.00012911513,0.00014406553,0.0006626907,0.00094368384],"genre_scores_gemma":[0.5196738,0.00033114906,0.47714755,0.00011359565,0.0000484113,0.0002227472,0.00075161917,0.000051391966,0.0016597601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757427,0.00053191493,0.00024972376,0.0004006078,0.0010297251,0.00021378223],"domain_scores_gemma":[0.99819523,0.00075183343,0.00017705052,0.00019456918,0.0005522352,0.00012902092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022373206,0.00046570535,0.0010887422,0.0021482867,0.000748023,0.0015832892,0.001808073,0.000715211,0.0014952574],"category_scores_gemma":[0.005564737,0.00032203805,0.00081571494,0.0023542172,0.00052486017,0.0035186051,0.000815077,0.0007677546,0.00038462906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005500497,0.0005365446,0.009151915,0.00026286035,0.0001899166,0.00025503215,0.00041417681,0.25536755,0.0077422443,0.05830058,0.0066581224,0.6605711],"study_design_scores_gemma":[0.000034191802,0.000079976795,0.00057375594,0.000014511091,0.000045799792,0.000107480635,0.000037816393,0.9736125,0.0031567323,0.020061225,0.0022551543,0.000020936302],"about_ca_topic_score_codex":0.0053626527,"about_ca_topic_score_gemma":0.0034012285,"teacher_disagreement_score":0.0053626527,"about_ca_system_score_codex":0.0010138844,"about_ca_system_score_gemma":0.0017302015,"threshold_uncertainty_score":0.011832237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033932424,0.0001465102,0.9936474,0.00011781411,0.00013617524,0.00010071046,0.00009741626,0.0006124988,0.0017481662],"genre_scores_gemma":[0.12688486,0.00050125236,0.8651294,0.00025983856,0.00044026112,0.00065291394,0.001229935,0.00018825021,0.0047132308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958275,0.00071777974,0.0002968996,0.00064346107,0.0021605992,0.0003537806],"domain_scores_gemma":[0.99512285,0.0024937976,0.00038317405,0.00085732265,0.0010205976,0.0001222904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027070092,0.0015056747,0.0021470422,0.0044613644,0.0014531652,0.0032299517,0.003559839,0.0016098559,0.0043063588],"category_scores_gemma":[0.012953653,0.00097017974,0.0025129335,0.00327283,0.0013279712,0.0039938428,0.0024356204,0.0034399456,0.002947614],"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.00035153588,0.00033374413,0.0025323862,0.00013713953,0.00022168404,0.000106091036,0.00011875673,0.17138833,0.003400673,0.062377922,0.00934258,0.7496891],"study_design_scores_gemma":[0.000028314867,0.000056290646,0.0004203938,0.000026816413,0.000039144707,0.000080460486,0.000020315505,0.9578944,0.003467652,0.033121947,0.004811843,0.000032376705],"about_ca_topic_score_codex":0.0032723215,"about_ca_topic_score_gemma":0.0017102275,"teacher_disagreement_score":0.0044613644,"about_ca_system_score_codex":0.0016529409,"about_ca_system_score_gemma":0.0018519475,"threshold_uncertainty_score":0.014406145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8686832,0.0045002517,0.09476665,0.0005796923,0.0006252484,0.0002716174,0.0012271851,0.004574821,0.024771329],"genre_scores_gemma":[0.9325871,0.0006260456,0.058882102,0.00039176075,0.000060951734,0.000085558335,0.0007964304,0.000043587628,0.006526461],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998934,0.000010569374,0.000007021879,0.000025326024,0.000039214377,0.000024358564],"domain_scores_gemma":[0.9998097,0.0000351539,0.00003256153,0.000028289165,0.000070820744,0.000023552058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010313605,0.00018098427,0.00033507944,0.00032751495,0.00034338445,0.00042893874,0.0018166155,0.00041851948,0.0030362671],"category_scores_gemma":[0.00023393074,0.00013914733,0.00019074604,0.0006391137,0.0002022,0.0007154271,0.00029844945,0.0002546437,0.00072524],"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.0007534461,0.00031321426,0.004150191,0.0006728895,0.00014028068,0.00085918617,0.00015634792,0.0027858918,0.80289376,0.005246773,0.011061477,0.17096652],"study_design_scores_gemma":[0.00027710723,0.0035937026,0.004066872,0.00006977994,0.00037171895,0.003154953,0.0001486189,0.038302954,0.89752835,0.0014754821,0.050902203,0.00010822983],"about_ca_topic_score_codex":0.0008601946,"about_ca_topic_score_gemma":0.0023013481,"teacher_disagreement_score":0.0030362671,"about_ca_system_score_codex":0.00036022445,"about_ca_system_score_gemma":0.00050386,"threshold_uncertainty_score":0.010157287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08592008,0.0005568718,0.9003947,0.00028521492,0.00026342948,0.00007209788,0.00005126229,0.0044818344,0.007974544],"genre_scores_gemma":[0.6028049,0.00028128456,0.3898557,0.00033861044,0.00019170345,0.00008532562,0.00013823588,0.00008515044,0.006219034],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968135,0.00007156728,0.000024229643,0.000049976217,0.00012137998,0.000051548912],"domain_scores_gemma":[0.9994498,0.00015796776,0.000082344224,0.000103708786,0.00016814121,0.000038138434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003877418,0.0002701145,0.0003142099,0.0004256131,0.00041159906,0.0004773722,0.00092737266,0.0004812461,0.0038389205],"category_scores_gemma":[0.0010212025,0.00014783903,0.00019003624,0.0004713242,0.00028380947,0.00070161885,0.00030981968,0.00042854494,0.0013334634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010356198,0.0002847783,0.0015386537,0.00026534742,0.000066277535,0.0003186341,0.00019008611,0.023005402,0.47066987,0.027484074,0.005904701,0.46923646],"study_design_scores_gemma":[0.00021306818,0.0017107117,0.0018164433,0.000046233443,0.00017249233,0.00073469593,0.000083365565,0.4113039,0.53098035,0.0074213473,0.045463685,0.000053653883],"about_ca_topic_score_codex":0.00056674413,"about_ca_topic_score_gemma":0.0008527974,"teacher_disagreement_score":0.0038389205,"about_ca_system_score_codex":0.0004127694,"about_ca_system_score_gemma":0.0007534788,"threshold_uncertainty_score":0.012842476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6103384,0.0038098043,0.32812345,0.003171422,0.000117375464,0.00032652155,0.00013434827,0.00037131945,0.053607333],"genre_scores_gemma":[0.92376935,0.0011412196,0.069417,0.000094021096,0.00008137041,0.00007829048,0.0000642782,0.000028216764,0.0053262184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99902487,0.00035658522,0.000027367767,0.0000803101,0.00036142924,0.0001493616],"domain_scores_gemma":[0.99892235,0.00049843855,0.000094427254,0.00014618332,0.00023141707,0.00010721061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016905947,0.00032834502,0.00032855858,0.0004963642,0.0010845198,0.0016260016,0.00073001033,0.001986817,0.0009455812],"category_scores_gemma":[0.002219471,0.00013001992,0.000417424,0.0008574655,0.0012299926,0.002165833,0.00064076995,0.0009057749,0.00012213989],"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.00030952354,0.0005339047,0.00605017,0.00027626168,0.000076724245,0.00723581,0.0012815058,0.40716532,0.010844481,0.45037803,0.0073922086,0.10845611],"study_design_scores_gemma":[0.00017710392,0.00053394504,0.0032908658,0.000086372354,0.00006184167,0.0024816738,0.0013049813,0.8638061,0.007992922,0.07165471,0.04856046,0.000048897935],"about_ca_topic_score_codex":0.004057181,"about_ca_topic_score_gemma":0.0034753,"teacher_disagreement_score":0.004057181,"about_ca_system_score_codex":0.0010706633,"about_ca_system_score_gemma":0.00086858624,"threshold_uncertainty_score":0.008940816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42183036,0.011894339,0.22934252,0.004202563,0.0015230351,0.00024092388,0.0017187358,0.005071403,0.32417613],"genre_scores_gemma":[0.9100741,0.0014506198,0.036601357,0.00045813268,0.00017719623,0.00005729543,0.0006520329,0.00016427028,0.05036505],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987817,0.000013366651,0.0000062888694,0.00001583691,0.00005671697,0.000029603107],"domain_scores_gemma":[0.9998154,0.000059332076,0.000023426455,0.000026342614,0.000063780295,0.000011741507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012589678,0.00020280511,0.0002536212,0.00030432563,0.0003110678,0.0010804511,0.0008847083,0.00035642536,0.014750954],"category_scores_gemma":[0.00063242315,0.000083521205,0.00010808172,0.0003985682,0.00017139169,0.0011907774,0.00041479073,0.00038234566,0.0023448695],"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.00060646766,0.00019211705,0.001067339,0.00087740616,0.00006346808,0.00032976316,0.00033857825,0.008811727,0.39665157,0.14540765,0.054545633,0.39110833],"study_design_scores_gemma":[0.00016510805,0.00067058566,0.0019676273,0.0002646973,0.00016619399,0.0010128472,0.0002254716,0.18548806,0.5707431,0.05508365,0.18415493,0.00005781744],"about_ca_topic_score_codex":0.0004071782,"about_ca_topic_score_gemma":0.0020089257,"teacher_disagreement_score":0.014750954,"about_ca_system_score_codex":0.0006420124,"about_ca_system_score_gemma":0.00051846384,"threshold_uncertainty_score":0.049346864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03241112,0.0032114647,0.93815136,0.0012818532,0.00054763036,0.00020748135,0.002010892,0.0061818417,0.015996255],"genre_scores_gemma":[0.204013,0.0012509545,0.7761538,0.0002525394,0.00026984204,0.00019595261,0.0038021286,0.00052047055,0.013541324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992895,0.00014233042,0.00006552118,0.00014209728,0.00022615989,0.00013427147],"domain_scores_gemma":[0.99859303,0.0005951205,0.00008507744,0.0003597563,0.00030538382,0.00006159232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087786216,0.000560469,0.0007095281,0.0013759054,0.00084784644,0.0029440708,0.0017386301,0.00086482696,0.0130969295],"category_scores_gemma":[0.0042184154,0.00047315788,0.00052148564,0.0019359897,0.00034146296,0.0046050847,0.0010546377,0.0010060515,0.0036532625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005736451,0.0001915833,0.001320715,0.0002562453,0.00006556992,0.000110608795,0.00016934938,0.085496806,0.007265807,0.06481592,0.0654286,0.7743051],"study_design_scores_gemma":[0.00018611609,0.00014607543,0.0005540304,0.000046732297,0.000047826474,0.00028536917,0.00014759829,0.84810007,0.0072878134,0.11459315,0.028570808,0.000034384637],"about_ca_topic_score_codex":0.0043326537,"about_ca_topic_score_gemma":0.006994688,"teacher_disagreement_score":0.0130969295,"about_ca_system_score_codex":0.0011504699,"about_ca_system_score_gemma":0.0020148377,"threshold_uncertainty_score":0.043813586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1758474,0.0009285802,0.8062393,0.00043834027,0.0001517424,0.0003344703,0.00026999926,0.006169088,0.009621114],"genre_scores_gemma":[0.5343397,0.0001509095,0.4624422,0.00010324054,0.000017276476,0.00018438241,0.00029615208,0.00041775472,0.002048379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966382,0.0011761803,0.00029120018,0.00045249803,0.00110232,0.00033960532],"domain_scores_gemma":[0.99427706,0.003377723,0.0002824805,0.0010418049,0.0008683347,0.00015270991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002930313,0.00082650373,0.00068759324,0.0017619879,0.00095865934,0.0016715197,0.0014655489,0.0007870473,0.0043082195],"category_scores_gemma":[0.017972924,0.00038903972,0.00026861674,0.002333961,0.00072115654,0.002586585,0.0008859665,0.0007777517,0.0010025974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015306103,0.00028488142,0.007153437,0.00031339677,0.00006738707,0.00020425758,0.00031422186,0.284566,0.0235144,0.02519829,0.00514371,0.65170944],"study_design_scores_gemma":[0.000113133756,0.00023085209,0.0008135764,0.00003563217,0.000025945139,0.00022182245,0.00013574329,0.9580201,0.0213156,0.0154259475,0.0036232283,0.00003846819],"about_ca_topic_score_codex":0.006527334,"about_ca_topic_score_gemma":0.0071247467,"teacher_disagreement_score":0.006527334,"about_ca_system_score_codex":0.0018321918,"about_ca_system_score_gemma":0.0025435102,"threshold_uncertainty_score":0.015497148},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06612233,0.035849903,0.27557912,0.016498387,0.0023960045,0.00039620168,0.00022536,0.00302085,0.5999119],"genre_scores_gemma":[0.6555078,0.044742696,0.13857369,0.003428016,0.0011521641,0.0002127494,0.00021595137,0.00032904543,0.1558379],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985721,0.00046984295,0.0000809659,0.00015689229,0.00056449964,0.00015566096],"domain_scores_gemma":[0.9987017,0.00041217523,0.00009839722,0.0003212909,0.00035914083,0.000107290114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011776565,0.00034023094,0.00021208405,0.0019038345,0.0011556883,0.0040189284,0.000895876,0.0017129978,0.0098980535],"category_scores_gemma":[0.0026139738,0.00030676293,0.00045002636,0.0020181965,0.0011588427,0.0040597753,0.0017177705,0.0013389298,0.0041651702],"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.0001423935,0.00020565293,0.003363348,0.00048790357,0.00003709908,0.0011178615,0.0010106387,0.0018275973,0.011661967,0.28937316,0.022086967,0.6686853],"study_design_scores_gemma":[0.00005475953,0.0002852856,0.0032814464,0.0009831175,0.00007083653,0.00450823,0.0009012427,0.010270713,0.053883072,0.07003421,0.8556342,0.00009281728],"about_ca_topic_score_codex":0.0011537914,"about_ca_topic_score_gemma":0.0010282873,"teacher_disagreement_score":0.0098980535,"about_ca_system_score_codex":0.0014829731,"about_ca_system_score_gemma":0.0014194903,"threshold_uncertainty_score":0.033112347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07500446,0.0010837638,0.8859561,0.00037392453,0.0002082071,0.00023441076,0.00012211311,0.004788325,0.032228764],"genre_scores_gemma":[0.4921878,0.00039731507,0.49831656,0.00015659997,0.00011558085,0.00019477028,0.00032274652,0.00010471557,0.008203898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959236,0.00006539949,0.000027133705,0.000053502477,0.00019751687,0.00006395547],"domain_scores_gemma":[0.99964,0.00006172585,0.000025320207,0.00007711663,0.00017700062,0.000018983032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032455867,0.00041090377,0.00041848302,0.0006805874,0.00045116953,0.0009680073,0.0012863918,0.00042227856,0.00347508],"category_scores_gemma":[0.00063333573,0.0002464205,0.00021370368,0.00086830737,0.0002799629,0.0011622349,0.0004134899,0.0004594966,0.00095962343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009785453,0.0003418093,0.0024709126,0.0004323628,0.00013895583,0.0004518092,0.00020973182,0.057997108,0.18558384,0.05838865,0.024344672,0.66866153],"study_design_scores_gemma":[0.00040899558,0.0007208369,0.0010914056,0.000042357577,0.00018951748,0.001173676,0.00011484472,0.77339363,0.16147082,0.014971197,0.046351865,0.00007077565],"about_ca_topic_score_codex":0.0015472207,"about_ca_topic_score_gemma":0.0020145886,"teacher_disagreement_score":0.00347508,"about_ca_system_score_codex":0.00054618064,"about_ca_system_score_gemma":0.00069341244,"threshold_uncertainty_score":0.01162529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003601948,0.00023827718,0.9870013,0.00018053902,0.00012211374,0.00019080161,0.00033612788,0.0019714476,0.0063574314],"genre_scores_gemma":[0.04148974,0.0002212513,0.9517536,0.00015626589,0.000078672005,0.00036260844,0.0010749379,0.00041883002,0.004444121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703336,0.00063861714,0.00038585873,0.0006776047,0.0009629143,0.00030164956],"domain_scores_gemma":[0.9962218,0.0015071905,0.00020378931,0.0010314935,0.0008872353,0.00014843771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00248143,0.0012390623,0.0013494574,0.004019942,0.00201324,0.002268849,0.0027547812,0.0019878414,0.01726282],"category_scores_gemma":[0.010451333,0.000727706,0.0015590191,0.0038032818,0.0014801535,0.0054417313,0.0037341318,0.0018801088,0.007518341],"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.00071874785,0.0002701893,0.0010478231,0.0005386454,0.0001642721,0.00033815144,0.0004098408,0.026229963,0.013523907,0.19551365,0.029540414,0.73170435],"study_design_scores_gemma":[0.00027082168,0.00036588605,0.0006701936,0.00019826212,0.00015684513,0.001510754,0.0003078693,0.2701341,0.042947162,0.5663759,0.1169104,0.00015195385],"about_ca_topic_score_codex":0.0009526881,"about_ca_topic_score_gemma":0.0008890438,"teacher_disagreement_score":0.01726282,"about_ca_system_score_codex":0.0009527779,"about_ca_system_score_gemma":0.0021832627,"threshold_uncertainty_score":0.057749867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1071688,0.00064292876,0.804492,0.0003447693,0.0003474737,0.00066945,0.0006979335,0.061445,0.024191583],"genre_scores_gemma":[0.80932754,0.000212848,0.17213961,0.0004980043,0.0001009023,0.00035867424,0.0012421551,0.00042890085,0.015691316],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999113,0.0000860656,0.000080013146,0.00022711472,0.00038242424,0.00011127195],"domain_scores_gemma":[0.99910176,0.00012958504,0.000109568486,0.00031889946,0.00026339365,0.00007685389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005220312,0.0005445368,0.0006430556,0.00089842075,0.00046185122,0.00089704746,0.0016016718,0.00046847746,0.007804138],"category_scores_gemma":[0.0012784208,0.00026306446,0.00034008923,0.00055572623,0.00036798962,0.0010760557,0.0010362023,0.0004942851,0.002728926],"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.001563343,0.00047030867,0.0066180644,0.00043388977,0.00015229496,0.00070487196,0.00019964135,0.041086234,0.15956867,0.016880393,0.03655482,0.7357674],"study_design_scores_gemma":[0.000479816,0.0015799493,0.00897229,0.00008919807,0.00022645188,0.002571348,0.00007626816,0.64607334,0.22680992,0.009263168,0.10364336,0.0002149486],"about_ca_topic_score_codex":0.001063754,"about_ca_topic_score_gemma":0.0010865855,"teacher_disagreement_score":0.007804138,"about_ca_system_score_codex":0.00056886155,"about_ca_system_score_gemma":0.0006790597,"threshold_uncertainty_score":0.02610743},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017442677,0.0046639354,0.9760528,0.00016102703,0.00025045706,0.00008039394,0.000053004394,0.00043537212,0.000860313],"genre_scores_gemma":[0.17297071,0.0034486703,0.8201,0.000087527595,0.00037953595,0.00039430734,0.0002124969,0.00039229446,0.00201443],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98792356,0.006686709,0.0006223044,0.0009340675,0.0034483674,0.00038494126],"domain_scores_gemma":[0.9256196,0.062916346,0.002034255,0.0034271856,0.0056191366,0.0003834371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016754849,0.001604863,0.002470285,0.004082209,0.00092396734,0.0019873306,0.0016833704,0.0015511645,0.0025293087],"category_scores_gemma":[0.070908725,0.0005354995,0.002037373,0.0031806687,0.0006898906,0.0032327962,0.0012334461,0.00196355,0.000443553],"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.002210992,0.0003282343,0.0077325907,0.0010304645,0.0017316961,0.00015114748,0.00034216602,0.11171239,0.0077960333,0.045808144,0.0031408353,0.81801534],"study_design_scores_gemma":[0.00012473858,0.00072664965,0.0055428436,0.00012231228,0.00050796196,0.00034516267,0.00015215056,0.9554269,0.013706722,0.017767165,0.005443398,0.00013405361],"about_ca_topic_score_codex":0.0020479253,"about_ca_topic_score_gemma":0.0013120782,"teacher_disagreement_score":0.016754849,"about_ca_system_score_codex":0.0010695644,"about_ca_system_score_gemma":0.0011803613,"threshold_uncertainty_score":0.08860916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23561063,0.00029905405,0.7438173,0.00014346451,0.000076565935,0.00027614267,0.0001433931,0.013025572,0.0066079795],"genre_scores_gemma":[0.8642569,0.0002103691,0.12968107,0.00012306724,0.000028259314,0.00014772307,0.00036565526,0.0001563809,0.0050306045],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.000108561486,0.00003608937,0.00010937967,0.0003035868,0.0000782759],"domain_scores_gemma":[0.99935657,0.00014189069,0.00009206221,0.0001447084,0.00020782303,0.000056977675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042015422,0.00048482988,0.00047580304,0.0007102895,0.0003236481,0.00055668096,0.0005835868,0.00051257707,0.0021208369],"category_scores_gemma":[0.0010596395,0.0002686485,0.0002715665,0.00036912574,0.00020583365,0.00085897994,0.00054856704,0.00041140785,0.00058366416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007662109,0.00019781702,0.010383906,0.00016957341,0.000069690745,0.00038224857,0.0004111188,0.008407176,0.5530898,0.0038404888,0.004246609,0.4180353],"study_design_scores_gemma":[0.00016302365,0.0016845679,0.025590478,0.000062203566,0.00020415791,0.0025443614,0.00015334881,0.32917312,0.616925,0.0021664158,0.021188926,0.0001444191],"about_ca_topic_score_codex":0.00050799066,"about_ca_topic_score_gemma":0.00025810336,"teacher_disagreement_score":0.0021208369,"about_ca_system_score_codex":0.00019936173,"about_ca_system_score_gemma":0.0002961609,"threshold_uncertainty_score":0.00709486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15970862,0.0023942864,0.81260157,0.00033410965,0.00016272755,0.0001776341,0.00014724277,0.0021758787,0.022297982],"genre_scores_gemma":[0.83125323,0.00087888085,0.15874718,0.00013338124,0.000052149022,0.00014374276,0.00030403363,0.00006956748,0.008417826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998344,0.000032684326,0.000010447435,0.000038565428,0.00005515588,0.00002863789],"domain_scores_gemma":[0.9998696,0.00001311033,0.0000092822465,0.000016031277,0.00008157031,0.000010474139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016648919,0.0002698674,0.00024734274,0.0002579243,0.00034497635,0.00049151166,0.0006118661,0.00026975368,0.0022677516],"category_scores_gemma":[0.00021696379,0.00015290985,0.00017878282,0.00032893624,0.00011917088,0.0005852345,0.00024589384,0.00027400313,0.00059201097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006751983,0.000111836176,0.0043122303,0.0008488981,0.00011237287,0.00053611683,0.00024746294,0.34356004,0.2269368,0.05121203,0.008625462,0.36282146],"study_design_scores_gemma":[0.00004043567,0.00035328016,0.002288794,0.00003334189,0.00005470638,0.00048347918,0.000050097613,0.93233615,0.039823472,0.006969069,0.017540392,0.000026760319],"about_ca_topic_score_codex":0.0010753901,"about_ca_topic_score_gemma":0.0011442843,"teacher_disagreement_score":0.0022677516,"about_ca_system_score_codex":0.00036944062,"about_ca_system_score_gemma":0.0005095694,"threshold_uncertainty_score":0.00758636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041824523,0.0028515253,0.9852519,0.00045445774,0.0002552119,0.0000392124,0.000028589398,0.00018551487,0.006751224],"genre_scores_gemma":[0.2862996,0.015070854,0.6867899,0.00033858742,0.0007847017,0.00036136596,0.00025262823,0.0003433441,0.009758975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989692,0.00025373598,0.00005934023,0.0002033063,0.00044865612,0.00006584483],"domain_scores_gemma":[0.9993136,0.0002573558,0.00003328798,0.00007897812,0.00028574577,0.000031055457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883742,0.00087742525,0.00082194136,0.0010292046,0.00086879317,0.0011083104,0.0011205347,0.00066296844,0.0029919911],"category_scores_gemma":[0.0022307828,0.00037951695,0.0007790375,0.0019147933,0.000896036,0.0025552583,0.0005866614,0.001717624,0.0005418866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012763034,0.00009601217,0.0011257787,0.00068010145,0.00015403294,0.00014450101,0.00018796012,0.39639378,0.009893642,0.26794723,0.006828202,0.3164211],"study_design_scores_gemma":[0.00004283968,0.00010364026,0.00026764133,0.000053201686,0.000051934392,0.0001501535,0.00004830805,0.8700802,0.0064578378,0.09706278,0.025639523,0.000041944193],"about_ca_topic_score_codex":0.0033595755,"about_ca_topic_score_gemma":0.001812852,"teacher_disagreement_score":0.0033595755,"about_ca_system_score_codex":0.0011123068,"about_ca_system_score_gemma":0.0014839676,"threshold_uncertainty_score":0.010009229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09443499,0.0012987518,0.8969836,0.00071360235,0.0001802123,0.00013554383,0.00011729993,0.0016898,0.004446172],"genre_scores_gemma":[0.885024,0.0006857139,0.1089538,0.00021390562,0.0002401753,0.00015600584,0.00014726524,0.00010962342,0.004469521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801385,0.0006567762,0.00014910633,0.00022113643,0.00067500264,0.00028407588],"domain_scores_gemma":[0.9954436,0.0021693644,0.0004172954,0.0012922939,0.00053376507,0.00014368327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033853017,0.00055632164,0.00097503635,0.0015262628,0.0007802611,0.0018542124,0.0016284961,0.0010658015,0.0019420793],"category_scores_gemma":[0.0060867113,0.0004819377,0.00046707396,0.0010954384,0.001624465,0.005789058,0.0020749134,0.00097529136,0.0003986873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017390776,0.00017223405,0.0019101653,0.00021776743,0.00010532021,0.0007033918,0.00045039572,0.18358703,0.032777216,0.56903255,0.008614224,0.20069075],"study_design_scores_gemma":[0.000090333444,0.00023755158,0.0004934779,0.000026985215,0.000034783327,0.0003351094,0.0000875723,0.9105854,0.008425232,0.0726611,0.0069737406,0.000048649188],"about_ca_topic_score_codex":0.0015181727,"about_ca_topic_score_gemma":0.00090616423,"teacher_disagreement_score":0.0033853017,"about_ca_system_score_codex":0.00086189056,"about_ca_system_score_gemma":0.0006712887,"threshold_uncertainty_score":0.017903447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040973887,0.0005813164,0.93615335,0.0002772606,0.0003628801,0.00058846956,0.00011181656,0.011247002,0.009704],"genre_scores_gemma":[0.4248449,0.0002665768,0.5605913,0.00044167897,0.00016244914,0.0005972931,0.00043328237,0.00026424852,0.012398312],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909484,0.00011432609,0.00006717488,0.00016452285,0.0004162267,0.00014290966],"domain_scores_gemma":[0.9991536,0.00012934692,0.00008113738,0.00021029625,0.00037052596,0.000055080072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004401313,0.0007250002,0.00052335375,0.0010740223,0.0005394969,0.0011615958,0.0026107808,0.00060018274,0.007391974],"category_scores_gemma":[0.0010650271,0.0004741123,0.00049277034,0.00091685035,0.00028599144,0.0009461666,0.0005832571,0.0010625396,0.0028053683],"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.0008344794,0.00080058246,0.0041794744,0.00045569375,0.0002249566,0.00030920294,0.00011179456,0.023071166,0.17232575,0.009676749,0.017214756,0.77079546],"study_design_scores_gemma":[0.0003101781,0.0025840634,0.0056022205,0.000058740727,0.00034131715,0.0015862169,0.000061962564,0.67636937,0.25291255,0.0033739714,0.0566899,0.00010951253],"about_ca_topic_score_codex":0.0023398832,"about_ca_topic_score_gemma":0.0031628383,"teacher_disagreement_score":0.007391974,"about_ca_system_score_codex":0.00077621604,"about_ca_system_score_gemma":0.0015482641,"threshold_uncertainty_score":0.024728596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027650133,0.0005688679,0.96896625,0.00018860382,0.000053060994,0.00010536048,0.000048825845,0.0012144618,0.0012043685],"genre_scores_gemma":[0.38237458,0.0003160537,0.6153426,0.00013748156,0.00007067091,0.00025072784,0.00034141142,0.0001732474,0.0009932043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772424,0.00087024656,0.0001980876,0.00029767453,0.00072758645,0.00018220757],"domain_scores_gemma":[0.9964606,0.002093904,0.00030182584,0.0004537251,0.0006200729,0.000069906106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028612658,0.0010071325,0.0015631283,0.002138023,0.0006037341,0.0015002127,0.0015264468,0.0009600871,0.0011275134],"category_scores_gemma":[0.007319285,0.00047157583,0.0009323938,0.0015813427,0.0005497804,0.0014701462,0.0007891934,0.0013419566,0.0005477481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025327937,0.00025543594,0.0035739157,0.00014284677,0.00019153478,0.00012219929,0.00006817877,0.35231924,0.0085860435,0.007668342,0.0030614163,0.62375754],"study_design_scores_gemma":[0.000014030354,0.000036419046,0.00019371076,0.0000073277174,0.000014054284,0.00003090968,0.000008743839,0.9920026,0.0030681049,0.004010532,0.0006072158,0.0000063733023],"about_ca_topic_score_codex":0.0010860494,"about_ca_topic_score_gemma":0.0011016803,"teacher_disagreement_score":0.0028612658,"about_ca_system_score_codex":0.0009041779,"about_ca_system_score_gemma":0.0012794628,"threshold_uncertainty_score":0.01513195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7939067,0.008274242,0.16553126,0.0006827673,0.0006838767,0.00035307658,0.0007851243,0.0017429305,0.028039962],"genre_scores_gemma":[0.96312743,0.0007907806,0.03216305,0.00011673785,0.000050038147,0.00006748251,0.00020080897,0.000028372246,0.003455337],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998047,0.000031292737,0.000010905423,0.00003506843,0.000094187904,0.000023963039],"domain_scores_gemma":[0.99962854,0.000059994778,0.00004323269,0.000044092274,0.00020014093,0.000023900417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015146437,0.00023448523,0.00029030032,0.0003450964,0.00021967464,0.0005088792,0.0011695225,0.00044882527,0.0023041407],"category_scores_gemma":[0.00057276734,0.00007919655,0.00021191768,0.0004040953,0.00012959092,0.00063810736,0.00022163586,0.00015379906,0.00037659262],"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.0011692233,0.0002685997,0.00436103,0.0014154676,0.00015356968,0.0007938918,0.00022763826,0.05446349,0.62129366,0.0075210943,0.0061562173,0.30217615],"study_design_scores_gemma":[0.00017126132,0.0042471504,0.004831822,0.000064506574,0.0002808992,0.0017188538,0.0001651003,0.36220863,0.58953905,0.0012081072,0.035503272,0.00006128516],"about_ca_topic_score_codex":0.0010073103,"about_ca_topic_score_gemma":0.0008696868,"teacher_disagreement_score":0.0023041407,"about_ca_system_score_codex":0.00045934354,"about_ca_system_score_gemma":0.00036838764,"threshold_uncertainty_score":0.0077081323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01982168,0.0001342945,0.9759966,0.00012808692,0.000088756904,0.00018235751,0.000033859644,0.00075923087,0.0028551754],"genre_scores_gemma":[0.3599127,0.000318764,0.6361756,0.000115178475,0.00012213514,0.00031257558,0.0001428997,0.00021568601,0.0026844863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980077,0.00054813235,0.0002812035,0.0002953839,0.00065759785,0.00020996375],"domain_scores_gemma":[0.9962081,0.0013483108,0.0004304482,0.0010847774,0.00060419925,0.00032407296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029162061,0.00061879004,0.001053079,0.00113069,0.0010857163,0.002907273,0.0023533718,0.0008789394,0.0022641325],"category_scores_gemma":[0.005893264,0.0005744838,0.00066620373,0.0008841753,0.0012504369,0.0046364097,0.0014775876,0.0022801894,0.00057097053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010057612,0.001045226,0.002853626,0.00020860317,0.00014611907,0.00050704204,0.0006964213,0.104818396,0.106434405,0.42949557,0.0043165744,0.34847215],"study_design_scores_gemma":[0.00012684114,0.00024480745,0.0003919593,0.000034252447,0.000066822744,0.00022989023,0.00007634512,0.87027556,0.029409217,0.0894189,0.009645546,0.000079756304],"about_ca_topic_score_codex":0.0010413101,"about_ca_topic_score_gemma":0.0016477102,"teacher_disagreement_score":0.0029162061,"about_ca_system_score_codex":0.0006790639,"about_ca_system_score_gemma":0.001641454,"threshold_uncertainty_score":0.015422523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4944487,0.0015048139,0.4605799,0.0002535682,0.00021574054,0.00019932837,0.00043571315,0.019781467,0.02258071],"genre_scores_gemma":[0.87921906,0.00024962056,0.11413253,0.000091343856,0.000028143895,0.000059642825,0.00036123596,0.00010792169,0.005750443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998505,0.00001874445,0.000013608374,0.00003594144,0.000049539765,0.0000316476],"domain_scores_gemma":[0.9998604,0.000031908603,0.00001661286,0.000035267636,0.00004155464,0.000014202932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115005954,0.00027916997,0.000216368,0.0004667324,0.00024958447,0.0004380383,0.0006833187,0.00020401066,0.004050716],"category_scores_gemma":[0.00030545812,0.00016232557,0.00016188704,0.00040872206,0.0001282073,0.00072416815,0.00034964387,0.00022516995,0.000715317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015162516,0.00034688946,0.004957607,0.0004306432,0.00011748074,0.0011338642,0.0003202795,0.036684904,0.30057782,0.01984051,0.020699997,0.6133738],"study_design_scores_gemma":[0.00017898522,0.0016256974,0.005426578,0.00007471795,0.00021639044,0.0014326131,0.00016541574,0.67432696,0.24599078,0.0060125426,0.064449765,0.00009958341],"about_ca_topic_score_codex":0.0024951773,"about_ca_topic_score_gemma":0.0035870913,"teacher_disagreement_score":0.004050716,"about_ca_system_score_codex":0.0004883154,"about_ca_system_score_gemma":0.00044289345,"threshold_uncertainty_score":0.013550937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66225344,0.0013593041,0.2670722,0.0004301114,0.00026512297,0.0003266191,0.0010136052,0.017049989,0.050229605],"genre_scores_gemma":[0.8780692,0.0002607206,0.11351411,0.00021236377,0.000028076123,0.000092843286,0.0006381874,0.000096476935,0.0070880135],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997465,0.000030944917,0.000023653029,0.0000518999,0.000092270355,0.000054863245],"domain_scores_gemma":[0.99961406,0.00011120721,0.00004476036,0.000119355376,0.00008634452,0.000024193932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024234394,0.00034045937,0.00025223554,0.0005049076,0.00025073288,0.0008375411,0.0010287096,0.0002325471,0.0062502744],"category_scores_gemma":[0.00060284865,0.000175598,0.00020045238,0.00064706086,0.00023650804,0.0008684302,0.00031701155,0.00037025154,0.00083832926],"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.0022502812,0.000391597,0.0102235675,0.00051228615,0.00021973035,0.00084556645,0.00024827314,0.08208807,0.21351315,0.028264897,0.028850265,0.6325924],"study_design_scores_gemma":[0.00028789273,0.0013212179,0.0057116444,0.000067736626,0.00011291059,0.0006242429,0.00013928111,0.6419032,0.30395156,0.005973201,0.039835032,0.00007208051],"about_ca_topic_score_codex":0.0049851732,"about_ca_topic_score_gemma":0.004799718,"teacher_disagreement_score":0.0062502744,"about_ca_system_score_codex":0.0009210017,"about_ca_system_score_gemma":0.0007091316,"threshold_uncertainty_score":0.02090919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12083911,0.0016611998,0.8524285,0.00047139917,0.00021616813,0.00023909725,0.00018727785,0.0030163147,0.020940939],"genre_scores_gemma":[0.5789353,0.0006755831,0.41344723,0.0002476439,0.00005271431,0.00041438665,0.00039446098,0.0002276445,0.0056049833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968135,0.00008617823,0.00002346915,0.000047735506,0.00010817215,0.000053037453],"domain_scores_gemma":[0.9995266,0.00012286694,0.000043980148,0.000056069955,0.00022628,0.000024246741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037643078,0.000612095,0.00028243716,0.00045957812,0.00033743822,0.0008371789,0.0020689594,0.00037747665,0.0043303343],"category_scores_gemma":[0.0009104438,0.0002029078,0.0002590624,0.0006588795,0.0001893094,0.000859072,0.00035024856,0.0005183069,0.0011003074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010084548,0.00044645055,0.0054573356,0.0013442775,0.00023219836,0.0004790462,0.00041857114,0.25406793,0.0752218,0.05572361,0.027980078,0.57762027],"study_design_scores_gemma":[0.00015678606,0.00094497757,0.0010557496,0.000098570854,0.00015467287,0.00032886674,0.00016817785,0.8648491,0.072687306,0.012426372,0.047088794,0.00004073912],"about_ca_topic_score_codex":0.0011471786,"about_ca_topic_score_gemma":0.0019433284,"teacher_disagreement_score":0.0043303343,"about_ca_system_score_codex":0.0006277924,"about_ca_system_score_gemma":0.0008178338,"threshold_uncertainty_score":0.014486432},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007435294,0.00048581182,0.98863834,0.0003359352,0.00028368144,0.00009508347,0.00015987836,0.0007226292,0.0018432877],"genre_scores_gemma":[0.18785353,0.0013536079,0.8017121,0.0006157849,0.0006882036,0.00029516112,0.0011127469,0.0002399064,0.0061290064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985581,0.0004055267,0.00015124392,0.00020401998,0.0005820325,0.00009910941],"domain_scores_gemma":[0.9948826,0.0017821582,0.00026014153,0.0009925563,0.001886034,0.00019654687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030131782,0.00086816004,0.0010512607,0.0011503169,0.00058466214,0.0018536883,0.0023872887,0.0010655604,0.0044489773],"category_scores_gemma":[0.009779608,0.00036290303,0.00089293503,0.0018167071,0.00038410746,0.0030980278,0.0013436454,0.0024517367,0.002571209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025129082,0.0007830497,0.003982066,0.00022560757,0.00025264247,0.00010989354,0.00013888415,0.16683666,0.0052373754,0.052982215,0.017844897,0.75135547],"study_design_scores_gemma":[0.000019308143,0.00006086152,0.00030055558,0.000022654314,0.000045589863,0.00006927654,0.000014216187,0.9620243,0.0015280008,0.030378291,0.0055211554,0.000015925081],"about_ca_topic_score_codex":0.0022021604,"about_ca_topic_score_gemma":0.0034902836,"teacher_disagreement_score":0.0044489773,"about_ca_system_score_codex":0.0006039934,"about_ca_system_score_gemma":0.0014046076,"threshold_uncertainty_score":0.015935421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3016723,0.00084389537,0.62974685,0.00023995985,0.00027220746,0.00034289926,0.00086438656,0.024174847,0.041842658],"genre_scores_gemma":[0.80266917,0.00016910187,0.18759742,0.000110417735,0.000020194218,0.00012145963,0.0008763845,0.00021241803,0.008223368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997887,0.000023540471,0.00002183188,0.000050550112,0.000058129135,0.000057199828],"domain_scores_gemma":[0.99983454,0.000042988722,0.000021206408,0.000052126707,0.00003614811,0.000013018595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016582313,0.00036882533,0.00025225093,0.0004921575,0.00028039937,0.0007585356,0.0010465402,0.0002242337,0.0065041464],"category_scores_gemma":[0.0003683966,0.00016675626,0.0003036987,0.0003333223,0.0001837362,0.0005077527,0.00024376869,0.00036440592,0.0011001208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017136073,0.00047776024,0.0054604704,0.0009248773,0.00014164962,0.0013405548,0.00033827816,0.08552505,0.33995253,0.04821436,0.023679266,0.49223155],"study_design_scores_gemma":[0.00022638397,0.0020062076,0.0049000983,0.00013365305,0.00020600272,0.0011110862,0.00013969529,0.5897852,0.30715942,0.009243864,0.08498365,0.00010463222],"about_ca_topic_score_codex":0.0020208498,"about_ca_topic_score_gemma":0.0027654134,"teacher_disagreement_score":0.0065041464,"about_ca_system_score_codex":0.0007234511,"about_ca_system_score_gemma":0.00072237774,"threshold_uncertainty_score":0.021758556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30246618,0.0034739296,0.6486462,0.0003990847,0.0003207161,0.0002466715,0.0005136968,0.008086755,0.035846803],"genre_scores_gemma":[0.8062714,0.0005155652,0.18353496,0.00017204045,0.00004012988,0.0001046871,0.0005487545,0.00007179672,0.008740606],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984825,0.000018534278,0.000013074565,0.000026792852,0.00005601503,0.000037278096],"domain_scores_gemma":[0.99989474,0.000023886318,0.000015091802,0.000032896194,0.000024901523,0.000008427488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013302303,0.00030083023,0.00026207586,0.00048451946,0.00029442302,0.00054935325,0.0013795551,0.0002833782,0.008722839],"category_scores_gemma":[0.000342416,0.0001650239,0.00018397499,0.00081107795,0.00014213433,0.0010643409,0.0004185197,0.00028329963,0.0011787692],"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.00092558976,0.00020044208,0.0018954965,0.00055657915,0.00009560637,0.00036991155,0.00008472703,0.043940403,0.18528394,0.02946912,0.014233717,0.72294444],"study_design_scores_gemma":[0.00028038028,0.0014468358,0.002893463,0.00010075686,0.00014441993,0.0010556213,0.0001229686,0.57804656,0.33562702,0.013140176,0.06706537,0.00007651031],"about_ca_topic_score_codex":0.0011454517,"about_ca_topic_score_gemma":0.0020461746,"teacher_disagreement_score":0.008722839,"about_ca_system_score_codex":0.0005375799,"about_ca_system_score_gemma":0.00046528978,"threshold_uncertainty_score":0.029180825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1329828,0.0013928886,0.83603865,0.00020113192,0.00020147461,0.0003165212,0.0010741245,0.01555936,0.012232909],"genre_scores_gemma":[0.40868473,0.0006239336,0.57863444,0.00012021686,0.000077359044,0.00019540926,0.0038231376,0.0004356917,0.007405075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981266,0.000015215637,0.000014098627,0.000030801075,0.000100097444,0.000027172264],"domain_scores_gemma":[0.9997385,0.000051624083,0.000033276483,0.00007586078,0.00008261914,0.00001819093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023695633,0.00039781505,0.00042839238,0.00071446196,0.00033063244,0.00061853713,0.0008952419,0.00028714165,0.0025965564],"category_scores_gemma":[0.0006938081,0.00024359653,0.00034642153,0.0010525931,0.00025434667,0.0011922773,0.0008131442,0.00040772176,0.0011066645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079755555,0.00024295149,0.0054857526,0.0003805378,0.0001664112,0.00026170275,0.00017286808,0.11258469,0.076903954,0.013571613,0.028823553,0.7606085],"study_design_scores_gemma":[0.00017229204,0.00051702827,0.0024102305,0.000021119016,0.000083177096,0.0006280085,0.00010696826,0.8934041,0.066750154,0.0067876363,0.029061403,0.000057908812],"about_ca_topic_score_codex":0.001536724,"about_ca_topic_score_gemma":0.0025817868,"teacher_disagreement_score":0.0025965564,"about_ca_system_score_codex":0.00039202123,"about_ca_system_score_gemma":0.00095310574,"threshold_uncertainty_score":0.008686364},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002602896,0.0012963224,0.003233056,0.0485866,0.9380219,0.000034690886,0.0006367206,0.00077260035,0.0071577746],"genre_scores_gemma":[0.019899014,0.0066941706,0.013527164,0.10718855,0.24667399,0.00024858202,0.0039517153,0.0024736067,0.5993433],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961449,0.00044261507,0.00040992512,0.0005852161,0.0020487346,0.00036856584],"domain_scores_gemma":[0.98638225,0.0017701815,0.0004957246,0.0009058109,0.0099610705,0.00048496152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019337963,0.0016130182,0.0014347968,0.002347142,0.0031774412,0.0030727948,0.0030521222,0.0050609205,0.05674384],"category_scores_gemma":[0.029643299,0.00084673066,0.0013345241,0.001981269,0.0018534113,0.0021733544,0.0019653721,0.006327512,0.03810985],"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.000024847172,0.000007478353,0.000045645447,0.000056277913,0.0000071748177,0.000093015,0.000013699695,0.00010198742,0.000121695644,0.0013188974,0.99138314,0.0068261367],"study_design_scores_gemma":[0.000021809794,0.000033106382,0.0005225971,0.00010375392,0.000029312228,0.00020076484,0.00004397048,0.0010570809,0.0013658161,0.0020485425,0.9945352,0.00003810983],"about_ca_topic_score_codex":0.020198328,"about_ca_topic_score_gemma":0.029511312,"teacher_disagreement_score":0.05674384,"about_ca_system_score_codex":0.0037164327,"about_ca_system_score_gemma":0.0033565527,"threshold_uncertainty_score":0.18982708},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004968312,0.0024431474,0.0067234407,0.045612134,0.93303335,0.000056856068,0.0005925349,0.0009720805,0.010069572],"genre_scores_gemma":[0.024474764,0.010182122,0.015778108,0.068928644,0.20798579,0.00018229746,0.0031402155,0.002192625,0.66713554],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971623,0.0002902191,0.0002504848,0.00040521618,0.0016501615,0.00024161894],"domain_scores_gemma":[0.98786235,0.0016282932,0.0003920608,0.0006515259,0.008975453,0.0004902922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441229,0.0014515525,0.0012118205,0.0022057216,0.00247848,0.0024525728,0.0027059447,0.004070275,0.0679286],"category_scores_gemma":[0.017387653,0.00060949865,0.0010587127,0.0014276244,0.0012776642,0.0016909948,0.0017015298,0.004872224,0.03455253],"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.00004805875,0.000017125649,0.00008244084,0.00012581436,0.00001134411,0.00018650475,0.000019174075,0.00015209187,0.00044429558,0.0014119192,0.9847504,0.012750891],"study_design_scores_gemma":[0.000024697654,0.00008815989,0.00063918775,0.000117380216,0.000038163384,0.0004639623,0.000053973243,0.0017395366,0.0039486415,0.0019945572,0.9908408,0.00005100809],"about_ca_topic_score_codex":0.007571141,"about_ca_topic_score_gemma":0.013055643,"teacher_disagreement_score":0.0679286,"about_ca_system_score_codex":0.0026681013,"about_ca_system_score_gemma":0.0020500734,"threshold_uncertainty_score":0.22724378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43142956,0.0040648375,0.5207954,0.00027631063,0.00027861097,0.0003020287,0.00042409342,0.0077105067,0.034718663],"genre_scores_gemma":[0.8788204,0.00038881568,0.11573447,0.00009754985,0.000047204514,0.000087461965,0.0002876151,0.000041560103,0.004494846],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99993217,0.0000071652407,0.000005041713,0.000015295662,0.000020727815,0.000019576308],"domain_scores_gemma":[0.9999447,0.000008439861,0.000010126432,0.0000149226125,0.000017007333,0.000004791647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055779874,0.00034609702,0.00020824297,0.00036352663,0.00019920593,0.00037190944,0.000905221,0.00015789163,0.002861232],"category_scores_gemma":[0.00015436587,0.000098433644,0.00012125584,0.00034815542,0.00009435926,0.00042495996,0.00019829137,0.00018368928,0.00045793274],"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.0007771426,0.00018439947,0.0029126192,0.00054854725,0.000057530717,0.0006603318,0.0001711102,0.030179337,0.36706847,0.01841605,0.011902405,0.567122],"study_design_scores_gemma":[0.00026124401,0.0022429237,0.0055146306,0.00013046396,0.00020519792,0.0014900753,0.00018047054,0.54232174,0.394505,0.004259085,0.048821952,0.00006731945],"about_ca_topic_score_codex":0.001162091,"about_ca_topic_score_gemma":0.0021324859,"teacher_disagreement_score":0.002861232,"about_ca_system_score_codex":0.00033663044,"about_ca_system_score_gemma":0.00034782148,"threshold_uncertainty_score":0.009571791},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50709665,0.0012666695,0.45527533,0.00025369847,0.0003701087,0.00044143107,0.0005438814,0.019890746,0.014861473],"genre_scores_gemma":[0.8958539,0.00014362195,0.09965585,0.00007442841,0.000045906694,0.00009226478,0.0005419034,0.000085217034,0.003506864],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968576,0.000034428285,0.000037912097,0.000045092802,0.00013477214,0.00006200113],"domain_scores_gemma":[0.9995664,0.00005514435,0.000034397595,0.000121155535,0.0001840106,0.000038881502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002894938,0.00026737447,0.00051615614,0.00055726734,0.0004322057,0.000623881,0.001780137,0.00042959754,0.004115924],"category_scores_gemma":[0.0006072425,0.00027542326,0.00018637197,0.0006685676,0.0002086142,0.0009453506,0.00057145103,0.0003713033,0.001472439],"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.0026837408,0.0008575976,0.012540442,0.00072471885,0.0003204348,0.000839077,0.00042139005,0.04607603,0.4191087,0.01893123,0.016778888,0.48071766],"study_design_scores_gemma":[0.00028597738,0.0016349299,0.003452651,0.00002877139,0.00017413849,0.0013853679,0.00010138971,0.58636916,0.37962127,0.0018243181,0.024993528,0.00012859149],"about_ca_topic_score_codex":0.001027043,"about_ca_topic_score_gemma":0.00075245026,"teacher_disagreement_score":0.004115924,"about_ca_system_score_codex":0.00042761004,"about_ca_system_score_gemma":0.00068180467,"threshold_uncertainty_score":0.01376909},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029969096,0.001203237,0.0024956497,0.05675926,0.9325336,0.000036364785,0.0005228617,0.0005396868,0.005609624],"genre_scores_gemma":[0.020712594,0.005793248,0.009440885,0.13824332,0.2605279,0.0002037326,0.0026674368,0.00145339,0.56095743],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99690163,0.00034574137,0.00031506584,0.00047421394,0.001677833,0.00028565965],"domain_scores_gemma":[0.9905315,0.0014905813,0.00036483494,0.0005744251,0.0066237636,0.00041492592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018025415,0.0013567118,0.0013030643,0.0019702232,0.002935341,0.0026425663,0.002464336,0.0058639958,0.042492896],"category_scores_gemma":[0.023539409,0.00069470226,0.0012871718,0.0011726252,0.0015155431,0.001516197,0.0016839314,0.0065817265,0.024378093],"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.000038281345,0.000010518679,0.00006348266,0.000066064866,0.0000100016305,0.00018100435,0.000014166597,0.00012016209,0.00019531744,0.0008853103,0.991442,0.0069736163],"study_design_scores_gemma":[0.000033093296,0.000050588354,0.00069715193,0.00011801291,0.0000433444,0.00029421927,0.000051814604,0.0013960669,0.0017301646,0.0020009973,0.993543,0.000041611773],"about_ca_topic_score_codex":0.015707823,"about_ca_topic_score_gemma":0.02473786,"teacher_disagreement_score":0.042492896,"about_ca_system_score_codex":0.0032604686,"about_ca_system_score_gemma":0.0029109642,"threshold_uncertainty_score":0.1421529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3001286,0.0019520374,0.62068415,0.000331399,0.0003533148,0.00036354354,0.0007108903,0.00902088,0.06645522],"genre_scores_gemma":[0.8219144,0.00036331467,0.17071055,0.00007260994,0.000022002247,0.00008705153,0.00039901247,0.00011563323,0.006315378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998889,0.000013704911,0.000008265224,0.000015090764,0.000046929406,0.000027158894],"domain_scores_gemma":[0.9999186,0.000019896934,0.000012133117,0.000014281192,0.000028869857,0.0000062567533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011297338,0.0003619444,0.0002534201,0.0003136999,0.00019775721,0.00051818864,0.0006318062,0.00026378653,0.0029842288],"category_scores_gemma":[0.00018904837,0.00015571754,0.00023046364,0.00022489618,0.0001281875,0.0002935631,0.00013747426,0.00026632927,0.0007095294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000697346,0.00022500279,0.0031796321,0.0014006014,0.00019758068,0.00104387,0.00022173776,0.27039284,0.34233177,0.025406402,0.010271938,0.34463128],"study_design_scores_gemma":[0.00027563112,0.0013733549,0.0024259347,0.00010522745,0.00017957053,0.00094290473,0.00007222376,0.6395469,0.29704344,0.002979287,0.05499406,0.00006148332],"about_ca_topic_score_codex":0.0020447546,"about_ca_topic_score_gemma":0.0020673748,"teacher_disagreement_score":0.0029842288,"about_ca_system_score_codex":0.00038107389,"about_ca_system_score_gemma":0.0006765846,"threshold_uncertainty_score":0.009983242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069173336,0.00014446364,0.927075,0.00030823378,0.000042085045,0.00005269317,0.000024292372,0.00047694813,0.0027028746],"genre_scores_gemma":[0.83706385,0.000104947765,0.16136512,0.0001437658,0.00004062897,0.000063751904,0.00004403962,0.00009192171,0.0010818441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904996,0.00032763454,0.000045469224,0.00015945538,0.0002783647,0.0001390772],"domain_scores_gemma":[0.99655056,0.0020099613,0.00045313212,0.00043169197,0.00039603893,0.00015855575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028739106,0.0007272239,0.00067945523,0.00045088085,0.00043785712,0.0011575001,0.0016924153,0.0010539829,0.0012871897],"category_scores_gemma":[0.0062543685,0.00030513416,0.000391243,0.00036960831,0.0009200475,0.002115619,0.0009947066,0.001557921,0.00024202414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020314053,0.00022806403,0.0014325767,0.000041462627,0.000038315186,0.00003530905,0.00003768902,0.90130967,0.01446085,0.023479149,0.000873522,0.057860266],"study_design_scores_gemma":[0.000005479224,0.00004293793,0.000063238964,0.0000019182135,0.0000024549233,0.000006665306,0.0000038802414,0.9958475,0.0016903736,0.002197106,0.00013536408,0.0000031370275],"about_ca_topic_score_codex":0.0019012151,"about_ca_topic_score_gemma":0.0017119332,"teacher_disagreement_score":0.0028739106,"about_ca_system_score_codex":0.0010001032,"about_ca_system_score_gemma":0.0014195957,"threshold_uncertainty_score":0.015198886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005120698,0.00014658256,0.99070436,0.00041934696,0.00006496725,0.000070322094,0.00004566329,0.00043485104,0.0029932186],"genre_scores_gemma":[0.34688085,0.00050072174,0.64675516,0.0004722855,0.00013935551,0.0003831632,0.00021347954,0.00040026347,0.0042547323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99368083,0.0027293924,0.0004875838,0.00066249986,0.0015751757,0.0008644477],"domain_scores_gemma":[0.9921996,0.0047861286,0.00036341636,0.0011484332,0.0011819941,0.00032042578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007041869,0.0011039365,0.0012625139,0.0009268134,0.0013919644,0.004836102,0.0023583116,0.0013864309,0.0035537686],"category_scores_gemma":[0.018147137,0.0011239767,0.0012160375,0.0010649884,0.003028588,0.0048261154,0.0030370757,0.0037422888,0.00092436135],"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.00021003757,0.000088577886,0.00032199651,0.00017640612,0.00003598024,0.00009100678,0.00026212752,0.19953752,0.0028927568,0.73735625,0.002633517,0.056393843],"study_design_scores_gemma":[0.000031175834,0.000036373447,0.00002934354,0.000048699745,0.0000280013,0.00002199512,0.00003678708,0.59112227,0.004031422,0.39996642,0.00463068,0.000016854436],"about_ca_topic_score_codex":0.0017892127,"about_ca_topic_score_gemma":0.002003894,"teacher_disagreement_score":0.007041869,"about_ca_system_score_codex":0.0027761764,"about_ca_system_score_gemma":0.003718494,"threshold_uncertainty_score":0.0372414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06944394,0.00074685377,0.91423273,0.00044862487,0.0001084581,0.00025479187,0.0016311089,0.008114597,0.0050189584],"genre_scores_gemma":[0.45673278,0.00054549804,0.53044397,0.00048968574,0.00009880958,0.00029944407,0.0061638197,0.00059846824,0.004627432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987105,0.0001765309,0.00014690413,0.00021578767,0.00060130534,0.00014896643],"domain_scores_gemma":[0.99825627,0.00065861346,0.00014825171,0.0005082095,0.000345517,0.00008321134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081603514,0.00056967,0.0009494238,0.0013421944,0.0006520706,0.0013699594,0.0014501282,0.00056113576,0.0030241867],"category_scores_gemma":[0.005174197,0.0002810902,0.0007781101,0.0034720728,0.0004505208,0.0034420008,0.0013155612,0.00076055207,0.0010052372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006317106,0.00039564815,0.006845889,0.00043618196,0.00011699721,0.00038506946,0.0003410045,0.094106294,0.05619137,0.038505547,0.0291629,0.7728813],"study_design_scores_gemma":[0.00006102654,0.00015396731,0.00089560676,0.000014780218,0.000035843103,0.00028441282,0.00013034849,0.93731296,0.020015523,0.030394623,0.010676957,0.000024026267],"about_ca_topic_score_codex":0.0032648477,"about_ca_topic_score_gemma":0.004762508,"teacher_disagreement_score":0.0032648477,"about_ca_system_score_codex":0.0009113204,"about_ca_system_score_gemma":0.0017718518,"threshold_uncertainty_score":0.010116935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60639817,0.0026363966,0.35809398,0.00038826483,0.00023346677,0.00010755856,0.00027800535,0.0050529824,0.02681115],"genre_scores_gemma":[0.8656595,0.0004331311,0.12997015,0.000097841286,0.00003161898,0.000036621896,0.00035477444,0.00009584461,0.0033205973],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997526,0.00003300967,0.000021244221,0.000032337328,0.00009881539,0.000062029874],"domain_scores_gemma":[0.99948055,0.000115280214,0.000033978213,0.00014145038,0.00020701656,0.000021839644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002636701,0.00019424871,0.00028294467,0.00039247348,0.00042251733,0.00078387035,0.0007531608,0.00040477444,0.0024295766],"category_scores_gemma":[0.0011846353,0.00017865266,0.00014804343,0.00077380805,0.00021299963,0.0011841909,0.0003445011,0.0003754379,0.00078029383],"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.0010802589,0.00034242272,0.010660241,0.00055884523,0.000091063564,0.00071577396,0.0003159426,0.07551618,0.31579587,0.034918312,0.012994621,0.54701054],"study_design_scores_gemma":[0.00019557691,0.000974824,0.002621296,0.00006855333,0.00015807713,0.0013738689,0.00013709822,0.6191991,0.3142037,0.0054389914,0.05556108,0.00006779002],"about_ca_topic_score_codex":0.0028790408,"about_ca_topic_score_gemma":0.004106211,"teacher_disagreement_score":0.0028790408,"about_ca_system_score_codex":0.0004615669,"about_ca_system_score_gemma":0.00079914293,"threshold_uncertainty_score":0.008127749},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013757966,0.0021430636,0.0022410066,0.008920337,0.010052382,0.00047643736,0.01075053,0.0022172555,0.96182317],"genre_scores_gemma":[0.014996853,0.0026236305,0.00078174076,0.0012281542,0.0025638917,0.00024978348,0.00408882,0.00044960508,0.9730175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994073,0.000119380886,0.000026522646,0.00013539165,0.00019019951,0.0001212212],"domain_scores_gemma":[0.9975085,0.0007363661,0.000116935036,0.0004768418,0.00047462957,0.00068679004],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010229801,0.001474897,0.0017723781,0.0010043915,0.0023123964,0.0036905045,0.0010339007,0.0039642258,0.87178695],"category_scores_gemma":[0.0035128235,0.0003610465,0.00073320844,0.0010642299,0.0005742627,0.0016067765,0.0016578932,0.0024460882,0.7183667],"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.00018679694,0.00008026508,0.00020774633,0.00014881208,0.00001363222,0.000063361826,0.00002538589,0.00011706745,0.0011027913,0.0019800016,0.9503787,0.0456954],"study_design_scores_gemma":[0.00007786403,0.000120079436,0.0012058908,0.00019239764,0.000018612453,0.00013959805,0.0000735325,0.0007387889,0.0011053678,0.0021171332,0.9941901,0.000020658415],"about_ca_topic_score_codex":0.0012578256,"about_ca_topic_score_gemma":0.0025084205,"teacher_disagreement_score":0.12821305,"about_ca_system_score_codex":0.0010801026,"about_ca_system_score_gemma":0.00093994784,"threshold_uncertainty_score":0.18288028},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037009913,0.0007201742,0.82751244,0.00029386918,0.00020668689,0.00029513217,0.0013902722,0.122654,0.009917499],"genre_scores_gemma":[0.38930804,0.0005793647,0.57838327,0.00043104583,0.00010530172,0.00094644877,0.0072867856,0.013254792,0.009704972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995528,0.000062260566,0.000025925865,0.00007642916,0.00019927714,0.000083345316],"domain_scores_gemma":[0.9996377,0.00008238963,0.000026706834,0.00010495031,0.00010267559,0.000045458288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057171524,0.0011339232,0.0006463828,0.000550333,0.00058836286,0.00086334744,0.0037608233,0.0008720697,0.008382784],"category_scores_gemma":[0.0014580181,0.00055455626,0.0010094417,0.0006387852,0.00065771694,0.0017126913,0.001821966,0.0012830012,0.0018609858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001546448,0.0003858547,0.0068985526,0.0009974921,0.0005077002,0.00071417034,0.0008900908,0.22513491,0.07574811,0.04287004,0.16038132,0.4839253],"study_design_scores_gemma":[0.00027597483,0.00020327463,0.0012575592,0.000043419524,0.00004377906,0.00017540122,0.00008988142,0.90263516,0.02447686,0.011521934,0.05918784,0.00008895465],"about_ca_topic_score_codex":0.006983374,"about_ca_topic_score_gemma":0.008847447,"teacher_disagreement_score":0.008382784,"about_ca_system_score_codex":0.00077920343,"about_ca_system_score_gemma":0.0017828718,"threshold_uncertainty_score":0.02804327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.891844,0.00012783482,0.10286169,0.000096128395,0.000050082417,0.00003993006,0.00015162963,0.00036009168,0.0044686887],"genre_scores_gemma":[0.9940439,0.000038186332,0.005275929,0.0000058709043,0.000005816235,0.000010749727,0.00009469585,0.000024858535,0.0005000578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997379,0.00004066718,0.000014988237,0.000023112247,0.0001412987,0.000041925734],"domain_scores_gemma":[0.9989278,0.0004066037,0.00016268592,0.00008677906,0.00033621048,0.00007994127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007947664,0.00081955903,0.0004200099,0.0015282881,0.0004012218,0.0012354366,0.0004166887,0.00084828323,0.0009112582],"category_scores_gemma":[0.0027741047,0.00023462389,0.00035329274,0.0006601605,0.00034271905,0.00077560236,0.00035668592,0.0004943466,0.00038539787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015782841,0.00019966305,0.017466227,0.000020255358,0.00002435871,0.00004528005,0.000025737912,0.93852437,0.017558504,0.0013919153,0.00033965605,0.024246283],"study_design_scores_gemma":[0.0000018178919,0.000030305278,0.0016770741,0.000001322639,0.0000021815947,0.000005672491,0.0000039961956,0.9948649,0.003191472,0.00017982163,0.00003751922,0.0000039373144],"about_ca_topic_score_codex":0.002996549,"about_ca_topic_score_gemma":0.002839608,"teacher_disagreement_score":0.002996549,"about_ca_system_score_codex":0.0006466764,"about_ca_system_score_gemma":0.00042733963,"threshold_uncertainty_score":0.005958259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04744114,0.0005161076,0.9406269,0.00029723853,0.00011535136,0.00039048755,0.0002968952,0.0058009163,0.0045148362],"genre_scores_gemma":[0.69143975,0.00032356058,0.30344528,0.00020352525,0.00007992435,0.00022155057,0.00048488035,0.00041852848,0.0033829934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969317,0.0007203142,0.00026686012,0.00047527932,0.0013005817,0.00030525163],"domain_scores_gemma":[0.98397857,0.0052457503,0.002013671,0.0068226866,0.0015695838,0.000369711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034549139,0.000545678,0.0005992248,0.000844714,0.0008280902,0.0018214717,0.0020212058,0.00069621875,0.0058152075],"category_scores_gemma":[0.00958157,0.0004718227,0.0006652967,0.00069406896,0.0021269529,0.0058998717,0.003292535,0.0015377004,0.0014824119],"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.0025587783,0.00057725323,0.0046831034,0.0011941207,0.00018733788,0.00061561493,0.00059606024,0.042717304,0.118408486,0.39848837,0.011925562,0.41804808],"study_design_scores_gemma":[0.0007031808,0.0016730626,0.0017501401,0.00018572836,0.00027547634,0.00249052,0.00034418094,0.41645607,0.2743585,0.24864282,0.052930072,0.0001902897],"about_ca_topic_score_codex":0.00037733957,"about_ca_topic_score_gemma":0.0003697905,"teacher_disagreement_score":0.0058152075,"about_ca_system_score_codex":0.0010362002,"about_ca_system_score_gemma":0.0024192997,"threshold_uncertainty_score":0.019453824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040851574,0.004848755,0.9066719,0.0010172585,0.001709156,0.00040810462,0.0006568002,0.009356783,0.034479767],"genre_scores_gemma":[0.23993951,0.0015991045,0.73735034,0.0007700744,0.0002874143,0.00045148577,0.0009826401,0.00022866597,0.018390788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.000026078587,0.000026781428,0.000047480113,0.0001394148,0.00004259696],"domain_scores_gemma":[0.9997036,0.000032806576,0.000022563183,0.00006630315,0.00015446823,0.000020286183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022129629,0.0004877281,0.00045537643,0.0009016474,0.00044051386,0.00079991744,0.0018088286,0.00064870546,0.0051681777],"category_scores_gemma":[0.0006419983,0.0002717045,0.00034274455,0.0011642632,0.00024310697,0.0016709222,0.0006041615,0.00071274006,0.001748201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044696982,0.00022694768,0.0010035418,0.0008929091,0.00011605224,0.0004383355,0.00018108763,0.042637218,0.12707074,0.068982385,0.06655961,0.6914442],"study_design_scores_gemma":[0.00033643286,0.0010504337,0.00082884403,0.00012696965,0.00023674768,0.0014308026,0.00009845168,0.69547635,0.0751844,0.032018807,0.19308923,0.00012255454],"about_ca_topic_score_codex":0.0018916685,"about_ca_topic_score_gemma":0.004446541,"teacher_disagreement_score":0.0051681777,"about_ca_system_score_codex":0.0009963105,"about_ca_system_score_gemma":0.0013823358,"threshold_uncertainty_score":0.017289221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041517606,0.000067921115,0.9931833,0.000061936014,0.0000112222415,0.00007089084,0.00004575014,0.00031377995,0.002093503],"genre_scores_gemma":[0.059247926,0.00011938642,0.9384656,0.000039192197,0.00001258044,0.00031736674,0.00014959667,0.00008669211,0.001561754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969196,0.0001013866,0.00001434352,0.00004666695,0.00010105521,0.0000446892],"domain_scores_gemma":[0.99935704,0.00040469939,0.000057081368,0.000053846103,0.000106005966,0.000021348756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088504143,0.0009958867,0.00058200874,0.0010580346,0.00067992747,0.00079478417,0.00095647934,0.0010306927,0.0056151487],"category_scores_gemma":[0.0027226682,0.00056210737,0.00047335928,0.001092228,0.00064510887,0.0009878507,0.00089257816,0.00086039095,0.0008945539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007405931,0.000057380257,0.0003405689,0.00013597569,0.000025919062,0.00006437263,0.00010373024,0.81055933,0.0029158932,0.028437529,0.0045758174,0.15270938],"study_design_scores_gemma":[0.000039392293,0.000057055204,0.000063189,0.000013798633,0.000011240805,0.000041997555,0.000028564149,0.98145527,0.0009198492,0.014745054,0.00261721,0.000007327937],"about_ca_topic_score_codex":0.002426525,"about_ca_topic_score_gemma":0.0027852326,"teacher_disagreement_score":0.0056151487,"about_ca_system_score_codex":0.00075627136,"about_ca_system_score_gemma":0.0014389107,"threshold_uncertainty_score":0.018784523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071048155,0.0011970313,0.8728491,0.0010020427,0.0005778606,0.00028879778,0.0007192638,0.017812945,0.034504723],"genre_scores_gemma":[0.60559905,0.00066515425,0.3268593,0.00056043343,0.00023413016,0.0002575281,0.0018833244,0.0005702979,0.06337087],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.00004512274,0.000026939008,0.000081370956,0.00021622983,0.000051459887],"domain_scores_gemma":[0.99942976,0.00011313297,0.000027990252,0.00009013315,0.0003117785,0.000027099994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003565844,0.00032623604,0.00033936923,0.0005872065,0.00042543968,0.0012044613,0.0016367862,0.0007913426,0.012377895],"category_scores_gemma":[0.0009279091,0.00032744536,0.00017872284,0.00067611056,0.00028991612,0.0017736506,0.0006105429,0.00060636667,0.0045255567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008041971,0.00027767074,0.0015826067,0.0004199594,0.00005428656,0.00034117428,0.00037523548,0.012055734,0.5673212,0.052082893,0.038507506,0.32617763],"study_design_scores_gemma":[0.00013669231,0.00091588614,0.0016812808,0.000064845204,0.00011705836,0.0006280666,0.00017116826,0.36881885,0.513428,0.013020326,0.100937456,0.000080470454],"about_ca_topic_score_codex":0.0018802044,"about_ca_topic_score_gemma":0.0032688675,"teacher_disagreement_score":0.012377895,"about_ca_system_score_codex":0.00066646916,"about_ca_system_score_gemma":0.00084766955,"threshold_uncertainty_score":0.04140818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009478828,0.00021954195,0.9852791,0.00013946673,0.00010265603,0.00012829434,0.000028049666,0.00058067875,0.004043357],"genre_scores_gemma":[0.25920138,0.00025487624,0.7365991,0.00009770736,0.000033352266,0.00014284096,0.00007504762,0.0000624001,0.0035331976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990019,0.0002088504,0.00009980818,0.00011464616,0.0004931399,0.000081606464],"domain_scores_gemma":[0.9991967,0.0003385339,0.00005669697,0.00007544762,0.00029549954,0.000037150206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011423684,0.00039276318,0.00056233327,0.0013441343,0.0005221031,0.0009884137,0.00074016274,0.00057705736,0.0030648415],"category_scores_gemma":[0.0031215702,0.00022444119,0.00029422462,0.0014257026,0.00057740393,0.0010189804,0.0007084541,0.0006743033,0.0005956798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004170068,0.00016328601,0.0015710127,0.00039239952,0.00007692238,0.00049676874,0.0003599585,0.17601888,0.046729837,0.11019471,0.0037627087,0.65981644],"study_design_scores_gemma":[0.0000631256,0.00017477425,0.00033719957,0.000034832123,0.000026309195,0.0005700414,0.00007847774,0.9433825,0.019922106,0.022698918,0.012679001,0.000032749882],"about_ca_topic_score_codex":0.0031266687,"about_ca_topic_score_gemma":0.0020222582,"teacher_disagreement_score":0.0031266687,"about_ca_system_score_codex":0.00068785046,"about_ca_system_score_gemma":0.0014516576,"threshold_uncertainty_score":0.010252893},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069756336,0.00020881525,0.90348804,0.00012033202,0.00014793895,0.00024426274,0.0009193754,0.08518198,0.0027136798],"genre_scores_gemma":[0.19992624,0.00045147457,0.7762863,0.00031991358,0.000107882566,0.0006935006,0.0044363705,0.010196157,0.007582139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574006,0.00096276193,0.00052712625,0.00064375973,0.0018663813,0.00025998536],"domain_scores_gemma":[0.99137306,0.005160494,0.0005816071,0.0014683217,0.0012956515,0.00012096499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030174889,0.002450687,0.0013327161,0.0022884726,0.0009256279,0.0027399566,0.0033330966,0.0015035464,0.0151879],"category_scores_gemma":[0.013952975,0.0017232086,0.0015918707,0.0008914104,0.001114038,0.0045121266,0.0026438334,0.0016427877,0.0048789144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009793887,0.0004683942,0.0043421746,0.0018715658,0.00041416095,0.0016932474,0.00060546416,0.10396594,0.087938,0.057812218,0.062465094,0.6774444],"study_design_scores_gemma":[0.0003820122,0.00028230838,0.0010355533,0.00042122614,0.00017721711,0.0011114862,0.00009637508,0.7603132,0.13841939,0.034610175,0.06299012,0.00016094968],"about_ca_topic_score_codex":0.0026350177,"about_ca_topic_score_gemma":0.0032413863,"teacher_disagreement_score":0.0151879,"about_ca_system_score_codex":0.0008534298,"about_ca_system_score_gemma":0.002761554,"threshold_uncertainty_score":0.05080855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019596308,0.00044535063,0.97562057,0.00020510086,0.000063914864,0.00008163999,0.00002466082,0.0005654872,0.0033969982],"genre_scores_gemma":[0.2467762,0.0008286932,0.7490574,0.000112471695,0.00008187298,0.0001051664,0.00021029197,0.00008401013,0.0027438612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994173,0.00014382372,0.00003782825,0.00007092148,0.00026891523,0.000061190054],"domain_scores_gemma":[0.9995425,0.00015803213,0.00002990924,0.00010345031,0.00014992405,0.000016321375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008501634,0.000517216,0.0006140118,0.0013082225,0.0005396846,0.00071395317,0.000762465,0.00075483683,0.0011603832],"category_scores_gemma":[0.0012851892,0.00028731802,0.00063473586,0.0011250039,0.0003166168,0.0015814541,0.0007012532,0.0007187261,0.0004892283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013781703,0.00019717631,0.0012373135,0.00017160736,0.00007796745,0.00016186044,0.00015735386,0.08346111,0.046581212,0.027051559,0.0025777216,0.83818734],"study_design_scores_gemma":[0.000028760373,0.0002636419,0.0006966878,0.000032970594,0.00005707929,0.00057965255,0.00008868235,0.9238179,0.03322939,0.026949601,0.01421108,0.000044609],"about_ca_topic_score_codex":0.00079605,"about_ca_topic_score_gemma":0.0011944228,"teacher_disagreement_score":0.0013082225,"about_ca_system_score_codex":0.00036715565,"about_ca_system_score_gemma":0.00060757017,"threshold_uncertainty_score":0.0044960976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05370958,0.017112376,0.6590849,0.065308966,0.002379027,0.00008320186,0.0006981561,0.0019507813,0.19967294],"genre_scores_gemma":[0.79919803,0.00949157,0.14024736,0.0035114256,0.0016376509,0.00019172784,0.00028863078,0.0006501406,0.04478336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991831,0.00020231189,0.00003832315,0.0001875286,0.00026845635,0.000120199045],"domain_scores_gemma":[0.99784315,0.0010056715,0.00006693127,0.0007293447,0.00022123066,0.00013357887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415039,0.0005489118,0.00079619075,0.0006104809,0.0014145015,0.006875235,0.0021767425,0.0031231365,0.011510433],"category_scores_gemma":[0.0069131786,0.0005330459,0.0005543914,0.0008829933,0.005453176,0.022451568,0.0030944454,0.0046017505,0.0020398127],"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.000038689763,0.000016751814,0.00014519466,0.000071252565,0.00001452522,0.00006775129,0.00028328167,0.004408379,0.000725466,0.97228795,0.006779418,0.015161234],"study_design_scores_gemma":[0.000011444394,0.000009961057,0.000053820062,0.000030460611,0.000009064976,0.00004192538,0.000095035706,0.014507416,0.00048924086,0.96793205,0.0168106,0.000009174876],"about_ca_topic_score_codex":0.002015508,"about_ca_topic_score_gemma":0.0019428558,"teacher_disagreement_score":0.011510433,"about_ca_system_score_codex":0.0015373827,"about_ca_system_score_gemma":0.0013420454,"threshold_uncertainty_score":0.03850621},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005919948,0.0019582675,0.8610391,0.0017100663,0.00071617984,0.00091795635,0.0051107733,0.01116689,0.11146081],"genre_scores_gemma":[0.08094589,0.008309807,0.7281583,0.0015617692,0.0012317612,0.0011294881,0.021006916,0.0035743255,0.15408173],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776554,0.00033705315,0.00009984183,0.00050329627,0.0011797454,0.00011457243],"domain_scores_gemma":[0.9964922,0.0011192556,0.00010560032,0.0014484783,0.000725851,0.000108629145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023435168,0.0018542195,0.0013537968,0.003398183,0.0014096764,0.003991317,0.0021708752,0.0008822385,0.023251973],"category_scores_gemma":[0.006336639,0.0010278642,0.0007963004,0.0040744524,0.000911345,0.004236569,0.0030031165,0.0020239737,0.018667318],"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.0000851345,0.0001404268,0.0021922018,0.0006275338,0.00006991288,0.00011423064,0.00054113026,0.0055818595,0.014325437,0.059963066,0.12614396,0.7902151],"study_design_scores_gemma":[0.000027862465,0.00010874672,0.0047512953,0.0005165922,0.00012490091,0.0007740301,0.00083010976,0.060076836,0.06190756,0.13560878,0.7351579,0.0001153918],"about_ca_topic_score_codex":0.0023119496,"about_ca_topic_score_gemma":0.0029419567,"teacher_disagreement_score":0.023251973,"about_ca_system_score_codex":0.0008891137,"about_ca_system_score_gemma":0.0018438515,"threshold_uncertainty_score":0.07778561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1953811,0.0030958909,0.75311637,0.00096312404,0.00061283907,0.00050729455,0.00092754525,0.0047228606,0.04067299],"genre_scores_gemma":[0.68695974,0.00061855145,0.3010591,0.0004848861,0.000086126245,0.00029002843,0.00041945226,0.00016556981,0.009916541],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998983,0.000011805471,0.000007874271,0.000024030234,0.000040095656,0.000017882958],"domain_scores_gemma":[0.9998547,0.000014151717,0.00003059594,0.000023815397,0.0000666787,0.000010112965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008361588,0.00031934178,0.00027190876,0.00034327482,0.00032449156,0.00049425283,0.0016609258,0.00044936064,0.003360773],"category_scores_gemma":[0.0002598359,0.00019173179,0.00029144782,0.0004965852,0.00012340058,0.0006155006,0.0002552375,0.00023918645,0.0009456136],"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.000337554,0.0001520889,0.002125869,0.00085789606,0.00014131122,0.0008524945,0.0002940559,0.03853031,0.691402,0.031861555,0.01983589,0.21360908],"study_design_scores_gemma":[0.00017266402,0.0024377366,0.0025405115,0.00011123771,0.00021236151,0.0028996125,0.00012371909,0.52951694,0.3492368,0.00666399,0.105956994,0.00012755473],"about_ca_topic_score_codex":0.0012812867,"about_ca_topic_score_gemma":0.004422739,"teacher_disagreement_score":0.003360773,"about_ca_system_score_codex":0.0006606153,"about_ca_system_score_gemma":0.0008957112,"threshold_uncertainty_score":0.011242926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038694218,0.0004018081,0.9567758,0.0002302848,0.00007795655,0.00018247943,0.0002754401,0.0022631374,0.0010989732],"genre_scores_gemma":[0.60634536,0.00030201572,0.38923872,0.0002915591,0.00005000433,0.00023824902,0.0008696017,0.000053522435,0.002610924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987993,0.00019192978,0.00014423035,0.00022403606,0.0004998899,0.00014070529],"domain_scores_gemma":[0.9982141,0.00046576664,0.00020896511,0.00034095655,0.0006971299,0.00007313139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014750388,0.00057885237,0.0007327582,0.0013536853,0.0009100114,0.001055737,0.0021287552,0.0008973295,0.0011872415],"category_scores_gemma":[0.003930317,0.000281558,0.00045606607,0.0013094303,0.0004907463,0.0027131788,0.0008983536,0.00086755847,0.00046466925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006898366,0.00023318751,0.008499492,0.000099455865,0.000089930865,0.00015985362,0.00021773145,0.08502404,0.021457534,0.013789682,0.00507044,0.86466885],"study_design_scores_gemma":[0.000022400556,0.00011270203,0.0007282349,0.00001383532,0.000022906068,0.00013182223,0.000032192664,0.9716386,0.017987063,0.006752401,0.0025340326,0.000023849565],"about_ca_topic_score_codex":0.008433596,"about_ca_topic_score_gemma":0.0095187845,"teacher_disagreement_score":0.008433596,"about_ca_system_score_codex":0.0021017203,"about_ca_system_score_gemma":0.002547228,"threshold_uncertainty_score":0.016769052},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078481406,0.00036932732,0.90981036,0.00029366903,0.000082568156,0.0001396065,0.0001624336,0.0012476571,0.00941289],"genre_scores_gemma":[0.54364526,0.00024893746,0.44837314,0.00011230619,0.00003124423,0.00028555197,0.0003517768,0.000069351685,0.0068825507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999342,0.000010783623,0.00000455444,0.00001610148,0.000020981113,0.000013409421],"domain_scores_gemma":[0.99986386,0.00002881206,0.000010830789,0.000017892,0.00007021809,0.000008321218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001371591,0.00028286994,0.00031691455,0.00034027084,0.0004357591,0.00047787483,0.0013223963,0.00044655832,0.0032115057],"category_scores_gemma":[0.00039924585,0.00018282747,0.00020330965,0.00042950868,0.0001931419,0.0005711485,0.00045762295,0.00029282682,0.00043806352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023309825,0.00008071456,0.0010765493,0.00019089188,0.00006718693,0.000087698674,0.000096961165,0.7266394,0.017806748,0.026191551,0.004922134,0.22260702],"study_design_scores_gemma":[0.00002409762,0.000043155425,0.0001379114,0.000006272108,0.0000147364535,0.000041514202,0.00001925232,0.98938775,0.0041153305,0.005066234,0.0011378168,0.0000060474476],"about_ca_topic_score_codex":0.004237177,"about_ca_topic_score_gemma":0.0075708437,"teacher_disagreement_score":0.004237177,"about_ca_system_score_codex":0.0005142027,"about_ca_system_score_gemma":0.0010710051,"threshold_uncertainty_score":0.010743558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17855524,0.01774349,0.51492643,0.0033873701,0.00042609478,0.00038062496,0.0012950057,0.0008068384,0.28247896],"genre_scores_gemma":[0.9006087,0.011320281,0.05716929,0.00030115485,0.00018179281,0.0002289281,0.00068964885,0.00011013733,0.029390087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992305,0.000105281295,0.00003078816,0.00013736836,0.00038867976,0.00010745048],"domain_scores_gemma":[0.9990345,0.00037003687,0.000111028,0.00010556505,0.00034822864,0.000030726897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000501047,0.00042591602,0.00025708094,0.0027719554,0.00056194665,0.0018273568,0.00050047156,0.0006312726,0.0047868458],"category_scores_gemma":[0.0019392938,0.0002034004,0.00059820875,0.0019342114,0.0005468868,0.0023221923,0.00041841558,0.000603546,0.00090000534],"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.00007441486,0.00010962995,0.021104408,0.0005717162,0.00010204242,0.00035879045,0.00030936368,0.08603013,0.009412717,0.6313702,0.0080330735,0.24252352],"study_design_scores_gemma":[0.00002032658,0.00018674442,0.039948896,0.0004949849,0.00017792184,0.001460491,0.0005718206,0.45229414,0.025085643,0.31321752,0.16642597,0.0001155857],"about_ca_topic_score_codex":0.0022323753,"about_ca_topic_score_gemma":0.0009875938,"teacher_disagreement_score":0.0047868458,"about_ca_system_score_codex":0.0021610763,"about_ca_system_score_gemma":0.0011302038,"threshold_uncertainty_score":0.016013622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4893706,0.018075883,0.24113968,0.0063418555,0.0011411236,0.00020800537,0.00052035245,0.008766608,0.23443584],"genre_scores_gemma":[0.9272005,0.004320864,0.041958258,0.0011082788,0.00014470618,0.00004391822,0.00035375135,0.0002720836,0.024597622],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995759,0.000057035093,0.000013761118,0.00006505727,0.00020949657,0.0000787815],"domain_scores_gemma":[0.9994272,0.00011932271,0.000081030514,0.00017345167,0.00015476298,0.000044251035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032860212,0.00052857737,0.00023590852,0.0002808269,0.00031499634,0.0010198895,0.00082028063,0.00034618346,0.007837751],"category_scores_gemma":[0.0011311134,0.00014418642,0.00012379905,0.00046461695,0.00037967582,0.0017688804,0.00073745876,0.0010847884,0.0024319561],"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.0020898776,0.00029367526,0.007917626,0.0008106322,0.000089079316,0.00055644906,0.00030020293,0.03498905,0.20928806,0.13295372,0.03205937,0.57865226],"study_design_scores_gemma":[0.00008950277,0.0011136394,0.0118867755,0.00027550882,0.0002147891,0.0015125662,0.00034260482,0.30549645,0.24942674,0.032228235,0.39732608,0.00008713843],"about_ca_topic_score_codex":0.0010937372,"about_ca_topic_score_gemma":0.0016607572,"teacher_disagreement_score":0.007837751,"about_ca_system_score_codex":0.0006030785,"about_ca_system_score_gemma":0.00049269095,"threshold_uncertainty_score":0.026219845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13681844,0.0021022009,0.84774154,0.0006653481,0.00008248939,0.00027197407,0.0006600256,0.002799981,0.008857968],"genre_scores_gemma":[0.5645018,0.0008397918,0.42977226,0.0003176814,0.00009190667,0.00027286523,0.0013902265,0.00038765516,0.0024257682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984536,0.00053868257,0.00008943338,0.0002668216,0.0005004871,0.00015093847],"domain_scores_gemma":[0.99427456,0.0031925438,0.00045937963,0.00096451124,0.00077667244,0.00033222575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030533457,0.00078366575,0.00143765,0.003863562,0.0008012036,0.0024009815,0.0016620418,0.0011473786,0.0024387143],"category_scores_gemma":[0.012370861,0.00060658285,0.00054668356,0.002688622,0.0012667973,0.0055077067,0.0036288283,0.0010836992,0.00073137897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007840501,0.00036152068,0.02029874,0.00050629175,0.00016378974,0.00053708325,0.001377928,0.2532324,0.013588331,0.14145474,0.01252381,0.5551714],"study_design_scores_gemma":[0.00008820366,0.00030587916,0.0020691266,0.00013048318,0.00006168835,0.0003798279,0.00049306976,0.9027006,0.0063096257,0.07435669,0.013062911,0.000041917257],"about_ca_topic_score_codex":0.0013861913,"about_ca_topic_score_gemma":0.002123917,"teacher_disagreement_score":0.003863562,"about_ca_system_score_codex":0.00059078867,"about_ca_system_score_gemma":0.0012266962,"threshold_uncertainty_score":0.016147852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08014449,0.0003332011,0.9020091,0.00023639815,0.00015138833,0.00027301404,0.00019489098,0.011023714,0.005633872],"genre_scores_gemma":[0.8067142,0.00024836455,0.18568683,0.0002552451,0.00007468773,0.0001911087,0.0005059718,0.00045224428,0.005871234],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797994,0.00043295725,0.00014116785,0.0002610069,0.00087760476,0.00030728919],"domain_scores_gemma":[0.9943509,0.0011659751,0.00058932404,0.0028749725,0.00088823214,0.00013055532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021588872,0.00055304763,0.0006208937,0.0008633857,0.0008049641,0.0011853944,0.0015831189,0.0009001653,0.0019808966],"category_scores_gemma":[0.0041716862,0.00039396636,0.0006179744,0.0005519129,0.0009360897,0.0032793777,0.002795021,0.001212253,0.0008137291],"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.0025261932,0.0002806509,0.010487589,0.0005216958,0.00029584495,0.0009237306,0.0007792008,0.06047562,0.21081905,0.097234495,0.019793184,0.5958628],"study_design_scores_gemma":[0.00021654725,0.0008085177,0.0025403693,0.000086122585,0.00014804238,0.00228037,0.00020270642,0.58996487,0.32813472,0.03485359,0.04061654,0.00014758314],"about_ca_topic_score_codex":0.0006101793,"about_ca_topic_score_gemma":0.0006402847,"teacher_disagreement_score":0.0021588872,"about_ca_system_score_codex":0.0005410567,"about_ca_system_score_gemma":0.0014978005,"threshold_uncertainty_score":0.011417389},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42046377,0.0032521882,0.53282887,0.0003653917,0.000357066,0.0001902094,0.0006134229,0.0059274323,0.036001623],"genre_scores_gemma":[0.8608548,0.00033634435,0.13330941,0.00008129851,0.000043615088,0.0000619552,0.00030950288,0.000059364113,0.0049437038],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998995,0.000013932354,0.000006582094,0.000012522704,0.000042388536,0.000025047548],"domain_scores_gemma":[0.9999106,0.000021382431,0.00001340275,0.000023722609,0.000024684483,0.0000062662934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011087973,0.00027242824,0.00017257108,0.00041123235,0.00020319958,0.00042372214,0.00082373177,0.00019139443,0.0026472944],"category_scores_gemma":[0.00027833437,0.0000767913,0.000119190874,0.0004000575,0.0001515246,0.00048629945,0.00026256306,0.0001873144,0.0004452284],"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.0009201503,0.00015230865,0.0028818648,0.00054743054,0.0000814223,0.0005899197,0.00010834458,0.06638588,0.30781093,0.05931355,0.012215115,0.54899305],"study_design_scores_gemma":[0.00017999664,0.0008636296,0.0018271136,0.000078050165,0.0000810859,0.001038149,0.00008828012,0.42384735,0.4989845,0.009675429,0.063288584,0.000047875004],"about_ca_topic_score_codex":0.00070917484,"about_ca_topic_score_gemma":0.0013024409,"teacher_disagreement_score":0.0026472944,"about_ca_system_score_codex":0.00040555175,"about_ca_system_score_gemma":0.00034856657,"threshold_uncertainty_score":0.008856058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1859912,0.0018201375,0.7773401,0.00022785105,0.00020089766,0.00014417125,0.0005244651,0.0063472297,0.027403977],"genre_scores_gemma":[0.733084,0.00024736757,0.261393,0.00008704158,0.000028927783,0.00007657673,0.00042636512,0.000085547195,0.0045711384],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990034,0.000014871886,0.000006052766,0.00001458574,0.000044158132,0.0000199701],"domain_scores_gemma":[0.9998957,0.000028436261,0.000019230041,0.000024861847,0.000024846819,0.0000070596175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015580785,0.0003689023,0.00018419544,0.00037915117,0.00017067917,0.00043177305,0.00100961,0.00020605417,0.0037142953],"category_scores_gemma":[0.0003304462,0.000096124684,0.00014096667,0.0002671125,0.00013769243,0.00042267868,0.0002929586,0.00020363189,0.00041154298],"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.0007769611,0.00016102193,0.0029272693,0.0003756128,0.00010422406,0.0003141983,0.000073230294,0.20054948,0.110917374,0.0309663,0.011606462,0.64122784],"study_design_scores_gemma":[0.00013388267,0.00069539703,0.0011396713,0.000044322445,0.000060733277,0.0004446654,0.000045091063,0.8474451,0.10937542,0.005634666,0.034952372,0.000028731958],"about_ca_topic_score_codex":0.0009874711,"about_ca_topic_score_gemma":0.0029119262,"teacher_disagreement_score":0.0037142953,"about_ca_system_score_codex":0.00047124492,"about_ca_system_score_gemma":0.00042487917,"threshold_uncertainty_score":0.012425542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021550309,0.00028637252,0.95169973,0.00043396832,0.00019432786,0.0001267772,0.00038551865,0.021723842,0.0035991482],"genre_scores_gemma":[0.3656495,0.0002360742,0.6099486,0.0012348654,0.00018761522,0.00045469226,0.003187911,0.0029563922,0.016144434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993149,0.00011118655,0.000036195677,0.00017795047,0.00022049501,0.00013923075],"domain_scores_gemma":[0.99865365,0.00041171542,0.00008757771,0.00043804312,0.0003099107,0.00009907098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073351344,0.0020472987,0.0011171029,0.0006099307,0.00069053227,0.001104888,0.0030962464,0.0016351201,0.012468493],"category_scores_gemma":[0.0058167684,0.0009990742,0.0009924467,0.0005274857,0.0008269535,0.0021413532,0.0023097477,0.0037498318,0.006116838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006989925,0.0004483206,0.003186503,0.00027974264,0.0001860436,0.00041717937,0.00024074764,0.38500455,0.02772416,0.011218775,0.041335262,0.5292597],"study_design_scores_gemma":[0.000039696493,0.000064487256,0.00023643501,0.000013576678,0.000014302326,0.00004832374,0.000023938826,0.9878805,0.004748521,0.004420936,0.002495116,0.000014238472],"about_ca_topic_score_codex":0.011157874,"about_ca_topic_score_gemma":0.031430807,"teacher_disagreement_score":0.012468493,"about_ca_system_score_codex":0.0007098226,"about_ca_system_score_gemma":0.002393059,"threshold_uncertainty_score":0.04171127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38559613,0.00067551347,0.60692877,0.0005259673,0.00006607194,0.000435412,0.00034839968,0.0013808041,0.004042978],"genre_scores_gemma":[0.80220985,0.0003937153,0.19381964,0.000083277744,0.00003451686,0.00039973244,0.00042059808,0.00015431235,0.0024843987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99265456,0.0042720553,0.0002717113,0.0009119735,0.0015925028,0.00029720945],"domain_scores_gemma":[0.9794409,0.014940471,0.0015243611,0.00080378266,0.0031433504,0.00014698591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008852011,0.0019717033,0.0010193182,0.0025032512,0.0005947083,0.0013992086,0.0013693281,0.00093341956,0.0010527881],"category_scores_gemma":[0.028794345,0.00057633343,0.0010233563,0.0023678716,0.00043961342,0.0015880716,0.00077158294,0.0015659492,0.0005477804],"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.0004873584,0.0009099364,0.058488112,0.000229728,0.0006127722,0.00008149075,0.00031883124,0.7262192,0.004730138,0.003905793,0.0013400894,0.20267661],"study_design_scores_gemma":[0.000009762863,0.00031431243,0.0044728843,0.000013443539,0.00004155864,0.000014268762,0.000073238865,0.99223363,0.0019269539,0.00055380375,0.00032851347,0.000017708751],"about_ca_topic_score_codex":0.015095751,"about_ca_topic_score_gemma":0.009836026,"teacher_disagreement_score":0.015095751,"about_ca_system_score_codex":0.0015527568,"about_ca_system_score_gemma":0.0013756839,"threshold_uncertainty_score":0.04681444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04877818,0.000720325,0.8970129,0.0007043215,0.00030492252,0.0008351519,0.005204067,0.043392766,0.0030473429],"genre_scores_gemma":[0.4087309,0.00047326664,0.5600345,0.0004356036,0.00010803123,0.0008907394,0.02036919,0.0025972857,0.0063604414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990996,0.00019196808,0.000055533845,0.00022985807,0.00036416273,0.00005888259],"domain_scores_gemma":[0.99632865,0.0013606324,0.00036978378,0.00076940417,0.0009826546,0.00018893942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008102711,0.0013056651,0.0005127982,0.0030090257,0.0006185203,0.0008516244,0.001545682,0.0010593644,0.002016197],"category_scores_gemma":[0.00911322,0.00042933616,0.0008052073,0.001634286,0.0004132757,0.0018199891,0.0015348098,0.001455914,0.00088623585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000681964,0.0003786063,0.011650224,0.0010116322,0.00019300249,0.000864015,0.0012685624,0.11465524,0.027958643,0.01816068,0.068649866,0.75452757],"study_design_scores_gemma":[0.00007712752,0.00020667972,0.002544699,0.00006791147,0.00008149881,0.00025854955,0.00031561422,0.9294383,0.019473655,0.023993293,0.023488158,0.000054621552],"about_ca_topic_score_codex":0.01017908,"about_ca_topic_score_gemma":0.020955967,"teacher_disagreement_score":0.01017908,"about_ca_system_score_codex":0.0009228575,"about_ca_system_score_gemma":0.0019101904,"threshold_uncertainty_score":0.020239651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38157955,0.0014246657,0.560024,0.00043159624,0.00030334544,0.00033699282,0.0006244418,0.007960057,0.047315232],"genre_scores_gemma":[0.83241177,0.00016426812,0.16293357,0.00014678518,0.000029174535,0.00010631954,0.00033619336,0.00011538609,0.0037565182],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999049,0.000013081143,0.000006146563,0.000015569778,0.000040979063,0.000019281397],"domain_scores_gemma":[0.9998685,0.000025099016,0.000029194556,0.000030321078,0.000038497215,0.00000838497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117574506,0.00026259787,0.00014404379,0.00031913604,0.00013133715,0.0003386653,0.0006771497,0.00017895186,0.0031167725],"category_scores_gemma":[0.00028894673,0.000082979546,0.00016651761,0.00019049758,0.00014933148,0.00030327772,0.00018237687,0.00020996956,0.00038491335],"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.0003440605,0.00019683689,0.0032747914,0.00058906036,0.000095041956,0.00041269072,0.00014790182,0.12388094,0.49501342,0.024689002,0.01432542,0.33703077],"study_design_scores_gemma":[0.00009431967,0.00090006855,0.0016615738,0.00004154071,0.000054270313,0.00037434054,0.000055813525,0.6124753,0.35174435,0.0029127065,0.02965441,0.000031361356],"about_ca_topic_score_codex":0.0009123681,"about_ca_topic_score_gemma":0.002236066,"teacher_disagreement_score":0.0031167725,"about_ca_system_score_codex":0.000430071,"about_ca_system_score_gemma":0.00055784924,"threshold_uncertainty_score":0.0104267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04789189,0.00010923625,0.9423619,0.00032148906,0.000042006664,0.00009697798,0.000060808525,0.0017125158,0.0074031497],"genre_scores_gemma":[0.75657374,0.00028079026,0.24003331,0.00015005794,0.00002858179,0.00028343697,0.00016131157,0.00019216,0.0022966366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991881,0.00029352924,0.00006612648,0.000121720135,0.0002434599,0.00008704058],"domain_scores_gemma":[0.99870574,0.0004875146,0.000114327784,0.00047016583,0.00016641594,0.000055797933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011453136,0.00040821082,0.00026059558,0.00042253127,0.0005505088,0.00089908566,0.00085470424,0.0006337418,0.0010927239],"category_scores_gemma":[0.0024657208,0.00021038961,0.00056094973,0.00037361248,0.0016851921,0.0035409096,0.0010752662,0.001345456,0.00025685751],"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.00012959914,0.00014533919,0.0018354057,0.00014425685,0.00003930568,0.00038152587,0.0006048527,0.13999343,0.0541542,0.7282873,0.0018803572,0.072404474],"study_design_scores_gemma":[0.000020665218,0.00016118537,0.00039384936,0.00004492536,0.000043584194,0.00020375311,0.00011436152,0.72778225,0.02452731,0.23141783,0.0152433785,0.000046878587],"about_ca_topic_score_codex":0.0012213849,"about_ca_topic_score_gemma":0.0011484666,"teacher_disagreement_score":0.0012213849,"about_ca_system_score_codex":0.00059085456,"about_ca_system_score_gemma":0.0009982041,"threshold_uncertainty_score":0.0060570836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029773149,0.00055783463,0.99405587,0.00007645772,0.00005536564,0.0000546733,0.000025936686,0.000513154,0.0016833809],"genre_scores_gemma":[0.10660237,0.0017882261,0.8877819,0.000112913636,0.000091219015,0.00033276438,0.00020597003,0.000229936,0.0028546695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990055,0.00035834077,0.00006624795,0.000107989385,0.0003826202,0.00007930294],"domain_scores_gemma":[0.9979019,0.0011818854,0.00025634968,0.0003156582,0.000288967,0.00005519457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014567717,0.00084229757,0.00054667366,0.0013019361,0.00080514327,0.0012398822,0.0009486828,0.0005825801,0.0020462244],"category_scores_gemma":[0.005968072,0.00037747505,0.0002830599,0.0017578831,0.0010274143,0.0030204137,0.001553784,0.0012504512,0.0008091828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015489978,0.00007861057,0.00060406805,0.00029955726,0.00003403836,0.00015396757,0.00024947387,0.28437784,0.010769193,0.32457495,0.006012756,0.37269065],"study_design_scores_gemma":[0.00003834236,0.00023143835,0.00014438745,0.00008761936,0.000024356179,0.00030286415,0.0000587388,0.7733784,0.008878367,0.17177494,0.045028035,0.000052480915],"about_ca_topic_score_codex":0.00071711175,"about_ca_topic_score_gemma":0.0008048912,"teacher_disagreement_score":0.0020462244,"about_ca_system_score_codex":0.0007143765,"about_ca_system_score_gemma":0.0011891299,"threshold_uncertainty_score":0.0077041984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013544095,0.00045767848,0.90926945,0.001021342,0.00047877233,0.00086898636,0.0024748333,0.028252084,0.043632794],"genre_scores_gemma":[0.28849557,0.001057351,0.6269763,0.001794158,0.00041559525,0.0020147054,0.013481586,0.005330876,0.060433835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857914,0.00018333935,0.00011885376,0.00019613434,0.00067102927,0.00025158605],"domain_scores_gemma":[0.9988146,0.00017066357,0.00007786686,0.00048210807,0.0002924225,0.00016242707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022512013,0.0006811402,0.00082758575,0.0009742981,0.001038546,0.0031615018,0.0038494274,0.0012564391,0.015496947],"category_scores_gemma":[0.0030415806,0.0005114906,0.00071822375,0.0010931492,0.0010325129,0.0036764226,0.004152925,0.002228237,0.005097414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013119492,0.0004653695,0.003937667,0.00048634937,0.00013994111,0.0007429647,0.0009419995,0.054942917,0.013616498,0.59303707,0.14392506,0.18645228],"study_design_scores_gemma":[0.00022915476,0.00016611515,0.0007336331,0.000087885506,0.000056478504,0.00047589635,0.00019790392,0.31721082,0.022649866,0.07987259,0.5782051,0.00011440361],"about_ca_topic_score_codex":0.0039162966,"about_ca_topic_score_gemma":0.0035695692,"teacher_disagreement_score":0.015496947,"about_ca_system_score_codex":0.0016539722,"about_ca_system_score_gemma":0.0027295377,"threshold_uncertainty_score":0.05184245},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034685605,0.0038269341,0.92239636,0.0010503569,0.00021645914,0.000099204626,0.00018378322,0.0012744676,0.06748392],"genre_scores_gemma":[0.15054755,0.009629162,0.7900711,0.00043548123,0.00031388647,0.00047296134,0.00073648227,0.0011951037,0.04659821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893314,0.00026471095,0.00007153247,0.00018648397,0.0004582125,0.00008585297],"domain_scores_gemma":[0.9994037,0.00027610076,0.000060539758,0.00016515685,0.0000735683,0.00002082049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010430192,0.001302669,0.00059081207,0.0005940022,0.00049427594,0.003019354,0.0016576493,0.0010635275,0.005389793],"category_scores_gemma":[0.0025961082,0.00078545406,0.0007158411,0.0010131341,0.002736915,0.0036428063,0.0018089131,0.0021415958,0.0018328715],"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.000024869278,0.000040891802,0.00015140799,0.00023514692,0.00001557224,0.000075335076,0.0001564453,0.09097503,0.0020901817,0.79169905,0.009730126,0.104806],"study_design_scores_gemma":[0.000022580754,0.000027851353,0.00018187726,0.00026057273,0.000017829387,0.00020046244,0.00005358315,0.181998,0.003366214,0.69049627,0.123342045,0.000032716354],"about_ca_topic_score_codex":0.0016065578,"about_ca_topic_score_gemma":0.0016100729,"teacher_disagreement_score":0.005389793,"about_ca_system_score_codex":0.0021850918,"about_ca_system_score_gemma":0.0015549621,"threshold_uncertainty_score":0.018030584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008304249,0.011985708,0.0015177624,0.029132914,0.049869303,0.00008225657,0.0015743772,0.001845268,0.90316206],"genre_scores_gemma":[0.002312509,0.0025425195,0.0004893842,0.0028879375,0.0014904588,0.000021678521,0.00026131302,0.0004499545,0.9895443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994143,0.00007045719,0.000021607459,0.00010703217,0.00030884956,0.000077867786],"domain_scores_gemma":[0.9990103,0.0001689413,0.000035034125,0.00009655425,0.00046006514,0.00022905176],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005670624,0.0011766758,0.00065584446,0.0014479038,0.0025249885,0.005735481,0.001012724,0.0027955847,0.605101],"category_scores_gemma":[0.0042748824,0.00038449766,0.00052259903,0.0009621529,0.0010177599,0.004062809,0.002612168,0.0033693882,0.40848035],"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.000016724047,0.000008319939,0.0000478805,0.000060823124,0.0000019204308,0.00006123788,0.00012614844,0.000016212562,0.000116844734,0.0036425116,0.9721326,0.023768786],"study_design_scores_gemma":[0.0000018432274,0.0000033553663,0.0000703319,0.00004546116,7.836787e-7,0.00004687027,0.00009232451,0.0000075768967,0.000073149014,0.00042572926,0.99923015,0.0000024701549],"about_ca_topic_score_codex":0.0048454874,"about_ca_topic_score_gemma":0.013124828,"teacher_disagreement_score":0.394899,"about_ca_system_score_codex":0.0017008941,"about_ca_system_score_gemma":0.0022311448,"threshold_uncertainty_score":0.56327546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035923094,0.0008125885,0.0007133651,0.0013217813,0.003138678,0.0001537752,0.0018249237,0.002173368,0.9895023],"genre_scores_gemma":[0.0011842052,0.0005768567,0.00040982346,0.0005105435,0.00043908998,0.000033824064,0.0009736667,0.00073898246,0.9951331],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876094,0.000102770115,0.00006037742,0.0001558364,0.00076403556,0.0001561433],"domain_scores_gemma":[0.9964348,0.00036452687,0.00012797584,0.00034176218,0.0018750854,0.000855862],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00084800564,0.0016706884,0.0010650017,0.0031769746,0.002262192,0.008127979,0.0016866198,0.0021925934,0.913958],"category_scores_gemma":[0.005010933,0.0006445343,0.0011710504,0.0022468185,0.00080323743,0.005106539,0.0039259866,0.0025322193,0.8652797],"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.00003400658,0.00004353139,0.000057049947,0.00019156936,0.000002109849,0.00006971278,0.000052659423,0.00003655144,0.00047699144,0.001401915,0.9358303,0.06180362],"study_design_scores_gemma":[0.00000708334,0.000019372097,0.00024164151,0.00007654889,0.0000018107401,0.00010616405,0.00007607294,0.00002957015,0.00021554215,0.00035401722,0.99886596,0.0000062641775],"about_ca_topic_score_codex":0.00206954,"about_ca_topic_score_gemma":0.0039749197,"teacher_disagreement_score":0.08604199,"about_ca_system_score_codex":0.0013211281,"about_ca_system_score_gemma":0.0014975949,"threshold_uncertainty_score":0.12272847},"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":"protocol","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036658023,0.00027696625,0.0025890446,0.00047475033,0.00020402862,0.9326915,0.054429885,0.00010820327,0.0055597704],"genre_scores_gemma":[0.0021276558,0.00020401676,0.0042627286,0.00022722651,0.00003565274,0.98909026,0.0030473338,0.000010618185,0.0009945354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9910946,0.0049357973,0.001678928,0.0006921386,0.0009404524,0.000658169],"domain_scores_gemma":[0.9624864,0.01930404,0.0031016783,0.003525152,0.009622059,0.0019606098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020070907,0.001524427,0.0026916568,0.0025997357,0.0027394055,0.0027055603,0.0030467587,0.0035004602,0.1988846],"category_scores_gemma":[0.03530647,0.002036399,0.003419056,0.0040214085,0.0016732161,0.0019192502,0.001707604,0.004215498,0.025916465],"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.067452796,0.025112,0.01876388,0.060302548,0.0008181319,0.0013077987,0.0057821637,0.01126494,0.0008506662,0.02665636,0.53877944,0.24290937],"study_design_scores_gemma":[0.121559516,0.020790374,0.04496589,0.022516131,0.0006510636,0.0005442746,0.005608423,0.0062983027,0.0018208015,0.017983764,0.7566843,0.00057722774],"about_ca_topic_score_codex":0.0073673874,"about_ca_topic_score_gemma":0.012071594,"teacher_disagreement_score":0.1988846,"about_ca_system_score_codex":0.005784216,"about_ca_system_score_gemma":0.020781655,"threshold_uncertainty_score":0.6653353},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005761457,0.000032063163,0.00039641518,0.00010603285,0.000069845366,0.00006882339,0.997543,0.00057321385,0.0006344993],"genre_scores_gemma":[0.014066255,0.00022656265,0.0065006292,0.0005313153,0.00012338738,0.0009776616,0.96809286,0.001192864,0.008288357],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943465,0.000035448047,0.00009474103,0.00013066122,0.00018677236,0.00011763341],"domain_scores_gemma":[0.9933535,0.0039350484,0.00065783534,0.0004764675,0.0012655704,0.00031164635],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00087174145,0.0012796798,0.0014291975,0.0021260474,0.00085902546,0.0011786276,0.0017068312,0.001186766,0.85270816],"category_scores_gemma":[0.009516614,0.0007165693,0.0013671233,0.0027879938,0.0003193062,0.0014048731,0.0007385018,0.0009767425,0.16035244],"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.001704046,0.000475963,0.0042858566,0.0070454045,0.00021154423,0.00030119505,0.00010989506,0.0014901466,0.004425679,0.0009110573,0.9623176,0.016721755],"study_design_scores_gemma":[0.016873876,0.0017078446,0.104119495,0.005434806,0.00087652827,0.0024655615,0.0008292268,0.016146498,0.032698024,0.014094825,0.80401367,0.0007396656],"about_ca_topic_score_codex":0.0060241297,"about_ca_topic_score_gemma":0.011453697,"teacher_disagreement_score":0.85270816,"about_ca_system_score_codex":0.0011861767,"about_ca_system_score_gemma":0.0015417887,"threshold_uncertainty_score":0.21009392},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99568236,0.0002026853,0.0007959636,0.00037291233,0.000006626309,0.00050171267,0.00010357584,0.0000041412836,0.0023299833],"genre_scores_gemma":[0.997106,0.00027814964,0.001122195,0.00013059608,0.000003962309,0.0007803746,0.000052481784,0.000005754799,0.00052054995],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99083835,0.0068897707,0.00033741965,0.00039841386,0.0006271559,0.00090883113],"domain_scores_gemma":[0.986368,0.0104519315,0.0011614481,0.00026104497,0.0012935709,0.0004639401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017486686,0.00045335852,0.00040248313,0.0015349275,0.0053873854,0.002078188,0.0013345458,0.0007508007,0.002187299],"category_scores_gemma":[0.018584758,0.00057210936,0.00027870506,0.0019321919,0.004017543,0.0018860687,0.0024598062,0.00079465774,0.00014990757],"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.000079067446,0.0001177221,0.018787662,0.00049803837,0.000014048801,0.0005566075,0.96621746,0.00006538395,0.0015699109,0.000702058,0.00020312719,0.011188981],"study_design_scores_gemma":[0.00001508507,0.0001890682,0.023934422,0.00063806016,0.000023954233,0.00016968537,0.9698322,0.00020905423,0.0008322279,0.00022751756,0.0039017457,0.00002704069],"about_ca_topic_score_codex":0.018850164,"about_ca_topic_score_gemma":0.024223614,"teacher_disagreement_score":0.018850164,"about_ca_system_score_codex":0.0049459226,"about_ca_system_score_gemma":0.0057801805,"threshold_uncertainty_score":0.09247959},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004246051,0.00032378387,0.0024064637,0.001690757,0.00044292337,0.00008494171,0.0061031426,0.0022131295,0.98248875],"genre_scores_gemma":[0.021940276,0.00045359167,0.0014586508,0.00031923232,0.0000747257,0.00003857088,0.0036923543,0.00052065385,0.971502],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997181,0.000014304894,0.000004744721,0.000033209035,0.00017425665,0.00005536394],"domain_scores_gemma":[0.99961436,0.000028950555,0.000021420521,0.000063920175,0.00018102831,0.000090322945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003760477,0.00064559723,0.00027144328,0.0017291493,0.0011324245,0.0021384484,0.0007307589,0.0012996137,0.2719174],"category_scores_gemma":[0.0014101061,0.00026639077,0.00041201146,0.0012810872,0.00044589903,0.00086855225,0.0011072193,0.00097567204,0.0846331],"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.000104710576,0.00008874137,0.00067687745,0.00006426653,0.0000064397245,0.00007205416,0.000016541302,0.00046293932,0.0010389953,0.014458269,0.8716834,0.11132679],"study_design_scores_gemma":[0.000031024763,0.000024032404,0.001775751,0.000046804907,0.0000037894858,0.00007636135,0.000043853728,0.0013528862,0.0012528517,0.0028560818,0.99252844,0.000008158208],"about_ca_topic_score_codex":0.025427118,"about_ca_topic_score_gemma":0.0391173,"teacher_disagreement_score":0.2719174,"about_ca_system_score_codex":0.0020499337,"about_ca_system_score_gemma":0.0024279326,"threshold_uncertainty_score":0.9096543},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028662335,0.017490987,0.0021827447,0.8069448,0.0018706513,0.00006865072,0.00016620947,0.00004519979,0.14256838],"genre_scores_gemma":[0.815577,0.012572123,0.002524037,0.10949983,0.0018505653,0.00010525751,0.000078075114,0.00010232659,0.05769079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97495544,0.006818779,0.0008782655,0.001766914,0.0075618927,0.008018739],"domain_scores_gemma":[0.8949058,0.05508172,0.0066859415,0.004487019,0.02222614,0.016613392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025592662,0.0005341786,0.0013750428,0.003003115,0.028888403,0.039881203,0.0041227583,0.02328963,0.018506775],"category_scores_gemma":[0.10360237,0.000690276,0.00068034424,0.0044874665,0.05620916,0.015343,0.008641057,0.023439338,0.0008543224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00011881764,0.000046239475,0.0021466778,0.00019323602,0.000038619124,0.000431983,0.013035486,0.00044516733,0.00013637912,0.8601859,0.09549418,0.027727222],"study_design_scores_gemma":[0.00017439759,0.000047337828,0.007443729,0.0015568524,0.000120527984,0.00032238106,0.046783596,0.0015390564,0.00073097815,0.43535683,0.50561756,0.00030670222],"about_ca_topic_score_codex":0.91073126,"about_ca_topic_score_gemma":0.9411674,"teacher_disagreement_score":0.09447764,"about_ca_system_score_codex":0.09447764,"about_ca_system_score_gemma":0.31343466,"threshold_uncertainty_score":0.68548644},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07782545,0.01274811,0.03486052,0.09755979,0.0011041859,0.00011026091,0.00005920207,0.000059397964,0.77567303],"genre_scores_gemma":[0.94602555,0.0034346064,0.0042127054,0.0047648987,0.00039286938,0.00013547375,0.000021320462,0.0000656749,0.040946927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667907,0.0023865208,0.0000398207,0.00017138165,0.00035718354,0.00036607226],"domain_scores_gemma":[0.9981523,0.0013851443,0.00010828227,0.00010905528,0.000093411945,0.00015179804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025879056,0.00038169467,0.00033274444,0.002201245,0.009992892,0.013286347,0.0015651807,0.0037421305,0.0037579727],"category_scores_gemma":[0.0032058994,0.0003065279,0.000311106,0.0016207118,0.036431093,0.010711777,0.0065688095,0.004690621,0.00038601924],"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.000005271259,0.000009984801,0.00011321554,0.000012708137,8.9409457e-7,0.00007560396,0.02865207,0.00005398757,0.000032754924,0.9671408,0.0016270659,0.0022755761],"study_design_scores_gemma":[0.000011298925,0.000028378416,0.00065666734,0.00030289456,0.000007408362,0.00031210275,0.088116884,0.0011530323,0.0003042718,0.5227063,0.38637942,0.000021306467],"about_ca_topic_score_codex":0.006935071,"about_ca_topic_score_gemma":0.0096971495,"teacher_disagreement_score":0.013286347,"about_ca_system_score_codex":0.006984802,"about_ca_system_score_gemma":0.0032920626,"threshold_uncertainty_score":0.05067849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96661913,0.0016307512,0.0014128031,0.018314706,0.00018909875,0.00029945673,0.00058784074,0.000008791849,0.010937398],"genre_scores_gemma":[0.9950901,0.00062660023,0.0005693918,0.0021051283,0.00002993072,0.00028393575,0.0000735792,0.000011043476,0.0012102999],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.98303235,0.013014284,0.00065185135,0.0005355347,0.0012078064,0.0015580832],"domain_scores_gemma":[0.92011696,0.067631,0.0043753316,0.0008628695,0.0040814052,0.0029324542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020817414,0.0003345244,0.0005664606,0.0020885963,0.0065133655,0.005962688,0.0013547286,0.0023953517,0.005388223],"category_scores_gemma":[0.05610936,0.0005874912,0.00040080666,0.0021248206,0.006576422,0.0059084725,0.0069831517,0.003560431,0.0003058617],"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.000101297046,0.000103135484,0.018222708,0.0005597447,0.000026575715,0.00035305685,0.9654207,0.000032670203,0.0002308424,0.0033785654,0.0012436671,0.010326964],"study_design_scores_gemma":[0.0000092368455,0.00003136772,0.0024169006,0.0002559213,0.000010753409,0.000057993057,0.99270904,0.00004737166,0.000060836974,0.00047792745,0.0039125853,0.000009997599],"about_ca_topic_score_codex":0.014021803,"about_ca_topic_score_gemma":0.020853637,"teacher_disagreement_score":0.020817414,"about_ca_system_score_codex":0.005775628,"about_ca_system_score_gemma":0.008668898,"threshold_uncertainty_score":0.11009431},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1811442,0.0054113725,0.35916325,0.0062541314,0.00778764,0.00065865845,0.002363642,0.01231614,0.42490092],"genre_scores_gemma":[0.438404,0.002270855,0.16903561,0.0012541224,0.00053462747,0.0003057281,0.001990635,0.0010354945,0.38516888],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999074,0.000084391606,0.00002307081,0.00017041333,0.000577221,0.00007082264],"domain_scores_gemma":[0.9992387,0.00014036945,0.00007749816,0.00017719013,0.0003068358,0.000059362585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809611,0.0005466176,0.0005666777,0.0006138046,0.00063256535,0.0014808304,0.0012163891,0.0013660139,0.022372784],"category_scores_gemma":[0.0014511787,0.000489721,0.0002872153,0.0004011524,0.00044193043,0.0014833516,0.0008355448,0.0008596759,0.015848566],"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.00025316674,0.0002095382,0.0007723348,0.00039177027,0.000038129183,0.00016893515,0.00010955405,0.0018307623,0.7769488,0.0218866,0.049281485,0.14810896],"study_design_scores_gemma":[0.00007063138,0.00018531992,0.0013844966,0.000035854748,0.000034977573,0.00022780354,0.000058937952,0.041088328,0.8129492,0.007732519,0.13617247,0.00005942412],"about_ca_topic_score_codex":0.00039539835,"about_ca_topic_score_gemma":0.0012988972,"teacher_disagreement_score":0.022372784,"about_ca_system_score_codex":0.0006143226,"about_ca_system_score_gemma":0.0006274658,"threshold_uncertainty_score":0.07484442},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13673,0.016166812,0.0042083715,0.046592884,0.0012797272,0.00013905695,0.0005488518,0.00012473177,0.79420954],"genre_scores_gemma":[0.9389655,0.0029310337,0.0013720202,0.010910403,0.0005882121,0.00011037642,0.00018031667,0.000058338388,0.044883866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9805444,0.007934422,0.0017516837,0.0014519108,0.0051143123,0.0032032747],"domain_scores_gemma":[0.9635349,0.017288165,0.0055406494,0.0031360248,0.008137302,0.0023630052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007104258,0.00023018387,0.0003893347,0.0031764703,0.0078019085,0.014976271,0.0017449994,0.005031908,0.013004214],"category_scores_gemma":[0.060097396,0.0004203798,0.00024787747,0.0033268805,0.01260453,0.0067985426,0.0056892806,0.0032451893,0.003484949],"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.00016974584,0.00004008728,0.0065301675,0.0003014657,0.000008992228,0.0019636927,0.03114519,0.00006939183,0.0006929874,0.8587482,0.034937363,0.06539273],"study_design_scores_gemma":[0.00005395709,0.00014224263,0.0128882,0.0031564995,0.000030496663,0.0047214525,0.028712437,0.00031034873,0.0017476447,0.13647713,0.8116097,0.00014999391],"about_ca_topic_score_codex":0.009539771,"about_ca_topic_score_gemma":0.005760804,"teacher_disagreement_score":0.014976271,"about_ca_system_score_codex":0.005573278,"about_ca_system_score_gemma":0.008121063,"threshold_uncertainty_score":0.043503404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016008474,0.0004867901,0.9792054,0.00009424885,0.000031011048,0.00007725309,0.000055166984,0.000222359,0.0038192344],"genre_scores_gemma":[0.7417555,0.0009024106,0.248695,0.00009227984,0.0000886036,0.00037889293,0.00024253009,0.00008177647,0.007762895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995677,0.000104812534,0.00003852077,0.0000839378,0.00015835294,0.000046750687],"domain_scores_gemma":[0.9991959,0.00032225865,0.00013120232,0.000041780775,0.0002868399,0.000022154778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011859784,0.00076321955,0.0003279105,0.00064030266,0.0003985792,0.00090737117,0.0007366321,0.0006088925,0.0055751596],"category_scores_gemma":[0.0014693947,0.00031644868,0.0006493095,0.00034773842,0.00036532714,0.0005269578,0.0006481295,0.00059804,0.00054584915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103431645,0.000105739644,0.0010893914,0.0004531296,0.000053220927,0.00013138758,0.00021476566,0.80912215,0.015358511,0.016966822,0.00070446625,0.15569691],"study_design_scores_gemma":[0.000016172124,0.000100164645,0.00026710803,0.000029873498,0.000011083214,0.000026914508,0.00003872386,0.99141896,0.0025655972,0.0029805372,0.002538958,0.000005962973],"about_ca_topic_score_codex":0.0058680335,"about_ca_topic_score_gemma":0.0049421433,"teacher_disagreement_score":0.0058680335,"about_ca_system_score_codex":0.000819954,"about_ca_system_score_gemma":0.0009738916,"threshold_uncertainty_score":0.01865071},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067391996,0.080575086,0.0041735675,0.2713844,0.046604972,0.00050771923,0.04565835,0.0009761135,0.54338056],"genre_scores_gemma":[0.011080429,0.012595185,0.0011663983,0.0026294,0.002562022,0.00005245519,0.0035514936,0.0003688061,0.9659939],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820614,0.00011102558,0.000037412236,0.00021734604,0.0011808411,0.0002473306],"domain_scores_gemma":[0.99580365,0.00017973503,0.0001899532,0.00013743961,0.002852153,0.00083713036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529572,0.0014988832,0.0004432829,0.0027192845,0.0037555208,0.0031319046,0.0016579515,0.0011849536,0.113788374],"category_scores_gemma":[0.0036434068,0.0006041008,0.0003841575,0.0038244505,0.0017087782,0.001356201,0.0019482883,0.0019398492,0.022652922],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017013339,0.0000059074346,0.00056304835,0.000032953925,0.0000030516678,0.000028407845,0.00007519391,0.00008632377,0.00012568926,0.0007416526,0.98269284,0.015627975],"study_design_scores_gemma":[0.0000020954546,0.000003908081,0.0020745916,0.00002201977,0.0000020359685,0.000010132403,0.00014440814,0.000039992956,0.00016263225,0.00010434553,0.9974256,0.000008066354],"about_ca_topic_score_codex":0.75432855,"about_ca_topic_score_gemma":0.89942056,"teacher_disagreement_score":0.24567145,"about_ca_system_score_codex":0.011534803,"about_ca_system_score_gemma":0.025005382,"threshold_uncertainty_score":0.49423647},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080091506,0.3714467,0.0022124655,0.41185728,0.0016823721,0.0001783403,0.013003745,0.00014043211,0.11938711],"genre_scores_gemma":[0.45591605,0.48893997,0.0047530485,0.024810025,0.00084775174,0.00017384652,0.0054918234,0.00010911164,0.018958438],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9891774,0.001118113,0.00039942423,0.0005988276,0.0060951468,0.002611108],"domain_scores_gemma":[0.957381,0.00981643,0.0018329021,0.00080863794,0.026069092,0.0040919697],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008239015,0.0004951462,0.0012247517,0.0066141207,0.0106427055,0.014824738,0.0018890693,0.0015115157,0.0068064034],"category_scores_gemma":[0.021134438,0.0005468394,0.0007456558,0.019173367,0.0058271238,0.005393692,0.0025124275,0.003429806,0.0008338006],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00016113753,0.00013756889,0.14484604,0.0055453456,0.00026955543,0.0003459395,0.029071957,0.0018795216,0.00056585093,0.047352966,0.22881725,0.54100686],"study_design_scores_gemma":[0.000022645516,0.000060862192,0.31190658,0.01103667,0.00025680257,0.0001760238,0.09666045,0.0010942211,0.0007453703,0.010772568,0.56703526,0.00023255346],"about_ca_topic_score_codex":0.99605966,"about_ca_topic_score_gemma":0.99840707,"teacher_disagreement_score":0.99176097,"about_ca_system_score_codex":0.13978286,"about_ca_system_score_gemma":0.32900742,"threshold_uncertainty_score":0.99772996},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14763798,0.024084197,0.005545679,0.20961535,0.0009199817,0.000048249676,0.00027909156,0.00005871915,0.6118108],"genre_scores_gemma":[0.9630894,0.0074326545,0.0011530077,0.007242901,0.00008535867,0.000014906085,0.000045165347,0.000028673163,0.020907992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960219,0.00064051844,0.00007376408,0.00024481752,0.0009781313,0.002040874],"domain_scores_gemma":[0.9974446,0.00083744136,0.00015955405,0.00009430088,0.0009388801,0.00052522623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002564026,0.00028138678,0.00040173717,0.0015888278,0.023986079,0.007631921,0.0014295963,0.0021092673,0.00482116],"category_scores_gemma":[0.0048255753,0.00023643252,0.0005024912,0.003208904,0.012545552,0.0030392262,0.0035572574,0.0038364942,0.00013096508],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016919468,0.0000070750257,0.0019192137,0.000043859447,0.0000085823285,0.00016743105,0.009424255,0.000707282,0.00005855066,0.9694743,0.009061147,0.009111407],"study_design_scores_gemma":[0.000033581317,0.00002633639,0.018654611,0.0005660393,0.00006551693,0.00021288183,0.069239706,0.0033717202,0.0004550568,0.2084377,0.69878906,0.00014774835],"about_ca_topic_score_codex":0.99502254,"about_ca_topic_score_gemma":0.9968759,"teacher_disagreement_score":0.16271885,"about_ca_system_score_codex":0.16271885,"about_ca_system_score_gemma":0.15052305,"threshold_uncertainty_score":0.97112745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027919693,0.00031030667,0.741699,0.00015287448,0.00014999298,0.00041479943,0.0015351746,0.20584413,0.021974063],"genre_scores_gemma":[0.44910997,0.0006539641,0.48600537,0.00047017192,0.00007598831,0.00075211073,0.006798984,0.02031426,0.035819236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992901,0.000081313934,0.000051648538,0.00008568223,0.00040036355,0.00009076417],"domain_scores_gemma":[0.99898416,0.00036889777,0.00008694566,0.00024289933,0.00025267317,0.000064443055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008530274,0.001316897,0.0006518538,0.0011562146,0.00040107727,0.0009725244,0.0020574254,0.00043377848,0.025814153],"category_scores_gemma":[0.002832115,0.00058443175,0.0004425339,0.00080969685,0.00034230863,0.0014412063,0.0012652659,0.0011831733,0.0050123935],"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.0023792319,0.0005156399,0.008235535,0.00078471453,0.00019583834,0.0007831136,0.00042240872,0.09730453,0.05525607,0.023844397,0.12879533,0.6814833],"study_design_scores_gemma":[0.00041939356,0.0003196807,0.0030269735,0.00010117406,0.00014022294,0.0005645189,0.00011261816,0.74090314,0.11045712,0.011571842,0.13228099,0.000102289756],"about_ca_topic_score_codex":0.0026487103,"about_ca_topic_score_gemma":0.0029462927,"teacher_disagreement_score":0.025814153,"about_ca_system_score_codex":0.0005803688,"about_ca_system_score_gemma":0.0010285813,"threshold_uncertainty_score":0.08635694},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9490698,0.00032656585,0.016681792,0.0003185487,0.000015311467,0.00027995554,0.019780824,0.0002900516,0.01323709],"genre_scores_gemma":[0.97096676,0.00046693414,0.00934148,0.00010548672,0.000035583387,0.00035130096,0.016430778,0.000053116466,0.0022486337],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99727887,0.000921818,0.00022725172,0.00038843552,0.0009485073,0.00023510316],"domain_scores_gemma":[0.98302853,0.0051497445,0.0047736987,0.0020849914,0.0041405493,0.0008224993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026278645,0.00027669896,0.0003358084,0.006583613,0.00033371625,0.0013365034,0.000653425,0.00042360098,0.0017086864],"category_scores_gemma":[0.016862858,0.00026299048,0.00020211363,0.0062561324,0.00037542733,0.0020368525,0.0013598223,0.00046075304,0.0009975106],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008290788,0.00015318545,0.9404798,0.00013691679,0.00007962891,0.0001374819,0.0019957793,0.0046251942,0.0007564562,0.0036458045,0.00770615,0.040200673],"study_design_scores_gemma":[0.000020908808,0.00019612629,0.90948033,0.000107315536,0.00004480682,0.00043059117,0.006332692,0.04787062,0.0015816956,0.0032048007,0.030665496,0.00006455955],"about_ca_topic_score_codex":0.017217278,"about_ca_topic_score_gemma":0.013199536,"teacher_disagreement_score":0.017217278,"about_ca_system_score_codex":0.0008504125,"about_ca_system_score_gemma":0.00068153214,"threshold_uncertainty_score":0.034234107},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11439061,0.0010799142,0.4228914,0.0013390211,0.00078856974,0.00023023956,0.0075899544,0.42966512,0.022025073],"genre_scores_gemma":[0.59778804,0.0003685338,0.35476875,0.0010229239,0.00006313549,0.00044404002,0.015826449,0.017098801,0.012619256],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956304,0.0000788913,0.000027391574,0.00012151106,0.00012361143,0.00008554273],"domain_scores_gemma":[0.99943596,0.00018000534,0.00002781114,0.00017630385,0.00013698278,0.000042935782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070709124,0.0013632437,0.00053461106,0.0004974294,0.00045038384,0.00094764616,0.0021860714,0.0009270007,0.015783472],"category_scores_gemma":[0.0042703324,0.0005604487,0.0006485058,0.00050933973,0.0004998256,0.0017011096,0.001317577,0.0016839997,0.006391382],"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.0024825204,0.0005971852,0.008456277,0.00096377963,0.00032207556,0.00062989164,0.00042623267,0.2766861,0.0306171,0.016963275,0.23031297,0.43154252],"study_design_scores_gemma":[0.00014375009,0.000109262255,0.0009049253,0.000035833385,0.000025211308,0.000067861045,0.00009505942,0.9543076,0.018845204,0.006659307,0.018774532,0.0000314714],"about_ca_topic_score_codex":0.012976364,"about_ca_topic_score_gemma":0.019967401,"teacher_disagreement_score":0.015783472,"about_ca_system_score_codex":0.0010335462,"about_ca_system_score_gemma":0.0016826872,"threshold_uncertainty_score":0.052800953},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9147286,0.0021478517,0.06411467,0.00012289088,0.000154074,0.00011913617,0.0002935246,0.0013480328,0.016971225],"genre_scores_gemma":[0.9413331,0.00045507407,0.054963734,0.00005810938,0.000018491928,0.000036619535,0.00021653,0.00007085159,0.0028474822],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996549,0.00008832225,0.00004494188,0.000044982487,0.000112225076,0.000054635173],"domain_scores_gemma":[0.9990194,0.00027954584,0.00015121137,0.00017233622,0.00034697136,0.000030599167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014483,0.00052901485,0.00019642616,0.0009407462,0.00022795287,0.0006389186,0.0008734667,0.00015956404,0.0033679295],"category_scores_gemma":[0.0015794496,0.00014494653,0.00023708896,0.0006058938,0.00015251712,0.00089138874,0.00028963212,0.00021811828,0.0003241783],"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.0020129173,0.00035990687,0.007433359,0.001601197,0.0004002607,0.00047701973,0.0002403945,0.11617388,0.3512378,0.01848483,0.0036007303,0.49797773],"study_design_scores_gemma":[0.00013253535,0.0050726333,0.01063834,0.0001813521,0.00067722984,0.0017048229,0.00038102004,0.3374414,0.6113398,0.0058013825,0.02653068,0.00009870649],"about_ca_topic_score_codex":0.0005321382,"about_ca_topic_score_gemma":0.0014054585,"teacher_disagreement_score":0.0033679295,"about_ca_system_score_codex":0.00039217147,"about_ca_system_score_gemma":0.00042866607,"threshold_uncertainty_score":0.011266828},"labels":[],"label_agreement":null}]}