{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:D2CRA76RUHA4X27VDH23RELCHO","short_pith_number":"pith:D2CRA76R","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"},"canonical_sha256":"1e85107fd1a1c1cbebf519f5b891623b8886b6a4565baadfa7f5416b35a2d315","source":{"kind":"arxiv","id":"2411.14850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14850","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14850v1","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14850","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"D2CRA76RUHA4","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"pith_short_16","alias_value":"D2CRA76RUHA4X27V","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"pith_short_8","alias_value":"D2CRA76R","created_at":"2026-07-05T09:39:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:D2CRA76RUHA4X27VDH23RELCHO","target":"record","payload":{"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"},"canonical_sha256":"1e85107fd1a1c1cbebf519f5b891623b8886b6a4565baadfa7f5416b35a2d315","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"},"source_kind":"arxiv","source_id":"2411.14850","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGnoazuIMdjipGXjvHLB2oWPpxAU0oxjy/XLWjXQ5eyUllBvDrDxGkUfdQqjT+5ucFE8jC464viK+alukFH9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:39:38.600422Z"},"content_sha256":"9c529f73adfd1bf631475fa2364ae1696f43c33a80ff766766014fb0234f4bf7","schema_version":"1.0","event_id":"sha256:9c529f73adfd1bf631475fa2364ae1696f43c33a80ff766766014fb0234f4bf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:D2CRA76RUHA4X27VDH23RELCHO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfFkELGK3ueN/XY9Nc3yBdddMXW1qS97LAvqs0zZdisdMIv1QDk8Etdt7zMddHDIGTlMIhnEpin+VIplmT8jAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:39:38.601102Z"},"content_sha256":"c4af51ed554701f6af7220cd3137d22f82ee7d2d2a057a7594e381508176c443","schema_version":"1.0","event_id":"sha256:c4af51ed554701f6af7220cd3137d22f82ee7d2d2a057a7594e381508176c443"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/bundle.json","state_url":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2CRA76RUHA4X27VDH23RELCHO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T03:39:38Z","links":{"resolver":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO","bundle":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/bundle.json","state":"https://pith.science/pith/D2CRA76RUHA4X27VDH23RELCHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2CRA76RUHA4X27VDH23RELCHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:D2CRA76RUHA4X27VDH23RELCHO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"987552e3972c3407109da6edcacb2f3cec0020a0dab7954a243301bfcb418f93","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T10:50:43Z","title_canon_sha256":"b4a9000d49505379efb95a977fd95b8cfefb140fdd150970c6f9d3cab63424e7"},"schema_version":"1.0","source":{"id":"2411.14850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14850","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14850v1","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14850","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"D2CRA76RUHA4","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"pith_short_16","alias_value":"D2CRA76RUHA4X27V","created_at":"2026-07-05T09:39:12Z"},{"alias_kind":"pith_short_8","alias_value":"D2CRA76R","created_at":"2026-07-05T09:39:12Z"}],"graph_snapshots":[{"event_id":"sha256:c4af51ed554701f6af7220cd3137d22f82ee7d2d2a057a7594e381508176c443","target":"graph","created_at":"2026-07-05T09:39:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.14850/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Danil Serov, Kamil Khadiev","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T10:50:43Z","title":"Quantum Algorithm for the Multiple String Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14850","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9c529f73adfd1bf631475fa2364ae1696f43c33a80ff766766014fb0234f4bf7","target":"record","created_at":"2026-07-05T09:39:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"987552e3972c3407109da6edcacb2f3cec0020a0dab7954a243301bfcb418f93","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T10:50:43Z","title_canon_sha256":"b4a9000d49505379efb95a977fd95b8cfefb140fdd150970c6f9d3cab63424e7"},"schema_version":"1.0","source":{"id":"2411.14850","kind":"arxiv","version":1}},"canonical_sha256":"1e85107fd1a1c1cbebf519f5b891623b8886b6a4565baadfa7f5416b35a2d315","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e85107fd1a1c1cbebf519f5b891623b8886b6a4565baadfa7f5416b35a2d315","first_computed_at":"2026-07-05T09:39:12.686300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:12.686300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ybl7YunDdLKNnxn1YXaWqQVx5an0qzjpiWkwNkEzCRahCRP4BwLzOka1FpWowz9bH3oY+++d5BrxQjkOzOKBCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:12.686860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c529f73adfd1bf631475fa2364ae1696f43c33a80ff766766014fb0234f4bf7","sha256:c4af51ed554701f6af7220cd3137d22f82ee7d2d2a057a7594e381508176c443"],"state_sha256":"c34cecce6c8aa7071244e5c8b9274792abf28e583aceecfa23ff6e1ba383f032"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyZUaIXhmDa1YsP24k5xLdwyh/bXD+cRHuZP7iGFTikONb6BGmHeSGRsTnP/Scm3+eGcfVjEohhyEwtjZDSJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T03:39:38.605239Z","bundle_sha256":"9641cc5217380e3c38ea3a2ded5d33d5c5300d7281e390b4304a2802e32440a6"}}