{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RPJV5N7MUDP4G3UNVQZC5S5VAE","short_pith_number":"pith:RPJV5N7M","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"},"canonical_sha256":"8bd35eb7eca0dfc36e8dac322ecbb5013d5519ef0f6d6ee07e1d95a9910f31d9","source":{"kind":"arxiv","id":"1706.04928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04928","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04928v2","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04928","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"RPJV5N7MUDP4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RPJV5N7MUDP4G3UN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RPJV5N7M","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RPJV5N7MUDP4G3UNVQZC5S5VAE","target":"record","payload":{"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"},"canonical_sha256":"8bd35eb7eca0dfc36e8dac322ecbb5013d5519ef0f6d6ee07e1d95a9910f31d9","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"},"source_kind":"arxiv","source_id":"1706.04928","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-18T00:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Zu+umAMHuqhEp9u2C/+EOk01i1p3q1G8yYuvvwE8sqFplg8hTzsDCyC07PTtvSmuGs01vdKAim+L66lANT0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:58:28.359757Z"},"content_sha256":"e81c74b15895cabf1fde4febd3d5ef16e147d78454ba86dad3207b193b64270e","schema_version":"1.0","event_id":"sha256:e81c74b15895cabf1fde4febd3d5ef16e147d78454ba86dad3207b193b64270e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RPJV5N7MUDP4G3UNVQZC5S5VAE","target":"graph","payload":{"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"},"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-18T00:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+6uM/ulQYDZWoc+OMLEpeDuYutIltTa/q35byJV1bxwg78XI3t60nYavGyghYeuBCuIiO5Zc7iZ/FZ+4xGbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:58:28.360101Z"},"content_sha256":"f15b867e340e71ba7c621092f77c50f0d968bb81f70b171713ea215d95dea9a7","schema_version":"1.0","event_id":"sha256:f15b867e340e71ba7c621092f77c50f0d968bb81f70b171713ea215d95dea9a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/bundle.json","state_url":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/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-03T02:58:28Z","links":{"resolver":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE","bundle":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/bundle.json","state":"https://pith.science/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPJV5N7MUDP4G3UNVQZC5S5VAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RPJV5N7MUDP4G3UNVQZC5S5VAE","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":"b76203b2dc2bfd81ec5aab526999411d4ad6a8025dd2b4fa2c2457bb8a2f5317","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-15T15:28:42Z","title_canon_sha256":"e3d44954f9f53785f3c7868e595abf217a571f6e6d8fe2a71e7f585ac32ee554"},"schema_version":"1.0","source":{"id":"1706.04928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04928","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04928v2","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04928","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"RPJV5N7MUDP4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RPJV5N7MUDP4G3UN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RPJV5N7M","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:f15b867e340e71ba7c621092f77c50f0d968bb81f70b171713ea215d95dea9a7","target":"graph","created_at":"2026-05-18T00:41: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"},"paper":{"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","authors_text":"Andrea Sportiello, Fr\\'ed\\'erique Bassino, Tsinjo Rakotoarimalala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-15T15:28:42Z","title":"The complexity of the Multiple Pattern Matching Problem for random strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04928","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:e81c74b15895cabf1fde4febd3d5ef16e147d78454ba86dad3207b193b64270e","target":"record","created_at":"2026-05-18T00:41: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":"b76203b2dc2bfd81ec5aab526999411d4ad6a8025dd2b4fa2c2457bb8a2f5317","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-15T15:28:42Z","title_canon_sha256":"e3d44954f9f53785f3c7868e595abf217a571f6e6d8fe2a71e7f585ac32ee554"},"schema_version":"1.0","source":{"id":"1706.04928","kind":"arxiv","version":2}},"canonical_sha256":"8bd35eb7eca0dfc36e8dac322ecbb5013d5519ef0f6d6ee07e1d95a9910f31d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bd35eb7eca0dfc36e8dac322ecbb5013d5519ef0f6d6ee07e1d95a9910f31d9","first_computed_at":"2026-05-18T00:41:12.177273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:12.177273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AntQdisGrcfLNcfrkEpmvJwDzsVpcyDzY1FzWne3xaS2iXExLcgiz/N1ecTt+bBlQ0xiednTBoW0ANMnD/3NDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:12.177963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e81c74b15895cabf1fde4febd3d5ef16e147d78454ba86dad3207b193b64270e","sha256:f15b867e340e71ba7c621092f77c50f0d968bb81f70b171713ea215d95dea9a7"],"state_sha256":"125e970e4a5f0186f27b8b26a9c3060998702a1c7609eed3310578a0854897bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWLdZXt9bGQdWp9BMYRTaxZN4JNqCL0j8+Vcw2xaIS3fkN36nDSe0yZh+ua8ds9ioE4rGOlEA6RQEkRF6wn1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:58:28.362001Z","bundle_sha256":"580bf6547f90f1b9160a3626c75f830929b32f7e26df87ac64f361e217c8c6f7"}}