{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VKOU56JU57MXTXX5JRZSBHWSZY","short_pith_number":"pith:VKOU56JU","canonical_record":{"source":{"id":"1109.2930","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T21:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"7fd74c950267adc1bdf0eccbd58f15ced7c5b97e1a63175e0a49ff6184fd099f","abstract_canon_sha256":"1173f0cc0c6e8b2a3316b61f098d1536a629d552229f62c55024119a8cefdcf5"},"schema_version":"1.0"},"canonical_sha256":"aa9d4ef934efd979defd4c73209ed2ce156c1c06210cdab2c2fa155f8a040e27","source":{"kind":"arxiv","id":"1109.2930","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2930","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2930v4","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2930","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"VKOU56JU57MX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKOU56JU57MXTXX5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKOU56JU","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VKOU56JU57MXTXX5JRZSBHWSZY","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2930","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T21:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"7fd74c950267adc1bdf0eccbd58f15ced7c5b97e1a63175e0a49ff6184fd099f","abstract_canon_sha256":"1173f0cc0c6e8b2a3316b61f098d1536a629d552229f62c55024119a8cefdcf5"},"schema_version":"1.0"},"canonical_sha256":"aa9d4ef934efd979defd4c73209ed2ce156c1c06210cdab2c2fa155f8a040e27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:56.533648Z","signature_b64":"F6fj67YiBxiJVDLkVrH1aATzj5MaDhHT9RvFxYenq+/LYAZZbPjO43WhjwSSNCz1jPnc9McyvlqyFkbflQecDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9d4ef934efd979defd4c73209ed2ce156c1c06210cdab2c2fa155f8a040e27","last_reissued_at":"2026-05-18T03:41:56.532992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:56.532992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2930","source_version":4,"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-18T03:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VE0UgJqgakdAF4pVISUFtaXOC5vfjvqwbkinemEB8PdHTH1J4pEb+W49OnZY+0Uj2M33eEl8XWffmjX6EJMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:54:18.994557Z"},"content_sha256":"1a3df31c7c633d2d3495d557acaf774eefdd172e6db473e780a7bb68c4eed25d","schema_version":"1.0","event_id":"sha256:1a3df31c7c633d2d3495d557acaf774eefdd172e6db473e780a7bb68c4eed25d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VKOU56JU57MXTXX5JRZSBHWSZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Approximate Pattern Matching in Compressed Repetitive Texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Hoobin, Pawe{\\l} Gawrychowski, Simon J. Puglisi, Travis Gagie","submitted_at":"2011-09-13T21:10:01Z","abstract_excerpt":"Motivated by the imminent growth of massive, highly redundant genomic databases, we study the problem of compressing a string database while simultaneously supporting fast random access, substring extraction and pattern matching to the underlying string(s). Bille et al. (2011) recently showed how, given a straight-line program with $r$ rules for a string $s$ of length $n$, we can build an $\\Oh{r}$-word data structure that allows us to extract any substring of length $m$ in $\\Oh{\\log n + m}$ time. They also showed how, given a pattern $p$ of length $m$ and an edit distance (k \\leq m), their dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2930","kind":"arxiv","version":4},"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-18T03:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsEUTKAt2e+XPHncY/osudRVsbF6RL3Ux/qhdWTZBprxt3+6ntqMZhiha4+zDA7eZe6Rb6TbmSOWI2QDtQSMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:54:18.995258Z"},"content_sha256":"b7188224ec5f1c19a2703db1aba1f386e541ddfe96fdf5f67bcfebea4745dd5e","schema_version":"1.0","event_id":"sha256:b7188224ec5f1c19a2703db1aba1f386e541ddfe96fdf5f67bcfebea4745dd5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/bundle.json","state_url":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKOU56JU57MXTXX5JRZSBHWSZY/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-27T08:54:18Z","links":{"resolver":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY","bundle":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/bundle.json","state":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKOU56JU57MXTXX5JRZSBHWSZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VKOU56JU57MXTXX5JRZSBHWSZY","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":"1173f0cc0c6e8b2a3316b61f098d1536a629d552229f62c55024119a8cefdcf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T21:10:01Z","title_canon_sha256":"7fd74c950267adc1bdf0eccbd58f15ced7c5b97e1a63175e0a49ff6184fd099f"},"schema_version":"1.0","source":{"id":"1109.2930","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2930","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2930v4","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2930","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"VKOU56JU57MX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKOU56JU57MXTXX5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKOU56JU","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:b7188224ec5f1c19a2703db1aba1f386e541ddfe96fdf5f67bcfebea4745dd5e","target":"graph","created_at":"2026-05-18T03:41:56Z","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":"Motivated by the imminent growth of massive, highly redundant genomic databases, we study the problem of compressing a string database while simultaneously supporting fast random access, substring extraction and pattern matching to the underlying string(s). Bille et al. (2011) recently showed how, given a straight-line program with $r$ rules for a string $s$ of length $n$, we can build an $\\Oh{r}$-word data structure that allows us to extract any substring of length $m$ in $\\Oh{\\log n + m}$ time. They also showed how, given a pattern $p$ of length $m$ and an edit distance (k \\leq m), their dat","authors_text":"Christopher Hoobin, Pawe{\\l} Gawrychowski, Simon J. Puglisi, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T21:10:01Z","title":"Faster Approximate Pattern Matching in Compressed Repetitive Texts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2930","kind":"arxiv","version":4},"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:1a3df31c7c633d2d3495d557acaf774eefdd172e6db473e780a7bb68c4eed25d","target":"record","created_at":"2026-05-18T03:41:56Z","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":"1173f0cc0c6e8b2a3316b61f098d1536a629d552229f62c55024119a8cefdcf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T21:10:01Z","title_canon_sha256":"7fd74c950267adc1bdf0eccbd58f15ced7c5b97e1a63175e0a49ff6184fd099f"},"schema_version":"1.0","source":{"id":"1109.2930","kind":"arxiv","version":4}},"canonical_sha256":"aa9d4ef934efd979defd4c73209ed2ce156c1c06210cdab2c2fa155f8a040e27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa9d4ef934efd979defd4c73209ed2ce156c1c06210cdab2c2fa155f8a040e27","first_computed_at":"2026-05-18T03:41:56.532992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:56.532992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F6fj67YiBxiJVDLkVrH1aATzj5MaDhHT9RvFxYenq+/LYAZZbPjO43WhjwSSNCz1jPnc9McyvlqyFkbflQecDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:56.533648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2930","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a3df31c7c633d2d3495d557acaf774eefdd172e6db473e780a7bb68c4eed25d","sha256:b7188224ec5f1c19a2703db1aba1f386e541ddfe96fdf5f67bcfebea4745dd5e"],"state_sha256":"f6747a5b4c15395ada20f156639f19a24eac20973567b6403818abaf049d27da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgQFCAffcicNu6zjUQkTJEDVTXJr6jeBESZTGNDk/VqUeq/s27yU76z5xyae7XLTGZc+fWv45z3bK6pnnFRDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:54:18.998367Z","bundle_sha256":"e91262570fae67fd0978f122fbfccf1d870ba9b0c60a46e01b180bad2f918bed"}}