{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003092286,0.0001603142,0.0001670599,0.0001489107,0.0007019168,0.000358756,0.003838127,0.00007542814,0.000002697253],"category_scores_gemma":[0.00001083904,0.0001588318,0.0000944278,0.0004370934,0.0001011327,0.0007275642,0.001971276,0.0002341928,0.00005691117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001174363,"about_ca_system_score_gemma":0.0001231327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003690194,"about_ca_topic_score_gemma":0.00001424449,"domain_scores_codex":[0.9986303,0.00009327734,0.0003161618,0.0004115059,0.0002291699,0.0003195577],"domain_scores_gemma":[0.9959348,0.0002282114,0.0001008141,0.003341281,0.0002597078,0.0001351963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.267475e-7,0.0001673773,0.00001700699,0.000006087691,0.00001518041,6.43637e-7,0.0005710773,0.0006809427,0.00009846495,0.1427448,0.0003308007,0.8553666],"study_design_scores_gemma":[0.0006484894,0.00007445303,0.001502796,0.00004354489,0.000006228895,0.00001417243,0.00004982261,0.9759995,0.0001887032,0.008466316,0.01280355,0.0002024604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001947674,0.0003161019,0.9952342,0.002977418,0.0002475604,0.0004349828,0.00002948158,0.000296692,0.0002687844],"genre_scores_gemma":[0.05167687,0.0001228135,0.9474587,0.0002416898,0.0001473503,0.0001205926,0.0001888806,0.00001564833,0.00002743206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9753185,"threshold_uncertainty_score":0.7132259,"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."}}