{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JC7JDYFUQE6IEQ7KAAI6YUMT3J","short_pith_number":"pith:JC7JDYFU","canonical_record":{"source":{"id":"1504.06242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-23T16:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"15c61ccb841d4f3879f4e35854e36b381e1c0d42d65cffb6145ed6ebd3b643a4","abstract_canon_sha256":"dcfdffc1d4f322c0fa8ab4a78e51ecd832d67f9ff1ca1e9fd462f813a2e2da0c"},"schema_version":"1.0"},"canonical_sha256":"48be91e0b4813c8243ea0011ec5193da64f5d517f84a077753a30de1b3a4333e","source":{"kind":"arxiv","id":"1504.06242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06242","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06242v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06242","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"JC7JDYFUQE6I","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JC7JDYFUQE6IEQ7K","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JC7JDYFU","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JC7JDYFUQE6IEQ7KAAI6YUMT3J","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-23T16:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"15c61ccb841d4f3879f4e35854e36b381e1c0d42d65cffb6145ed6ebd3b643a4","abstract_canon_sha256":"dcfdffc1d4f322c0fa8ab4a78e51ecd832d67f9ff1ca1e9fd462f813a2e2da0c"},"schema_version":"1.0"},"canonical_sha256":"48be91e0b4813c8243ea0011ec5193da64f5d517f84a077753a30de1b3a4333e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:02.187831Z","signature_b64":"OVpVNZ0gSeVHMO2AjofniMGxoUu/98epAliZRvwlrXRovGfL+FFXXRqgxBsIDFVlO7vlgmmHU85M+gxVJkd/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48be91e0b4813c8243ea0011ec5193da64f5d517f84a077753a30de1b3a4333e","last_reissued_at":"2026-05-18T02:18:02.187170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:02.187170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06242","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-05-18T02:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UV/ccIpcke22KBQEPlbdIfd+thDRBOmkICHPOAHJDyRCqeRYATvGrAl50/kUil5ohvWyR8S9wNKWOLf9i4OECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:55:25.576548Z"},"content_sha256":"37425acbb8e44eed9a16e36bffb7adeb57499281cfe77658d07c95d382e1f8b8","schema_version":"1.0","event_id":"sha256:37425acbb8e44eed9a16e36bffb7adeb57499281cfe77658d07c95d382e1f8b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JC7JDYFUQE6IEQ7KAAI6YUMT3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dictionary matching in a stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allyx Fontaine, Benjamin Sach, Ely Porat, Raphael Clifford, Tatiana Starikovskaya","submitted_at":"2015-04-23T16:24:15Z","abstract_excerpt":"We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream. We present a randomised algorithm which takes O(log log(k + m)) time per arriving character and uses O(k log m) words of space, where k is the number of strings in the dictionary and m is the length of the longest string in the dictionary."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06242","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":""},"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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0e2j5p6la08R0rEZokQ689lBxYIVMSsnokN4D4Du+tBhv8s/iX9ZqUBjePriO9jHhTTDZNHR8b2VgDJ7CngCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:55:25.576887Z"},"content_sha256":"a0e632058653f08acfe17d7b3868b2521658c23a13498ac92d46343d82f48ce2","schema_version":"1.0","event_id":"sha256:a0e632058653f08acfe17d7b3868b2521658c23a13498ac92d46343d82f48ce2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/bundle.json","state_url":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/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-05-28T10:55:25Z","links":{"resolver":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J","bundle":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/bundle.json","state":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JC7JDYFUQE6IEQ7KAAI6YUMT3J","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":"dcfdffc1d4f322c0fa8ab4a78e51ecd832d67f9ff1ca1e9fd462f813a2e2da0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-23T16:24:15Z","title_canon_sha256":"15c61ccb841d4f3879f4e35854e36b381e1c0d42d65cffb6145ed6ebd3b643a4"},"schema_version":"1.0","source":{"id":"1504.06242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06242","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06242v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06242","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"JC7JDYFUQE6I","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JC7JDYFUQE6IEQ7K","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JC7JDYFU","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:a0e632058653f08acfe17d7b3868b2521658c23a13498ac92d46343d82f48ce2","target":"graph","created_at":"2026-05-18T02:18:02Z","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 consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream. We present a randomised algorithm which takes O(log log(k + m)) time per arriving character and uses O(k log m) words of space, where k is the number of strings in the dictionary and m is the length of the longest string in the dictionary.","authors_text":"Allyx Fontaine, Benjamin Sach, Ely Porat, Raphael Clifford, Tatiana Starikovskaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-23T16:24:15Z","title":"Dictionary matching in a stream"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06242","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:37425acbb8e44eed9a16e36bffb7adeb57499281cfe77658d07c95d382e1f8b8","target":"record","created_at":"2026-05-18T02:18:02Z","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":"dcfdffc1d4f322c0fa8ab4a78e51ecd832d67f9ff1ca1e9fd462f813a2e2da0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-23T16:24:15Z","title_canon_sha256":"15c61ccb841d4f3879f4e35854e36b381e1c0d42d65cffb6145ed6ebd3b643a4"},"schema_version":"1.0","source":{"id":"1504.06242","kind":"arxiv","version":1}},"canonical_sha256":"48be91e0b4813c8243ea0011ec5193da64f5d517f84a077753a30de1b3a4333e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48be91e0b4813c8243ea0011ec5193da64f5d517f84a077753a30de1b3a4333e","first_computed_at":"2026-05-18T02:18:02.187170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:02.187170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OVpVNZ0gSeVHMO2AjofniMGxoUu/98epAliZRvwlrXRovGfL+FFXXRqgxBsIDFVlO7vlgmmHU85M+gxVJkd/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:02.187831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37425acbb8e44eed9a16e36bffb7adeb57499281cfe77658d07c95d382e1f8b8","sha256:a0e632058653f08acfe17d7b3868b2521658c23a13498ac92d46343d82f48ce2"],"state_sha256":"65ab29309228a16fa35af8e005996bb6e1f571ad664c013f3824b300dc72409f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzvxOir3Ge4bVfJ8w9Y3sKOQDszUtgSST0zpKfM1cNk4S1DISQLPaIvGQ9+XHCxne9sG3pbnRMHB/4Xz0NgHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:55:25.578848Z","bundle_sha256":"21822581b7d10d0d1c4e173ed724c4aa8ec919cfd142bdb2ab917d121d25ab1a"}}