{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N324ZRORNDSLC2OONISHAHKU72","short_pith_number":"pith:N324ZROR","schema_version":"1.0","canonical_sha256":"6ef5ccc5d168e4b169ce6a24701d54febf31f27eb26bcce39c0c2e456dae2525","source":{"kind":"arxiv","id":"1103.2613","version":1},"attestation_state":"computed","paper":{"title":"Linear pattern matching on sparse suffix trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gregory Kucherov, Roman Kolpakov, Tatiana Starikovskaya","submitted_at":"2011-03-14T09:49:10Z","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"},"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":"1103.2613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T09:49:10Z","cross_cats_sorted":[],"title_canon_sha256":"5d218c3bbef2403afd61b7f749b445c9999f58b916160ce2616c267884a18cbb","abstract_canon_sha256":"0c8c2e9aef515967a98fecaef7f137bdf0ba9d64c3f3cd6ce40d984c4ae7a473"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:19.502372Z","signature_b64":"bjfWGSMXuN1Ye5aJ49wbsf6IbE6nHy21yGA1U6DC4aUy5TfTu/YLLXgXwc/o+NhlRzjnLhPKqrFh4F4zQ745Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef5ccc5d168e4b169ce6a24701d54febf31f27eb26bcce39c0c2e456dae2525","last_reissued_at":"2026-05-18T02:22:19.501734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:19.501734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear pattern matching on sparse suffix trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gregory Kucherov, Roman Kolpakov, Tatiana Starikovskaya","submitted_at":"2011-03-14T09:49:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2613","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":"1103.2613","created_at":"2026-05-18T02:22:19.501820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2613v1","created_at":"2026-05-18T02:22:19.501820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2613","created_at":"2026-05-18T02:22:19.501820+00:00"},{"alias_kind":"pith_short_12","alias_value":"N324ZRORNDSL","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N324ZRORNDSLC2OO","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N324ZROR","created_at":"2026-05-18T12:26:37.096874+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/N324ZRORNDSLC2OONISHAHKU72","json":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72.json","graph_json":"https://pith.science/api/pith-number/N324ZRORNDSLC2OONISHAHKU72/graph.json","events_json":"https://pith.science/api/pith-number/N324ZRORNDSLC2OONISHAHKU72/events.json","paper":"https://pith.science/paper/N324ZROR"},"agent_actions":{"view_html":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72","download_json":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72.json","view_paper":"https://pith.science/paper/N324ZROR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2613&json=true","fetch_graph":"https://pith.science/api/pith-number/N324ZRORNDSLC2OONISHAHKU72/graph.json","fetch_events":"https://pith.science/api/pith-number/N324ZRORNDSLC2OONISHAHKU72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72/action/storage_attestation","attest_author":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72/action/author_attestation","sign_citation":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72/action/citation_signature","submit_replication":"https://pith.science/pith/N324ZRORNDSLC2OONISHAHKU72/action/replication_record"}},"created_at":"2026-05-18T02:22:19.501820+00:00","updated_at":"2026-05-18T02:22:19.501820+00:00"}