{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5L5MH2D43ZC3H7ORNDWWO5T4V6","short_pith_number":"pith:5L5MH2D4","schema_version":"1.0","canonical_sha256":"eafac3e87cde45b3fdd168ed67767caf9349becf7200444fc84631d0a033b98d","source":{"kind":"arxiv","id":"1011.3441","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.3441","created_at":"2026-05-18T02:04:47.487373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3441v2","created_at":"2026-05-18T02:04:47.487373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3441","created_at":"2026-05-18T02:04:47.487373+00:00"},{"alias_kind":"pith_short_12","alias_value":"5L5MH2D43ZC3","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5L5MH2D43ZC3H7OR","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5L5MH2D4","created_at":"2026-05-18T12:26:04.259169+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/5L5MH2D43ZC3H7ORNDWWO5T4V6","json":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6.json","graph_json":"https://pith.science/api/pith-number/5L5MH2D43ZC3H7ORNDWWO5T4V6/graph.json","events_json":"https://pith.science/api/pith-number/5L5MH2D43ZC3H7ORNDWWO5T4V6/events.json","paper":"https://pith.science/paper/5L5MH2D4"},"agent_actions":{"view_html":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6","download_json":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6.json","view_paper":"https://pith.science/paper/5L5MH2D4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3441&json=true","fetch_graph":"https://pith.science/api/pith-number/5L5MH2D43ZC3H7ORNDWWO5T4V6/graph.json","fetch_events":"https://pith.science/api/pith-number/5L5MH2D43ZC3H7ORNDWWO5T4V6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/action/storage_attestation","attest_author":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/action/author_attestation","sign_citation":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/action/citation_signature","submit_replication":"https://pith.science/pith/5L5MH2D43ZC3H7ORNDWWO5T4V6/action/replication_record"}},"created_at":"2026-05-18T02:04:47.487373+00:00","updated_at":"2026-05-18T02:04:47.487373+00:00"}