{"id":"W2030934401","doi":"10.1016/j.comcom.2004.06.005","title":"A fast string search algorithm for deep packet classification","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Algorithm; Time complexity; String (physics); Commentz-Walter algorithm; Set (abstract data type); String searching algorithm; Boyer–Moore string search algorithm; Network packet; Pattern matching; Artificial intelligence; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001422086,0.00116161,0.001578237,0.002625008,0.001149122,0.001630552,0.00217101,0.001987805,0.01039088],"category_scores_gemma":[0.005312513,0.0005866918,0.0008291826,0.004316136,0.0006587527,0.002449119,0.002070038,0.002268581,0.005929611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007900161,"about_ca_system_score_gemma":0.002120734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003525876,"about_ca_topic_score_gemma":0.004254504,"domain_scores_codex":[0.9989049,0.0002306338,0.0001096354,0.0001988771,0.0004507265,0.0001050987],"domain_scores_gemma":[0.9979504,0.000931464,0.00009304171,0.0004394091,0.0005131374,0.00007265984],"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.000383561,0.0001346906,0.0004617728,0.00009801127,0.00005718964,0.00006914933,0.00004769359,0.0208947,0.008498925,0.01256142,0.01280433,0.9439884],"study_design_scores_gemma":[0.0001293033,0.0001591351,0.0005242371,0.00003633423,0.00005342778,0.0002221884,0.00004382097,0.9382352,0.01162566,0.03984424,0.009089416,0.00003700598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005863933,0.000466146,0.9887295,0.0001914782,0.0001814993,0.0000957248,0.0003386006,0.003079056,0.00105394],"genre_scores_gemma":[0.06033602,0.0004017305,0.9299536,0.0002615581,0.0001661278,0.0003327313,0.001559132,0.0003387604,0.006650412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01039088,"threshold_uncertainty_score":0.03476095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07407034828581271,"score_gpt":0.3202449769917853,"score_spread":0.2461746287059726,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}