{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EUETDHI6YH3LNLYNAT3QETC4BQ","short_pith_number":"pith:EUETDHI6","canonical_record":{"source":{"id":"1902.03274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"0fb1d7c77ffa49fa0dcd53017551e79e2e1b9d2054f0f4953278a967de6397c9","abstract_canon_sha256":"3a55dacdc6525fdf2d38ff10a8036699810716a4c1159e85c4b316c712cac62a"},"schema_version":"1.0"},"canonical_sha256":"2509319d1ec1f6b6af0d04f7024c5c0c320f24ac6117201941ea198db2f8b10e","source":{"kind":"arxiv","id":"1902.03274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03274","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03274v1","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03274","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"EUETDHI6YH3L","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EUETDHI6YH3LNLYN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EUETDHI6","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EUETDHI6YH3LNLYNAT3QETC4BQ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"0fb1d7c77ffa49fa0dcd53017551e79e2e1b9d2054f0f4953278a967de6397c9","abstract_canon_sha256":"3a55dacdc6525fdf2d38ff10a8036699810716a4c1159e85c4b316c712cac62a"},"schema_version":"1.0"},"canonical_sha256":"2509319d1ec1f6b6af0d04f7024c5c0c320f24ac6117201941ea198db2f8b10e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:21.415334Z","signature_b64":"QbjBkNQjDshEt9wG0i9FAbO78LuA7SNN83HVnNf/eimCMHMlPnJWG85LqkbVXMoFZfkhxA1Ma0tyHoWnOOeqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2509319d1ec1f6b6af0d04f7024c5c0c320f24ac6117201941ea198db2f8b10e","last_reissued_at":"2026-05-17T23:54:21.414724Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:21.414724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03274","source_version":1,"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-17T23:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uo8LBafcwrGYZHF39LFM+pWXKeBJ33hfPiDoOw4pf5JgCwBdmqnYMjCckpketLHwM0atZrLudQ3a+E3RdvjGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:09:46.303738Z"},"content_sha256":"3b5eb585fce6b926dca92fa6654fae496dce4a7be9613a08f47b075b6ad7ead3","schema_version":"1.0","event_id":"sha256:3b5eb585fce6b926dca92fa6654fae496dce4a7be9613a08f47b075b6ad7ead3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EUETDHI6YH3LNLYNAT3QETC4BQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Repetition-Aware Compressed Suffix Trees based on Block Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Manuel C\\'aceres","submitted_at":"2019-02-08T20:08:03Z","abstract_excerpt":"Suffix trees are a fundamental data structure in stringology, but their space usage, though linear, is an important problem for its applications. We design and implement a new compressed suffix tree targeted to highly repetitive texts, such as large genomic collections of the same species. Our suffix tree tree builds on Block Trees, a recent Lempel-Ziv-bounded data structure that captures the repetitiveness of its input. We use Block Trees to compress the topology of the suffix tree, and augment the Block Tree nodes with data that speeds up suffix tree navigation.\n  Our compressed suffix tree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03274","kind":"arxiv","version":1},"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-17T23:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iiGOCRuHyAib2QLPbnsL+3SLjGWN44kqHw/OG7A+U9NZZ9/uLXTB8BjDuhggiefBmwkMMgaIsWrKgBnopwZgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:09:46.304287Z"},"content_sha256":"ab90ac9ff8f1598a866200da1855b213c0fefb434d6bde50d3817e481dfd49f9","schema_version":"1.0","event_id":"sha256:ab90ac9ff8f1598a866200da1855b213c0fefb434d6bde50d3817e481dfd49f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUETDHI6YH3LNLYNAT3QETC4BQ/bundle.json","state_url":"https://pith.science/pith/EUETDHI6YH3LNLYNAT3QETC4BQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUETDHI6YH3LNLYNAT3QETC4BQ/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-06-07T08:09:46Z","links":{"resolver":"https://pith.science/pith/EUETDHI6YH3LNLYNAT3QETC4BQ","bundle":"https://pith.science/pith/EUETDHI6YH3LNLYNAT3QETC4BQ/bundle.json","state":"https://pith.science/pith/EUETDHI6YH3LNLYNAT3QETC4BQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUETDHI6YH3LNLYNAT3QETC4BQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EUETDHI6YH3LNLYNAT3QETC4BQ","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":"3a55dacdc6525fdf2d38ff10a8036699810716a4c1159e85c4b316c712cac62a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:08:03Z","title_canon_sha256":"0fb1d7c77ffa49fa0dcd53017551e79e2e1b9d2054f0f4953278a967de6397c9"},"schema_version":"1.0","source":{"id":"1902.03274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03274","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03274v1","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03274","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"EUETDHI6YH3L","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EUETDHI6YH3LNLYN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EUETDHI6","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:ab90ac9ff8f1598a866200da1855b213c0fefb434d6bde50d3817e481dfd49f9","target":"graph","created_at":"2026-05-17T23:54:21Z","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":"Suffix trees are a fundamental data structure in stringology, but their space usage, though linear, is an important problem for its applications. We design and implement a new compressed suffix tree targeted to highly repetitive texts, such as large genomic collections of the same species. Our suffix tree tree builds on Block Trees, a recent Lempel-Ziv-bounded data structure that captures the repetitiveness of its input. We use Block Trees to compress the topology of the suffix tree, and augment the Block Tree nodes with data that speeds up suffix tree navigation.\n  Our compressed suffix tree ","authors_text":"Gonzalo Navarro, Manuel C\\'aceres","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:08:03Z","title":"Faster Repetition-Aware Compressed Suffix Trees based on Block Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03274","kind":"arxiv","version":1},"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:3b5eb585fce6b926dca92fa6654fae496dce4a7be9613a08f47b075b6ad7ead3","target":"record","created_at":"2026-05-17T23:54:21Z","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":"3a55dacdc6525fdf2d38ff10a8036699810716a4c1159e85c4b316c712cac62a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:08:03Z","title_canon_sha256":"0fb1d7c77ffa49fa0dcd53017551e79e2e1b9d2054f0f4953278a967de6397c9"},"schema_version":"1.0","source":{"id":"1902.03274","kind":"arxiv","version":1}},"canonical_sha256":"2509319d1ec1f6b6af0d04f7024c5c0c320f24ac6117201941ea198db2f8b10e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2509319d1ec1f6b6af0d04f7024c5c0c320f24ac6117201941ea198db2f8b10e","first_computed_at":"2026-05-17T23:54:21.414724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:21.414724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QbjBkNQjDshEt9wG0i9FAbO78LuA7SNN83HVnNf/eimCMHMlPnJWG85LqkbVXMoFZfkhxA1Ma0tyHoWnOOeqDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:21.415334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b5eb585fce6b926dca92fa6654fae496dce4a7be9613a08f47b075b6ad7ead3","sha256:ab90ac9ff8f1598a866200da1855b213c0fefb434d6bde50d3817e481dfd49f9"],"state_sha256":"17675d769fac56766a67d66177ec367f550198c180c51569740af57ea30cb4be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tjwfHqTwJm28u7szm4imT9/QXZ1G3+dAhlB2I+k5vksJrPzSpTa3AlUu5kmIsiB6Sh7vRWBYQ3lazoHrFXzBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:09:46.308222Z","bundle_sha256":"bbffbb7817db8127e31fcad0304b5b9e4fa3c5e76d39cfd1a9585ca46d701dbe"}}