{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WZ3DPI5NDZ2GOUIBDDUN7RKAIF","short_pith_number":"pith:WZ3DPI5N","schema_version":"1.0","canonical_sha256":"b67637a3ad1e7467510118e8dfc5404170e2a2d7f27b343e5c338b2b4f922cee","source":{"kind":"arxiv","id":"1706.10094","version":2},"attestation_state":"computed","paper":{"title":"Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Mikko Berggren Ettienne, Philip Bille","submitted_at":"2017-06-30T10:02:10Z","abstract_excerpt":"Given a string $S$, the \\emph{compressed indexing problem} is to preprocess $S$ into a compressed representation that supports fast \\emph{substring queries}. The goal is to use little space relative to the compressed size of $S$ while supporting fast queries. We present a compressed index based on the Lempel--Ziv 1977 compression scheme. We obtain the following time-space trade-offs: For constant-sized alphabets; (i) $O(m + occ \\lg\\lg n)$ time using $O(z\\lg(n/z)\\lg\\lg z)$ space, or (ii) $O(m(1 + \\frac{\\lg^\\epsilon z}{\\lg(n/z)}) + occ(\\lg\\lg n + \\lg^\\epsilon z))$ time using $O(z\\lg(n/z))$ space"},"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":"1706.10094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-30T10:02:10Z","cross_cats_sorted":[],"title_canon_sha256":"c71b403056124338bf33156941ee4865fa0fc7bea6ed2cd80cc79653b7e33157","abstract_canon_sha256":"64448a753ffa7d8af8120b1ca06ac04ef35e4b1a3fe06db94494ddd636e27b5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:29.723635Z","signature_b64":"iD1TOQ2fxOvD1/K+NX+idgfY4TxrNCXJCVUd9z3sz7pnf6g6CNMbwkcor4kvn/JIfAd0rCyvVjQdLls0g/TeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b67637a3ad1e7467510118e8dfc5404170e2a2d7f27b343e5c338b2b4f922cee","last_reissued_at":"2026-05-18T00:26:29.722793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:29.722793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Mikko Berggren Ettienne, Philip Bille","submitted_at":"2017-06-30T10:02:10Z","abstract_excerpt":"Given a string $S$, the \\emph{compressed indexing problem} is to preprocess $S$ into a compressed representation that supports fast \\emph{substring queries}. The goal is to use little space relative to the compressed size of $S$ while supporting fast queries. We present a compressed index based on the Lempel--Ziv 1977 compression scheme. We obtain the following time-space trade-offs: For constant-sized alphabets; (i) $O(m + occ \\lg\\lg n)$ time using $O(z\\lg(n/z)\\lg\\lg z)$ space, or (ii) $O(m(1 + \\frac{\\lg^\\epsilon z}{\\lg(n/z)}) + occ(\\lg\\lg n + \\lg^\\epsilon z))$ time using $O(z\\lg(n/z))$ space"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10094","kind":"arxiv","version":2},"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":"1706.10094","created_at":"2026-05-18T00:26:29.722915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10094v2","created_at":"2026-05-18T00:26:29.722915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10094","created_at":"2026-05-18T00:26:29.722915+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZ3DPI5NDZ2G","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZ3DPI5NDZ2GOUIB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZ3DPI5N","created_at":"2026-05-18T12:31:53.515858+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/WZ3DPI5NDZ2GOUIBDDUN7RKAIF","json":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF.json","graph_json":"https://pith.science/api/pith-number/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/graph.json","events_json":"https://pith.science/api/pith-number/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/events.json","paper":"https://pith.science/paper/WZ3DPI5N"},"agent_actions":{"view_html":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF","download_json":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF.json","view_paper":"https://pith.science/paper/WZ3DPI5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10094&json=true","fetch_graph":"https://pith.science/api/pith-number/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/graph.json","fetch_events":"https://pith.science/api/pith-number/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/action/storage_attestation","attest_author":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/action/author_attestation","sign_citation":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/action/citation_signature","submit_replication":"https://pith.science/pith/WZ3DPI5NDZ2GOUIBDDUN7RKAIF/action/replication_record"}},"created_at":"2026-05-18T00:26:29.722915+00:00","updated_at":"2026-05-18T00:26:29.722915+00:00"}