{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"K. Pagiamtzis","is_ca":true},{"name":"Ali Sheikholeslami","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001998661,0.0007109271,0.0005126589,0.0009331888,0.0002415463,0.0008408637,0.001144323,0.0008283944,0.006888597],"category_scores_gemma":[0.0004128298,0.0003200126,0.0002754563,0.001510664,0.0002670756,0.001780838,0.0003459692,0.0004802105,0.001816713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003958906,"about_ca_system_score_gemma":0.0003199424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004466239,"about_ca_topic_score_gemma":0.0007935404,"domain_scores_codex":[0.9999038,0.00001215892,0.000009328551,0.00001775503,0.00004198927,0.00001499038],"domain_scores_gemma":[0.9998426,0.0000794033,0.00001772227,0.00001182585,0.00004200717,0.000006431242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009607931,0.00008392495,0.0005800931,0.003732631,0.000047209,0.0001684811,0.000133989,0.009609952,0.02854693,0.06873127,0.02206864,0.8662009],"study_design_scores_gemma":[0.00004898646,0.0005777305,0.0008203692,0.0007122823,0.0001780133,0.002864694,0.0001369176,0.05584839,0.04442983,0.03996431,0.8543465,0.00007206815],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.02204612,0.5791885,0.3364372,0.001314034,0.0008123528,0.0001702399,0.0003438504,0.001401063,0.05828667],"genre_scores_gemma":[0.1942211,0.4743479,0.2838245,0.001285666,0.001610341,0.000438534,0.0009324465,0.0002387653,0.04310067],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006888597,"threshold_uncertainty_score":0.02304465,"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)","authors":[{"name":"Ehab Al‐Shaer","is_ca":false},{"name":"H. Hamed","is_ca":false},{"name":"Raouf Boutaba","is_ca":true},{"name":"Milu Md Khaled Hasan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004149377,0.0004317286,0.000740686,0.002924861,0.0008899333,0.00168236,0.001463854,0.0007902164,0.00142642],"category_scores_gemma":[0.02096277,0.0002381068,0.0005472059,0.001578554,0.000699024,0.001794035,0.0007971206,0.0009966185,0.0002176027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001179128,"about_ca_system_score_gemma":0.00127654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002858972,"about_ca_topic_score_gemma":0.002052871,"domain_scores_codex":[0.9952282,0.001278034,0.0004385981,0.0007089464,0.001968241,0.0003780521],"domain_scores_gemma":[0.9775963,0.01368529,0.002224254,0.002489331,0.003493744,0.0005111918],"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.001570673,0.0007716998,0.2137033,0.0002717976,0.0003136208,0.0009992196,0.0009497964,0.2141134,0.01481859,0.04663569,0.005396324,0.5004559],"study_design_scores_gemma":[0.00002450369,0.00004100044,0.006550353,0.00001160345,0.00002564986,0.0001910854,0.0001207008,0.972639,0.006245898,0.013166,0.0009696792,0.00001443146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5335922,0.000367882,0.4586295,0.0004942571,0.00007253427,0.0002303595,0.0006241314,0.001729316,0.004259808],"genre_scores_gemma":[0.8991303,0.00005541197,0.09931254,0.00004610096,0.00002751911,0.00008326608,0.0006906692,0.00004623852,0.0006079188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004149377,"threshold_uncertainty_score":0.02194428,"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","authors":[{"name":"Igor Arsovski","is_ca":true},{"name":"Ali Sheikholeslami","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002210422,0.0003298457,0.000239894,0.0003368837,0.0003676982,0.0004117205,0.0008884087,0.0003521699,0.001673894],"category_scores_gemma":[0.001036032,0.0001877156,0.0001371996,0.0004285378,0.0003557698,0.001131398,0.0004661834,0.000302717,0.0003284039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003194197,"about_ca_system_score_gemma":0.0002380076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002120187,"about_ca_topic_score_gemma":0.0005146916,"domain_scores_codex":[0.9997433,0.00004454673,0.00002329706,0.00006421285,0.000101588,0.00002311702],"domain_scores_gemma":[0.9996073,0.0001316673,0.00007321641,0.00008695586,0.00008541266,0.00001558083],"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.0005990955,0.0001155806,0.0009839719,0.000163352,0.00003705253,0.0001793616,0.0001735481,0.009370058,0.6483819,0.01131531,0.001379707,0.327301],"study_design_scores_gemma":[0.00007463404,0.0008648719,0.001233915,0.00002683665,0.0000634642,0.0009062681,0.00007269812,0.1883282,0.7931643,0.005886832,0.009330996,0.00004713525],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1571657,0.00105314,0.8361276,0.0003376875,0.0001666547,0.0001327225,0.00007711844,0.001270129,0.00366922],"genre_scores_gemma":[0.894484,0.0001544108,0.1033003,0.0002084728,0.00006283206,0.0000588613,0.0000384423,0.0000402959,0.001652348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001673894,"threshold_uncertainty_score":0.005599797,"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","authors":[{"name":"K. Pagiamtzis","is_ca":true},{"name":"Ali Sheikholeslami","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007925239,0.0001409243,0.0001672628,0.0002758558,0.0002724649,0.0002959873,0.0009337345,0.0002607601,0.002751418],"category_scores_gemma":[0.0002906077,0.00008799459,0.000121976,0.0004693269,0.0002149252,0.0008092444,0.0002549447,0.0002100457,0.0003597481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003788729,"about_ca_system_score_gemma":0.0005057968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400314,"about_ca_topic_score_gemma":0.003241608,"domain_scores_codex":[0.9999408,0.000006238945,0.000004770181,0.00001303442,0.00002209006,0.00001314444],"domain_scores_gemma":[0.9998376,0.00003202891,0.00002759606,0.00003639548,0.00005147051,0.00001472295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005120005,0.00009576888,0.00140321,0.0003967848,0.00003376069,0.000281548,0.0001599774,0.01376615,0.5589332,0.02121661,0.006769295,0.3964317],"study_design_scores_gemma":[0.000220736,0.001609168,0.004047722,0.00005573194,0.0001761092,0.001928834,0.0001096564,0.3604028,0.5795903,0.009039154,0.04275008,0.00006977157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4652725,0.002759239,0.5036202,0.0004924549,0.0002004706,0.0002147993,0.0005789894,0.004697823,0.02216356],"genre_scores_gemma":[0.838003,0.0002311568,0.1574214,0.0001617281,0.00003165449,0.00004158476,0.0002113484,0.00003096087,0.003867146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002751418,"threshold_uncertainty_score":0.009204388,"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","authors":[{"name":"Guoqing Xiao","is_ca":true},{"name":"Kenli Li","is_ca":false},{"name":"Yuedan Chen","is_ca":true},{"name":"Wangquan He","is_ca":false},{"name":"Albert Y. Zomaya","is_ca":false},{"name":"Tao Li","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717152,0.001133923,0.0006463828,0.000550333,0.0005883629,0.0008633474,0.003760823,0.0008720697,0.008382784],"category_scores_gemma":[0.001458018,0.0005545563,0.001009442,0.0006387852,0.0006577169,0.001712691,0.001821966,0.001283001,0.001860986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007792034,"about_ca_system_score_gemma":0.001782872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006983374,"about_ca_topic_score_gemma":0.008847447,"domain_scores_codex":[0.9995528,0.00006226057,0.00002592586,0.00007642916,0.0001992771,0.00008334532],"domain_scores_gemma":[0.9996377,0.00008238963,0.00002670683,0.0001049503,0.0001026756,0.00004545829],"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.001546448,0.0003858547,0.006898553,0.0009974921,0.0005077002,0.0007141703,0.0008900908,0.2251349,0.07574811,0.04287004,0.1603813,0.4839253],"study_design_scores_gemma":[0.0002759748,0.0002032746,0.001257559,0.00004341952,0.00004377906,0.0001754012,0.00008988142,0.9026352,0.02447686,0.01152193,0.05918784,0.00008895465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03700991,0.0007201742,0.8275124,0.0002938692,0.0002066869,0.0002951322,0.001390272,0.122654,0.009917499],"genre_scores_gemma":[0.389308,0.0005793647,0.5783833,0.0004310458,0.0001053017,0.0009464488,0.007286786,0.01325479,0.009704972],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008382784,"threshold_uncertainty_score":0.02804327,"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","authors":[{"name":"Adel El‐Atawy","is_ca":false},{"name":"Ehab Al‐Shaer","is_ca":false},{"name":"Tung Tran","is_ca":true},{"name":"Raouf Boutaba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00164601,0.0004945637,0.000331182,0.0007506576,0.0003635211,0.0009313533,0.0007097583,0.0005294732,0.001315933],"category_scores_gemma":[0.003638608,0.0002791369,0.0004077838,0.0004465428,0.0005197396,0.001324752,0.0003200553,0.0007416741,0.0002731757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009448684,"about_ca_system_score_gemma":0.0008202646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001603857,"about_ca_topic_score_gemma":0.001891118,"domain_scores_codex":[0.999128,0.0003075922,0.00006489765,0.0001089604,0.0003001919,0.00009031232],"domain_scores_gemma":[0.9981824,0.001174615,0.0001789145,0.0001893191,0.0002351582,0.00003964199],"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.0009423151,0.000345334,0.003744798,0.0003235317,0.00006377354,0.0001712757,0.0001514024,0.4622405,0.08967191,0.07616589,0.001949032,0.3642302],"study_design_scores_gemma":[0.000047941,0.0001703784,0.0003390824,0.00002216768,0.00003473194,0.00005247132,0.00001228332,0.9596677,0.02473244,0.01290886,0.001995606,0.00001635104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05669484,0.0002960385,0.9398206,0.0001156265,0.00004650004,0.00007189146,0.00004641617,0.001276038,0.001631942],"genre_scores_gemma":[0.7212228,0.0003824517,0.276234,0.0001151052,0.0000264593,0.00008495033,0.0001293611,0.00009700606,0.001707833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00164601,"threshold_uncertainty_score":0.00870502,"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","authors":[{"name":"K. Pagiamtzis","is_ca":true},{"name":"Ali Sheikholeslami","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008637107,0.0001991748,0.0001155593,0.0002183592,0.0002453976,0.0003034218,0.000685265,0.0002779175,0.003572465],"category_scores_gemma":[0.0003070447,0.0001450356,0.0001653974,0.0003601632,0.0002134821,0.0008327453,0.0002190802,0.0002449291,0.0004844544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003234867,"about_ca_system_score_gemma":0.0003163479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006783867,"about_ca_topic_score_gemma":0.002347801,"domain_scores_codex":[0.999933,0.000009429054,0.000004824606,0.00001336704,0.00002752998,0.00001190349],"domain_scores_gemma":[0.9998558,0.00004216329,0.00002729407,0.00002824917,0.00003786542,0.00000862118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006906445,0.0001065723,0.001676146,0.0004437689,0.00006074548,0.0002850269,0.0001586771,0.03351135,0.5030842,0.03167346,0.005887081,0.4224222],"study_design_scores_gemma":[0.0002042999,0.001729933,0.002986798,0.0000515778,0.0001683826,0.001077514,0.000128116,0.3782727,0.5394176,0.01795632,0.05794625,0.00006054004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2738621,0.002777873,0.7050492,0.0003455314,0.00009581982,0.0001474607,0.0002865337,0.003560137,0.01387536],"genre_scores_gemma":[0.7810786,0.0004102523,0.2126504,0.0001395595,0.00004405146,0.00007305546,0.0002227801,0.00007842791,0.005302818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003572465,"threshold_uncertainty_score":0.01195109,"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","authors":[{"name":"Perng-Fei Lin","is_ca":false},{"name":"J.B. Kuo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001031361,0.0001809843,0.0003350794,0.000327515,0.0003433845,0.0004289387,0.001816615,0.0004185195,0.003036267],"category_scores_gemma":[0.0002339307,0.0001391473,0.000190746,0.0006391137,0.0002022,0.0007154271,0.0002984494,0.0002546437,0.00072524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003602245,"about_ca_system_score_gemma":0.00050386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008601946,"about_ca_topic_score_gemma":0.002301348,"domain_scores_codex":[0.9998934,0.00001056937,0.000007021879,0.00002532602,0.00003921438,0.00002435856],"domain_scores_gemma":[0.9998097,0.0000351539,0.00003256153,0.00002828917,0.00007082074,0.00002355206],"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.0007534461,0.0003132143,0.004150191,0.0006728895,0.0001402807,0.0008591862,0.0001563479,0.002785892,0.8028938,0.005246773,0.01106148,0.1709665],"study_design_scores_gemma":[0.0002771072,0.003593703,0.004066872,0.00006977994,0.000371719,0.003154953,0.0001486189,0.03830295,0.8975284,0.001475482,0.0509022,0.0001082298],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8686832,0.004500252,0.09476665,0.0005796923,0.0006252484,0.0002716174,0.001227185,0.004574821,0.02477133],"genre_scores_gemma":[0.9325871,0.0006260456,0.0588821,0.0003917608,0.00006095173,0.00008555833,0.0007964304,0.00004358763,0.006526461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003036267,"threshold_uncertainty_score":0.01015729,"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","authors":[{"name":"Patrick McDaniel","is_ca":false},{"name":"William Aiello","is_ca":true},{"name":"Kevin Butler","is_ca":false},{"name":"John P. A. Ioannidis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005525171,0.0007333751,0.001626381,0.001222949,0.001695026,0.003326765,0.002255958,0.002294156,0.003750689],"category_scores_gemma":[0.02684968,0.0007769805,0.0005171763,0.002177274,0.002934109,0.007702456,0.00356458,0.002858298,0.0007147211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00154153,"about_ca_system_score_gemma":0.001776188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001497261,"about_ca_topic_score_gemma":0.00151086,"domain_scores_codex":[0.9967121,0.001809001,0.0001099968,0.0003777887,0.000562595,0.0004284506],"domain_scores_gemma":[0.9825103,0.01217323,0.0009254154,0.002344202,0.001549628,0.0004972061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007180125,0.0001485742,0.001963524,0.0001174972,0.00004605597,0.0001510533,0.0002792988,0.3298849,0.00130718,0.5951266,0.005851756,0.0644056],"study_design_scores_gemma":[0.00003162072,0.00003807786,0.0001803096,0.00001456408,0.00001792886,0.0000387783,0.0000692098,0.767099,0.0005624697,0.2309436,0.0009923712,0.00001211878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05501187,0.001041799,0.9349905,0.001580886,0.0001949219,0.00007330939,0.00006227475,0.0002611195,0.006783239],"genre_scores_gemma":[0.921324,0.001037542,0.07199887,0.0001675547,0.0002565043,0.00008441482,0.00009273587,0.00009816125,0.004940266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005525171,"threshold_uncertainty_score":0.02922022,"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","authors":[{"name":"Xuehong Sun","is_ca":true},{"name":"Sartaj Sahni","is_ca":false},{"name":"Y.Q. Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279887,0.001333952,0.001251345,0.001943946,0.001077565,0.002851587,0.00341305,0.0009676749,0.01851182],"category_scores_gemma":[0.003468305,0.0006314158,0.0008160111,0.002422827,0.000441478,0.004534547,0.001295045,0.001045821,0.01399298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001298167,"about_ca_system_score_gemma":0.001722378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004640172,"about_ca_topic_score_gemma":0.004383175,"domain_scores_codex":[0.998589,0.0001173655,0.0001098657,0.0003666202,0.0006125855,0.0002045582],"domain_scores_gemma":[0.9972844,0.0007873766,0.0001502588,0.0009487351,0.0007220377,0.0001071905],"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.0006585187,0.0002027751,0.001679761,0.0002238231,0.0001032061,0.0001980786,0.00006575369,0.01259645,0.02725232,0.004548457,0.02566612,0.9268047],"study_design_scores_gemma":[0.0003931246,0.0005402284,0.005062222,0.0001187286,0.0003925229,0.001346034,0.0002879424,0.7324094,0.1408662,0.02053982,0.09788821,0.0001556429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07504954,0.002881451,0.8489774,0.001575578,0.0008923253,0.0006468692,0.001107096,0.03100931,0.03786046],"genre_scores_gemma":[0.4084292,0.00140175,0.5327566,0.0008898782,0.0004528441,0.0008330202,0.003891099,0.0008749134,0.05047064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01851182,"threshold_uncertainty_score":0.06192827,"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","authors":[{"name":"Oleksiy Tyshchenko","is_ca":true},{"name":"Ali Sheikholeslami","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002370406,0.0002388291,0.0002095248,0.0004079608,0.0003096192,0.0004858042,0.0008969077,0.000454915,0.001187331],"category_scores_gemma":[0.001280855,0.0001797795,0.0001246719,0.0004197277,0.0004350929,0.001321474,0.0005294159,0.0002814858,0.0002665884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004631834,"about_ca_system_score_gemma":0.0002353911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003291558,"about_ca_topic_score_gemma":0.0008056705,"domain_scores_codex":[0.9997593,0.00003896488,0.00001755449,0.00005610536,0.0001042376,0.00002391996],"domain_scores_gemma":[0.999268,0.0002642004,0.0001746421,0.0001050438,0.0001639727,0.00002405674],"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.0007448993,0.00007864557,0.002355284,0.0002078374,0.00003291351,0.0003142648,0.0002878134,0.01217256,0.7767362,0.01256357,0.001661678,0.1928443],"study_design_scores_gemma":[0.00004645059,0.0005594865,0.001182416,0.00001844761,0.00003772993,0.0006226393,0.00005811043,0.1665678,0.8215192,0.003571667,0.005783453,0.00003266615],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4858574,0.001435469,0.5030336,0.0003630733,0.0001625273,0.0001346781,0.0001213291,0.002096649,0.006795236],"genre_scores_gemma":[0.9459084,0.00007896021,0.05260853,0.0001283777,0.0000301582,0.0000291149,0.00003323146,0.00002976404,0.001153534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001187331,"threshold_uncertainty_score":0.003971994,"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","authors":[{"name":"Yaser Jararweh","is_ca":false},{"name":"Lo’ai Tawalbeh","is_ca":false},{"name":"Hala Tawalbeh","is_ca":false},{"name":"Abidalrahman Moh’d","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001791084,0.0006903654,0.0005755139,0.001600206,0.0007286834,0.001126664,0.001209436,0.0005321208,0.005713108],"category_scores_gemma":[0.005532441,0.0001620373,0.0002847959,0.00159581,0.0004546554,0.001681379,0.0006177241,0.0004240173,0.001132359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001489736,"about_ca_system_score_gemma":0.00117146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001203419,"about_ca_topic_score_gemma":0.001007142,"domain_scores_codex":[0.9969214,0.0007197821,0.0002773087,0.0003135757,0.001335065,0.0004329612],"domain_scores_gemma":[0.9949687,0.002102829,0.0003720352,0.0006784413,0.001704897,0.0001731112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.01369191,0.0008705515,0.01791275,0.001665119,0.0004055653,0.000430975,0.0004445098,0.268144,0.09476933,0.02486296,0.01562859,0.5611738],"study_design_scores_gemma":[0.0004182173,0.00712723,0.008164675,0.0001456597,0.0002300908,0.001021028,0.0004378896,0.7491238,0.2168113,0.003615216,0.01278901,0.0001158647],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8248846,0.005669597,0.1413545,0.0006503024,0.0003716796,0.0003261632,0.0008021081,0.004701139,0.02123987],"genre_scores_gemma":[0.9697826,0.000649992,0.0254717,0.00005308256,0.00003690798,0.00007943597,0.0005635648,0.00006668783,0.003295945],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005713108,"threshold_uncertainty_score":0.01911223,"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","authors":[{"name":"Tung Tran","is_ca":true},{"name":"Ehab Al‐Shaer","is_ca":true},{"name":"Raouf Boutaba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411964,0.001112973,0.0005222263,0.001770805,0.0004780764,0.002333913,0.001412439,0.001335154,0.007776598],"category_scores_gemma":[0.004604599,0.0006511856,0.0006913185,0.0006744585,0.0006092211,0.002642784,0.001640325,0.001323558,0.001809051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005974387,"about_ca_system_score_gemma":0.001217304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003181989,"about_ca_topic_score_gemma":0.001968506,"domain_scores_codex":[0.9993528,0.0001397382,0.00006055555,0.0001050881,0.0002775776,0.00006427383],"domain_scores_gemma":[0.99861,0.0005936284,0.000123997,0.0002826685,0.0002546436,0.000134964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001268297,0.0005487848,0.009230141,0.0009634271,0.0001805833,0.001123324,0.003224955,0.03705152,0.08820314,0.06153958,0.1440187,0.6526476],"study_design_scores_gemma":[0.0001798857,0.0001660683,0.004342695,0.000250649,0.00005577571,0.001104646,0.0004751677,0.6229933,0.1373279,0.04086817,0.1920854,0.000150483],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009660409,0.0001191583,0.8000654,0.0003918356,0.00006329206,0.0001450239,0.001250018,0.1840284,0.004276515],"genre_scores_gemma":[0.2018983,0.0006404301,0.7729422,0.0003586223,0.00005225406,0.0004782116,0.004350081,0.01026747,0.009012287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007776598,"threshold_uncertainty_score":0.02601528,"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","authors":[{"name":"Daniel Hoffman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193841,0.00130801,0.0007449943,0.00156346,0.0008229104,0.00139636,0.003141822,0.001358771,0.1302162],"category_scores_gemma":[0.003562971,0.0008555697,0.001126728,0.0007607801,0.0008415009,0.002948521,0.002951848,0.001760807,0.03470889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008712113,"about_ca_system_score_gemma":0.001202135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003505187,"about_ca_topic_score_gemma":0.003588997,"domain_scores_codex":[0.9987098,0.00008682195,0.00006406632,0.0001920578,0.0007422874,0.0002049182],"domain_scores_gemma":[0.9986876,0.0003824424,0.00006743898,0.0003600193,0.0004172093,0.00008543814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001525931,0.0002191743,0.002205296,0.001679654,0.0001097962,0.0008622648,0.0003582228,0.01228323,0.03766104,0.03732761,0.5018877,0.4038801],"study_design_scores_gemma":[0.0003803006,0.0003757736,0.002920334,0.0002500216,0.00008937618,0.001282653,0.0001059777,0.06823523,0.07965576,0.02459132,0.8219443,0.0001689614],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"other","genre_scores_codex":[0.02282368,0.001340394,0.2029913,0.0006872995,0.0006351822,0.001262006,0.01318013,0.5260875,0.2309926],"genre_scores_gemma":[0.2605406,0.001533849,0.2683986,0.002039416,0.0002328935,0.001938877,0.07165916,0.1072176,0.2864391],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1302162,"threshold_uncertainty_score":0,"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","authors":[{"name":"Johnny Tsung Lin Ho","is_ca":true},{"name":"Guy Lemieux","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004037948,0.0009787346,0.000588052,0.001312741,0.0003410343,0.001152653,0.002717451,0.0005419067,0.01002937],"category_scores_gemma":[0.0009139359,0.0005224618,0.0003625306,0.001107652,0.0003499207,0.001780892,0.0007657413,0.0005464168,0.003427336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00110408,"about_ca_system_score_gemma":0.001034021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003962298,"about_ca_topic_score_gemma":0.00436227,"domain_scores_codex":[0.9993711,0.00005418624,0.00005087419,0.0001370561,0.0002834032,0.0001034166],"domain_scores_gemma":[0.9995895,0.00009631171,0.00005082832,0.0001174634,0.000111455,0.0000344259],"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.002344025,0.0004162761,0.005116611,0.0007994781,0.0002367647,0.0008067407,0.000174057,0.04003056,0.0902666,0.01686937,0.06875329,0.7741862],"study_design_scores_gemma":[0.0005827522,0.0009657834,0.002430882,0.0001073383,0.00017221,0.001321559,0.00008518745,0.6943396,0.1927215,0.01101606,0.09610403,0.0001530683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07778279,0.002522558,0.7775065,0.0003154167,0.0003706733,0.0006319705,0.001618003,0.1098115,0.02944058],"genre_scores_gemma":[0.4708156,0.0008640704,0.4983748,0.0007792895,0.00008817812,0.0004090277,0.00396779,0.001252681,0.02344855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01002937,"threshold_uncertainty_score":0.03355163,"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","authors":[{"name":"Zefu Dai","is_ca":true},{"name":"Nick Ni","is_ca":true},{"name":"Jianwen Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003405223,0.0004632094,0.0004256995,0.0004769526,0.0003841965,0.000700073,0.001208403,0.0005754146,0.01289022],"category_scores_gemma":[0.0006440863,0.0003188596,0.0002922946,0.0005025328,0.0001383343,0.0008109953,0.0004489425,0.0006967338,0.002881869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006054369,"about_ca_system_score_gemma":0.001205294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090713,"about_ca_topic_score_gemma":0.001342673,"domain_scores_codex":[0.9996878,0.00003405573,0.00002496406,0.00006486816,0.0001280787,0.00006025654],"domain_scores_gemma":[0.9996424,0.00008586306,0.00004878073,0.00005044419,0.000127222,0.00004530404],"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.002248918,0.0005361947,0.005908881,0.000844757,0.000165782,0.0006801985,0.0003035498,0.03251239,0.4033555,0.0299357,0.06618384,0.4573242],"study_design_scores_gemma":[0.0004316924,0.00227337,0.005946216,0.0001167004,0.0002151699,0.001830706,0.00008848951,0.419135,0.3079263,0.004323191,0.2575201,0.0001930103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.191753,0.001850917,0.7014771,0.001451046,0.00117892,0.0008276646,0.001850809,0.04304601,0.05656454],"genre_scores_gemma":[0.6530887,0.0004959388,0.3053893,0.001004072,0.0001971083,0.0003478971,0.001972207,0.0005817153,0.03692304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01289022,"threshold_uncertainty_score":0.04312205,"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","authors":[{"name":"N. Mohan","is_ca":true},{"name":"Manoj Sachdev","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007899223,0.0003863616,0.000242961,0.000506146,0.0004423608,0.0003854151,0.0009343721,0.0003992869,0.004760606],"category_scores_gemma":[0.0005297771,0.0001405321,0.0003061581,0.0007783704,0.0002723615,0.0008603725,0.0003428694,0.000336162,0.0007900349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003475145,"about_ca_system_score_gemma":0.0003645968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000598893,"about_ca_topic_score_gemma":0.001468652,"domain_scores_codex":[0.9998834,0.00001070998,0.000007875205,0.00001762604,0.00006192214,0.00001838163],"domain_scores_gemma":[0.999775,0.00005795575,0.00003946724,0.00004028011,0.00008008601,0.000007196264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002658964,0.0001582738,0.0009131039,0.000337549,0.0000685533,0.0004590814,0.0002157702,0.02286581,0.4566768,0.02529419,0.00949601,0.483249],"study_design_scores_gemma":[0.00008310993,0.0009517286,0.001683691,0.00008666959,0.000302191,0.003023066,0.0001421921,0.29183,0.6393743,0.0148636,0.04761018,0.00004925576],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1575414,0.004690047,0.7982842,0.000953219,0.0004953018,0.0001686279,0.0002551804,0.004982113,0.03262975],"genre_scores_gemma":[0.7824972,0.001021331,0.2000736,0.0006281221,0.0001632392,0.00009586806,0.0002426965,0.0001758145,0.01510211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004760606,"threshold_uncertainty_score":0.01592577,"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","authors":[{"name":"N. Mohan","is_ca":true},{"name":"Manoj Sachdev","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007178438,0.0002035494,0.0002967276,0.0002663293,0.0002623276,0.0006804341,0.001119999,0.0004371194,0.0063473],"category_scores_gemma":[0.0005085936,0.0001187164,0.0001077707,0.0004447499,0.0002087802,0.00123509,0.0004372508,0.0003166355,0.001059996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003947859,"about_ca_system_score_gemma":0.0003474299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003129355,"about_ca_topic_score_gemma":0.0009505724,"domain_scores_codex":[0.9998399,0.00001319068,0.000007233509,0.00002738743,0.00008469691,0.00002750913],"domain_scores_gemma":[0.9997581,0.00006185672,0.00005918536,0.00003989647,0.00006158543,0.00001930567],"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.001140386,0.000157393,0.002745586,0.000430758,0.00004685236,0.0006372304,0.0001451217,0.006762472,0.7546515,0.02003333,0.007985365,0.2052639],"study_design_scores_gemma":[0.0001617834,0.001651059,0.002009511,0.00004523404,0.0001093203,0.002353329,0.0001077539,0.1644903,0.7883129,0.00569814,0.03501948,0.00004117003],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.702749,0.00324913,0.2430783,0.0009079813,0.0003662467,0.0001271878,0.0006057672,0.00309171,0.04582471],"genre_scores_gemma":[0.9550682,0.0001895325,0.03694541,0.0002006018,0.00004952078,0.00003029406,0.0001703535,0.0000476194,0.007298498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0063473,"threshold_uncertainty_score":0.02123386,"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","authors":[{"name":"Ivan Leonidovitch. Chvets","is_ca":true},{"name":"M.H. MacGregor","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006593211,0.0004661959,0.000440017,0.0008888867,0.0005107954,0.00104649,0.002607403,0.0006160197,0.004559357],"category_scores_gemma":[0.002940267,0.0003489507,0.0002741463,0.001679427,0.0002562132,0.002597671,0.0007043795,0.0007579381,0.0009435177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070037,"about_ca_system_score_gemma":0.0008024887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001588143,"about_ca_topic_score_gemma":0.005755914,"domain_scores_codex":[0.9994757,0.00009958077,0.00004084067,0.00006146794,0.0002313301,0.00009104858],"domain_scores_gemma":[0.9971064,0.001044428,0.0002804505,0.000761997,0.00071795,0.00008892498],"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.002429938,0.0004608586,0.006767977,0.0008852506,0.0001999758,0.0004208625,0.0003577422,0.1783517,0.2192196,0.08834967,0.02392909,0.4786273],"study_design_scores_gemma":[0.0002349869,0.00097486,0.001454461,0.00009876687,0.0002329422,0.0008234509,0.0001205857,0.725447,0.2088436,0.01831357,0.04337457,0.00008123596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.29461,0.009357865,0.6725733,0.0005535014,0.0003557756,0.0001468512,0.000427338,0.00850275,0.0134727],"genre_scores_gemma":[0.7493328,0.00103956,0.2416339,0.0001356486,0.00008802964,0.0001450676,0.0004114744,0.0001985607,0.007014993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004559357,"threshold_uncertainty_score":0.01525259,"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","authors":[{"name":"Bingnan Hou","is_ca":false},{"name":"Zhiping Cai","is_ca":false},{"name":"Kui Wu","is_ca":true},{"name":"Tao Yang","is_ca":false},{"name":"Tongqing Zhou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003053346,0.0007836657,0.00143765,0.003863562,0.0008012036,0.002400981,0.001662042,0.001147379,0.002438714],"category_scores_gemma":[0.01237086,0.0006065828,0.0005466836,0.002688622,0.001266797,0.005507707,0.003628828,0.001083699,0.000731379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005907887,"about_ca_system_score_gemma":0.001226696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001386191,"about_ca_topic_score_gemma":0.002123917,"domain_scores_codex":[0.9984536,0.0005386826,0.00008943338,0.0002668216,0.0005004871,0.0001509385],"domain_scores_gemma":[0.9942746,0.003192544,0.0004593796,0.0009645112,0.0007766724,0.0003322258],"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.0007840501,0.0003615207,0.02029874,0.0005062917,0.0001637897,0.0005370833,0.001377928,0.2532324,0.01358833,0.1414547,0.01252381,0.5551714],"study_design_scores_gemma":[0.00008820366,0.0003058792,0.002069127,0.0001304832,0.00006168835,0.0003798279,0.0004930698,0.9027006,0.006309626,0.07435669,0.01306291,0.00004191726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1368184,0.002102201,0.8477415,0.0006653481,0.00008248939,0.0002719741,0.0006600256,0.002799981,0.008857968],"genre_scores_gemma":[0.5645018,0.0008397918,0.4297723,0.0003176814,0.00009190667,0.0002728652,0.001390227,0.0003876552,0.002425768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003863562,"threshold_uncertainty_score":0.01614785,"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","authors":[{"name":"Alexander Kesselman","is_ca":false},{"name":"Kirill Kogan","is_ca":true},{"name":"Sergey Nemzer","is_ca":false},{"name":"Michael Segal","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001564889,0.000479997,0.0005859022,0.00107932,0.0009334734,0.001511765,0.001340654,0.000859061,0.004233688],"category_scores_gemma":[0.009491011,0.0003254482,0.0002458552,0.001562186,0.0004643743,0.002920214,0.0007525714,0.0005722629,0.000395346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001805923,"about_ca_system_score_gemma":0.001925892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004139545,"about_ca_topic_score_gemma":0.01193311,"domain_scores_codex":[0.9991028,0.0003205038,0.00005166438,0.000101854,0.0002380869,0.0001850599],"domain_scores_gemma":[0.9927921,0.005474267,0.0002693926,0.0005187229,0.000805376,0.0001401587],"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.00217734,0.0003524937,0.006787177,0.0003291447,0.00009189637,0.0001465246,0.0004207887,0.4963626,0.02018692,0.05401251,0.0122323,0.4069002],"study_design_scores_gemma":[0.00003235816,0.0001851289,0.0007591752,0.0000140134,0.00002978672,0.00007029913,0.00009375796,0.9829689,0.005369251,0.00966839,0.0007978099,0.00001119845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7495332,0.004417485,0.2265613,0.002630436,0.0002542964,0.0001057988,0.000390603,0.001706149,0.01440079],"genre_scores_gemma":[0.9664508,0.0002711095,0.03042239,0.0001402302,0.00005002187,0.00003547711,0.0001203187,0.00005172139,0.002457967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004233688,"threshold_uncertainty_score":0.01416308,"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","authors":[{"name":"Naoya Onizawa","is_ca":true},{"name":"Shoun Matsunaga","is_ca":false},{"name":"Vincent Gaudet","is_ca":true},{"name":"Warren J. Gross","is_ca":true},{"name":"Takahiro Hanyu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001250359,0.0002555122,0.0003404016,0.0004795019,0.0002561175,0.0004058553,0.001726059,0.000303964,0.002385629],"category_scores_gemma":[0.0003987977,0.0001613651,0.0001868941,0.0004816637,0.0001868087,0.000929176,0.0003257764,0.0002241302,0.0003498858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003547626,"about_ca_system_score_gemma":0.0004441236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006020072,"about_ca_topic_score_gemma":0.001645355,"domain_scores_codex":[0.9998536,0.00001549276,0.00001089007,0.00003438163,0.00005905304,0.00002662829],"domain_scores_gemma":[0.9996794,0.00006586928,0.00006778381,0.00007301418,0.00009239122,0.00002155395],"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.001187082,0.0002165769,0.002464553,0.000509025,0.00009707253,0.0008677911,0.0002498192,0.02630761,0.7455847,0.01669819,0.005993955,0.1998237],"study_design_scores_gemma":[0.000264938,0.00148188,0.002186722,0.00005615799,0.0001628731,0.00183452,0.00008453902,0.4204306,0.5460583,0.003679285,0.02367311,0.00008710122],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5712851,0.003811226,0.4023539,0.0002793813,0.0003179966,0.0001688389,0.0003684578,0.005839844,0.01557537],"genre_scores_gemma":[0.9383987,0.0002122205,0.05798595,0.000101207,0.00003480751,0.00005949995,0.0001441197,0.00007107615,0.002992462],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002385629,"threshold_uncertainty_score":0.007980704,"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","authors":[{"name":"Nitin Mohan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001258968,0.0002028051,0.0002536212,0.0003043256,0.0003110678,0.001080451,0.0008847083,0.0003564254,0.01475095],"category_scores_gemma":[0.0006324232,0.0000835212,0.0001080817,0.0003985682,0.0001713917,0.001190777,0.0004147907,0.0003823457,0.00234487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006420124,"about_ca_system_score_gemma":0.0005184638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004071782,"about_ca_topic_score_gemma":0.002008926,"domain_scores_codex":[0.9998782,0.00001336665,0.000006288869,0.00001583691,0.00005671697,0.00002960311],"domain_scores_gemma":[0.9998154,0.00005933208,0.00002342646,0.00002634261,0.0000637803,0.00001174151],"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.0006064677,0.000192117,0.001067339,0.0008774062,0.00006346808,0.0003297632,0.0003385782,0.008811727,0.3966516,0.1454076,0.05454563,0.3911083],"study_design_scores_gemma":[0.0001651081,0.0006705857,0.001967627,0.0002646973,0.000166194,0.001012847,0.0002254716,0.1854881,0.5707431,0.05508365,0.1841549,0.00005781744],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4218304,0.01189434,0.2293425,0.004202563,0.001523035,0.0002409239,0.001718736,0.005071403,0.3241761],"genre_scores_gemma":[0.9100741,0.00145062,0.03660136,0.0004581327,0.0001771962,0.00005729543,0.0006520329,0.0001642703,0.05036505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01475095,"threshold_uncertainty_score":0.04934686,"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","authors":[{"name":"Robert D. Cameron","is_ca":true},{"name":"Thomas C. Shermer","is_ca":true},{"name":"Arrvindh Shriraman","is_ca":true},{"name":"Kenneth S. Herdy","is_ca":true},{"name":"Dan Lin","is_ca":true},{"name":"Benjamin R. Hull","is_ca":true},{"name":"Lin Meng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001589612,0.0007660639,0.001041128,0.001399928,0.0007899273,0.001918155,0.002438107,0.0008306725,0.00429368],"category_scores_gemma":[0.003893698,0.0005384065,0.001111335,0.002592738,0.001449993,0.003114124,0.002070758,0.001593461,0.002688198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001068394,"about_ca_system_score_gemma":0.001740388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001963043,"about_ca_topic_score_gemma":0.002291639,"domain_scores_codex":[0.9978393,0.0004503809,0.0002238122,0.0004881266,0.0007545821,0.0002436136],"domain_scores_gemma":[0.9979039,0.0006398991,0.0001692242,0.0007626188,0.0004591139,0.0000652411],"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.0005782136,0.0001813796,0.001495242,0.0002805316,0.00006451229,0.0002523264,0.0003508832,0.08657317,0.03148146,0.1517828,0.009061989,0.7178976],"study_design_scores_gemma":[0.000112284,0.0001304705,0.0002768815,0.00003972945,0.00002820275,0.0002971262,0.00009177288,0.7197747,0.05067543,0.2105681,0.01795313,0.00005210125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007883564,0.0001276915,0.9875031,0.0001248471,0.00004147497,0.00006406004,0.00007781023,0.002083977,0.002093439],"genre_scores_gemma":[0.09984498,0.0001967313,0.8946201,0.0001448309,0.00004242473,0.0001959665,0.0004455159,0.0006564404,0.003853053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00429368,"threshold_uncertainty_score":0.01436377,"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","authors":[{"name":"Shuping Ji","is_ca":true},{"name":"Hans‐Arno Jacobsen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008160351,0.00056967,0.0009494238,0.001342194,0.0006520706,0.001369959,0.001450128,0.0005611358,0.003024187],"category_scores_gemma":[0.005174197,0.0002810902,0.0007781101,0.003472073,0.0004505208,0.003442001,0.001315561,0.0007605521,0.001005237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009113204,"about_ca_system_score_gemma":0.001771852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003264848,"about_ca_topic_score_gemma":0.004762508,"domain_scores_codex":[0.9987105,0.0001765309,0.0001469041,0.0002157877,0.0006013053,0.0001489664],"domain_scores_gemma":[0.9982563,0.0006586135,0.0001482517,0.0005082095,0.000345517,0.00008321134],"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.0006317106,0.0003956482,0.006845889,0.000436182,0.0001169972,0.0003850695,0.0003410045,0.09410629,0.05619137,0.03850555,0.0291629,0.7728813],"study_design_scores_gemma":[0.00006102654,0.0001539673,0.0008956068,0.00001478022,0.0000358431,0.0002844128,0.0001303485,0.937313,0.02001552,0.03039462,0.01067696,0.00002402627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06944394,0.0007468538,0.9142327,0.0004486249,0.0001084581,0.0002547919,0.001631109,0.008114597,0.005018958],"genre_scores_gemma":[0.4567328,0.000545498,0.530444,0.0004896857,0.00009880958,0.0002994441,0.00616382,0.0005984682,0.004627432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003264848,"threshold_uncertainty_score":0.01011693,"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","authors":[{"name":"Naoya Onizawa","is_ca":true},{"name":"Shoun Matsunaga","is_ca":false},{"name":"Vincent Gaudet","is_ca":true},{"name":"Takahiro Hanyu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009583565,0.0001545557,0.0002417469,0.000350656,0.00020415,0.0003201023,0.001149044,0.0002155273,0.001571164],"category_scores_gemma":[0.0002709722,0.0001150999,0.000125219,0.0003420247,0.0001677149,0.0007356486,0.0002511947,0.0001471965,0.0002642971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002581385,"about_ca_system_score_gemma":0.0002893989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003158937,"about_ca_topic_score_gemma":0.0008384782,"domain_scores_codex":[0.9999145,0.000009729094,0.000006995985,0.00001675486,0.00003538571,0.00001660038],"domain_scores_gemma":[0.9998206,0.00004285771,0.00004448459,0.00002769174,0.00005171244,0.00001269055],"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.0006377953,0.0001374017,0.00198009,0.0003382521,0.000056184,0.0005854541,0.0001770865,0.008666982,0.8428141,0.01572288,0.003567248,0.1253165],"study_design_scores_gemma":[0.0001995541,0.00107007,0.001810358,0.0000331676,0.0001415581,0.001671603,0.00006669337,0.2010223,0.7727764,0.003702807,0.01744804,0.00005733516],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7145893,0.002260095,0.265444,0.0002145435,0.0001730357,0.0001103801,0.0001976894,0.00339286,0.01361815],"genre_scores_gemma":[0.9625995,0.0001588089,0.03468477,0.00006398879,0.00002576279,0.0000428166,0.00007938041,0.0000303977,0.002314572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001571164,"threshold_uncertainty_score":0.005256116,"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","authors":[{"name":"S. Kasnavi","is_ca":true},{"name":"Vincent Gaudet","is_ca":true},{"name":"Paul Berube","is_ca":true},{"name":"José Nelson Amaral","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003094645,0.0002947323,0.0002766525,0.0004599704,0.0005448288,0.0005091829,0.001093442,0.0003905689,0.004437633],"category_scores_gemma":[0.001090856,0.0001708671,0.0001870085,0.0009797987,0.0003008698,0.000998989,0.0005373757,0.000379157,0.0008757334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005787498,"about_ca_system_score_gemma":0.0009032514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004754669,"about_ca_topic_score_gemma":0.001109365,"domain_scores_codex":[0.9996393,0.00006842974,0.00005102206,0.00005896268,0.000139506,0.00004283376],"domain_scores_gemma":[0.9995746,0.0000778658,0.00006604528,0.0001695783,0.00009610623,0.0000157652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005103446,0.0001241102,0.0006704074,0.0006145079,0.00006042218,0.0002850484,0.0001845174,0.01766692,0.3558742,0.09226486,0.01112721,0.5206175],"study_design_scores_gemma":[0.0002739948,0.001731146,0.0009715682,0.0001081831,0.0001280935,0.001637616,0.0001156659,0.2792095,0.55518,0.03701868,0.1235399,0.00008582015],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07597964,0.001634925,0.9031493,0.0004615679,0.0004564167,0.0003217725,0.0003690157,0.003906319,0.01372113],"genre_scores_gemma":[0.5238067,0.0005046845,0.4677558,0.0002668112,0.0001220141,0.0001930509,0.0002991831,0.00009640563,0.006955443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004437633,"threshold_uncertainty_score":0.01484531,"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","authors":[{"name":"Ratish Mohan","is_ca":false},{"name":"Anis Yazidi","is_ca":false},{"name":"Boning Feng","is_ca":false},{"name":"B. John Oommen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002873911,0.0007272239,0.0006794552,0.0004508808,0.0004378571,0.0011575,0.001692415,0.001053983,0.00128719],"category_scores_gemma":[0.006254368,0.0003051342,0.000391243,0.0003696083,0.0009200475,0.002115619,0.0009947066,0.001557921,0.0002420241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001000103,"about_ca_system_score_gemma":0.001419596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001901215,"about_ca_topic_score_gemma":0.001711933,"domain_scores_codex":[0.99905,0.0003276345,0.00004546922,0.0001594554,0.0002783647,0.0001390772],"domain_scores_gemma":[0.9965506,0.002009961,0.0004531321,0.000431692,0.0003960389,0.0001585557],"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.0002031405,0.000228064,0.001432577,0.00004146263,0.00003831519,0.00003530905,0.00003768902,0.9013097,0.01446085,0.02347915,0.000873522,0.05786027],"study_design_scores_gemma":[0.000005479224,0.00004293793,0.00006323896,0.000001918213,0.000002454923,0.000006665306,0.000003880241,0.9958475,0.001690374,0.002197106,0.0001353641,0.000003137028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06917334,0.0001444636,0.927075,0.0003082338,0.00004208504,0.00005269317,0.00002429237,0.0004769481,0.002702875],"genre_scores_gemma":[0.8370638,0.0001049478,0.1613651,0.0001437658,0.00004062897,0.0000637519,0.00004403962,0.00009192171,0.001081844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002873911,"threshold_uncertainty_score":0.01519889,"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","authors":[{"name":"Pilin Junsangsri","is_ca":false},{"name":"Jie Han","is_ca":true},{"name":"Fabrizio Lombardi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001514644,0.0002344852,0.0002903003,0.0003450964,0.0002196746,0.0005088792,0.001169523,0.0004488253,0.002304141],"category_scores_gemma":[0.0005727673,0.00007919655,0.0002119177,0.0004040953,0.0001295909,0.0006381074,0.0002216359,0.0001537991,0.0003765926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004593435,"about_ca_system_score_gemma":0.0003683876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100731,"about_ca_topic_score_gemma":0.0008696868,"domain_scores_codex":[0.9998047,0.00003129274,0.00001090542,0.00003506843,0.0000941879,0.00002396304],"domain_scores_gemma":[0.9996285,0.00005999478,0.00004323269,0.00004409227,0.0002001409,0.00002390042],"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.001169223,0.0002685997,0.00436103,0.001415468,0.0001535697,0.0007938918,0.0002276383,0.05446349,0.6212937,0.007521094,0.006156217,0.3021761],"study_design_scores_gemma":[0.0001712613,0.00424715,0.004831822,0.00006450657,0.0002808992,0.001718854,0.0001651003,0.3622086,0.5895391,0.001208107,0.03550327,0.00006128516],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7939067,0.008274242,0.1655313,0.0006827673,0.0006838767,0.0003530766,0.0007851243,0.001742931,0.02803996],"genre_scores_gemma":[0.9631274,0.0007907806,0.03216305,0.0001167379,0.00005003815,0.00006748251,0.000200809,0.00002837225,0.003455337],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002304141,"threshold_uncertainty_score":0.007708132,"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","authors":[{"name":"Ameer Abdelhadi","is_ca":true},{"name":"Guy Lemieux","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007854275,0.0002657195,0.0001878214,0.000426775,0.000156728,0.0002873145,0.000988643,0.0002101464,0.002829623],"category_scores_gemma":[0.0004274963,0.000127229,0.000185693,0.0004490983,0.0001432291,0.0006765304,0.0002723013,0.0001902573,0.000655068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002998876,"about_ca_system_score_gemma":0.0003054491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005558981,"about_ca_topic_score_gemma":0.001250218,"domain_scores_codex":[0.9999222,0.000008562592,0.000006825365,0.00001759581,0.00003114213,0.00001374351],"domain_scores_gemma":[0.9997761,0.00005106726,0.00004870744,0.00004784422,0.0000646007,0.00001171407],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003625125,0.0001141374,0.001737052,0.000465698,0.00006109409,0.0002838389,0.0000909959,0.05625563,0.4109982,0.01661497,0.00580872,0.5072072],"study_design_scores_gemma":[0.00008539426,0.001032934,0.003062448,0.0000654655,0.0001402756,0.001004799,0.00005295403,0.4684172,0.4887734,0.008018535,0.029295,0.00005150653],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3791141,0.001855581,0.5946302,0.0001708135,0.0001701824,0.0002057309,0.0007180463,0.0074257,0.01570952],"genre_scores_gemma":[0.7501143,0.0003183565,0.2441265,0.0001002426,0.00002840115,0.00007516373,0.0004888966,0.00009554387,0.004652515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002829623,"threshold_uncertainty_score":0.009465992,"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","authors":[{"name":"Anxiao He","is_ca":false},{"name":"Kai Bu","is_ca":false},{"name":"Yucong Li","is_ca":false},{"name":"Eikoh Chida","is_ca":false},{"name":"Qian‐Ping Gu","is_ca":true},{"name":"Kui Ren","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003454914,0.000545678,0.0005992248,0.000844714,0.0008280902,0.001821472,0.002021206,0.0006962187,0.005815207],"category_scores_gemma":[0.00958157,0.0004718227,0.0006652967,0.000694069,0.002126953,0.005899872,0.003292535,0.0015377,0.001482412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010362,"about_ca_system_score_gemma":0.0024193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003773396,"about_ca_topic_score_gemma":0.0003697905,"domain_scores_codex":[0.9969317,0.0007203142,0.0002668601,0.0004752793,0.001300582,0.0003052516],"domain_scores_gemma":[0.9839786,0.00524575,0.002013671,0.006822687,0.001569584,0.000369711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002558778,0.0005772532,0.004683103,0.001194121,0.0001873379,0.0006156149,0.0005960602,0.0427173,0.1184085,0.3984884,0.01192556,0.4180481],"study_design_scores_gemma":[0.0007031808,0.001673063,0.00175014,0.0001857284,0.0002754763,0.00249052,0.0003441809,0.4164561,0.2743585,0.2486428,0.05293007,0.0001902897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04744114,0.0005161076,0.9406269,0.0002972385,0.0001153514,0.0003904875,0.0002968952,0.005800916,0.004514836],"genre_scores_gemma":[0.6914397,0.0003235606,0.3034453,0.0002035253,0.00007992435,0.0002215506,0.0004848804,0.0004185285,0.003382993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005815207,"threshold_uncertainty_score":0.01945382,"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","authors":[{"name":"Brigitte Jaumard","is_ca":true},{"name":"Anjali Agarwal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009598813,0.0003375635,0.0004631467,0.0004684995,0.0005582649,0.001245892,0.001604837,0.0005156197,0.002126274],"category_scores_gemma":[0.001159514,0.0002758311,0.000301355,0.0004118754,0.0002581171,0.001644371,0.0006874262,0.0006609594,0.0007102073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006692318,"about_ca_system_score_gemma":0.001118562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001417795,"about_ca_topic_score_gemma":0.001866357,"domain_scores_codex":[0.9994453,0.00008880979,0.00004326757,0.0001285823,0.0002452093,0.00004889485],"domain_scores_gemma":[0.9993076,0.0001014965,0.00007493787,0.000198384,0.0002253779,0.00009214079],"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.0009678252,0.0004185359,0.003519413,0.0003019478,0.0001768114,0.0005728695,0.0002962641,0.07122213,0.1753344,0.06095662,0.04145981,0.6447734],"study_design_scores_gemma":[0.0003366173,0.000729946,0.00274646,0.00003934961,0.0002103023,0.001021731,0.0001242717,0.8316978,0.05936695,0.01329147,0.09031322,0.0001218691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04129736,0.001304538,0.9393452,0.000584031,0.0002903943,0.0002350212,0.0001944615,0.01041007,0.006338871],"genre_scores_gemma":[0.4459584,0.0005436302,0.5423588,0.0002727038,0.0003170873,0.0002328929,0.0007311808,0.0002221912,0.009363127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002126274,"threshold_uncertainty_score":0.007113099,"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","authors":[{"name":"B. Khorchani","is_ca":true},{"name":"Sylvain Hallé","is_ca":true},{"name":"Roger Villemaire","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003130946,0.001257117,0.001071589,0.0017497,0.0008609228,0.003265776,0.003139224,0.001373192,0.003725965],"category_scores_gemma":[0.01341346,0.001292059,0.003227753,0.000970687,0.002131904,0.004644543,0.002913348,0.00289542,0.0005866709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002111311,"about_ca_system_score_gemma":0.005811744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0154509,"about_ca_topic_score_gemma":0.02261751,"domain_scores_codex":[0.9948865,0.001194608,0.0004406366,0.0008721677,0.002005905,0.0006003277],"domain_scores_gemma":[0.9912821,0.004760198,0.0006038966,0.002013912,0.001173877,0.0001660158],"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.001121046,0.0009254598,0.009384464,0.0008604084,0.0006690153,0.0009751048,0.0004598623,0.6125005,0.0440207,0.1635913,0.01196341,0.1535287],"study_design_scores_gemma":[0.0001332471,0.00006025942,0.0001830623,0.00003362627,0.0001032433,0.0000705495,0.00002080255,0.9574523,0.01596449,0.02347325,0.002478256,0.00002695353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02924166,0.00007427746,0.9496883,0.000363536,0.00008441619,0.0001746047,0.0005677775,0.01748807,0.002317331],"genre_scores_gemma":[0.4240694,0.0001911363,0.5689967,0.0004443158,0.00007693833,0.0003263077,0.001208312,0.001252609,0.003434257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0154509,"threshold_uncertainty_score":0.0307219,"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","authors":[{"name":"Nitin Mohan","is_ca":true},{"name":"Wilson Fung","is_ca":true},{"name":"Manoj Sachdev","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002117555,0.0002212237,0.0002270938,0.0004031926,0.0002626309,0.0004731951,0.001083408,0.0003294626,0.002231374],"category_scores_gemma":[0.0007562029,0.0001984281,0.0001029492,0.0003703871,0.0001724745,0.0007664618,0.0003525964,0.0002847079,0.0003783956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004551931,"about_ca_system_score_gemma":0.0004744165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006512955,"about_ca_topic_score_gemma":0.001609238,"domain_scores_codex":[0.9998234,0.00002364292,0.00001393686,0.00003033186,0.00008183622,0.00002685896],"domain_scores_gemma":[0.9996289,0.0001391465,0.00007195052,0.00004922539,0.00008837523,0.00002235043],"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.0006806629,0.0001511044,0.00200569,0.0002856749,0.0000376793,0.0002891033,0.0001184662,0.002410769,0.6365638,0.01425408,0.003058668,0.3401443],"study_design_scores_gemma":[0.0001181807,0.0007833422,0.001491548,0.00002618145,0.0001015538,0.001659141,0.00003815556,0.105866,0.873527,0.002562993,0.01379013,0.00003576249],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2903311,0.002348903,0.6939521,0.0004090618,0.0003655156,0.0001792824,0.0002603406,0.002945826,0.009207891],"genre_scores_gemma":[0.8503394,0.0002588314,0.1443956,0.000226569,0.00006411282,0.00004103525,0.000111541,0.00003219899,0.004530765],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002231374,"threshold_uncertainty_score":0.007464647,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006145221,0.0002016486,0.0002160302,0.0003565219,0.0002354295,0.0003732106,0.001539443,0.0002628353,0.001752676],"category_scores_gemma":[0.0002035554,0.0001123721,0.0001405003,0.0005799621,0.0001850847,0.0007938512,0.0002885523,0.0002002875,0.0003459733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003765092,"about_ca_system_score_gemma":0.0003223729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009453335,"about_ca_topic_score_gemma":0.003203613,"domain_scores_codex":[0.9999369,0.000007374122,0.000003834882,0.00001448359,0.0000256255,0.00001177269],"domain_scores_gemma":[0.9998502,0.00003075397,0.00002424381,0.00002812509,0.00005582539,0.00001096197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007019116,0.0002845848,0.002712038,0.0006602876,0.0001201706,0.0004766925,0.0001305144,0.06046147,0.5226901,0.03035496,0.008616745,0.3727905],"study_design_scores_gemma":[0.0001183084,0.001478413,0.002249261,0.00004652566,0.0002053719,0.00135936,0.00008426741,0.655488,0.3066903,0.00621349,0.02600237,0.00006430119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3899804,0.001534085,0.5883392,0.0003351624,0.0001657953,0.0001987916,0.0003897842,0.002691288,0.0163654],"genre_scores_gemma":[0.8753858,0.0003079671,0.1193027,0.0001299801,0.00004945613,0.00008650337,0.0002228643,0.00002751475,0.004487223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001752676,"threshold_uncertainty_score":0.005863309,"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","authors":[{"name":"Johnny Tsung Lin Ho","is_ca":true},{"name":"Guy Lemieux","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008403151,0.0009062509,0.0007674781,0.001273103,0.0003479565,0.001593671,0.002907716,0.0007916412,0.01090083],"category_scores_gemma":[0.002497704,0.0005539123,0.0004661684,0.001002192,0.0005254348,0.002107989,0.001262767,0.0007222707,0.006068165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007147208,"about_ca_system_score_gemma":0.0009797409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001745121,"about_ca_topic_score_gemma":0.001544729,"domain_scores_codex":[0.9988675,0.0001370874,0.00009124537,0.000274658,0.0004699048,0.0001596801],"domain_scores_gemma":[0.9987691,0.0002282175,0.0001051567,0.0006089869,0.0002332339,0.00005533344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003323729,0.0004711236,0.008163842,0.00117839,0.000242303,0.0007932424,0.0004030425,0.02429113,0.08419055,0.04815852,0.1913936,0.6373905],"study_design_scores_gemma":[0.0004284082,0.001141878,0.004262814,0.0001100317,0.0001514255,0.002196696,0.0001223026,0.4328206,0.2005638,0.03009483,0.3279223,0.0001849601],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.06758963,0.001552661,0.4646731,0.000417643,0.0004045094,0.0009041802,0.008498617,0.3977342,0.05822545],"genre_scores_gemma":[0.4615142,0.001047593,0.4345736,0.001141602,0.0001180237,0.0006907916,0.0321413,0.01135522,0.05741774],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01090083,"threshold_uncertainty_score":0,"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","authors":[{"name":"Ameer Abdelhadi","is_ca":true},{"name":"Guy Lemieux","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001198361,0.0003455507,0.0002068554,0.0003624527,0.0001835812,0.0004329681,0.0006403185,0.0002404165,0.002135342],"category_scores_gemma":[0.0003903617,0.0001464547,0.000156594,0.000312943,0.0002113878,0.0008375958,0.0003095861,0.0002603373,0.0005296756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002927902,"about_ca_system_score_gemma":0.0003313867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005969458,"about_ca_topic_score_gemma":0.001623637,"domain_scores_codex":[0.9998785,0.00001866342,0.00001069054,0.00002106768,0.00004626913,0.00002475255],"domain_scores_gemma":[0.9997291,0.00008518844,0.00005656948,0.00006428835,0.0000486179,0.00001620319],"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.0005464207,0.000118762,0.001759353,0.0003924003,0.00004885765,0.0003886927,0.0001663015,0.01877947,0.5078092,0.01469968,0.002971084,0.4523199],"study_design_scores_gemma":[0.0002341983,0.002185296,0.003593367,0.0001451115,0.0001573023,0.001490233,0.0001575581,0.1760275,0.7597582,0.005500639,0.05068257,0.00006799744],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.53064,0.002440143,0.4297284,0.0003424927,0.000200454,0.0002189649,0.0003033125,0.005475265,0.03065095],"genre_scores_gemma":[0.7392531,0.0004114502,0.2531387,0.0001062465,0.00002538111,0.00006489049,0.0002365697,0.00007625011,0.006687399],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002135342,"threshold_uncertainty_score":0.007143438,"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","authors":[{"name":"Omar Ahmed","is_ca":true},{"name":"Shawki Areibi","is_ca":true},{"name":"D. Fayek","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993238,0.000734047,0.001160696,0.00254258,0.0008115441,0.00149931,0.003141005,0.0008224574,0.002599605],"category_scores_gemma":[0.004325199,0.00057026,0.0004765638,0.002835158,0.000453536,0.001809503,0.001348639,0.001129129,0.000839146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008371298,"about_ca_system_score_gemma":0.002582475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009396344,"about_ca_topic_score_gemma":0.006392796,"domain_scores_codex":[0.9991543,0.0000843083,0.00005791369,0.0001470241,0.0004473331,0.0001090931],"domain_scores_gemma":[0.9987312,0.0003803188,0.0001426918,0.0002473621,0.0004254605,0.00007281565],"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.0002652048,0.0001743469,0.002842946,0.0001119824,0.00005417113,0.0001082542,0.00005359402,0.02943499,0.005223161,0.003408324,0.01765196,0.9406709],"study_design_scores_gemma":[0.00006360449,0.0001811835,0.001293318,0.00001450513,0.00003629532,0.0002513549,0.00003450401,0.9783902,0.008574466,0.002414656,0.008716906,0.00002895228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03393083,0.0008449745,0.9475192,0.0003103668,0.0002539875,0.000606765,0.0005072741,0.01299952,0.003027112],"genre_scores_gemma":[0.1719521,0.0003304565,0.8205256,0.0002679604,0.0001547885,0.0004948595,0.001811595,0.0003889225,0.004073689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009396344,"threshold_uncertainty_score":0.01868331,"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","authors":[{"name":"Faouzi Kamoun","is_ca":true},{"name":"Mazhar Ali","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590306,0.0005828781,0.000645385,0.0006053007,0.000430004,0.0006894135,0.0009134554,0.001158176,0.002596659],"category_scores_gemma":[0.00189179,0.0003101314,0.0003280112,0.0008245073,0.0004926687,0.001184313,0.0006738934,0.0009813476,0.0004413674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008011467,"about_ca_system_score_gemma":0.001117923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004448603,"about_ca_topic_score_gemma":0.00425764,"domain_scores_codex":[0.9997645,0.00006915299,0.00001441677,0.00003838888,0.0000905468,0.00002294853],"domain_scores_gemma":[0.9997134,0.0001536065,0.00002483795,0.00001627309,0.00007849451,0.00001344104],"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.00006602374,0.00002914417,0.0001936093,0.00006710506,0.00003023387,0.00003416093,0.00003313582,0.8313948,0.001639994,0.02514778,0.002645449,0.1387186],"study_design_scores_gemma":[0.000009973722,0.00001172335,0.00002492233,0.000004171709,0.00000353112,0.000009085907,0.000002777019,0.9931946,0.0002984598,0.005489776,0.0009478026,0.000003167625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003449452,0.0003416518,0.9940958,0.0001833055,0.00005323543,0.00003034406,0.00002430961,0.0002228258,0.001599032],"genre_scores_gemma":[0.1739263,0.000857942,0.8186912,0.0001480169,0.00009618996,0.0002834286,0.0001482438,0.00009534334,0.00575337],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004448603,"threshold_uncertainty_score":0.008845389,"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","authors":[{"name":"Ratish Mohan","is_ca":false},{"name":"Anis Yazidi","is_ca":false},{"name":"Boning Feng","is_ca":false},{"name":"B. John Oommen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002916206,0.00061879,0.001053079,0.00113069,0.001085716,0.002907273,0.002353372,0.0008789394,0.002264132],"category_scores_gemma":[0.005893264,0.0005744838,0.0006662037,0.0008841753,0.001250437,0.00463641,0.001477588,0.002280189,0.0005709705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006790639,"about_ca_system_score_gemma":0.001641454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00104131,"about_ca_topic_score_gemma":0.00164771,"domain_scores_codex":[0.9980077,0.0005481323,0.0002812035,0.0002953839,0.0006575978,0.0002099637],"domain_scores_gemma":[0.9962081,0.001348311,0.0004304482,0.001084777,0.0006041992,0.000324073],"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.001005761,0.001045226,0.002853626,0.0002086032,0.0001461191,0.000507042,0.0006964213,0.1048184,0.1064344,0.4294956,0.004316574,0.3484721],"study_design_scores_gemma":[0.0001268411,0.0002448075,0.0003919593,0.00003425245,0.00006682274,0.0002298902,0.00007634512,0.8702756,0.02940922,0.0894189,0.009645546,0.0000797563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01982168,0.0001342945,0.9759966,0.0001280869,0.0000887569,0.0001823575,0.00003385964,0.0007592309,0.002855175],"genre_scores_gemma":[0.3599127,0.000318764,0.6361756,0.0001151785,0.0001221351,0.0003125756,0.0001428997,0.000215686,0.002684486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002916206,"threshold_uncertainty_score":0.01542252,"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","authors":[{"name":"Daniel Brox","is_ca":true},{"name":"W. Newcomen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007947664,0.000819559,0.0004200099,0.001528288,0.0004012218,0.001235437,0.0004166887,0.0008482832,0.0009112582],"category_scores_gemma":[0.002774105,0.0002346239,0.0003532927,0.0006601605,0.0003427191,0.0007756024,0.0003566859,0.0004943466,0.0003853979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006466764,"about_ca_system_score_gemma":0.0004273396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002996549,"about_ca_topic_score_gemma":0.002839608,"domain_scores_codex":[0.9997379,0.00004066718,0.00001498824,0.00002311225,0.0001412987,0.00004192573],"domain_scores_gemma":[0.9989278,0.0004066037,0.0001626859,0.00008677906,0.0003362105,0.00007994127],"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.0001578284,0.000199663,0.01746623,0.00002025536,0.00002435871,0.00004528005,0.00002573791,0.9385244,0.0175585,0.001391915,0.000339656,0.02424628],"study_design_scores_gemma":[0.000001817892,0.00003030528,0.001677074,0.000001322639,0.000002181595,0.000005672491,0.000003996196,0.9948649,0.003191472,0.0001798216,0.00003751922,0.000003937314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.891844,0.0001278348,0.1028617,0.00009612839,0.00005008242,0.00003993006,0.0001516296,0.0003600917,0.004468689],"genre_scores_gemma":[0.9940439,0.00003818633,0.005275929,0.000005870904,0.000005816235,0.00001074973,0.00009469585,0.00002485853,0.0005000578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002996549,"threshold_uncertainty_score":0.005958259,"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","authors":[{"name":"Kaveh Aasaraai","is_ca":true},{"name":"Andreas Moshovos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001797267,0.0002542785,0.0002726946,0.0003275362,0.0004175537,0.0007568554,0.001133304,0.0002862421,0.003722837],"category_scores_gemma":[0.0004988439,0.0001759012,0.0001389921,0.0005249513,0.0001844707,0.0007498037,0.0003889539,0.0004964276,0.0009717182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006779446,"about_ca_system_score_gemma":0.00120755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001438661,"about_ca_topic_score_gemma":0.004569136,"domain_scores_codex":[0.9997627,0.00002616918,0.00001652041,0.00002262628,0.0001234767,0.00004851116],"domain_scores_gemma":[0.9996318,0.0000605891,0.00004572245,0.00007925131,0.0001456608,0.00003699092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001649919,0.0003686296,0.003025729,0.0009416536,0.0001060471,0.0006321382,0.0002075608,0.03354387,0.5752501,0.05297013,0.01674384,0.3145604],"study_design_scores_gemma":[0.0004297585,0.001309078,0.002456482,0.0001213796,0.0001590189,0.001203876,0.0001440607,0.3307553,0.5488954,0.008346459,0.1060816,0.00009760847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3198225,0.004437867,0.6335742,0.0007812721,0.0003992693,0.0002662762,0.0004526199,0.003965248,0.03630067],"genre_scores_gemma":[0.8209375,0.0007190294,0.1572236,0.0002871366,0.00006126347,0.0001061625,0.0004316631,0.0001382139,0.02009558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003722837,"threshold_uncertainty_score":0.01245415,"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","authors":[{"name":"Daniel Rozhko","is_ca":true},{"name":"Geoffrey Elliott","is_ca":true},{"name":"Daniel Ly-Ma","is_ca":true},{"name":"Paul Chow","is_ca":true},{"name":"Hans‐Arno Jacobsen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002423439,0.0003404594,0.0002522355,0.0005049076,0.0002507329,0.0008375411,0.00102871,0.0002325471,0.006250274],"category_scores_gemma":[0.0006028487,0.000175598,0.0002004524,0.0006470609,0.000236508,0.0008684302,0.0003170116,0.0003702515,0.0008383293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009210017,"about_ca_system_score_gemma":0.0007091316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004985173,"about_ca_topic_score_gemma":0.004799718,"domain_scores_codex":[0.9997465,0.00003094492,0.00002365303,0.0000518999,0.00009227035,0.00005486325],"domain_scores_gemma":[0.9996141,0.0001112072,0.00004476036,0.0001193554,0.00008634452,0.00002419393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002250281,0.000391597,0.01022357,0.0005122861,0.0002197304,0.0008455665,0.0002482731,0.08208807,0.2135132,0.0282649,0.02885026,0.6325924],"study_design_scores_gemma":[0.0002878927,0.001321218,0.005711644,0.00006773663,0.0001129106,0.0006242429,0.0001392811,0.6419032,0.3039516,0.005973201,0.03983503,0.00007208051],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6622534,0.001359304,0.2670722,0.0004301114,0.000265123,0.0003266191,0.001013605,0.01704999,0.05022961],"genre_scores_gemma":[0.8780692,0.0002607206,0.1135141,0.0002123638,0.00002807612,0.00009284329,0.0006381874,0.00009647694,0.007088013],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006250274,"threshold_uncertainty_score":0.02090919,"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","authors":[{"name":"Ideh Sarbishei","is_ca":true},{"name":"Shervin Vakili","is_ca":true},{"name":"J. M. Pierre Langlois","is_ca":true},{"name":"Yvon Savaria","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000133023,0.0003008302,0.0002620759,0.0004845195,0.000294423,0.0005493533,0.001379555,0.0002833782,0.008722839],"category_scores_gemma":[0.000342416,0.0001650239,0.000183975,0.0008110779,0.0001421343,0.001064341,0.0004185197,0.0002832996,0.001178769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005375799,"about_ca_system_score_gemma":0.0004652898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145452,"about_ca_topic_score_gemma":0.002046175,"domain_scores_codex":[0.9998482,0.00001853428,0.00001307456,0.00002679285,0.00005601503,0.0000372781],"domain_scores_gemma":[0.9998947,0.00002388632,0.0000150918,0.00003289619,0.00002490152,0.000008427488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009255898,0.0002004421,0.001895497,0.0005565792,0.00009560637,0.0003699115,0.00008472703,0.0439404,0.1852839,0.02946912,0.01423372,0.7229444],"study_design_scores_gemma":[0.0002803803,0.001446836,0.002893463,0.0001007569,0.0001444199,0.001055621,0.0001229686,0.5780466,0.335627,0.01314018,0.06706537,0.00007651031],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3024662,0.00347393,0.6486462,0.0003990847,0.0003207161,0.0002466715,0.0005136968,0.008086755,0.0358468],"genre_scores_gemma":[0.8062714,0.0005155652,0.183535,0.0001720405,0.00004012988,0.0001046871,0.0005487545,0.00007179672,0.008740606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008722839,"threshold_uncertainty_score":0.02918082,"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","authors":[{"name":"Zahoor Ali Khan","is_ca":true},{"name":"Nadeem Javaid","is_ca":false},{"name":"Misbah Arshad","is_ca":false},{"name":"A. Bibi","is_ca":false},{"name":"Bilal Qasim","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004208742,0.001782389,0.001285138,0.002634052,0.000977106,0.002181347,0.002315624,0.001559615,0.002393283],"category_scores_gemma":[0.01312837,0.0003356721,0.0005695579,0.002784086,0.0008159434,0.003019165,0.001409919,0.00102951,0.001029163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001937729,"about_ca_system_score_gemma":0.002102564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00400622,"about_ca_topic_score_gemma":0.002174775,"domain_scores_codex":[0.9920167,0.002089315,0.001097074,0.001329565,0.002095439,0.001371968],"domain_scores_gemma":[0.9858499,0.007643498,0.001062758,0.002112178,0.002738577,0.0005930154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.01040736,0.00230287,0.02577062,0.001035533,0.0005584947,0.0004085419,0.0005513189,0.3383165,0.05171229,0.006598646,0.00889674,0.5534411],"study_design_scores_gemma":[0.0002910084,0.001812226,0.00520917,0.00003974615,0.0001244622,0.0004509957,0.0003205519,0.899919,0.08698317,0.001602857,0.003157692,0.00008894896],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8634561,0.002757795,0.1032814,0.0003502642,0.0002567254,0.0004427256,0.000821703,0.01762782,0.01100546],"genre_scores_gemma":[0.9226896,0.000660784,0.07181326,0.00006500257,0.00004055455,0.0001457701,0.001353372,0.0005718546,0.002659584],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004208742,"threshold_uncertainty_score":0.02225822,"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","authors":[{"name":"Raouf Ajami","is_ca":true},{"name":"Anh Dinh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002087183,0.0005442905,0.0003163147,0.0005450355,0.0003001447,0.0005790587,0.0007708851,0.000381843,0.004637191],"category_scores_gemma":[0.000247951,0.0002119617,0.0002830912,0.0003068633,0.0001227711,0.0004020946,0.0001885157,0.0002963202,0.001263905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004582836,"about_ca_system_score_gemma":0.0005989239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001646874,"about_ca_topic_score_gemma":0.001894172,"domain_scores_codex":[0.9998094,0.00002324478,0.00001292332,0.00003813954,0.00006949726,0.0000467954],"domain_scores_gemma":[0.9998547,0.00002043259,0.00002212881,0.00002086635,0.00007004174,0.00001177317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006833249,0.0002956705,0.007380758,0.001350586,0.0002337956,0.0008035328,0.0002178195,0.1098225,0.2370926,0.02447031,0.01425439,0.6033947],"study_design_scores_gemma":[0.0007204662,0.002613446,0.006563053,0.0003476154,0.000369368,0.00231448,0.0001618646,0.4440525,0.3812767,0.004871598,0.1565991,0.0001098029],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1269417,0.001677615,0.8143176,0.000351126,0.0006287968,0.0009003677,0.0002242529,0.005889288,0.04906922],"genre_scores_gemma":[0.5630965,0.0007282649,0.4192915,0.000269703,0.00005851786,0.0003155842,0.0003392827,0.000155417,0.01574524],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004637191,"threshold_uncertainty_score":0.01551294,"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","authors":[{"name":"Naoya Onizawa","is_ca":true},{"name":"Warren J. Gross","is_ca":true},{"name":"Takahiro Hanyu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001287532,0.0002649316,0.0002403576,0.0004618567,0.0004195449,0.0005087291,0.001528241,0.0002904495,0.001788452],"category_scores_gemma":[0.0004433515,0.0001341228,0.0001648613,0.0004311816,0.0001778904,0.0005683085,0.0002479841,0.0002716911,0.0003046031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006922256,"about_ca_system_score_gemma":0.0006417496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007419317,"about_ca_topic_score_gemma":0.002187745,"domain_scores_codex":[0.9998541,0.00001680932,0.00001301336,0.0000313294,0.00006635357,0.00001839638],"domain_scores_gemma":[0.9997795,0.00003807102,0.00004125903,0.00004376518,0.00008026522,0.0000171776],"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.0004839449,0.0001459289,0.003739406,0.0007544906,0.00008312312,0.0004969194,0.0002568352,0.02688956,0.6560085,0.02178064,0.009257344,0.2801034],"study_design_scores_gemma":[0.0001406051,0.001977248,0.00223851,0.0000917619,0.0002347875,0.001632091,0.00009969374,0.4129127,0.5011626,0.004426567,0.07500944,0.00007385161],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.276146,0.003984564,0.6974093,0.0006706206,0.0006333215,0.0002762572,0.0004681128,0.004707542,0.01570427],"genre_scores_gemma":[0.8734692,0.0004748455,0.1212751,0.0002619079,0.00007007606,0.00009898588,0.000163188,0.00008859297,0.004098082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001788452,"threshold_uncertainty_score":0.005982995,"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","authors":[{"name":"Nitin Mohan","is_ca":true},{"name":"Manoj Sachdev","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001175015,0.0002310447,0.0003047771,0.0003699735,0.0003579173,0.0008200379,0.0007668553,0.0004801944,0.003243783],"category_scores_gemma":[0.0005681553,0.000122531,0.0002237188,0.0006094011,0.0003055516,0.001259193,0.0004213375,0.0003201429,0.00058128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000388178,"about_ca_system_score_gemma":0.0004163143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003773648,"about_ca_topic_score_gemma":0.000930461,"domain_scores_codex":[0.999902,0.000009931518,0.00001389982,0.00001334743,0.00004709092,0.00001372242],"domain_scores_gemma":[0.9997416,0.00006118365,0.00005594121,0.00005260671,0.00007822045,0.00001054433],"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.0003999981,0.00007085478,0.0007926393,0.0008592699,0.00005258279,0.0005891201,0.0003549869,0.01184764,0.6594902,0.09502078,0.005028417,0.2254935],"study_design_scores_gemma":[0.00009040874,0.0006110817,0.0007008308,0.000105442,0.0001270608,0.002423491,0.0001627353,0.09102962,0.8155998,0.01827229,0.07081762,0.00005960218],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3019886,0.01322574,0.6396223,0.001770635,0.00117643,0.0002521356,0.001089241,0.002363199,0.03851169],"genre_scores_gemma":[0.8179916,0.002334601,0.1705947,0.0004358963,0.0001714545,0.000118294,0.0001946022,0.00008400779,0.008074987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003243783,"threshold_uncertainty_score":0.0108515,"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)","authors":[{"name":"Amjad Gawanmeh","is_ca":false},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041619,0.00108885,0.0007519972,0.001489688,0.0006323026,0.002133609,0.003288914,0.001328265,0.001751046],"category_scores_gemma":[0.007165641,0.0009768965,0.002635686,0.0007833828,0.002342161,0.003200391,0.001768422,0.001751894,0.0005128596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001038401,"about_ca_system_score_gemma":0.002313514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005692365,"about_ca_topic_score_gemma":0.003338776,"domain_scores_codex":[0.9950932,0.001550618,0.0005849608,0.0008867992,0.001501588,0.0003828244],"domain_scores_gemma":[0.9935761,0.003741169,0.0007219703,0.001338314,0.0005424241,0.00008001702],"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.0003875209,0.0002954583,0.004949036,0.0007086655,0.0002417758,0.0019084,0.0006757402,0.626258,0.04922927,0.2481212,0.001549421,0.06567558],"study_design_scores_gemma":[0.00008664308,0.00007320661,0.0002862593,0.00006286651,0.00007059736,0.0002160767,0.00004359455,0.9291069,0.02922133,0.03354043,0.007254139,0.00003787192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008308477,0.00006649776,0.9890779,0.00004915205,0.00001476267,0.00009769385,0.0000803705,0.001313403,0.0009917271],"genre_scores_gemma":[0.2855125,0.0004151312,0.7109805,0.00009334526,0.0000295878,0.0004627296,0.0004951104,0.0003664899,0.001644594],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005692365,"threshold_uncertainty_score":0.02201045,"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","authors":[{"name":"Weiwei Geng","is_ca":false},{"name":"Scott Flinn","is_ca":false},{"name":"John DeDourek","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004098084,0.001565854,0.000819602,0.001018003,0.001069131,0.003888226,0.00298374,0.002367677,0.01747606],"category_scores_gemma":[0.02027578,0.0008400957,0.0006847676,0.0008793778,0.0009828864,0.006292531,0.002733144,0.001793026,0.005936608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006776926,"about_ca_system_score_gemma":0.001092436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007471837,"about_ca_topic_score_gemma":0.001191774,"domain_scores_codex":[0.9962811,0.001282156,0.000281575,0.0003600359,0.001445838,0.0003492467],"domain_scores_gemma":[0.9886125,0.004146392,0.0005796032,0.004904339,0.001413982,0.0003432238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007515326,0.0004214074,0.007171271,0.0009821095,0.0001753512,0.002905978,0.001189714,0.164509,0.02944346,0.1277133,0.06095375,0.6037831],"study_design_scores_gemma":[0.0001330347,0.000232716,0.002323846,0.0005889649,0.00009785836,0.002822762,0.0005685235,0.5977771,0.04605587,0.1826127,0.1666003,0.000186113],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01871104,0.0005360044,0.9224913,0.0007911775,0.000244233,0.0003172217,0.0005054147,0.02089255,0.03551106],"genre_scores_gemma":[0.6143637,0.00106689,0.3509919,0.0004667981,0.0001290366,0.000601079,0.002298832,0.006801514,0.02328023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01747606,"threshold_uncertainty_score":0.05846322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}