{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:2LQHVXUXSXMZIVXJ2P5PD6CATC","short_pith_number":"pith:2LQHVXUX","canonical_record":{"source":{"id":"0903.4251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-25T19:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"676263cfa1314f2eaeec0f6d96f020447bcac42a8c6c78c19606c0476fe39ea5","abstract_canon_sha256":"d3828a313fb7f5781d922ee1bf4a762c947d72db6c4454d622aff627ad8df61e"},"schema_version":"1.0"},"canonical_sha256":"d2e07ade9795d99456e9d3faf1f840989bcf47d2f80a96cde10431e52f75ab86","source":{"kind":"arxiv","id":"0903.4251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4251","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4251v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4251","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"2LQHVXUXSXMZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2LQHVXUXSXMZIVXJ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2LQHVXUX","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:2LQHVXUXSXMZIVXJ2P5PD6CATC","target":"record","payload":{"canonical_record":{"source":{"id":"0903.4251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-25T19:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"676263cfa1314f2eaeec0f6d96f020447bcac42a8c6c78c19606c0476fe39ea5","abstract_canon_sha256":"d3828a313fb7f5781d922ee1bf4a762c947d72db6c4454d622aff627ad8df61e"},"schema_version":"1.0"},"canonical_sha256":"d2e07ade9795d99456e9d3faf1f840989bcf47d2f80a96cde10431e52f75ab86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.177688Z","signature_b64":"MBvSLRNqcrOGfG/NulWOuP1d2+lSsqtxa9J8DyWCJgHs3myo7KF00kEfFmn1HXPLopi5+zfQH0WIrk6SiiunDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2e07ade9795d99456e9d3faf1f840989bcf47d2f80a96cde10431e52f75ab86","last_reissued_at":"2026-05-18T00:58:48.177155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.177155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.4251","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YyG7/Lvox3Xn0ZgeA3NbnfGpONMJLzo1GNqfZ69aB8pC2xh4GeA+McPXnkum6hPObfTgMsiQpJFfmo853KuZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:19:49.849350Z"},"content_sha256":"10edff7818a581af22158dfaff2244684f0ed490e6060fbd15a6f2b80a4d9e55","schema_version":"1.0","event_id":"sha256:10edff7818a581af22158dfaff2244684f0ed490e6060fbd15a6f2b80a4d9e55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:2LQHVXUXSXMZIVXJ2P5PD6CATC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arlindo Oliveira, Artur Ferreira, Mario Figueiredo","submitted_at":"2009-03-25T19:25:24Z","abstract_excerpt":"Much research has been devoted to optimizing algorithms of the Lempel-Ziv (LZ) 77 family, both in terms of speed and memory requirements. Binary search trees and suffix trees (ST) are data structures that have been often used for this purpose, as they allow fast searches at the expense of memory usage.\n  In recent years, there has been interest on suffix arrays (SA), due to their simplicity and low memory requirements. One key issue is that an SA can solve the sub-string problem almost as efficiently as an ST, using less memory. This paper proposes two new SA-based algorithms for LZ encoding, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4251","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"woCPtSmA2PtxDIZ9nk/20uEpRWCIyR0xWwpKjy42BGuwsRsQOiYatwXtv/DYGHjC+gvHyViAyT/xhDlnXXfOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:19:49.850178Z"},"content_sha256":"602f61401c8b23647d0c436c00356694fffdebea3f655f90ecafd1539aae950a","schema_version":"1.0","event_id":"sha256:602f61401c8b23647d0c436c00356694fffdebea3f655f90ecafd1539aae950a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LQHVXUXSXMZIVXJ2P5PD6CATC/bundle.json","state_url":"https://pith.science/pith/2LQHVXUXSXMZIVXJ2P5PD6CATC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LQHVXUXSXMZIVXJ2P5PD6CATC/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-10T04:19:49Z","links":{"resolver":"https://pith.science/pith/2LQHVXUXSXMZIVXJ2P5PD6CATC","bundle":"https://pith.science/pith/2LQHVXUXSXMZIVXJ2P5PD6CATC/bundle.json","state":"https://pith.science/pith/2LQHVXUXSXMZIVXJ2P5PD6CATC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LQHVXUXSXMZIVXJ2P5PD6CATC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:2LQHVXUXSXMZIVXJ2P5PD6CATC","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":"d3828a313fb7f5781d922ee1bf4a762c947d72db6c4454d622aff627ad8df61e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-25T19:25:24Z","title_canon_sha256":"676263cfa1314f2eaeec0f6d96f020447bcac42a8c6c78c19606c0476fe39ea5"},"schema_version":"1.0","source":{"id":"0903.4251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4251","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4251v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4251","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"2LQHVXUXSXMZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2LQHVXUXSXMZIVXJ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2LQHVXUX","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:602f61401c8b23647d0c436c00356694fffdebea3f655f90ecafd1539aae950a","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"Much research has been devoted to optimizing algorithms of the Lempel-Ziv (LZ) 77 family, both in terms of speed and memory requirements. Binary search trees and suffix trees (ST) are data structures that have been often used for this purpose, as they allow fast searches at the expense of memory usage.\n  In recent years, there has been interest on suffix arrays (SA), due to their simplicity and low memory requirements. One key issue is that an SA can solve the sub-string problem almost as efficiently as an ST, using less memory. This paper proposes two new SA-based algorithms for LZ encoding, ","authors_text":"Arlindo Oliveira, Artur Ferreira, Mario Figueiredo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-25T19:25:24Z","title":"On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4251","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:10edff7818a581af22158dfaff2244684f0ed490e6060fbd15a6f2b80a4d9e55","target":"record","created_at":"2026-05-18T00:58:48Z","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":"d3828a313fb7f5781d922ee1bf4a762c947d72db6c4454d622aff627ad8df61e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-25T19:25:24Z","title_canon_sha256":"676263cfa1314f2eaeec0f6d96f020447bcac42a8c6c78c19606c0476fe39ea5"},"schema_version":"1.0","source":{"id":"0903.4251","kind":"arxiv","version":1}},"canonical_sha256":"d2e07ade9795d99456e9d3faf1f840989bcf47d2f80a96cde10431e52f75ab86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2e07ade9795d99456e9d3faf1f840989bcf47d2f80a96cde10431e52f75ab86","first_computed_at":"2026-05-18T00:58:48.177155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.177155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MBvSLRNqcrOGfG/NulWOuP1d2+lSsqtxa9J8DyWCJgHs3myo7KF00kEfFmn1HXPLopi5+zfQH0WIrk6SiiunDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.177688Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.4251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10edff7818a581af22158dfaff2244684f0ed490e6060fbd15a6f2b80a4d9e55","sha256:602f61401c8b23647d0c436c00356694fffdebea3f655f90ecafd1539aae950a"],"state_sha256":"8eee1bd262ee1899a09f41f9efb9f63d4f293b77e55ae684a2584b3294f1084f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMaU9V+ajexK+So3WN4KqNYYPubSinibfNKcx3gUgH5TVEronKReX3Bve0ja6O+YBnLa6P4P/N3/+Clqi/AGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:19:49.854078Z","bundle_sha256":"46f361246666ed4f11bdcbf27625b7380d76272bc9113823b3327b761f2f1976"}}