{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KLZCMH76V2OX2CQJH7R7Q55MHK","short_pith_number":"pith:KLZCMH76","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"},"canonical_sha256":"52f2261ffeae9d7d0a093fe3f877ac3a99ec1e58c55b72dbe477a26f7603bd8c","source":{"kind":"arxiv","id":"1403.1065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1065","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1065v2","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1065","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"KLZCMH76V2OX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KLZCMH76V2OX2CQJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KLZCMH76","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KLZCMH76V2OX2CQJH7R7Q55MHK","target":"record","payload":{"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"},"canonical_sha256":"52f2261ffeae9d7d0a093fe3f877ac3a99ec1e58c55b72dbe477a26f7603bd8c","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"},"source_kind":"arxiv","source_id":"1403.1065","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5j4/fuzlHDlhneU6DOQO3kmU74913X1KLeeZ3gLqsl3FByT0eiw0WxxA3iQU2gKu33ahc28BbrXK/jjfPz44Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:20:41.191203Z"},"content_sha256":"624cd4c89a16c86eb3a2953fca7ee0308ac90b1bee13e198d98287868f04c911","schema_version":"1.0","event_id":"sha256:624cd4c89a16c86eb3a2953fca7ee0308ac90b1bee13e198d98287868f04c911"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KLZCMH76V2OX2CQJH7R7Q55MHK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v69P1ZFXPYN7ZHPKMgnDq9gWYKAN0Uk5vOwL9XJLvkltKJ7Dp2wKC9F6wnOZhPUnBwLcHx9Q2vI3cywDsIhIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:20:41.191684Z"},"content_sha256":"1468dbb77ed9269c6fbee2b4abe2f1c5e09e2da056c252f35840c8a01aa34e25","schema_version":"1.0","event_id":"sha256:1468dbb77ed9269c6fbee2b4abe2f1c5e09e2da056c252f35840c8a01aa34e25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/bundle.json","state_url":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:20:41Z","links":{"resolver":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK","bundle":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/bundle.json","state":"https://pith.science/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLZCMH76V2OX2CQJH7R7Q55MHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KLZCMH76V2OX2CQJH7R7Q55MHK","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":"5f5ca0993543e560709f6519635a03c9f0201d56cba33c830d48c0927715c45e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-05T10:16:27Z","title_canon_sha256":"8af0d9a817946da76766016659ec7718172154c0a6f0f174b5379d281fe8a2e8"},"schema_version":"1.0","source":{"id":"1403.1065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1065","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1065v2","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1065","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"KLZCMH76V2OX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KLZCMH76V2OX2CQJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KLZCMH76","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:1468dbb77ed9269c6fbee2b4abe2f1c5e09e2da056c252f35840c8a01aa34e25","target":"graph","created_at":"2026-05-18T02:50:24Z","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":"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","authors_text":"Inge Li G{\\o}rtz, Patrick Hagge Cording, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-05T10:16:27Z","title":"Compressed Subsequence Matching and Packed Tree Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1065","kind":"arxiv","version":2},"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:624cd4c89a16c86eb3a2953fca7ee0308ac90b1bee13e198d98287868f04c911","target":"record","created_at":"2026-05-18T02:50:24Z","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":"5f5ca0993543e560709f6519635a03c9f0201d56cba33c830d48c0927715c45e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-05T10:16:27Z","title_canon_sha256":"8af0d9a817946da76766016659ec7718172154c0a6f0f174b5379d281fe8a2e8"},"schema_version":"1.0","source":{"id":"1403.1065","kind":"arxiv","version":2}},"canonical_sha256":"52f2261ffeae9d7d0a093fe3f877ac3a99ec1e58c55b72dbe477a26f7603bd8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f2261ffeae9d7d0a093fe3f877ac3a99ec1e58c55b72dbe477a26f7603bd8c","first_computed_at":"2026-05-18T02:50:24.057019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:24.057019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Ayyqw41ZEsc0BenUVhG4UjoXvElF+rypJSfsO3w3Ha+Z8tl2pNxpRU6A/bhlTupduGKqJFzz+ofxTpGVK3nDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:24.057576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:624cd4c89a16c86eb3a2953fca7ee0308ac90b1bee13e198d98287868f04c911","sha256:1468dbb77ed9269c6fbee2b4abe2f1c5e09e2da056c252f35840c8a01aa34e25"],"state_sha256":"7f70450944e731770c4366c9b8d590e17ed153c52cd54d94799b90eb628b42da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzYRqQTCPRFToiUkf0nGvUT5J95ikbEKdcyUTJi/hE8PpkDakMZ894P7VPStVasCcKXwdTmSTQmBCu4X1UGvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:20:41.194562Z","bundle_sha256":"1f4b6a2543bf274f0f34734f71b4dbbb8956bc6d7a7ff8d3baa4f1ba90206d6e"}}