{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:US6XMBCSIRZ3VUGVASZCPGBYBR","short_pith_number":"pith:US6XMBCS","schema_version":"1.0","canonical_sha256":"a4bd7604524473bad0d504b22798380c6bad0ec6d2feab6326202bc9793b1776","source":{"kind":"arxiv","id":"1408.2350","version":1},"attestation_state":"computed","paper":{"title":"Dictionary Matching with One Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amihood Amir, Avivit Levy, B. Riva Shalom, Ely Porat","submitted_at":"2014-08-11T08:35:29Z","abstract_excerpt":"The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\\ldots,P_d$ over alphabet $\\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares. Then, given a query text $T$ of length $n$ over alphabet $\\Sigma$, the goal is to output all locations in $T$ in which a pattern $P_i\\in D$, $1\\leq i\\leq d$, ends. There is a renewed current interest in the gapped matching problem stemming from cyber security. In this paper we solve the problem where all patterns in the dictionary have one gap with a"},"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":"1408.2350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-11T08:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"91af68d35bfe0c4e9debff66a358e8780e68ba2780e6e0dee0fb660e9b8a78d0","abstract_canon_sha256":"450b08bec40fc4bcd9bef60060b30df57c76709ef1465e5a84f2e2c770bf7309"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:29.664116Z","signature_b64":"AbdDKVPtZdNTyYUNUcVW50SDMN3xYfL/hnwC8AXZS0mnh/T1BDt56Dl60RwakAQR3zcUa7Fqwu7Ih0NAFvQKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4bd7604524473bad0d504b22798380c6bad0ec6d2feab6326202bc9793b1776","last_reissued_at":"2026-05-18T02:45:29.663304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:29.663304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dictionary Matching with One Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amihood Amir, Avivit Levy, B. Riva Shalom, Ely Porat","submitted_at":"2014-08-11T08:35:29Z","abstract_excerpt":"The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\\ldots,P_d$ over alphabet $\\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares. Then, given a query text $T$ of length $n$ over alphabet $\\Sigma$, the goal is to output all locations in $T$ in which a pattern $P_i\\in D$, $1\\leq i\\leq d$, ends. There is a renewed current interest in the gapped matching problem stemming from cyber security. In this paper we solve the problem where all patterns in the dictionary have one gap with a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2350","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":"1408.2350","created_at":"2026-05-18T02:45:29.663423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2350v1","created_at":"2026-05-18T02:45:29.663423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2350","created_at":"2026-05-18T02:45:29.663423+00:00"},{"alias_kind":"pith_short_12","alias_value":"US6XMBCSIRZ3","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"US6XMBCSIRZ3VUGV","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"US6XMBCS","created_at":"2026-05-18T12:28:52.271510+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/US6XMBCSIRZ3VUGVASZCPGBYBR","json":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR.json","graph_json":"https://pith.science/api/pith-number/US6XMBCSIRZ3VUGVASZCPGBYBR/graph.json","events_json":"https://pith.science/api/pith-number/US6XMBCSIRZ3VUGVASZCPGBYBR/events.json","paper":"https://pith.science/paper/US6XMBCS"},"agent_actions":{"view_html":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR","download_json":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR.json","view_paper":"https://pith.science/paper/US6XMBCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2350&json=true","fetch_graph":"https://pith.science/api/pith-number/US6XMBCSIRZ3VUGVASZCPGBYBR/graph.json","fetch_events":"https://pith.science/api/pith-number/US6XMBCSIRZ3VUGVASZCPGBYBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR/action/storage_attestation","attest_author":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR/action/author_attestation","sign_citation":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR/action/citation_signature","submit_replication":"https://pith.science/pith/US6XMBCSIRZ3VUGVASZCPGBYBR/action/replication_record"}},"created_at":"2026-05-18T02:45:29.663423+00:00","updated_at":"2026-05-18T02:45:29.663423+00:00"}