{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KLZCMH76V2OX2CQJH7R7Q55MHK","short_pith_number":"pith:KLZCMH76","schema_version":"1.0","canonical_sha256":"52f2261ffeae9d7d0a093fe3f877ac3a99ec1e58c55b72dbe477a26f7603bd8c","source":{"kind":"arxiv","id":"1403.1065","version":2},"attestation_state":"computed","paper":{"title":"Compressed Subsequence Matching and Packed Tree Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Patrick Hagge Cording, Philip Bille","submitted_at":"2014-03-05T10:16:27Z","abstract_excerpt":"We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\\sigma$, our algorithm uses $O(n+\\frac{n\\sigma}{w})$ space and $O(n+\\frac{n\\sigma}{w}+m\\log N\\log w\\cdot occ)$ or $O(n+\\frac{n\\sigma}{w}\\log w+m\\log N\\cdot occ)$ time. Here $w$ is the word size and $occ$ is the number of occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for $occ=o(\\frac{n}{\\log N})$ occurrences. The algorithm uses a new data s"},"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":"1403.1065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-05T10:16:27Z","cross_cats_sorted":[],"title_canon_sha256":"8af0d9a817946da76766016659ec7718172154c0a6f0f174b5379d281fe8a2e8","abstract_canon_sha256":"5f5ca0993543e560709f6519635a03c9f0201d56cba33c830d48c0927715c45e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:24.057576Z","signature_b64":"6Ayyqw41ZEsc0BenUVhG4UjoXvElF+rypJSfsO3w3Ha+Z8tl2pNxpRU6A/bhlTupduGKqJFzz+ofxTpGVK3nDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f2261ffeae9d7d0a093fe3f877ac3a99ec1e58c55b72dbe477a26f7603bd8c","last_reissued_at":"2026-05-18T02:50:24.057019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:24.057019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Subsequence Matching and Packed Tree Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Patrick Hagge Cording, Philip Bille","submitted_at":"2014-03-05T10:16:27Z","abstract_excerpt":"We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\\sigma$, our algorithm uses $O(n+\\frac{n\\sigma}{w})$ space and $O(n+\\frac{n\\sigma}{w}+m\\log N\\log w\\cdot occ)$ or $O(n+\\frac{n\\sigma}{w}\\log w+m\\log N\\cdot occ)$ time. Here $w$ is the word size and $occ$ is the number of occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for $occ=o(\\frac{n}{\\log N})$ occurrences. The algorithm uses a new data s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1065","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":"1403.1065","created_at":"2026-05-18T02:50:24.057096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1065v2","created_at":"2026-05-18T02:50:24.057096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1065","created_at":"2026-05-18T02:50:24.057096+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLZCMH76V2OX","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLZCMH76V2OX2CQJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLZCMH76","created_at":"2026-05-18T12:28:35.611951+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/KLZCMH76V2OX2CQJH7R7Q55MHK","json":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK.json","graph_json":"https://pith.science/api/pith-number/KLZCMH76V2OX2CQJH7R7Q55MHK/graph.json","events_json":"https://pith.science/api/pith-number/KLZCMH76V2OX2CQJH7R7Q55MHK/events.json","paper":"https://pith.science/paper/KLZCMH76"},"agent_actions":{"view_html":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK","download_json":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK.json","view_paper":"https://pith.science/paper/KLZCMH76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1065&json=true","fetch_graph":"https://pith.science/api/pith-number/KLZCMH76V2OX2CQJH7R7Q55MHK/graph.json","fetch_events":"https://pith.science/api/pith-number/KLZCMH76V2OX2CQJH7R7Q55MHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/action/storage_attestation","attest_author":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/action/author_attestation","sign_citation":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/action/citation_signature","submit_replication":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/action/replication_record"}},"created_at":"2026-05-18T02:50:24.057096+00:00","updated_at":"2026-05-18T02:50:24.057096+00:00"}