{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LG7N5OWBBGONQMJWQI2WJ42KPH","short_pith_number":"pith:LG7N5OWB","canonical_record":{"source":{"id":"1710.03395","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-10T03:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"b812f6ee29ecb5ee04c1f6dfab3f6be762333860bc6b3916668c839bfff0d9fd","abstract_canon_sha256":"b5ca03ce29a16b65ac3f70c6700b6420ff21bf4b57be4a5e0e4641e5422285d5"},"schema_version":"1.0"},"canonical_sha256":"59bedebac1099cd83136823564f34a79e494cd44b60659c11b3bbcef41310778","source":{"kind":"arxiv","id":"1710.03395","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03395","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03395v4","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03395","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"LG7N5OWBBGON","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LG7N5OWBBGONQMJW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LG7N5OWB","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LG7N5OWBBGONQMJWQI2WJ42KPH","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03395","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-10T03:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"b812f6ee29ecb5ee04c1f6dfab3f6be762333860bc6b3916668c839bfff0d9fd","abstract_canon_sha256":"b5ca03ce29a16b65ac3f70c6700b6420ff21bf4b57be4a5e0e4641e5422285d5"},"schema_version":"1.0"},"canonical_sha256":"59bedebac1099cd83136823564f34a79e494cd44b60659c11b3bbcef41310778","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:06.777552Z","signature_b64":"FPfHRCEqklWJtvijV4OLeTDIgnrF3MBm9XX7D1Av/ctB1wKqYM+z3tBCVnxU7X4D+4GtoYYhKgi+5YX4l0PLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bedebac1099cd83136823564f34a79e494cd44b60659c11b3bbcef41310778","last_reissued_at":"2026-05-17T23:53:06.776932Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:06.776932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03395","source_version":4,"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-17T23:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ok50OXKtAP0K41+ugo2zAsZr1ZaRVCz0Xx1NzyKcLu1f4ChQJjYazAp3QyDicEQ75y2bNL13iXsk8SSDGPwXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:37:55.901337Z"},"content_sha256":"7ce41c4bc07a9e4334ac6605feb4536834bbd4ba2c1000d5d4b7af03837e323e","schema_version":"1.0","event_id":"sha256:7ce41c4bc07a9e4334ac6605feb4536834bbd4ba2c1000d5d4b7af03837e323e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LG7N5OWBBGONQMJWQI2WJ42KPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Dynamic Dictionary Matching with DAWGs and AC-automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Shunsuke Inenaga","submitted_at":"2017-10-10T03:56:33Z","abstract_excerpt":"The dictionary matching is a task to find all occurrences of patterns in a set $D$ (called a dictionary) on a text $T$. The Aho-Corasick-automaton (AC-automaton) is a data structure which enables us to solve the dictionary matching problem in $O(d\\log\\sigma)$ preprocessing time and $O(n\\log\\sigma+occ)$ matching time, where $d$ is the total length of the patterns in $D$, $n$ is the length of the text, $\\sigma$ is the alphabet size, and $occ$ is the total number of occurrences of all the patterns in the text. The dynamic dictionary matching is a variant where patterns may dynamically be inserted"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03395","kind":"arxiv","version":4},"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-17T23:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S86MHPfhl4yDIG4nkK0GZE6yrQwwXeftCPVPQPQildP5yDIp+nibw1Kz7PYWh2t0578meomQEcLVLLeig/KKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:37:55.902060Z"},"content_sha256":"905db339dcfbe6c24c590a9469bf1d689c364d91db40360a35f2223d5a8e3df0","schema_version":"1.0","event_id":"sha256:905db339dcfbe6c24c590a9469bf1d689c364d91db40360a35f2223d5a8e3df0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/bundle.json","state_url":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/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-31T10:37:55Z","links":{"resolver":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH","bundle":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/bundle.json","state":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LG7N5OWBBGONQMJWQI2WJ42KPH","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":"b5ca03ce29a16b65ac3f70c6700b6420ff21bf4b57be4a5e0e4641e5422285d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-10T03:56:33Z","title_canon_sha256":"b812f6ee29ecb5ee04c1f6dfab3f6be762333860bc6b3916668c839bfff0d9fd"},"schema_version":"1.0","source":{"id":"1710.03395","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03395","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03395v4","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03395","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"LG7N5OWBBGON","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LG7N5OWBBGONQMJW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LG7N5OWB","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:905db339dcfbe6c24c590a9469bf1d689c364d91db40360a35f2223d5a8e3df0","target":"graph","created_at":"2026-05-17T23:53:06Z","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":"The dictionary matching is a task to find all occurrences of patterns in a set $D$ (called a dictionary) on a text $T$. The Aho-Corasick-automaton (AC-automaton) is a data structure which enables us to solve the dictionary matching problem in $O(d\\log\\sigma)$ preprocessing time and $O(n\\log\\sigma+occ)$ matching time, where $d$ is the total length of the patterns in $D$, $n$ is the length of the text, $\\sigma$ is the alphabet size, and $occ$ is the total number of occurrences of all the patterns in the text. The dynamic dictionary matching is a variant where patterns may dynamically be inserted","authors_text":"Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Shunsuke Inenaga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-10T03:56:33Z","title":"Efficient Dynamic Dictionary Matching with DAWGs and AC-automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03395","kind":"arxiv","version":4},"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:7ce41c4bc07a9e4334ac6605feb4536834bbd4ba2c1000d5d4b7af03837e323e","target":"record","created_at":"2026-05-17T23:53:06Z","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":"b5ca03ce29a16b65ac3f70c6700b6420ff21bf4b57be4a5e0e4641e5422285d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-10T03:56:33Z","title_canon_sha256":"b812f6ee29ecb5ee04c1f6dfab3f6be762333860bc6b3916668c839bfff0d9fd"},"schema_version":"1.0","source":{"id":"1710.03395","kind":"arxiv","version":4}},"canonical_sha256":"59bedebac1099cd83136823564f34a79e494cd44b60659c11b3bbcef41310778","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59bedebac1099cd83136823564f34a79e494cd44b60659c11b3bbcef41310778","first_computed_at":"2026-05-17T23:53:06.776932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:06.776932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPfHRCEqklWJtvijV4OLeTDIgnrF3MBm9XX7D1Av/ctB1wKqYM+z3tBCVnxU7X4D+4GtoYYhKgi+5YX4l0PLCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:06.777552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03395","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce41c4bc07a9e4334ac6605feb4536834bbd4ba2c1000d5d4b7af03837e323e","sha256:905db339dcfbe6c24c590a9469bf1d689c364d91db40360a35f2223d5a8e3df0"],"state_sha256":"963e306416fc6ec58b3d71307d0a1cacab7236e102d6b10329bf92b71474af48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4j4+RPzgpCMmb0+4t2GXhWKrRhqhl+pElTcrZTzZOMF24ciXEOM4ZHVOZar+utft3xqtfbHAH0A5CmjCB7iGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:37:55.905227Z","bundle_sha256":"65f50336f7cd1d07e33282222cfd18ea3b4db1e6914e0c5cfeb026ebb8665896"}}