{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5L5MH2D43ZC3H7ORNDWWO5T4V6","short_pith_number":"pith:5L5MH2D4","canonical_record":{"source":{"id":"1011.3441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T16:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"2fa18fcddcf728f71ce9773fb0e1c0c9b85b32400754ab745844d858396efabf","abstract_canon_sha256":"73cc0914bfdb993c7ce34e301edcd47b250ac8b684ef4aad50182a900bf35002"},"schema_version":"1.0"},"canonical_sha256":"eafac3e87cde45b3fdd168ed67767caf9349becf7200444fc84631d0a033b98d","source":{"kind":"arxiv","id":"1011.3441","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3441","created_at":"2026-05-18T02:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3441v2","created_at":"2026-05-18T02:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3441","created_at":"2026-05-18T02:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"5L5MH2D43ZC3","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5L5MH2D43ZC3H7OR","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5L5MH2D4","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5L5MH2D43ZC3H7ORNDWWO5T4V6","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T16:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"2fa18fcddcf728f71ce9773fb0e1c0c9b85b32400754ab745844d858396efabf","abstract_canon_sha256":"73cc0914bfdb993c7ce34e301edcd47b250ac8b684ef4aad50182a900bf35002"},"schema_version":"1.0"},"canonical_sha256":"eafac3e87cde45b3fdd168ed67767caf9349becf7200444fc84631d0a033b98d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:47.487846Z","signature_b64":"BrslT7osDjiVWXM4UBruhchqBlp7aowZJjIEFJ01rpaPAb2znsqqAM0ag8LD39xMwFx8yghK5fuLKv3LA6epAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eafac3e87cde45b3fdd168ed67767caf9349becf7200444fc84631d0a033b98d","last_reissued_at":"2026-05-18T02:04:47.487281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:47.487281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3441","source_version":2,"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-05-18T02:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ar9Pvod6wOV16y4FKiuy3FPl99BRk2TTxBldOzeJja0MaClb9Onq3lUz87gTbA5ULX3I7YouTC2sQvd6OC4VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:31:00.612915Z"},"content_sha256":"cea983315504aabcae536a7b1a57ccc6d01aeff7b2dd0f0d350abc8cc91493cf","schema_version":"1.0","event_id":"sha256:cea983315504aabcae536a7b1a57ccc6d01aeff7b2dd0f0d350abc8cc91493cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5L5MH2D43ZC3H7ORNDWWO5T4V6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst case efficient single and multiple string matching in the Word-RAM model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2010-11-15T16:37:43Z","abstract_excerpt":"In this paper, we explore worst-case solutions for the problems of single and multiple matching on strings in the word RAM model with word length w. In the first problem, we have to build a data structure based on a pattern p of length m over an alphabet of size sigma such that we can answer to the following query: given a text T of length n, where each character is encoded using log(sigma) bits return the positions of all the occurrences of p in T (in the following we refer by occ to the number of reported occurrences). For the multi-pattern matching problem we have a set S of d patterns of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3441","kind":"arxiv","version":2},"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"},"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-05-18T02:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gxrvm68K1B2fMSYPb1lbipsNautAJ4fs65x/ZJcjWdV8UbhS2sdTBnRMvifTDPNZXYvK1FbXwLajtYJ2Q7TICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:31:00.613295Z"},"content_sha256":"83de71396901b4b68731e22e3ced23f97effe6f53fe88a2435d7a17c1dd8349b","schema_version":"1.0","event_id":"sha256:83de71396901b4b68731e22e3ced23f97effe6f53fe88a2435d7a17c1dd8349b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/bundle.json","state_url":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/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-06-02T12:31:00Z","links":{"resolver":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6","bundle":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/bundle.json","state":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5L5MH2D43ZC3H7ORNDWWO5T4V6","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":"73cc0914bfdb993c7ce34e301edcd47b250ac8b684ef4aad50182a900bf35002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T16:37:43Z","title_canon_sha256":"2fa18fcddcf728f71ce9773fb0e1c0c9b85b32400754ab745844d858396efabf"},"schema_version":"1.0","source":{"id":"1011.3441","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3441","created_at":"2026-05-18T02:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3441v2","created_at":"2026-05-18T02:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3441","created_at":"2026-05-18T02:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"5L5MH2D43ZC3","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5L5MH2D43ZC3H7OR","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5L5MH2D4","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:83de71396901b4b68731e22e3ced23f97effe6f53fe88a2435d7a17c1dd8349b","target":"graph","created_at":"2026-05-18T02:04:47Z","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"},"paper":{"abstract_excerpt":"In this paper, we explore worst-case solutions for the problems of single and multiple matching on strings in the word RAM model with word length w. In the first problem, we have to build a data structure based on a pattern p of length m over an alphabet of size sigma such that we can answer to the following query: given a text T of length n, where each character is encoded using log(sigma) bits return the positions of all the occurrences of p in T (in the following we refer by occ to the number of reported occurrences). For the multi-pattern matching problem we have a set S of d patterns of t","authors_text":"Djamal Belazzougui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T16:37:43Z","title":"Worst case efficient single and multiple string matching in the Word-RAM model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3441","kind":"arxiv","version":2},"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:cea983315504aabcae536a7b1a57ccc6d01aeff7b2dd0f0d350abc8cc91493cf","target":"record","created_at":"2026-05-18T02:04:47Z","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":"73cc0914bfdb993c7ce34e301edcd47b250ac8b684ef4aad50182a900bf35002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T16:37:43Z","title_canon_sha256":"2fa18fcddcf728f71ce9773fb0e1c0c9b85b32400754ab745844d858396efabf"},"schema_version":"1.0","source":{"id":"1011.3441","kind":"arxiv","version":2}},"canonical_sha256":"eafac3e87cde45b3fdd168ed67767caf9349becf7200444fc84631d0a033b98d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eafac3e87cde45b3fdd168ed67767caf9349becf7200444fc84631d0a033b98d","first_computed_at":"2026-05-18T02:04:47.487281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:47.487281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BrslT7osDjiVWXM4UBruhchqBlp7aowZJjIEFJ01rpaPAb2znsqqAM0ag8LD39xMwFx8yghK5fuLKv3LA6epAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:47.487846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3441","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cea983315504aabcae536a7b1a57ccc6d01aeff7b2dd0f0d350abc8cc91493cf","sha256:83de71396901b4b68731e22e3ced23f97effe6f53fe88a2435d7a17c1dd8349b"],"state_sha256":"41991a0827c699aafb468d54f9432484a9ce2f492794fbd501407d795da36e9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjUHXiHIFylJVghFZOP2ls/j25hEe6M3kjkwQUMYlovtWOAOVNIasBym+N4SQauj/wGmQbL5315WDBObES24AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:31:00.615692Z","bundle_sha256":"cf520fab037b254493abe58b514e5cbfc448ffcc1b9dfce9f30435cfa0ea1d32"}}