{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RPJV5N7MUDP4G3UNVQZC5S5VAE","short_pith_number":"pith:RPJV5N7M","schema_version":"1.0","canonical_sha256":"8bd35eb7eca0dfc36e8dac322ecbb5013d5519ef0f6d6ee07e1d95a9910f31d9","source":{"kind":"arxiv","id":"1706.04928","version":2},"attestation_state":"computed","paper":{"title":"The complexity of the Multiple Pattern Matching Problem for random strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Sportiello, Fr\\'ed\\'erique Bassino, Tsinjo Rakotoarimalala","submitted_at":"2017-06-15T15:28:42Z","abstract_excerpt":"We generalise a multiple string pattern matching algorithm, recently proposed by Fredriksson and Grabowski [J. Discr. Alg. 7, 2009], to deal with arbitrary dictionaries on an alphabet of size $s$. If $r_m$ is the number of words of length $m$ in the dictionary, and $\\phi(r) = \\max_m \\ln(s\\, m\\, r_m)/m$, the complexity rate for the string characters to be read by this algorithm is at most $\\kappa_{{}_\\textrm{UB}}\\, \\phi(r)$ for some constant $\\kappa_{{}_\\textrm{UB}}$. On the other side, we generalise the classical lower bound of Yao [SIAM J. Comput. 8, 1979], for the problem with a single patte"},"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":"1706.04928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-15T15:28:42Z","cross_cats_sorted":[],"title_canon_sha256":"e3d44954f9f53785f3c7868e595abf217a571f6e6d8fe2a71e7f585ac32ee554","abstract_canon_sha256":"b76203b2dc2bfd81ec5aab526999411d4ad6a8025dd2b4fa2c2457bb8a2f5317"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:12.177963Z","signature_b64":"AntQdisGrcfLNcfrkEpmvJwDzsVpcyDzY1FzWne3xaS2iXExLcgiz/N1ecTt+bBlQ0xiednTBoW0ANMnD/3NDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bd35eb7eca0dfc36e8dac322ecbb5013d5519ef0f6d6ee07e1d95a9910f31d9","last_reissued_at":"2026-05-18T00:41:12.177273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:12.177273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of the Multiple Pattern Matching Problem for random strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Sportiello, Fr\\'ed\\'erique Bassino, Tsinjo Rakotoarimalala","submitted_at":"2017-06-15T15:28:42Z","abstract_excerpt":"We generalise a multiple string pattern matching algorithm, recently proposed by Fredriksson and Grabowski [J. Discr. Alg. 7, 2009], to deal with arbitrary dictionaries on an alphabet of size $s$. If $r_m$ is the number of words of length $m$ in the dictionary, and $\\phi(r) = \\max_m \\ln(s\\, m\\, r_m)/m$, the complexity rate for the string characters to be read by this algorithm is at most $\\kappa_{{}_\\textrm{UB}}\\, \\phi(r)$ for some constant $\\kappa_{{}_\\textrm{UB}}$. On the other side, we generalise the classical lower bound of Yao [SIAM J. Comput. 8, 1979], for the problem with a single patte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04928","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":"1706.04928","created_at":"2026-05-18T00:41:12.177386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04928v2","created_at":"2026-05-18T00:41:12.177386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04928","created_at":"2026-05-18T00:41:12.177386+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPJV5N7MUDP4","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPJV5N7MUDP4G3UN","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPJV5N7M","created_at":"2026-05-18T12:31:39.905425+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/RPJV5N7MUDP4G3UNVQZC5S5VAE","json":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE.json","graph_json":"https://pith.science/api/pith-number/RPJV5N7MUDP4G3UNVQZC5S5VAE/graph.json","events_json":"https://pith.science/api/pith-number/RPJV5N7MUDP4G3UNVQZC5S5VAE/events.json","paper":"https://pith.science/paper/RPJV5N7M"},"agent_actions":{"view_html":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE","download_json":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE.json","view_paper":"https://pith.science/paper/RPJV5N7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04928&json=true","fetch_graph":"https://pith.science/api/pith-number/RPJV5N7MUDP4G3UNVQZC5S5VAE/graph.json","fetch_events":"https://pith.science/api/pith-number/RPJV5N7MUDP4G3UNVQZC5S5VAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/action/storage_attestation","attest_author":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/action/author_attestation","sign_citation":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/action/citation_signature","submit_replication":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/action/replication_record"}},"created_at":"2026-05-18T00:41:12.177386+00:00","updated_at":"2026-05-18T00:41:12.177386+00:00"}