{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZZEGSEMLFELCTPEI7KJV76ZWPP","short_pith_number":"pith:ZZEGSEML","schema_version":"1.0","canonical_sha256":"ce4869118b291629bc88fa935ffb367bfbf90b482155977a2b698191e383f661","source":{"kind":"arxiv","id":"1904.10786","version":1},"attestation_state":"computed","paper":{"title":"Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.FL","authors_text":"Denis Matou\\v{s}ek, Jakub Semri\\v{c}, Jan Ko\\v{r}enek, Ji\\v{r}\\'i Matou\\v{s}ek, Luk\\'a\\v{s} Hol\\'ik, Milan \\v{C}e\\v{s}ka, Ond\\v{r}ej Leng\\'al, Tom\\'a\\v{s} Vojnar, Vojt\\v{e}ch Havlena","submitted_at":"2019-04-24T13:13:07Z","abstract_excerpt":"Deep packet inspection via regular expression (RE) matching is a crucial task of network intrusion detection systems (IDSes), which secure Internet connection against attacks and suspicious network traffic. Monitoring high-speed computer networks (100 Gbps and faster) in a single-box solution demands that the RE matching, traditionally based on finite automata (FAs), is accelerated in hardware. In this paper, we describe a novel FPGA architecture for RE matching that is able to process network traffic beyond 100 Gbps. The key idea is to reduce the required FPGA resources by leveraging approxim"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1904.10786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-24T13:13:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7c2cf633c8b59619ce256aa617c234e7da7b14bd68981a6e0131e724c77e83b5","abstract_canon_sha256":"95781a6399e5917907318d9d2cdf2803cfc1c4b2a0bddb531d6aae894d19ba9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:49.997767Z","signature_b64":"84b+oODEbHMyl5kWJm2/dghA90sZkXhBKf8taSdg8uQ6ITEuxBGMf76uqm7PM2jERdStvKoimFGq8ZKOCvNiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce4869118b291629bc88fa935ffb367bfbf90b482155977a2b698191e383f661","last_reissued_at":"2026-05-17T23:47:49.997150Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:49.997150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.FL","authors_text":"Denis Matou\\v{s}ek, Jakub Semri\\v{c}, Jan Ko\\v{r}enek, Ji\\v{r}\\'i Matou\\v{s}ek, Luk\\'a\\v{s} Hol\\'ik, Milan \\v{C}e\\v{s}ka, Ond\\v{r}ej Leng\\'al, Tom\\'a\\v{s} Vojnar, Vojt\\v{e}ch Havlena","submitted_at":"2019-04-24T13:13:07Z","abstract_excerpt":"Deep packet inspection via regular expression (RE) matching is a crucial task of network intrusion detection systems (IDSes), which secure Internet connection against attacks and suspicious network traffic. Monitoring high-speed computer networks (100 Gbps and faster) in a single-box solution demands that the RE matching, traditionally based on finite automata (FAs), is accelerated in hardware. In this paper, we describe a novel FPGA architecture for RE matching that is able to process network traffic beyond 100 Gbps. The key idea is to reduce the required FPGA resources by leveraging approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10786","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.10786","created_at":"2026-05-17T23:47:49.997255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10786v1","created_at":"2026-05-17T23:47:49.997255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10786","created_at":"2026-05-17T23:47:49.997255+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZEGSEMLFELC","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZEGSEMLFELCTPEI","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZEGSEML","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP","json":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP.json","graph_json":"https://pith.science/api/pith-number/ZZEGSEMLFELCTPEI7KJV76ZWPP/graph.json","events_json":"https://pith.science/api/pith-number/ZZEGSEMLFELCTPEI7KJV76ZWPP/events.json","paper":"https://pith.science/paper/ZZEGSEML"},"agent_actions":{"view_html":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP","download_json":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP.json","view_paper":"https://pith.science/paper/ZZEGSEML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10786&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZEGSEMLFELCTPEI7KJV76ZWPP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZEGSEMLFELCTPEI7KJV76ZWPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP/action/storage_attestation","attest_author":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP/action/author_attestation","sign_citation":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP/action/citation_signature","submit_replication":"https://pith.science/pith/ZZEGSEMLFELCTPEI7KJV76ZWPP/action/replication_record"}},"created_at":"2026-05-17T23:47:49.997255+00:00","updated_at":"2026-05-17T23:47:49.997255+00:00"}