{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D2CRA76RUHA4X27VDH23RELCHO","short_pith_number":"pith:D2CRA76R","schema_version":"1.0","canonical_sha256":"1e85107fd1a1c1cbebf519f5b891623b8886b6a4565baadfa7f5416b35a2d315","source":{"kind":"arxiv","id":"2411.14850","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithm for the Multiple String Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Danil Serov, Kamil Khadiev","submitted_at":"2024-11-22T10:50:43Z","abstract_excerpt":"Let us consider the Multiple String Matching Problem. In this problem, we consider a long string, denoted by $t$, of length $n$. This string is referred to as a text. We also consider a sequence of $m$ strings, denoted by $S$, which we refer to as a dictionary. The total length of all strings from the dictionary is represented by the variable L. The objective is to identify all instances of strings from the dictionary within the text. The standard classical solution to this problem is Aho-Corasick Algorithm that has $O(n+L)$ query and time complexity. At the same time, the classical lower boun"},"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":"2411.14850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T10:50:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b4a9000d49505379efb95a977fd95b8cfefb140fdd150970c6f9d3cab63424e7","abstract_canon_sha256":"987552e3972c3407109da6edcacb2f3cec0020a0dab7954a243301bfcb418f93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:12.686860Z","signature_b64":"ybl7YunDdLKNnxn1YXaWqQVx5an0qzjpiWkwNkEzCRahCRP4BwLzOka1FpWowz9bH3oY+++d5BrxQjkOzOKBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e85107fd1a1c1cbebf519f5b891623b8886b6a4565baadfa7f5416b35a2d315","last_reissued_at":"2026-07-05T09:39:12.686300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:12.686300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm for the Multiple String Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Danil Serov, Kamil Khadiev","submitted_at":"2024-11-22T10:50:43Z","abstract_excerpt":"Let us consider the Multiple String Matching Problem. In this problem, we consider a long string, denoted by $t$, of length $n$. This string is referred to as a text. We also consider a sequence of $m$ strings, denoted by $S$, which we refer to as a dictionary. The total length of all strings from the dictionary is represented by the variable L. The objective is to identify all instances of strings from the dictionary within the text. The standard classical solution to this problem is Aho-Corasick Algorithm that has $O(n+L)$ query and time complexity. At the same time, the classical lower boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14850","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14850/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.14850","created_at":"2026-07-05T09:39:12.686370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14850v1","created_at":"2026-07-05T09:39:12.686370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14850","created_at":"2026-07-05T09:39:12.686370+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2CRA76RUHA4","created_at":"2026-07-05T09:39:12.686370+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2CRA76RUHA4X27V","created_at":"2026-07-05T09:39:12.686370+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2CRA76R","created_at":"2026-07-05T09:39:12.686370+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/D2CRA76RUHA4X27VDH23RELCHO","json":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO.json","graph_json":"https://pith.science/api/pith-number/D2CRA76RUHA4X27VDH23RELCHO/graph.json","events_json":"https://pith.science/api/pith-number/D2CRA76RUHA4X27VDH23RELCHO/events.json","paper":"https://pith.science/paper/D2CRA76R"},"agent_actions":{"view_html":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO","download_json":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO.json","view_paper":"https://pith.science/paper/D2CRA76R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14850&json=true","fetch_graph":"https://pith.science/api/pith-number/D2CRA76RUHA4X27VDH23RELCHO/graph.json","fetch_events":"https://pith.science/api/pith-number/D2CRA76RUHA4X27VDH23RELCHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/action/storage_attestation","attest_author":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/action/author_attestation","sign_citation":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/action/citation_signature","submit_replication":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/action/replication_record"}},"created_at":"2026-07-05T09:39:12.686370+00:00","updated_at":"2026-07-05T09:39:12.686370+00:00"}