{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NJKGX5UX4KGPWWNGCCBGRXMVSO","short_pith_number":"pith:NJKGX5UX","schema_version":"1.0","canonical_sha256":"6a546bf697e28cfb59a6108268dd959389d947378068a578699e35555d0548fc","source":{"kind":"arxiv","id":"1711.08217","version":3},"attestation_state":"computed","paper":{"title":"Compressed Indexing with Signature Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Roy Christiansen, Mikko Berggren Ettienne","submitted_at":"2017-11-22T10:40:06Z","abstract_excerpt":"The compressed indexing problem is to preprocess a string $S$ of length $n$ into a compressed representation that supports pattern matching queries. That is, given a string $P$ of length $m$ report all occurrences of $P$ in $S$.\n  We present a data structure that supports pattern matching queries in $O(m + occ (\\lg\\lg n + \\lg^\\epsilon z))$ time using $O(z \\lg(n / z))$ space where $z$ is the size of the LZ77 parse of $S$ and $\\epsilon > 0$ is an arbitrarily small constant, when the alphabet is small or $z = O(n^{1 - \\delta})$ for any constant $\\delta > 0$. We also present two data structures fo"},"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":"1711.08217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T10:40:06Z","cross_cats_sorted":[],"title_canon_sha256":"71ef1ff0edfe542a8304d8b2b1a0d2e7ca0c418ca630e748644b1c8c4342a2f9","abstract_canon_sha256":"bae304dedcd6370b216199b31d5b902735ad39dc1cc8b597c63d3cf938fd242d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:46.038679Z","signature_b64":"lNNyNrGY3ius6nndDn5KCrZOvPO/zkFNucaBm41IVabB9CuGUqQidIOkxF4LivXK12VCli9RHPmkkE/r1QaOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a546bf697e28cfb59a6108268dd959389d947378068a578699e35555d0548fc","last_reissued_at":"2026-05-18T00:18:46.038037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:46.038037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Indexing with Signature Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Roy Christiansen, Mikko Berggren Ettienne","submitted_at":"2017-11-22T10:40:06Z","abstract_excerpt":"The compressed indexing problem is to preprocess a string $S$ of length $n$ into a compressed representation that supports pattern matching queries. That is, given a string $P$ of length $m$ report all occurrences of $P$ in $S$.\n  We present a data structure that supports pattern matching queries in $O(m + occ (\\lg\\lg n + \\lg^\\epsilon z))$ time using $O(z \\lg(n / z))$ space where $z$ is the size of the LZ77 parse of $S$ and $\\epsilon > 0$ is an arbitrarily small constant, when the alphabet is small or $z = O(n^{1 - \\delta})$ for any constant $\\delta > 0$. We also present two data structures fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08217","kind":"arxiv","version":3},"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":"1711.08217","created_at":"2026-05-18T00:18:46.038127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08217v3","created_at":"2026-05-18T00:18:46.038127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08217","created_at":"2026-05-18T00:18:46.038127+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJKGX5UX4KGP","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJKGX5UX4KGPWWNG","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJKGX5UX","created_at":"2026-05-18T12:31:31.346846+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/NJKGX5UX4KGPWWNGCCBGRXMVSO","json":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO.json","graph_json":"https://pith.science/api/pith-number/NJKGX5UX4KGPWWNGCCBGRXMVSO/graph.json","events_json":"https://pith.science/api/pith-number/NJKGX5UX4KGPWWNGCCBGRXMVSO/events.json","paper":"https://pith.science/paper/NJKGX5UX"},"agent_actions":{"view_html":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO","download_json":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO.json","view_paper":"https://pith.science/paper/NJKGX5UX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08217&json=true","fetch_graph":"https://pith.science/api/pith-number/NJKGX5UX4KGPWWNGCCBGRXMVSO/graph.json","fetch_events":"https://pith.science/api/pith-number/NJKGX5UX4KGPWWNGCCBGRXMVSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/action/storage_attestation","attest_author":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/action/author_attestation","sign_citation":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/action/citation_signature","submit_replication":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/action/replication_record"}},"created_at":"2026-05-18T00:18:46.038127+00:00","updated_at":"2026-05-18T00:18:46.038127+00:00"}