{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LG7N5OWBBGONQMJWQI2WJ42KPH","short_pith_number":"pith:LG7N5OWB","schema_version":"1.0","canonical_sha256":"59bedebac1099cd83136823564f34a79e494cd44b60659c11b3bbcef41310778","source":{"kind":"arxiv","id":"1710.03395","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.03395","created_at":"2026-05-17T23:53:06.777027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03395v4","created_at":"2026-05-17T23:53:06.777027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03395","created_at":"2026-05-17T23:53:06.777027+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG7N5OWBBGON","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG7N5OWBBGONQMJW","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG7N5OWB","created_at":"2026-05-18T12:31:28.150371+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/LG7N5OWBBGONQMJWQI2WJ42KPH","json":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH.json","graph_json":"https://pith.science/api/pith-number/LG7N5OWBBGONQMJWQI2WJ42KPH/graph.json","events_json":"https://pith.science/api/pith-number/LG7N5OWBBGONQMJWQI2WJ42KPH/events.json","paper":"https://pith.science/paper/LG7N5OWB"},"agent_actions":{"view_html":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH","download_json":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH.json","view_paper":"https://pith.science/paper/LG7N5OWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03395&json=true","fetch_graph":"https://pith.science/api/pith-number/LG7N5OWBBGONQMJWQI2WJ42KPH/graph.json","fetch_events":"https://pith.science/api/pith-number/LG7N5OWBBGONQMJWQI2WJ42KPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/action/storage_attestation","attest_author":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/action/author_attestation","sign_citation":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/action/citation_signature","submit_replication":"https://pith.science/pith/LG7N5OWBBGONQMJWQI2WJ42KPH/action/replication_record"}},"created_at":"2026-05-17T23:53:06.777027+00:00","updated_at":"2026-05-17T23:53:06.777027+00:00"}