{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":186,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":186,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"3ba57be992fa","filters":{"topic":"Network Packet Processing and Optimization"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03292805169399435,"gpt":0.2521090837053269,"spread":0.2191810320113325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130117,0.0002309162,0.0004303699,0.0002365735,0.0002213917,0.0004160151,0.0004239578,0.00009551971,0.000002586236],"category_scores_gemma":[0.0001220572,0.0002025872,0.00006259596,0.0003456539,0.0001395916,0.0005598946,0.00005691613,0.0003353748,0.000002156763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004679466,"about_ca_system_score_gemma":0.0001965471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009691012,"about_ca_topic_score_gemma":0.00009660757,"domain_scores_codex":[0.9979017,0.0002484448,0.0006462261,0.000326199,0.0004647769,0.0004126852],"domain_scores_gemma":[0.9981786,0.0002965643,0.0005791622,0.0002216157,0.0005077933,0.0002162699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000352256,0.001049375,0.0555507,0.0007850027,0.0006700999,0.001080276,0.01488478,0.2270927,0.05449875,0.001143794,0.02896205,0.6139303],"study_design_scores_gemma":[0.04559523,0.004933647,0.5104418,0.004719443,0.0006452379,0.01551929,0.0007454111,0.2034686,0.09128629,0.1082138,0.00695301,0.00747827],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.785534,0.002366702,0.2091272,0.0001425675,0.002128842,0.000149949,0.00002011725,0.00005585259,0.0004748533],"genre_scores_gemma":[0.9976451,0.000237493,0.0007567733,0.0001436085,0.0008337768,0.000001811079,0.000002512486,0.00002206814,0.000356838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.606452,"threshold_uncertainty_score":0.8261264,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04643447313465448,"gpt":0.315681861229468,"spread":0.2692473880948135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003565765,0.00009537789,0.0002077646,0.000577462,0.0002450618,0.0001470313,0.0008977514,0.00006268724,0.000003463913],"category_scores_gemma":[0.0001195056,0.0000897592,0.00004719761,0.003211049,0.00008862789,0.0003323082,0.00006379578,0.0003146007,0.000001500242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000980562,"about_ca_system_score_gemma":0.00009664573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001523346,"about_ca_topic_score_gemma":0.0001398618,"domain_scores_codex":[0.9988699,0.0002295665,0.0004317729,0.0001355419,0.0001797933,0.0001534351],"domain_scores_gemma":[0.9980902,0.0003353914,0.0003460809,0.0007508724,0.0004037143,0.00007375997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001452717,0.003534874,0.2006586,0.00003934771,0.002166611,0.000005299756,0.0294038,0.3489439,0.007748872,0.08236247,0.006638378,0.3183526],"study_design_scores_gemma":[0.0002352783,0.00003330283,0.1449309,0.00004619229,0.00008034092,0.00001343158,0.00003135321,0.8515363,0.0002049205,0.0002076432,0.002579077,0.0001012754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.50228,0.002258298,0.474301,0.01855514,0.0001264516,0.0002270222,0.0000382828,0.0001797459,0.002034115],"genre_scores_gemma":[0.9795052,0.002089257,0.01813752,0.0001579305,0.00002792314,0.000005887614,0.00004433542,0.000005028288,0.00002685058],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5025923,"threshold_uncertainty_score":0.3660274,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04117684806867808,"gpt":0.2821037555095107,"spread":0.2409269074408326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561917,0.0001873369,0.0003627033,0.0002740931,0.0001241257,0.0001982956,0.000357126,0.00009670531,0.000003140353],"category_scores_gemma":[0.0001599608,0.0001753887,0.0000907451,0.0004197697,0.00004068083,0.0009146801,0.00001762679,0.0002456924,0.000002701868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001479581,"about_ca_system_score_gemma":0.0002778852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005198167,"about_ca_topic_score_gemma":0.00001597273,"domain_scores_codex":[0.998089,0.00013087,0.0007851841,0.000246112,0.0003658331,0.0003829587],"domain_scores_gemma":[0.9980384,0.0001253028,0.0006534767,0.0002365466,0.0008264733,0.000119784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001996443,0.0009265181,0.0008401469,0.0005640606,0.0002587164,0.0005316039,0.01459668,0.5051273,0.4247602,0.004351969,0.004278316,0.04356484],"study_design_scores_gemma":[0.003438923,0.0005382466,0.0001351152,0.001172047,0.00004491529,0.001341847,0.0006263761,0.04154316,0.9170645,0.03234753,0.001047784,0.0006995329],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02736407,0.0003132903,0.9703587,0.0003452466,0.0009616623,0.0003201398,0.000003733658,0.00003675767,0.0002964402],"genre_scores_gemma":[0.9609286,0.0001188672,0.03822379,0.000231348,0.00009128077,0.000008419943,0.000001365975,0.00002568128,0.0003706607],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9335645,"threshold_uncertainty_score":0.7152145,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0563906129532896,"gpt":0.295128966455155,"spread":0.2387383535018654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127599,0.0002507238,0.0004582563,0.0003435308,0.0002780284,0.0003433103,0.0009625875,0.0001200941,0.0000153307],"category_scores_gemma":[0.00009687094,0.000224925,0.0001790237,0.0007155436,0.0001494139,0.001370199,0.0000920617,0.000697834,0.00002531281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002423364,"about_ca_system_score_gemma":0.000895326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118523,"about_ca_topic_score_gemma":0.000003117286,"domain_scores_codex":[0.9971108,0.0001422964,0.0008574357,0.0003489121,0.0008803005,0.0006602328],"domain_scores_gemma":[0.9976364,0.00008938614,0.0004955059,0.0003695232,0.001014709,0.0003945219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001061445,0.0006386121,0.0002898316,0.0001353183,0.0001718284,0.0006908022,0.005087485,0.8587514,0.1131186,0.0005609741,0.0007300847,0.01971884],"study_design_scores_gemma":[0.01724393,0.001510539,0.0008128164,0.004044978,0.0001249369,0.004332257,0.0006591176,0.5589268,0.3919871,0.01778809,0.0004766077,0.002092744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3777918,0.0002927451,0.6202916,0.0003521951,0.0008876804,0.00009511681,0.000003235118,0.00004780413,0.0002378792],"genre_scores_gemma":[0.9715036,0.0001249847,0.02716067,0.000488748,0.0004362474,0.000001363737,0.000001113037,0.000035248,0.0002480116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5937119,"threshold_uncertainty_score":0.9172173,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0177715680750364,"gpt":0.2503210929208687,"spread":0.2325495248458323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000239625,0.0001831461,0.0002518602,0.00004982072,0.0005127797,0.0004697662,0.0002251635,0.0001319173,0.000005754503],"category_scores_gemma":[0.000006769651,0.0001228862,0.00006088077,0.0002869201,0.00005461529,0.000282492,0.000003417719,0.0001863153,0.00001173018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002757644,"about_ca_system_score_gemma":0.00004298639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003423568,"about_ca_topic_score_gemma":0.000007988298,"domain_scores_codex":[0.9988973,0.00008088593,0.0002397794,0.0003794655,0.0001569131,0.0002456507],"domain_scores_gemma":[0.9987666,0.0006054364,0.0001095858,0.0003182372,0.0001065521,0.00009358508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002984038,0.0001272664,0.0001004773,0.0001470742,0.0001744592,0.000002878066,0.00145654,0.9643937,0.00006198652,0.02251557,0.001099184,0.009622464],"study_design_scores_gemma":[0.001515792,0.0001417567,0.00008149511,0.0001098284,0.00004294265,0.00002462551,0.0003522582,0.9936381,0.00007834192,0.001102687,0.002672317,0.0002398671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002877724,0.0007705959,0.9937147,0.0006683874,0.0008796789,0.0008298762,0.00007707865,0.0001124348,0.00006951953],"genre_scores_gemma":[0.9917579,0.0001759427,0.007098081,0.00009871229,0.0000596769,0.0002308465,0.00001084424,0.00001074786,0.0005572694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9888802,"threshold_uncertainty_score":0.5011153,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02282131499874519,"gpt":0.2563555305894215,"spread":0.2335342155906763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900347,0.0001409066,0.0001389308,0.00007295272,0.0002209495,0.0003256789,0.0004154767,0.00006225219,0.00000447053],"category_scores_gemma":[0.0000238363,0.0001282101,0.00006637377,0.0002929349,0.00001436216,0.0006981557,0.000055836,0.0000758047,0.00002023923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003843045,"about_ca_system_score_gemma":0.00003163569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001922914,"about_ca_topic_score_gemma":0.000002032416,"domain_scores_codex":[0.9989501,0.00002144546,0.0001878136,0.0003517686,0.0001456176,0.0003433079],"domain_scores_gemma":[0.9993954,0.00007946428,0.00008279933,0.0002698382,0.00008626287,0.0000862132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005849309,0.0001293634,0.0003975194,0.00002994777,0.00003953373,0.0000157309,0.003617663,0.02924885,0.001516986,0.03521034,0.0123028,0.9174328],"study_design_scores_gemma":[0.0005278218,0.000314488,0.0008013552,0.00009979207,0.000006834427,0.000004611597,0.00003460251,0.9872807,0.002840033,0.006332923,0.001389795,0.0003669893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01115635,0.00006343675,0.9795932,0.0004350321,0.0002040388,0.0001778171,0.000001433804,0.0003343883,0.008034279],"genre_scores_gemma":[0.7220516,0.00001185497,0.2763641,0.0007144488,0.0001182432,0.00001075147,0.000005949204,0.000007685853,0.0007154461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9580319,"threshold_uncertainty_score":0.5228258,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0350303170777592,"gpt":0.2680286524852757,"spread":0.2329983354075165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000300403,0.0001633244,0.0002067642,0.00007653001,0.0002614995,0.0003909772,0.0003498673,0.00008029988,0.00001378955],"category_scores_gemma":[0.0000953735,0.0001268219,0.00004757494,0.0002718162,0.0001378757,0.000568521,0.0001525139,0.0001013783,0.000008847485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000139624,"about_ca_system_score_gemma":0.0001103577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002165789,"about_ca_topic_score_gemma":0.00002522374,"domain_scores_codex":[0.9987327,0.00002571233,0.0002600814,0.000408733,0.0002150372,0.0003576807],"domain_scores_gemma":[0.9991117,0.0001247287,0.00005133236,0.0002735303,0.0003050365,0.0001337032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005876665,0.0009888195,0.002491502,0.0007880272,0.0001649183,0.00004669093,0.006852412,0.1145333,0.006065461,0.7697095,0.01573397,0.08203775],"study_design_scores_gemma":[0.007266043,0.0006972789,0.0006954773,0.0004167898,0.00003685066,0.00007967015,0.0005730262,0.8488568,0.05629541,0.07706988,0.006772301,0.001240431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03363255,0.0002949293,0.9581743,0.005968043,0.0003423841,0.0002465207,0.000003554205,0.0002810755,0.001056565],"genre_scores_gemma":[0.5460565,0.00009667669,0.4470847,0.001051896,0.0003058803,0.00003622859,0.00001640147,0.00002287388,0.00532882],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7343236,"threshold_uncertainty_score":0.5171649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05058230669773604,"gpt":0.2585575767007333,"spread":0.2079752700029972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000928569,0.0005378718,0.0007978237,0.0002822712,0.0007316062,0.0003926174,0.001265746,0.0001582148,0.00004900282],"category_scores_gemma":[0.00006309601,0.0003775863,0.0002203976,0.001281594,0.0002229325,0.00137796,0.00006484115,0.0009733764,0.000007575262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003964358,"about_ca_system_score_gemma":0.0006460718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004418531,"about_ca_topic_score_gemma":0.0001777456,"domain_scores_codex":[0.9959516,0.0004532583,0.0009711677,0.0005498005,0.001195644,0.0008785455],"domain_scores_gemma":[0.9950985,0.000278786,0.001893872,0.0005399032,0.001830431,0.0003584917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005530706,0.0004779677,0.002862179,0.0002470299,0.0008260789,0.001139314,0.03309156,0.8989967,0.02854071,0.00003144161,0.01300007,0.02023395],"study_design_scores_gemma":[0.03345911,0.00297224,0.00843575,0.004742276,0.00208975,0.007480572,0.01895683,0.7896094,0.1111178,0.001581599,0.01334198,0.006212718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6180515,0.001111227,0.3775608,0.0006975991,0.001367122,0.0004240177,0.00006271764,0.0001027232,0.0006223327],"genre_scores_gemma":[0.9924583,0.0001325648,0.003796987,0.000696064,0.0007049985,0.000005403585,0.000008517342,0.00007099623,0.002126155],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3744069,"threshold_uncertainty_score":0.9998676,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01075002695221107,"gpt":0.2420842488587336,"spread":0.2313342219065225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014712,0.0001294675,0.0001365207,0.0001091796,0.0000889262,0.0002663558,0.0005887031,0.00007808357,0.000005179337],"category_scores_gemma":[0.000004120104,0.0001304672,0.0000364167,0.0005704985,0.00002254397,0.0005549409,0.0002103562,0.0001944214,0.00003308461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008576296,"about_ca_system_score_gemma":0.00002565627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003182007,"about_ca_topic_score_gemma":0.00001793672,"domain_scores_codex":[0.9988093,0.00007978215,0.0002897762,0.0003691606,0.0001247898,0.0003271266],"domain_scores_gemma":[0.9993694,0.00006414719,0.00009671137,0.0003639671,0.00004265535,0.00006313441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002436566,0.00004229623,0.001725647,0.000002851839,0.000003254618,0.000002674734,0.0006585479,0.5381748,0.000002240552,0.006413427,0.001721502,0.4512503],"study_design_scores_gemma":[0.0002508988,0.00001704979,0.001733051,0.00007566938,0.000001796941,0.000008521671,0.000003034114,0.9948334,0.0000127343,0.0004828364,0.002433633,0.0001473787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006970702,0.0001708141,0.9905545,0.0007369278,0.0005847127,0.00008974197,5.768522e-8,0.000237755,0.0006548235],"genre_scores_gemma":[0.7046283,0.00001393244,0.294072,0.0004723449,0.0007051919,0.000006356389,0.000004396367,0.000008469197,0.00008895155],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6976576,"threshold_uncertainty_score":0.5320297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.045177678743253,"gpt":0.2589935259185676,"spread":0.2138158471753145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004128292,0.0001978898,0.0002204149,0.0001990407,0.000338357,0.000128349,0.000669867,0.0001283669,0.00001611805],"category_scores_gemma":[0.000007891746,0.0002068352,0.0001044381,0.0007436739,0.00007799522,0.0003968192,0.000006766548,0.0002835068,0.00002521122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001063711,"about_ca_system_score_gemma":0.00007592025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009310926,"about_ca_topic_score_gemma":0.00005922185,"domain_scores_codex":[0.9983973,0.0001044774,0.0004443196,0.0004363054,0.0002690053,0.0003485738],"domain_scores_gemma":[0.9985022,0.0002440182,0.0002527526,0.0007731274,0.0001341121,0.00009382322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001609089,0.0001149076,0.0000673243,0.00002085604,0.00002667609,0.000001318498,0.0006875741,0.3022881,0.0005179015,0.0002852183,0.0001755066,0.6957985],"study_design_scores_gemma":[0.0005965857,0.00008139162,0.0002591377,0.0003027548,0.00004700911,0.00002022971,0.00008251593,0.9815037,0.01021142,0.0007847192,0.005722235,0.0003883175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01147824,0.0002988205,0.9845263,0.0007175845,0.00113556,0.0001593532,0.000001802775,0.0002798817,0.001402484],"genre_scores_gemma":[0.8776274,0.000230235,0.1211954,0.000241165,0.0003940946,0.00002357958,0.000003658795,0.00002159995,0.0002628002],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8661492,"threshold_uncertainty_score":0.8434494,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1237896382441681,"gpt":0.293034362105582,"spread":0.1692447238614139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124899,0.000231677,0.0005418408,0.0002580183,0.000259215,0.0001710036,0.000502578,0.00009108361,0.000006733358],"category_scores_gemma":[0.0001011084,0.00021616,0.0001104564,0.0007605496,0.0001457844,0.00160429,0.00006159396,0.0004204291,0.000004951543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002305983,"about_ca_system_score_gemma":0.0004250838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004291081,"about_ca_topic_score_gemma":0.00003477198,"domain_scores_codex":[0.99739,0.0001907919,0.001024334,0.000305852,0.0005750227,0.0005139683],"domain_scores_gemma":[0.9977686,0.0001336312,0.0007565577,0.0003351148,0.0008203333,0.0001857207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001442167,0.0006229538,0.02173071,0.000355719,0.0001569737,0.001998353,0.02426657,0.8394193,0.0757651,0.00009511641,0.000970365,0.03447462],"study_design_scores_gemma":[0.004045132,0.0003700662,0.004229736,0.001452802,0.00005965402,0.005200195,0.001017332,0.7764726,0.198368,0.007502092,0.000190261,0.001092108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6029088,0.0002969739,0.3956042,0.000139581,0.0008420321,0.00007587141,0.000003175815,0.00003355475,0.00009580109],"genre_scores_gemma":[0.9830264,0.000276087,0.01614616,0.0001640786,0.0002655525,4.167053e-7,8.972886e-7,0.00002377777,0.00009664611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3801176,"threshold_uncertainty_score":0.8814747,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01855899503513599,"gpt":0.2726223379729414,"spread":0.2540633429378055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002925624,0.0000706115,0.0001336389,0.0001807734,0.00007461843,0.00008185296,0.0002878633,0.0000477527,0.00001973529],"category_scores_gemma":[0.0001125312,0.00005806393,0.00004850829,0.0003381342,0.0000178228,0.008465233,0.00004299272,0.0001322394,0.00001025149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007709806,"about_ca_system_score_gemma":0.0001850241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002490706,"about_ca_topic_score_gemma":3.449991e-7,"domain_scores_codex":[0.9983882,0.00007175236,0.0005768426,0.00003335317,0.0007863175,0.0001435583],"domain_scores_gemma":[0.9973523,0.00002297135,0.0009626887,0.0001412672,0.001439306,0.000081481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005971404,0.000183943,0.01195453,0.0002138435,0.00007472643,3.603676e-7,0.03793069,0.05690753,0.00002963036,0.004343215,0.005796659,0.8825052],"study_design_scores_gemma":[0.0008021349,0.00009251732,0.01104263,0.0001127594,0.00003377211,0.00007041703,0.000177077,0.9806046,0.002682531,0.0005400809,0.003723485,0.0001179991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.410134,0.0005959509,0.5835242,0.0002449826,0.001271133,0.0001376569,0.000003832939,0.00002832085,0.004059969],"genre_scores_gemma":[0.9815366,0.0000858864,0.01814576,0.00008380699,0.0001348766,0.000001392208,0.000005723331,0.000001899269,0.000004022379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9236971,"threshold_uncertainty_score":0.613709,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01745739873635292,"gpt":0.2977305604430058,"spread":0.2802731617066529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009664108,0.0002326921,0.0002139833,0.000389004,0.0004733528,0.0009677213,0.0002299265,0.000207494,0.000006495926],"category_scores_gemma":[0.0001565108,0.0002490526,0.00003539412,0.000994538,0.0000553549,0.00157836,0.00008055924,0.0001375676,0.00001421663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001430281,"about_ca_system_score_gemma":0.0004443826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001032387,"about_ca_topic_score_gemma":0.0003381103,"domain_scores_codex":[0.9978559,0.000130945,0.0006581931,0.0005222487,0.0004498627,0.0003828618],"domain_scores_gemma":[0.9983959,0.00008969245,0.000441761,0.0003521366,0.0005238572,0.0001966729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002856674,0.0001017916,0.003682166,0.00008615867,0.00001655098,0.000007403489,0.006416497,0.0002453009,0.0003062614,0.9859032,0.000202744,0.003003359],"study_design_scores_gemma":[0.0008376544,0.0002115348,0.008497193,0.0001347848,0.00001152205,0.0001280356,0.0006636417,0.9720592,0.0008393344,0.003635336,0.01246568,0.0005160893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09526499,0.0001025491,0.8951112,0.000389393,0.0004109982,0.0003547832,0.000008941627,0.0006380571,0.007719059],"genre_scores_gemma":[0.997463,0.00006037014,0.001437632,0.0001428741,0.0004376497,0.0000128603,0.00008048634,0.0000171203,0.0003480318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9822679,"threshold_uncertainty_score":0.9999962,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006713487888598387,"gpt":0.219518846482702,"spread":0.2128053585941036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005949382,0.00002631557,0.00002390285,0.00001794219,0.00004053921,0.00007173282,0.0001883725,0.0000130932,0.00003123326],"category_scores_gemma":[0.00000303839,0.00002154265,0.000008877829,0.00013866,0.0000049753,0.0002790554,0.00003019705,0.00002196141,0.0001628293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006948468,"about_ca_system_score_gemma":0.00001290281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.452922e-7,"about_ca_topic_score_gemma":0.000001569515,"domain_scores_codex":[0.9997216,0.000005886767,0.0000439609,0.00008893225,0.00006120108,0.00007839588],"domain_scores_gemma":[0.9998105,0.000008407534,0.000009935615,0.0001265736,0.00002013265,0.00002449307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.407361e-7,0.0000246585,0.0001582549,0.000001592186,0.000001925882,6.581731e-7,0.0001894646,0.01125236,0.00004244861,0.1162574,0.01660686,0.855464],"study_design_scores_gemma":[0.00007104864,0.000007457042,0.00007427595,0.000002471442,4.855714e-7,0.000003673993,0.000001515951,0.9375427,0.001282071,0.001108375,0.05984759,0.00005827315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006138927,0.00006275644,0.9169309,0.001753701,0.00005837383,0.00001104935,1.002728e-8,0.0001938892,0.08037542],"genre_scores_gemma":[0.4737881,0.000008196248,0.5194693,0.0007226449,0.0001309269,0.000001115531,2.443944e-7,0.000001753608,0.005877622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9262904,"threshold_uncertainty_score":0.2092896,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01060999771491705,"gpt":0.1984280385890178,"spread":0.1878180408741008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001085329,0.0001507634,0.0001472745,0.00008856172,0.0002429795,0.0001410912,0.0003432403,0.00004484543,0.00006323449],"category_scores_gemma":[0.000006940732,0.0001146661,0.00002810023,0.0004690787,0.0000550343,0.0004175787,0.00004755634,0.0001099645,0.00003758446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002427513,"about_ca_system_score_gemma":0.0001234631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004577167,"about_ca_topic_score_gemma":0.000009492899,"domain_scores_codex":[0.9989592,0.00003754416,0.0001536602,0.0003311585,0.0002230951,0.0002953321],"domain_scores_gemma":[0.9993387,0.00005633358,0.00006358024,0.0003405435,0.0001002259,0.0001005517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007291242,0.0004200182,0.01002581,0.00009340301,0.00009276767,0.000340451,0.00295745,0.91962,0.0005279886,0.0004936282,0.01393467,0.05142091],"study_design_scores_gemma":[0.0009197257,0.00008895819,0.0004006482,0.0000770769,0.000007866454,0.0000798222,0.00001784865,0.9910949,0.006448383,0.00005398169,0.0005273769,0.0002833759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103898,0.00003085358,0.893128,0.0005800113,0.00007873229,0.00007649973,7.306907e-7,0.0003795648,0.001827619],"genre_scores_gemma":[0.8395949,0.000006349587,0.1579993,0.001199741,0.00003495499,0.000008565571,0.00001057059,0.00001324333,0.001132387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7356969,"threshold_uncertainty_score":0.4675948,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007975650614026872,"gpt":0.2321972326308826,"spread":0.2242215820168557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000153345,0.00008412937,0.00007610015,0.00004514115,0.00017315,0.0004135019,0.0004349728,0.00005826029,0.00007387572],"category_scores_gemma":[0.00001657333,0.00007103203,0.00002589216,0.000254415,0.00002487574,0.0006013244,0.00008446497,0.0001569806,0.0001084188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007097668,"about_ca_system_score_gemma":0.00005144217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006419578,"about_ca_topic_score_gemma":0.0000141657,"domain_scores_codex":[0.9992774,0.0000153038,0.0001156525,0.0002461994,0.000135446,0.0002100059],"domain_scores_gemma":[0.9994463,0.00002681374,0.00004066158,0.0003363434,0.00006547966,0.00008440828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001048363,0.0002132739,0.002238062,0.00002867204,0.0000226054,0.00001662949,0.001843126,0.003597524,0.02108183,0.1483759,0.02461899,0.7979529],"study_design_scores_gemma":[0.0003673941,0.00003893466,0.000665036,0.00001644746,0.000005350485,0.00003514123,0.00001558015,0.9466395,0.01121289,0.007396451,0.03322687,0.0003803477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05008266,0.00003252824,0.9188184,0.001569476,0.0009039636,0.00005415127,1.627637e-7,0.0004637508,0.02807487],"genre_scores_gemma":[0.6977404,0.000004194303,0.3004657,0.0008651924,0.0001802339,0.000003666014,9.83987e-7,0.00000688903,0.0007328075],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.943042,"threshold_uncertainty_score":0.3987408,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03238749857296692,"gpt":0.2596647451549677,"spread":0.2272772465820008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001685036,0.00008105122,0.00008623272,0.00005075035,0.0001251838,0.0001345687,0.0002167818,0.00003876254,0.000007765145],"category_scores_gemma":[0.00002082604,0.00006773175,0.00003041673,0.0001883497,0.00002893105,0.0005416239,0.00003992387,0.00004509712,0.000005617027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005028027,"about_ca_system_score_gemma":0.0000740254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001398135,"about_ca_topic_score_gemma":0.000001889651,"domain_scores_codex":[0.9993484,0.00001212449,0.0001426363,0.0002184516,0.0001097455,0.0001686352],"domain_scores_gemma":[0.9995434,0.00001705478,0.00006132821,0.000206592,0.0001313347,0.00004034086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002448753,0.001099782,0.0001706579,0.0004150954,0.0001474367,0.00003085118,0.008265165,0.2114881,0.0530714,0.6246898,0.05187571,0.04850113],"study_design_scores_gemma":[0.00279037,0.001147654,0.00009506255,0.0004161947,0.00002853101,0.0002626535,0.0007024014,0.08529194,0.5978173,0.3041172,0.006421275,0.0009093686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005832984,0.00005095032,0.9947063,0.001782661,0.0003023497,0.0003383809,8.332084e-7,0.0002393063,0.001995866],"genre_scores_gemma":[0.3085978,0.00001061422,0.6890759,0.0002401947,0.00004925377,0.0001470108,0.000004687146,0.000008465033,0.00186597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5447459,"threshold_uncertainty_score":0.2762021,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02115177342424038,"gpt":0.2260782770659528,"spread":0.2049265036417124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001384513,0.000107803,0.0001093559,0.00004561472,0.0001008003,0.0001710187,0.0003260169,0.00004785227,0.00008090315],"category_scores_gemma":[0.00001072845,0.00008770313,0.00003658367,0.0002150815,0.00003083439,0.0005295365,0.0001283578,0.00008280455,0.0001511703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003611312,"about_ca_system_score_gemma":0.0000694712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002915083,"about_ca_topic_score_gemma":0.00000706774,"domain_scores_codex":[0.9990993,0.00001572007,0.00017051,0.0002709658,0.0002073082,0.0002362316],"domain_scores_gemma":[0.9994316,0.00001581579,0.00005588539,0.0003220318,0.0000899845,0.0000846457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001113817,0.002066539,0.001021395,0.0001508282,0.0001481318,0.0006842215,0.004967362,0.6873191,0.005102876,0.137661,0.056699,0.1040682],"study_design_scores_gemma":[0.01335038,0.001460486,0.00351,0.001110829,0.00005276047,0.0008142599,0.0009455236,0.70985,0.2032968,0.05238071,0.009765505,0.003462779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01624995,0.0001585955,0.9597774,0.002049777,0.0005224856,0.00009249301,6.517856e-7,0.0003812237,0.02076741],"genre_scores_gemma":[0.8316429,0.00002289296,0.1561643,0.002023663,0.0001295353,0.000008462009,0.000005865438,0.00001347225,0.009988888],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8153929,"threshold_uncertainty_score":0.357643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05121562897356994,"gpt":0.268261431583526,"spread":0.2170458026099561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004236493,0.00009960267,0.0001055093,0.00003429426,0.0003434734,0.0003729917,0.0002432892,0.00004693884,0.00001037333],"category_scores_gemma":[0.000124633,0.00008892867,0.00002843959,0.0003000249,0.00001187009,0.0005467723,0.00004176942,0.00006101606,0.000007848598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001948473,"about_ca_system_score_gemma":0.0000702808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001263911,"about_ca_topic_score_gemma":0.00001408106,"domain_scores_codex":[0.9991152,0.00003117565,0.0001762364,0.0002869933,0.00009446481,0.0002958986],"domain_scores_gemma":[0.9994735,0.00008874429,0.00007719356,0.000202325,0.0001058472,0.00005241513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001273849,0.0004711749,0.006385449,0.000184568,0.00008438279,0.000007664565,0.004683163,0.3283271,0.005140794,0.3220504,0.008051828,0.3246008],"study_design_scores_gemma":[0.0003759768,0.00002065936,0.00002991669,0.00002003553,0.000004214713,0.000004354482,0.00007045849,0.9892702,0.008250722,0.0003502096,0.001457684,0.0001455467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001060868,0.0001498976,0.9928222,0.0001092453,0.0001947818,0.0001271751,2.584942e-7,0.0002157932,0.005319729],"genre_scores_gemma":[0.3263123,0.000002716808,0.6699407,0.0001942441,0.00004411184,0.00001480196,0.000001760702,0.00000767202,0.003481702],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6609431,"threshold_uncertainty_score":0.3626406,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02757603907305439,"gpt":0.3057848780112881,"spread":0.2782088389382337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002746929,0.00004841933,0.0000472612,0.00003234831,0.00007303809,0.0001808145,0.0003073191,0.00002604866,0.00000321618],"category_scores_gemma":[0.00001430642,0.00003159144,0.000009056766,0.001017868,0.00002734456,0.0002281841,0.0001153979,0.00005967234,0.00001909318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002006692,"about_ca_system_score_gemma":0.00004984794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006635139,"about_ca_topic_score_gemma":0.00003637958,"domain_scores_codex":[0.9993777,0.00005919507,0.00005990562,0.0001682513,0.0001736401,0.0001613247],"domain_scores_gemma":[0.9997481,0.00004164686,0.00001040616,0.0001491266,0.00002619584,0.00002448745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001135432,0.00003889981,0.003993201,0.0000190342,0.000006572778,0.00004009014,0.008747041,0.004731612,0.00001421261,0.0385858,0.008013902,0.9357983],"study_design_scores_gemma":[0.0004568197,0.00006529337,0.1178672,0.00003077123,0.000002508262,0.00002881736,0.001177425,0.8649511,0.0004227653,0.01350562,0.001287272,0.0002044511],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4384065,0.0001464299,0.4867101,0.0168079,0.0003138655,0.0002637706,0.000002848219,0.0005461247,0.0568025],"genre_scores_gemma":[0.9935882,0.0000408671,0.005563192,0.0003876474,0.00003351401,0.000006712711,0.000002097698,0.000002024957,0.0003757623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9355938,"threshold_uncertainty_score":0.1743598,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03052033678092598,"gpt":0.263910897751214,"spread":0.233390560970288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001978755,0.00008183925,0.0001863766,0.0002060253,0.0001323567,0.0003304716,0.0002851303,0.000040855,2.633132e-7],"category_scores_gemma":[0.00001400984,0.00005762821,0.00002370375,0.000425788,0.000120892,0.001281373,0.00005802506,0.0001147896,6.859875e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002350492,"about_ca_system_score_gemma":0.00005508399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001911781,"about_ca_topic_score_gemma":3.972458e-7,"domain_scores_codex":[0.9988322,0.0001706851,0.0003342977,0.0001443744,0.000315541,0.0002029033],"domain_scores_gemma":[0.9993359,0.0001498532,0.0002280377,0.00007879618,0.00006863624,0.0001388047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006030565,0.0003706598,0.1385091,0.0003174312,0.00004183746,0.00005023255,0.02150024,0.006241802,0.0005875248,0.475456,0.002374588,0.3544902],"study_design_scores_gemma":[0.000519512,0.0002850547,0.06090555,0.0003461254,0.0000084862,0.001322066,0.0006529327,0.9342209,0.00005502482,0.0008300315,0.0006848444,0.0001694382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2298393,0.002509523,0.763048,0.002115359,0.0009005877,0.00007010596,1.826697e-7,0.00002322853,0.001493746],"genre_scores_gemma":[0.9116423,0.00006751301,0.08789708,0.00007293899,0.0003099852,2.467218e-7,7.444658e-8,0.000001913919,0.000008006953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9279791,"threshold_uncertainty_score":0.3186745,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008486655486713809,"gpt":0.1940119839983482,"spread":0.1855253285116344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003525456,0.0003258141,0.0003648212,0.0002483609,0.0005942881,0.0005577949,0.0003836981,0.0002287787,0.00003755168],"category_scores_gemma":[0.000004929731,0.0002929761,0.0001067434,0.0005820409,0.00007443327,0.0004189742,0.000003286566,0.0002315842,0.00003806863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001260591,"about_ca_system_score_gemma":0.0001795841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004421847,"about_ca_topic_score_gemma":0.00001996224,"domain_scores_codex":[0.9974292,0.0003027964,0.0003832614,0.0007640165,0.0006252016,0.0004955078],"domain_scores_gemma":[0.9985279,0.0001471613,0.0001188548,0.0007301216,0.0001763941,0.0002995317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003301364,0.0007756823,0.000005735284,0.0004170845,0.000271932,0.0000293517,0.001366409,0.7518742,0.01142795,0.04933507,0.001143243,0.1833203],"study_design_scores_gemma":[0.001267255,0.0003572881,0.00001949849,0.0002913815,0.00003091177,0.00002655299,0.0001443468,0.9903506,0.006072729,0.0003498104,0.0006119508,0.0004776811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004111406,0.00008754075,0.9912958,0.000600853,0.001240851,0.0004594249,0.0000067981,0.0004547039,0.001742595],"genre_scores_gemma":[0.995025,0.00008135301,0.002492441,0.000465561,0.00009136244,0.0001473078,0.000006198878,0.00004223678,0.001648571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9909136,"threshold_uncertainty_score":0.9999523,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01105706994047953,"gpt":0.181300326171254,"spread":0.1702432562307744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001475344,0.000292471,0.0004092443,0.0002673408,0.0003118762,0.00008914516,0.001101508,0.0003028263,0.00006013109],"category_scores_gemma":[0.000004471124,0.0003374667,0.000110128,0.000360743,0.00007143267,0.0009106182,0.0001159044,0.0002729429,0.00007202189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009172501,"about_ca_system_score_gemma":0.0001404873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005765663,"about_ca_topic_score_gemma":0.00251887,"domain_scores_codex":[0.9983889,0.00005141412,0.0001857736,0.0005592789,0.0004402316,0.0003743874],"domain_scores_gemma":[0.9985711,0.00002314546,0.0004261919,0.0005502295,0.0003368338,0.00009252103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009285369,0.002722189,0.005544263,0.008214448,0.001246163,0.001105314,0.3373469,0.1370348,0.02381529,0.003729636,0.1382078,0.3401047],"study_design_scores_gemma":[0.01778956,0.003375428,0.1462872,0.01657674,0.001318587,0.0001066375,0.116328,0.4021368,0.2786794,0.001913666,0.003978071,0.01150986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.9900132,0.0002410025,0.004346061,0.0001993568,0.001096284,0.0002212136,0.0000104985,0.0002154429,0.003656981],"genre_scores_gemma":[0.4038442,0.000145712,0.005578687,0.00003184739,0.00006431012,8.045554e-7,0.0004111643,0.00002899139,0.5898943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5862373,"threshold_uncertainty_score":0.9999077,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02254865816580674,"gpt":0.2543185713826495,"spread":0.2317699132168428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004950891,0.00006841632,0.00008117573,0.00005900082,0.0000632294,0.0001564064,0.001007299,0.00003972759,0.000007595285],"category_scores_gemma":[0.00002716656,0.00005561253,0.000008480303,0.0002241425,0.00001045438,0.0008691352,0.0004759325,0.00007280658,0.0000204863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007776961,"about_ca_system_score_gemma":0.00001606329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001813119,"about_ca_topic_score_gemma":0.00001237603,"domain_scores_codex":[0.9991612,0.00006845997,0.0001379797,0.0003368105,0.0001391496,0.0001564067],"domain_scores_gemma":[0.9989572,0.00004241052,0.00004302936,0.0008993951,0.00001667627,0.00004126394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001985321,0.0002411828,0.002621814,0.00009082232,0.000007405783,0.00002163203,0.003019344,0.1921673,0.003333357,0.1323071,0.04123968,0.6249304],"study_design_scores_gemma":[0.0001967363,0.000007725131,0.0002290419,0.00006602846,6.95059e-7,0.00000250153,0.00001040954,0.9765105,0.0004843248,0.0186133,0.003773278,0.0001055128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004828437,0.00007155166,0.989561,0.0006743845,0.0001327932,0.00003699026,1.418622e-7,0.0001458071,0.004548951],"genre_scores_gemma":[0.5338705,0.00001898843,0.4650938,0.0003712397,0.00007587214,0.000002368688,0.00001362228,0.0000056768,0.0005479729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7843431,"threshold_uncertainty_score":0.2267813,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008289532133585992,"gpt":0.2184565017200199,"spread":0.2101669695864339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004094632,0.0001487528,0.0001475235,0.00007232679,0.0003614429,0.000143149,0.0004694834,0.00004968543,0.000002519609],"category_scores_gemma":[0.00004410829,0.0001016678,0.00005001475,0.0002398737,0.0001062754,0.0001658128,0.0003080567,0.00007584311,0.000001404191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003996317,"about_ca_system_score_gemma":0.00003702437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005632463,"about_ca_topic_score_gemma":8.853393e-7,"domain_scores_codex":[0.9988123,0.000008069666,0.0002321022,0.000359062,0.0003344691,0.0002539493],"domain_scores_gemma":[0.9992129,0.00005328469,0.000241921,0.0001505258,0.0002714113,0.00006990899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001244611,0.00152413,0.005080095,0.001249247,0.0001269869,0.000002019359,0.007968274,0.0647689,0.6060919,0.0846747,0.04021789,0.1870512],"study_design_scores_gemma":[0.001511022,0.000281036,0.0008332721,0.0008653288,0.00003361237,0.000006953555,0.0000510327,0.3705419,0.6110886,0.01417078,0.00032894,0.0002875057],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6591832,0.0002484464,0.3361087,0.002401297,0.0006627058,0.0006770421,0.000003351175,0.0001595646,0.0005556694],"genre_scores_gemma":[0.8704628,0.000002945771,0.1289369,0.0003167696,0.0001226655,0.00003360185,9.779619e-7,0.00001154424,0.0001117772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.305773,"threshold_uncertainty_score":0.4145892,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02487416087665568,"gpt":0.2306194334969701,"spread":0.2057452726203144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204938,0.0002411595,0.0002470573,0.0001414339,0.0002739844,0.0002315779,0.0006401414,0.0001392635,0.0001442491],"category_scores_gemma":[0.00002281427,0.000205355,0.00007401568,0.0005466141,0.00004358662,0.0009510351,0.0001676683,0.0001612733,0.0001258519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046741,"about_ca_system_score_gemma":0.0001303244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002460073,"about_ca_topic_score_gemma":0.00001030824,"domain_scores_codex":[0.9977275,0.0001785377,0.0002642875,0.0004728088,0.0006092024,0.0007476475],"domain_scores_gemma":[0.9986147,0.0001584587,0.00009531024,0.0006990818,0.0001730811,0.0002594052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009102117,0.00142994,0.0001983433,0.0001021764,0.00008243446,0.00001660006,0.0007777142,0.06637441,0.001476288,0.8895159,0.01594442,0.02399074],"study_design_scores_gemma":[0.00109625,0.0001355476,0.00005707088,0.00005459299,0.00001149681,0.000003870271,0.00004279355,0.942604,0.05366924,0.001398164,0.000581499,0.0003454923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002465572,0.00007753467,0.9799124,0.0007514465,0.0009522726,0.000144091,0.000001357642,0.0007594087,0.01493594],"genre_scores_gemma":[0.8093705,0.00001784902,0.1829015,0.002524131,0.000289829,0.00002635239,0.00001712509,0.00002811568,0.004824668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8881177,"threshold_uncertainty_score":0.8374135,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01653283122052534,"gpt":0.2541950251287802,"spread":0.2376621939082548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001974624,0.00009414287,0.00008810441,0.00004812377,0.0001481867,0.0002568405,0.0003708251,0.00004441665,0.00001533906],"category_scores_gemma":[0.00001622648,0.00008206128,0.00004260179,0.0001899176,0.00001271972,0.0004922493,0.00004419546,0.0000545922,0.00003498987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000283664,"about_ca_system_score_gemma":0.00006616404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003717734,"about_ca_topic_score_gemma":0.00001375246,"domain_scores_codex":[0.9992303,0.0000132306,0.0001374592,0.0002663788,0.00012933,0.0002232542],"domain_scores_gemma":[0.9994808,0.00005961512,0.00005404973,0.0002639713,0.00008102632,0.00006058109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003847067,0.0002878717,0.0006269795,0.0001405432,0.00002615415,0.00000261682,0.001010977,0.3390252,0.0006240888,0.06285462,0.02206687,0.5732956],"study_design_scores_gemma":[0.0003775519,0.00003367103,0.00004175722,0.00003071629,0.000002704146,0.000001845021,0.000004821197,0.9811295,0.0026079,0.001120791,0.01450888,0.0001398393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002005898,0.00008714299,0.990841,0.003162795,0.0001193991,0.0001275199,6.288859e-7,0.0003733184,0.003282314],"genre_scores_gemma":[0.187378,0.000002149218,0.8092032,0.001343245,0.0001909021,0.00002782901,0.000006156081,0.000009411699,0.001839129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6421043,"threshold_uncertainty_score":0.3346362,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01418633484215256,"gpt":0.2638186931382118,"spread":0.2496323582960593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196978,0.0001394929,0.0002119453,0.0003426225,0.0001460021,0.0004477247,0.002052266,0.00008115568,0.000002916679],"category_scores_gemma":[0.00006048536,0.0001340481,0.00005761109,0.0004073214,0.0000648158,0.0009042651,0.0001251973,0.0003445356,0.000005701899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002841016,"about_ca_system_score_gemma":0.0001130405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001489739,"about_ca_topic_score_gemma":0.000008111446,"domain_scores_codex":[0.998159,0.0001794194,0.0007622599,0.000165911,0.0005472263,0.000186184],"domain_scores_gemma":[0.9976944,0.0002955802,0.0009439614,0.000445515,0.0005588885,0.00006166707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008545409,0.0001612212,0.001194257,0.000006745837,0.00005249729,0.000003821876,0.001183068,0.9877926,0.0001835836,0.002298119,0.0004730037,0.006565678],"study_design_scores_gemma":[0.0008734454,0.0001011046,0.000447599,0.0012954,0.000003611726,0.00004180973,0.00003050374,0.9947793,0.00009010269,0.0001144441,0.0020908,0.0001318288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04132327,0.001420903,0.9537057,0.001263955,0.001160083,0.0001073453,0.000001152661,0.00004094061,0.0009766367],"genre_scores_gemma":[0.9865025,0.0002967727,0.01258695,0.0004081423,0.0001405257,0.000007509424,0.00001051527,0.00001316769,0.00003393464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9451792,"threshold_uncertainty_score":0.5466323,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1567059972768445,"gpt":0.3052713440647466,"spread":0.1485653467879021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005113826,0.0001253284,0.0002043054,0.0001987659,0.0004607183,0.00007867877,0.0004809344,0.0001701524,0.0000100794],"category_scores_gemma":[0.00001160692,0.0001199289,0.0000342437,0.0001638233,0.0002171761,0.0002860158,0.000004014139,0.0001714775,0.000006423314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004676144,"about_ca_system_score_gemma":0.0001478569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003329322,"about_ca_topic_score_gemma":0.00002528565,"domain_scores_codex":[0.9989409,0.0001313724,0.0001949293,0.0003214373,0.0002389042,0.0001724159],"domain_scores_gemma":[0.9986754,0.00009333075,0.0002428916,0.0006702468,0.0002832383,0.00003489908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006352583,0.0002720903,0.000006636355,0.00002574892,0.00002729719,0.000001407845,0.0003133283,0.8780305,0.01695157,0.0002804693,0.00007746509,0.10395],"study_design_scores_gemma":[0.0007326361,0.0001514474,0.00001066563,0.00002677201,0.00002856379,0.000001927488,0.00001848623,0.5623549,0.4362538,0.0003355807,0.00001103441,0.00007421851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03296745,0.0001176249,0.9654001,0.0005339492,0.0002575536,0.0003405101,0.000001769568,0.000123432,0.0002575883],"genre_scores_gemma":[0.9437535,0.0000237608,0.05599584,0.00003325706,0.000005076666,0.00006796327,4.292181e-7,0.000005590943,0.0001145875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.910786,"threshold_uncertainty_score":0.4890561,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09955275623906377,"gpt":0.2553329699136858,"spread":0.155780213674622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002696295,0.00009891872,0.0001106242,0.00005638787,0.0000967687,0.0002383488,0.000426817,0.00004689631,0.00001402081],"category_scores_gemma":[0.00004501746,0.00008142272,0.00002761686,0.0003633194,0.00004174369,0.0005903234,0.00008669364,0.00006027083,0.00006496622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002882559,"about_ca_system_score_gemma":0.0001441114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002009214,"about_ca_topic_score_gemma":0.000003619425,"domain_scores_codex":[0.9991142,0.00004304476,0.000133278,0.0002484526,0.0002474803,0.0002135051],"domain_scores_gemma":[0.9991931,0.00002640366,0.00005098665,0.0003672313,0.00022859,0.0001336642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005025406,0.0002963636,0.002981156,0.00004822439,0.00002869041,0.00005776572,0.0008642584,0.8558387,0.0005680661,0.05065319,0.06723509,0.02137832],"study_design_scores_gemma":[0.0004704111,0.00008101048,0.00007940727,0.00001666157,0.000003204206,0.000002923079,0.00005237929,0.9894075,0.003053927,0.002338077,0.004353715,0.0001408314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005724599,0.0003078047,0.9753814,0.001436337,0.0004805595,0.00007311807,3.801033e-7,0.0004402683,0.01615554],"genre_scores_gemma":[0.7462583,0.000003559003,0.2464955,0.001122843,0.00009705406,0.00001091639,0.000008935573,0.00001053887,0.005992358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7405337,"threshold_uncertainty_score":0.3320322,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01061084441168028,"gpt":0.2087312915089265,"spread":0.1981204470972462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001342467,0.0001242407,0.0001198237,0.00004898095,0.0002810423,0.000314374,0.0001362717,0.00007716504,0.00001062528],"category_scores_gemma":[0.00001246502,0.0001188604,0.00004132897,0.0003750254,0.00005060555,0.002038192,0.000003225856,0.0001728373,0.00002014148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086764,"about_ca_system_score_gemma":0.00005812723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003751126,"about_ca_topic_score_gemma":0.00000137147,"domain_scores_codex":[0.9991521,0.00002945391,0.0002870398,0.0001534498,0.0002308956,0.0001470459],"domain_scores_gemma":[0.9993886,0.00004475416,0.000126169,0.0001485186,0.0001657238,0.0001261872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001888116,0.0001644507,0.00008639265,0.000474948,0.00009952801,0.000004979076,0.04303209,0.1001278,0.00006870239,0.1082781,0.004898059,0.7425762],"study_design_scores_gemma":[0.0007139932,0.0001860222,0.00001456517,0.00004424343,0.00001667816,0.00001223905,0.0001756291,0.9784788,0.007181721,0.009170237,0.003748894,0.0002569509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003664863,0.00001932444,0.9930108,0.001372917,0.0002617643,0.000178047,0.00001835256,0.0001847848,0.001289177],"genre_scores_gemma":[0.9872171,0.00006474286,0.01125345,0.001406257,0.00002548775,0.0000120631,0.000009428138,0.000004436356,0.000007090398],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9835522,"threshold_uncertainty_score":0.4846985,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05379302327859042,"gpt":0.2393142486921036,"spread":0.1855212254135132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002889484,0.00008608298,0.0001156642,0.00001627859,0.0004890314,0.0001273465,0.0002231726,0.00004409885,6.469797e-7],"category_scores_gemma":[0.00001712988,0.00006577,0.00002779962,0.0004298442,0.00005118189,0.0003568821,0.00004321896,0.00005537209,8.210962e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001472707,"about_ca_system_score_gemma":0.00003128663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001563838,"about_ca_topic_score_gemma":0.000006764476,"domain_scores_codex":[0.9992383,0.00003070669,0.0001760746,0.0002064447,0.000111432,0.0002370051],"domain_scores_gemma":[0.9993923,0.0001447485,0.0001198293,0.0002253969,0.00008396509,0.00003372612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001366958,0.00001667525,0.0008222332,0.00001695995,0.00002406336,0.000001403408,0.0003056432,0.9171069,0.0001247382,0.001317009,0.06678458,0.0134661],"study_design_scores_gemma":[0.0002071057,0.00002629831,0.0003804042,0.00002904951,0.00001213317,0.000007998874,0.000007862181,0.9959366,0.0003031178,0.0004336879,0.002572097,0.00008364313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01076149,0.0007998594,0.9867321,0.000287018,0.001063018,0.0001764994,0.000001892394,0.00005588053,0.0001222616],"genre_scores_gemma":[0.951188,0.0001987376,0.04636182,0.0002552062,0.001584221,0.00003004525,0.00001587541,0.00001071775,0.0003553436],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9404265,"threshold_uncertainty_score":0.3761284,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02561072321850174,"gpt":0.2539770676491669,"spread":0.2283663444306651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002726507,0.00008067159,0.00007431312,0.0000270217,0.0001164007,0.00007922789,0.000156082,0.00004496069,0.000003216503],"category_scores_gemma":[0.00001279995,0.00005679961,0.00002536653,0.0001924033,0.00001640587,0.0007431379,0.00003338474,0.0000400816,0.000005794115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002976496,"about_ca_system_score_gemma":0.00002896915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005281258,"about_ca_topic_score_gemma":0.00001801776,"domain_scores_codex":[0.999359,0.00001386387,0.00009492472,0.0002057365,0.00009289393,0.0002335918],"domain_scores_gemma":[0.9995505,0.00001395971,0.00004697909,0.0002356127,0.00008751088,0.00006544786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005241742,0.001776266,0.02848571,0.0003888262,0.0001212486,0.000001623255,0.01258291,0.4466914,0.002425772,0.1256722,0.003031702,0.3782981],"study_design_scores_gemma":[0.0001863313,0.00006925764,0.0005411988,0.000004220521,0.000004872206,0.00000369623,0.00000494425,0.9948801,0.002095567,0.002018659,0.00009186517,0.00009933484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03370574,0.0000488519,0.9642858,0.00006711463,0.00007328061,0.0001417153,2.529486e-7,0.0001929284,0.001484307],"genre_scores_gemma":[0.6304176,0.000001020101,0.3688896,0.0001816856,0.0000425007,0.00001999288,9.05545e-7,0.000003845167,0.0004427841],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5967119,"threshold_uncertainty_score":0.2316221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02105443880539756,"gpt":0.2166344805740334,"spread":0.1955800417686359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001954811,0.0001079795,0.000114494,0.00004542332,0.0001945206,0.0002044786,0.0001692929,0.00006836838,0.000008054182],"category_scores_gemma":[0.00001954969,0.00009591656,0.00003349533,0.0001260889,0.00002996262,0.0005002241,0.00006203406,0.00006100253,0.000005002426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000306911,"about_ca_system_score_gemma":0.00002420301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001191979,"about_ca_topic_score_gemma":0.00009114486,"domain_scores_codex":[0.9991283,0.00002211441,0.0001764053,0.0003247408,0.0001309342,0.0002174692],"domain_scores_gemma":[0.9994736,0.00007731498,0.00007202264,0.0002077972,0.0001220192,0.0000472322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003606741,0.002068124,0.04495346,0.001009765,0.0001662111,0.00004528279,0.003631116,0.08754499,0.09537029,0.02064272,0.02490317,0.7193042],"study_design_scores_gemma":[0.001202736,0.0001034398,0.003721225,0.00004172763,0.000008994528,0.00002127071,0.00005131817,0.941983,0.04667557,0.004986419,0.0009196383,0.0002846591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05443754,0.0001507325,0.9419481,0.0001102222,0.0003241179,0.0002440679,0.000001388638,0.0002046691,0.002579138],"genre_scores_gemma":[0.9628839,0.000008335343,0.03398083,0.000149366,0.0000997918,0.00002167688,0.000003846526,0.000009633068,0.002842569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9084464,"threshold_uncertainty_score":0.3911363,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0214447789882437,"gpt":0.2142230853399171,"spread":0.1927783063516734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002218101,0.0001813988,0.0001701823,0.00008340165,0.0001683725,0.0004531159,0.0005923116,0.0001032107,0.0005354206],"category_scores_gemma":[0.00002567842,0.000144857,0.00006056875,0.0003762875,0.00004360221,0.0006665356,0.0001066993,0.0001616701,0.000387812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000342692,"about_ca_system_score_gemma":0.00005085021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003183827,"about_ca_topic_score_gemma":0.000006617252,"domain_scores_codex":[0.9985846,0.00007568436,0.000234261,0.0004268829,0.0002637184,0.0004149043],"domain_scores_gemma":[0.998823,0.0001051491,0.00009718494,0.0006361358,0.0001849051,0.0001536042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001970983,0.0002431641,0.0002585831,0.00001634618,0.00001316213,0.000008562813,0.0001336682,0.8710921,0.00004730024,0.002331541,0.08864266,0.03719318],"study_design_scores_gemma":[0.0005420312,0.00009490229,0.0002124734,0.00007007313,0.000002793787,0.000001966785,0.00002109475,0.9978177,0.0004539808,0.0001976456,0.0003813459,0.0002039953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002207034,0.00005453293,0.9447597,0.001089711,0.0005732994,0.0002553242,2.381343e-7,0.0003862193,0.05067389],"genre_scores_gemma":[0.9484372,0.000007009999,0.03622222,0.006900398,0.0001071199,0.00005353032,0.000006269422,0.00001945842,0.008246851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9462301,"threshold_uncertainty_score":0.5907096,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00588116255634943,"gpt":0.2167406213045004,"spread":0.210859458748151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005151438,0.00003178152,0.00002997007,0.0000195991,0.00005054536,0.00009771639,0.0001990263,0.00001498661,0.00001440551],"category_scores_gemma":[0.000004241061,0.00002551116,0.00001107049,0.0001773529,0.000003901931,0.0002388676,0.00001357513,0.00002414049,0.00004824976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004853185,"about_ca_system_score_gemma":0.00001243633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.200299e-7,"about_ca_topic_score_gemma":2.987181e-7,"domain_scores_codex":[0.9996967,0.000006469087,0.00004529124,0.0001014424,0.00006461271,0.00008552229],"domain_scores_gemma":[0.9997933,0.000005577216,0.00001185005,0.0001395154,0.00002276573,0.00002701174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.781667e-7,0.00003483074,0.00009128852,0.000001170651,0.000001275815,0.000003163892,0.0002547471,0.003437523,0.00008514558,0.2462242,0.01794728,0.7319183],"study_design_scores_gemma":[0.0001658098,0.00008358408,0.001552329,0.000008993963,0.00000132606,0.00001141791,0.000007236854,0.9507934,0.001140518,0.0345419,0.01153337,0.0001600372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004984633,0.0000518829,0.8998918,0.002074726,0.00007126827,0.00001225227,9.973125e-9,0.0002138051,0.09718578],"genre_scores_gemma":[0.7448009,0.000008657931,0.2491754,0.001892957,0.00005491983,3.838049e-7,4.182295e-7,0.000001140992,0.0040652],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9473559,"threshold_uncertainty_score":0.1040315,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03620402639506439,"gpt":0.238177139726224,"spread":0.2019731133311596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002436832,0.000108898,0.0001257557,0.0000552353,0.0002463825,0.0003224792,0.0002344785,0.00005035021,0.00001288998],"category_scores_gemma":[0.00003648945,0.00009228937,0.00002091486,0.0002501722,0.00007024623,0.0005179725,0.00007761632,0.00006008575,0.000005363763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001412837,"about_ca_system_score_gemma":0.00003506615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002361291,"about_ca_topic_score_gemma":0.0000112692,"domain_scores_codex":[0.9991686,0.00005871394,0.0001348814,0.0002768217,0.0001469238,0.0002140284],"domain_scores_gemma":[0.9994377,0.00007107407,0.00006477273,0.0002529463,0.00009416268,0.0000792687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000556986,0.0002184157,0.008571013,0.0002405614,0.00003375471,0.00001809225,0.001355905,0.7744445,0.004036901,0.03376449,0.003073676,0.174187],"study_design_scores_gemma":[0.00031581,0.00005366607,0.000116461,0.00002810404,0.00000497776,0.000006326099,0.00002554852,0.9944007,0.003559059,0.0009086095,0.0004424876,0.0001382342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02909305,0.0002792533,0.9670761,0.0004767628,0.0002320463,0.00005765351,1.091874e-7,0.0002023099,0.002582758],"genre_scores_gemma":[0.7817653,0.000003207545,0.2168681,0.0007539504,0.00006482695,0.000002316978,0.000002371568,0.000008407514,0.0005314272],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7526723,"threshold_uncertainty_score":0.3763452,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02569693793863277,"gpt":0.2914582352866313,"spread":0.2657612973479985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731604,0.0001932752,0.0001906124,0.0001728071,0.0002671257,0.0003632836,0.001020495,0.00009538087,0.00001225281],"category_scores_gemma":[0.00001062186,0.0001683817,0.00002686693,0.0002610364,0.0001152349,0.001211938,0.00011886,0.0002435083,0.000008024464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001047003,"about_ca_system_score_gemma":0.000120381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003544841,"about_ca_topic_score_gemma":0.0000210307,"domain_scores_codex":[0.9973376,0.0004108574,0.0005433171,0.0004652562,0.00107784,0.0001650886],"domain_scores_gemma":[0.996905,0.00007379615,0.0004759641,0.001040961,0.001392167,0.0001121697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001014638,0.0009139181,0.004678205,0.00003240893,0.00006727123,2.07219e-7,0.001463203,0.4758742,0.001548096,0.01349531,0.00003821554,0.5017874],"study_design_scores_gemma":[0.0008179404,0.0003974924,0.02169303,0.00005404978,0.00001702919,0.00002582893,0.00004897024,0.9755678,0.0008209748,0.00005886589,0.0003056679,0.0001923484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7709727,0.00002188288,0.2266583,0.0004002513,0.0007181024,0.0004065644,0.000007592457,0.0001005967,0.0007140742],"genre_scores_gemma":[0.942137,0.00004449175,0.05718004,0.00007645447,0.0001913455,0.00008584007,0.0002650239,0.0000131065,0.000006719296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5015951,"threshold_uncertainty_score":0.6866406,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03249872416982492,"gpt":0.2580709072216661,"spread":0.2255721830518412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005587931,0.0002014151,0.0002402999,0.00007014976,0.0003950905,0.0003516677,0.001224946,0.0001201644,0.00001252765],"category_scores_gemma":[0.0000345093,0.0001938552,0.00007676548,0.001056518,0.0000555164,0.0005710545,0.0003411187,0.0002661831,0.000006484089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005388057,"about_ca_system_score_gemma":0.00002129833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000147093,"about_ca_topic_score_gemma":0.00005243678,"domain_scores_codex":[0.9982544,0.0001064352,0.0004330901,0.0004259402,0.000152299,0.0006278424],"domain_scores_gemma":[0.9982784,0.0003654179,0.0001458453,0.000982166,0.0001193962,0.0001087123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001795316,0.000114231,0.00121723,0.000002923088,0.000009591281,0.000002937951,0.0003707751,0.4536944,9.324647e-7,0.005754937,0.003908399,0.5349218],"study_design_scores_gemma":[0.0004223822,0.00005165842,0.0002033178,0.00004724794,0.000006818754,0.00000855189,0.00002882402,0.9977901,0.000001740678,0.000751588,0.0004449327,0.0002428397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001326429,0.0008165702,0.9943571,0.00132539,0.0002997789,0.0003397941,9.939384e-7,0.0003242005,0.002403527],"genre_scores_gemma":[0.4264448,0.0001635272,0.5721492,0.000587123,0.0002356283,0.00007553421,0.00002106671,0.00001866534,0.0003044915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5440957,"threshold_uncertainty_score":0.7905185,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02052798692064645,"gpt":0.2457671628757149,"spread":0.2252391759550684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001569378,0.0001035993,0.0001324098,0.00009122562,0.00008579229,0.00006255569,0.0003404166,0.0000435033,0.000014926],"category_scores_gemma":[0.00002356235,0.00007292689,0.00003921705,0.0002777929,0.00004058551,0.0003899876,0.00007165043,0.00003302841,0.000006218454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004375444,"about_ca_system_score_gemma":0.000107257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000018625,"about_ca_topic_score_gemma":0.000008470011,"domain_scores_codex":[0.999164,0.00001635951,0.0002078857,0.0002461142,0.0001528141,0.0002128702],"domain_scores_gemma":[0.9994103,0.00008223349,0.0001235447,0.0002826462,0.00005627814,0.00004495708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006156063,0.0005277474,0.004383641,0.0003849857,0.0001131019,0.00001142074,0.002162874,0.3727112,0.2885963,0.03779917,0.00009192681,0.2931562],"study_design_scores_gemma":[0.0004196912,0.00001843318,0.0002367647,0.0002513008,0.000004161803,0.000004189371,0.000002807607,0.9947219,0.003028375,0.001091199,0.00008909618,0.000132021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07994337,0.00006351071,0.9189061,0.000354899,0.0001044924,0.00005262203,8.196214e-7,0.0001322368,0.0004419835],"genre_scores_gemma":[0.6497787,0.00000420548,0.3500471,0.00006451508,0.00001065388,0.000001464634,5.655485e-7,0.000006654804,0.00008617448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6220108,"threshold_uncertainty_score":0.2973872,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Stability (learning theory); Strain (injury); Computer science; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02867700032132856,"gpt":0.2653315872197695,"spread":0.2366545868984409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000659212,0.0001713461,0.0001749631,0.00007442727,0.0002206251,0.000336757,0.0005667387,0.00006934272,0.0000784056],"category_scores_gemma":[0.0001153389,0.0001637109,0.00003405876,0.000484187,0.00005039564,0.0006649821,0.0001063484,0.0001301518,0.00004029025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005165262,"about_ca_system_score_gemma":0.0001081016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004037258,"about_ca_topic_score_gemma":0.000007624902,"domain_scores_codex":[0.9984191,0.0001290171,0.0002645188,0.0004955225,0.0002734775,0.0004183461],"domain_scores_gemma":[0.9989233,0.00005843797,0.00007914117,0.0005840531,0.0001745264,0.0001805398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002074851,0.001019323,0.1157362,0.001205125,0.0001549787,0.0001046882,0.02297276,0.02208353,0.009567138,0.07718898,0.0229566,0.7268032],"study_design_scores_gemma":[0.001254065,0.0004408547,0.01407886,0.0003686985,0.00002161934,0.00004041393,0.0002540557,0.9143786,0.02226042,0.001580252,0.04421128,0.00111091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.490048,0.0003113209,0.4855014,0.0006095344,0.003264928,0.0004696188,0.00001849795,0.0007324952,0.01904419],"genre_scores_gemma":[0.9544585,0.00001412746,0.04472885,0.0003726224,0.00006760354,0.00002045409,0.000004597475,0.0000125808,0.0003206217],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8922951,"threshold_uncertainty_score":0.6675938,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02499434622569165,"gpt":0.302972435304365,"spread":0.2779780890786734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170246,0.00009859341,0.00008802793,0.000048696,0.0002388083,0.0003648248,0.001611355,0.00006258216,0.000006129459],"category_scores_gemma":[0.00006728489,0.00008093034,0.00001535194,0.0002792164,0.00002624683,0.0005542429,0.0001980184,0.000115335,0.000007283678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005896532,"about_ca_system_score_gemma":0.0001114209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007921458,"about_ca_topic_score_gemma":0.00003895539,"domain_scores_codex":[0.998952,0.000009475717,0.0001399404,0.0004921517,0.0001573295,0.0002491143],"domain_scores_gemma":[0.9986458,0.00005804474,0.00006787757,0.001002995,0.0001357103,0.00008961404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002668052,0.0006883699,0.001543044,0.0001820592,0.00002724363,0.000004030856,0.003106776,0.370158,0.004748031,0.0182371,0.0103039,0.5909747],"study_design_scores_gemma":[0.0001753807,0.00003045681,0.00005329875,0.000008888313,0.000004496269,0.000003733385,0.00001585173,0.996101,0.001432382,0.0003844644,0.001658931,0.0001311177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01387205,0.0000141515,0.983967,0.00040338,0.0004497141,0.0001632841,0.000002325701,0.0002436488,0.0008844655],"genre_scores_gemma":[0.6295817,5.828609e-7,0.3698475,0.0001686149,0.000160498,0.00001099691,0.00002800675,0.000008422558,0.0001937004],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.625943,"threshold_uncertainty_score":0.3518014,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0408427872375346,"gpt":0.2988760417846316,"spread":0.258033254547097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002295937,0.00009132863,0.00008877613,0.00004177457,0.0007907733,0.0008986904,0.0007391513,0.00004075756,0.00001487159],"category_scores_gemma":[0.00002742756,0.00007672094,0.000029284,0.00005539857,0.00003095961,0.0007743943,0.0001804402,0.00008633996,0.00005021907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002381496,"about_ca_system_score_gemma":0.00003830658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004064235,"about_ca_topic_score_gemma":0.000007616136,"domain_scores_codex":[0.999263,0.00002385776,0.0001025278,0.0002515504,0.000167487,0.0001915213],"domain_scores_gemma":[0.9990276,0.00002639513,0.0001173322,0.000732356,0.00003947469,0.00005683279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002479805,0.0001859513,0.001255414,0.00006267718,0.00004128392,0.00007692295,0.002702866,0.2800855,0.001257405,0.1194254,0.007850773,0.5870309],"study_design_scores_gemma":[0.0002571366,0.00003149548,0.0005707687,0.00009362498,0.000004512292,0.00001375663,0.00002634835,0.9807197,0.003000742,0.01466132,0.000391817,0.000228793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04867506,0.00002314271,0.890896,0.0007298054,0.0005533093,0.00004566092,1.722339e-7,0.0001846412,0.05889219],"genre_scores_gemma":[0.8243691,0.000005536608,0.1732484,0.0004914543,0.0001652081,0.000001090914,5.793677e-7,0.000008336245,0.001710352],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.775694,"threshold_uncertainty_score":0.8666093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01775539484387704,"gpt":0.2490131059414327,"spread":0.2312577110975556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001778757,0.00009303135,0.00009985073,0.00003309607,0.0007798622,0.000953769,0.000728506,0.00003344026,0.000002466315],"category_scores_gemma":[0.00001489585,0.00006652962,0.00002266096,0.00005623478,0.00003081684,0.0005338523,0.0001229079,0.00007601776,0.000002720403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001154493,"about_ca_system_score_gemma":0.00004302887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004719707,"about_ca_topic_score_gemma":0.00008077783,"domain_scores_codex":[0.9993016,0.000009273921,0.0000823423,0.0002600306,0.0001249236,0.0002218977],"domain_scores_gemma":[0.9992102,0.00003739142,0.0001014599,0.0005335007,0.0000634996,0.00005396297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003357693,0.00005075887,0.001217382,0.0001315132,0.00003428071,0.000008706334,0.001349893,0.445467,0.0002386941,0.04558853,0.001434862,0.5044448],"study_design_scores_gemma":[0.001773045,0.0001545713,0.0008314241,0.0003482864,0.00002154664,0.00004563155,0.0001481667,0.9327838,0.01424426,0.04683924,0.002172894,0.0006371317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01605253,0.00002356006,0.9737242,0.001091319,0.0001335264,0.0001171245,3.956515e-7,0.0001506071,0.00870677],"genre_scores_gemma":[0.5302897,0.000001799805,0.467243,0.0001134812,0.00009349049,0.00001101714,0.000001073771,0.000008561562,0.002237862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5142372,"threshold_uncertainty_score":0.9197217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05640658317555513,"gpt":0.2961395869657484,"spread":0.2397330037901933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149793,0.00005462647,0.00006840497,0.00005006627,0.00005923964,0.0000289201,0.0001832553,0.00002987492,0.00002376045],"category_scores_gemma":[0.00002181482,0.00004669324,0.00001725833,0.0002982867,0.00001416,0.001016454,0.00004230834,0.00003703889,0.00001005107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002365106,"about_ca_system_score_gemma":0.0000607973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000334189,"about_ca_topic_score_gemma":5.372839e-7,"domain_scores_codex":[0.9991162,0.00004601951,0.0001506939,0.0001022704,0.0004250511,0.0001597823],"domain_scores_gemma":[0.9994323,0.00002064228,0.00009762171,0.0001915465,0.0002179948,0.00003992759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001653584,0.00006999994,0.03956366,0.00001636143,0.000009595971,6.698674e-8,0.001564988,0.04455626,0.0001654571,0.002970268,0.0003358035,0.9107459],"study_design_scores_gemma":[0.0001511129,0.00001454945,0.008996244,0.00001763377,0.000008855601,0.000002427868,0.00001273991,0.987229,0.003314948,0.00009426399,0.0000936152,0.00006460613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2552938,0.0001891296,0.7313932,0.00007068036,0.0003494744,0.00007649953,7.574556e-8,0.00008480313,0.01254246],"genre_scores_gemma":[0.8948495,0.000007880837,0.1049076,0.00003909707,0.00007106961,0.000004306339,0.000001723895,0.000003307778,0.0001155051],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9426727,"threshold_uncertainty_score":0.1904095,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05734253987275195,"gpt":0.2255725325396555,"spread":0.1682299926669036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002217192,0.00009673341,0.00008257732,0.00002943662,0.0001310933,0.00009384459,0.0004556778,0.00004726418,0.0000826413],"category_scores_gemma":[0.00001011166,0.0000781177,0.00002532427,0.0003130524,0.00001461526,0.0002520916,0.00006635534,0.00007084388,0.0001713729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001366114,"about_ca_system_score_gemma":0.00003559898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006351409,"about_ca_topic_score_gemma":0.000001882894,"domain_scores_codex":[0.9992026,0.0000564789,0.0001107135,0.000257451,0.000127873,0.0002448811],"domain_scores_gemma":[0.9994596,0.00004537422,0.00004565846,0.0003346132,0.00004794493,0.00006686323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009812054,0.000325707,0.0006630307,0.00002322582,0.00004959528,0.0000654096,0.01078819,0.1473305,0.00001108503,0.06648187,0.2433244,0.5308388],"study_design_scores_gemma":[0.0002564246,0.0002729849,0.0004248472,0.00006282265,0.000005475491,0.000008133647,0.000007547464,0.9731581,0.001400263,0.02045778,0.003650224,0.000295447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009566666,0.00005790863,0.9503224,0.0001222554,0.0002843652,0.00007299261,4.72524e-8,0.0003559194,0.0486884],"genre_scores_gemma":[0.2645899,0.00002004288,0.7297646,0.001683683,0.0001717644,0.00001380393,0.000001191576,0.00001205365,0.003742953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8258276,"threshold_uncertainty_score":0.3185548,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005469129697024398,"gpt":0.1899289250570135,"spread":0.1844597953599891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002344907,0.0001337161,0.0001484161,0.00006298764,0.0003475042,0.0005851253,0.0002868831,0.0001028616,0.00001567251],"category_scores_gemma":[0.00001857535,0.0001136605,0.00004495927,0.0004191845,0.00001229974,0.0007262545,0.00006674637,0.00005422675,0.00003370256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006863286,"about_ca_system_score_gemma":0.00005383422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002395035,"about_ca_topic_score_gemma":0.00003092094,"domain_scores_codex":[0.9988477,0.00005894227,0.0002757631,0.0003398252,0.0001635644,0.0003142079],"domain_scores_gemma":[0.9991158,0.0001035659,0.0001447332,0.0002966805,0.0002595759,0.00007963402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008858837,0.00005910784,0.00001952405,0.00005047598,0.00002048841,4.986497e-7,0.0002165102,0.6911985,0.0005990547,0.03730775,0.003672454,0.2668468],"study_design_scores_gemma":[0.0002513611,0.000086581,0.0001147843,0.00004624726,0.000005275963,0.000007726741,0.000007648228,0.9928579,0.0004247452,0.004896091,0.001141504,0.0001601243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009827762,0.0001583852,0.9953352,0.0001910517,0.001599243,0.0003064343,2.43434e-7,0.0003531644,0.001073532],"genre_scores_gemma":[0.9127479,0.00001952288,0.08526073,0.0002736356,0.0007699106,0.0002406254,0.000007600904,0.00001508168,0.0006650268],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9117651,"threshold_uncertainty_score":0.5642377,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008242802829672592,"gpt":0.2226405607578746,"spread":0.214397757928202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001581091,0.00008569237,0.00008400142,0.0001010718,0.00006490448,0.0001126045,0.0001598188,0.00005525117,0.000001100699],"category_scores_gemma":[0.000002313414,0.00007962972,0.0000167869,0.0001704938,0.00002421105,0.0004734406,0.00005621458,0.00005721845,8.438135e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002978105,"about_ca_system_score_gemma":0.00001932588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001662993,"about_ca_topic_score_gemma":0.00002232086,"domain_scores_codex":[0.9993535,0.00001139748,0.0001473732,0.0002627605,0.00007625218,0.0001486698],"domain_scores_gemma":[0.9997255,0.00001939512,0.00005492092,0.0001475202,0.00003057759,0.00002215332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009899612,0.001119913,0.004436864,0.0003459499,0.00001864217,0.00003222864,0.001442193,0.03403459,0.4212425,0.02433222,0.03989625,0.4729996],"study_design_scores_gemma":[0.0005161489,0.0001362055,0.001243696,0.00008309232,0.000004516458,0.00006939434,0.00003070684,0.908766,0.08081702,0.004988314,0.003024467,0.0003204004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01636525,0.0001012453,0.9799713,0.0002529781,0.0001584058,0.000174515,0.000001004992,0.0002198233,0.002755447],"genre_scores_gemma":[0.4452989,0.00002210216,0.5516561,0.00007208441,0.0001756482,0.00002659823,0.000005263546,0.000009709812,0.002733589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8747314,"threshold_uncertainty_score":0.3247206,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.06023525701070293,"gpt":0.2947489383889734,"spread":0.2345136813782705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001329323,0.00009619976,0.0001160424,0.0003823777,0.0001071903,0.00004599389,0.000239972,0.0001488095,0.0000176574],"category_scores_gemma":[0.00002027424,0.0001009108,0.00002944407,0.0002330649,0.00008794836,0.0003918566,0.00001558505,0.0001226055,3.163803e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001990847,"about_ca_system_score_gemma":0.00004413107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006031696,"about_ca_topic_score_gemma":0.00003534307,"domain_scores_codex":[0.9992804,0.00002331924,0.0002532966,0.000264557,0.0000758455,0.0001025651],"domain_scores_gemma":[0.9994095,0.00003283797,0.0001023563,0.0001213634,0.0003045598,0.00002939705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000551628,0.00008084167,0.00007667884,0.00002456839,0.00009667728,7.211462e-7,0.004236124,0.00213032,0.005807807,0.9634299,0.000005345392,0.0240558],"study_design_scores_gemma":[0.000252503,0.00006932726,0.00002846097,0.00004088643,0.00002035696,0.00003119502,0.0002637474,0.8981996,0.004120804,0.09681278,0.00007389192,0.00008651996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03637581,0.00006306412,0.9622952,0.0004113113,0.0002171633,0.0001409692,0.00001390495,0.0001010806,0.0003815034],"genre_scores_gemma":[0.7262115,0.00007667505,0.2736192,0.00001116574,0.000007821493,0.00002799484,0.000006863318,0.000004259363,0.000034474],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8960692,"threshold_uncertainty_score":0.4115021,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"USable; Computer science; Firewall (physics); World Wide Web; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01099493926765502,"gpt":0.2260047024672377,"spread":0.2150097631995827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001007287,0.0000516972,0.00005131551,0.00002530216,0.0001028242,0.0001507307,0.0002572681,0.00002812311,0.0001783741],"category_scores_gemma":[0.00001278791,0.00004808525,0.00001570418,0.0001756714,0.0000140904,0.0004865459,0.00002997855,0.00004640182,0.0002514806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001839432,"about_ca_system_score_gemma":0.00003784552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.819177e-7,"about_ca_topic_score_gemma":0.000002288,"domain_scores_codex":[0.99949,0.0000155568,0.00009303434,0.0001509225,0.000115687,0.0001348595],"domain_scores_gemma":[0.9996539,0.00001988902,0.00003478716,0.0001964319,0.00005227314,0.00004270025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004140582,0.00008054363,0.0001853735,0.00001086396,0.000008887996,0.00000347287,0.001906691,0.01483636,0.003359261,0.1126995,0.1080322,0.7588727],"study_design_scores_gemma":[0.0001536884,0.00001622493,0.00007812028,0.000009431743,0.000001625363,0.000005068336,0.000003250008,0.8969859,0.005044772,0.008472946,0.08912829,0.0001006463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001940169,0.00006270755,0.8120396,0.004592895,0.0001437299,0.00004394581,1.93563e-7,0.0002086621,0.1809681],"genre_scores_gemma":[0.7783706,0.00001510209,0.214679,0.0008905154,0.000186193,0.000005251828,0.000002425448,0.000004079989,0.005846816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8821496,"threshold_uncertainty_score":0.3232359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}