{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:N324ZRORNDSLC2OONISHAHKU72","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":"0c8c2e9aef515967a98fecaef7f137bdf0ba9d64c3f3cd6ce40d984c4ae7a473","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T09:49:10Z","title_canon_sha256":"5d218c3bbef2403afd61b7f749b445c9999f58b916160ce2616c267884a18cbb"},"schema_version":"1.0","source":{"id":"1103.2613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2613","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2613v1","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2613","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"N324ZRORNDSL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N324ZRORNDSLC2OO","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N324ZROR","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:b5881700bd3b5a21c20cd732661b3dd74fc1ad00b2ee7cb012c54145aa93c7db","target":"graph","created_at":"2026-05-18T02:22:19Z","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":"Packing several characters into one computer word is a simple and natural way to compress the representation of a string and to speed up its processing. Exploiting this idea, we propose an index for a packed string, based on a {\\em sparse suffix tree} \\cite{KU-96} with appropriately defined suffix links. Assuming, under the standard unit-cost RAM model, that a word can store up to $\\log_{\\sigma}n$ characters ($\\sigma$ the alphabet size), our index takes $O(n/\\log_{\\sigma}n)$ space, i.e. the same space as the packed string itself. The resulting pattern matching algorithm runs in time $O(m+r^2+r","authors_text":"Gregory Kucherov, Roman Kolpakov, Tatiana Starikovskaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T09:49:10Z","title":"Linear pattern matching on sparse suffix trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2613","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:238aebf617bed115d1b6d31fd63c4b05f76e8f12daea2d5dbc1c959601141d71","target":"record","created_at":"2026-05-18T02:22:19Z","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":"0c8c2e9aef515967a98fecaef7f137bdf0ba9d64c3f3cd6ce40d984c4ae7a473","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T09:49:10Z","title_canon_sha256":"5d218c3bbef2403afd61b7f749b445c9999f58b916160ce2616c267884a18cbb"},"schema_version":"1.0","source":{"id":"1103.2613","kind":"arxiv","version":1}},"canonical_sha256":"6ef5ccc5d168e4b169ce6a24701d54febf31f27eb26bcce39c0c2e456dae2525","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ef5ccc5d168e4b169ce6a24701d54febf31f27eb26bcce39c0c2e456dae2525","first_computed_at":"2026-05-18T02:22:19.501734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:19.501734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bjfWGSMXuN1Ye5aJ49wbsf6IbE6nHy21yGA1U6DC4aUy5TfTu/YLLXgXwc/o+NhlRzjnLhPKqrFh4F4zQ745Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:19.502372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:238aebf617bed115d1b6d31fd63c4b05f76e8f12daea2d5dbc1c959601141d71","sha256:b5881700bd3b5a21c20cd732661b3dd74fc1ad00b2ee7cb012c54145aa93c7db"],"state_sha256":"f9716a2e899d1cf3ead84d095c831b955ecb6cdcd507e15fe64fe8f27afdcf56"}