{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JC7JDYFUQE6IEQ7KAAI6YUMT3J","short_pith_number":"pith:JC7JDYFU","schema_version":"1.0","canonical_sha256":"48be91e0b4813c8243ea0011ec5193da64f5d517f84a077753a30de1b3a4333e","source":{"kind":"arxiv","id":"1504.06242","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.06242","created_at":"2026-05-18T02:18:02.187279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06242v1","created_at":"2026-05-18T02:18:02.187279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06242","created_at":"2026-05-18T02:18:02.187279+00:00"},{"alias_kind":"pith_short_12","alias_value":"JC7JDYFUQE6I","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JC7JDYFUQE6IEQ7K","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JC7JDYFU","created_at":"2026-05-18T12:29:27.538025+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/JC7JDYFUQE6IEQ7KAAI6YUMT3J","json":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J.json","graph_json":"https://pith.science/api/pith-number/JC7JDYFUQE6IEQ7KAAI6YUMT3J/graph.json","events_json":"https://pith.science/api/pith-number/JC7JDYFUQE6IEQ7KAAI6YUMT3J/events.json","paper":"https://pith.science/paper/JC7JDYFU"},"agent_actions":{"view_html":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J","download_json":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J.json","view_paper":"https://pith.science/paper/JC7JDYFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06242&json=true","fetch_graph":"https://pith.science/api/pith-number/JC7JDYFUQE6IEQ7KAAI6YUMT3J/graph.json","fetch_events":"https://pith.science/api/pith-number/JC7JDYFUQE6IEQ7KAAI6YUMT3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/action/storage_attestation","attest_author":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/action/author_attestation","sign_citation":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/action/citation_signature","submit_replication":"https://pith.science/pith/JC7JDYFUQE6IEQ7KAAI6YUMT3J/action/replication_record"}},"created_at":"2026-05-18T02:18:02.187279+00:00","updated_at":"2026-05-18T02:18:02.187279+00:00"}