{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MQWKA25SYQZZIV2DGMDI6YO5FQ","short_pith_number":"pith:MQWKA25S","canonical_record":{"source":{"id":"1301.2495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T13:44:27Z","cross_cats_sorted":[],"title_canon_sha256":"dc6108ed9f32f057a05bf57cbba2ac4443b14449fa9e0a1d27c59227bf766a21","abstract_canon_sha256":"5800124f7113b9ad1ef70aae3d2e1bbc23362bc5b5bba752c122cefde66325f0"},"schema_version":"1.0"},"canonical_sha256":"642ca06bb2c43394574333068f61dd2c3af63a61f335221af1eb240104d4d740","source":{"kind":"arxiv","id":"1301.2495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2495","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2495v1","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2495","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"MQWKA25SYQZZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MQWKA25SYQZZIV2D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MQWKA25S","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MQWKA25SYQZZIV2DGMDI6YO5FQ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T13:44:27Z","cross_cats_sorted":[],"title_canon_sha256":"dc6108ed9f32f057a05bf57cbba2ac4443b14449fa9e0a1d27c59227bf766a21","abstract_canon_sha256":"5800124f7113b9ad1ef70aae3d2e1bbc23362bc5b5bba752c122cefde66325f0"},"schema_version":"1.0"},"canonical_sha256":"642ca06bb2c43394574333068f61dd2c3af63a61f335221af1eb240104d4d740","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:37.772883Z","signature_b64":"mBvPQ0G9K1caxchiy2vRk9zZUxyHHnLEa17EX4CLpxMq2lSeHqrGQv20nA+bqN9+XgLiDW+/YyUgWFIC7cXvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"642ca06bb2c43394574333068f61dd2c3af63a61f335221af1eb240104d4d740","last_reissued_at":"2026-05-18T03:36:37.772264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:37.772264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2495","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-18T03:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hk/xrUnSXb38vXh0YASnkFf8/1sIF1+MhES+hIjQ/jBUlBwZI5PLXmgccm8/1K5VoXAnnG38+CkHQFZltBfxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:49:53.319570Z"},"content_sha256":"4846abfee99b7f1d0fe410fb27c556be5024c08fa084454bfe088add71bcce23","schema_version":"1.0","event_id":"sha256:4846abfee99b7f1d0fe410fb27c556be5024c08fa084454bfe088add71bcce23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MQWKA25SYQZZIV2DGMDI6YO5FQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akashnil Dutta, Dana Ron, Reut Levi, Ronitt Rubinfeld","submitted_at":"2013-01-11T13:44:27Z","abstract_excerpt":"We present a simple adaptation of the Lempel Ziv 78' (LZ78) compression scheme ({\\em IEEE Transactions on Information Theory, 1978}) that supports efficient random access to the input string. Namely, given query access to the compressed string, it is possible to efficiently recover any symbol of the input string. The compression algorithm is given as input a parameter $\\eps >0$, and with very high probability increases the length of the compressed string by at most a factor of $(1+\\eps)$. The access time is $O(\\log n + 1/\\eps^2)$ in expectation, and $O(\\log n/\\eps^2)$ with high probability. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2495","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-18T03:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7fcAxtqXLMIyBPBm3AkmK4FsejOnWVHOWRTSQdcNmdmnElhbVvv3h2SBcahVxUsthpuaG67mYq5efzHGqiMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:49:53.319921Z"},"content_sha256":"b41f8c37bbc3c5ecb48064c1ba689c495d87941c681ee7f3c8f3b6a2f93c78d0","schema_version":"1.0","event_id":"sha256:b41f8c37bbc3c5ecb48064c1ba689c495d87941c681ee7f3c8f3b6a2f93c78d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQWKA25SYQZZIV2DGMDI6YO5FQ/bundle.json","state_url":"https://pith.science/pith/MQWKA25SYQZZIV2DGMDI6YO5FQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQWKA25SYQZZIV2DGMDI6YO5FQ/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-01T02:49:53Z","links":{"resolver":"https://pith.science/pith/MQWKA25SYQZZIV2DGMDI6YO5FQ","bundle":"https://pith.science/pith/MQWKA25SYQZZIV2DGMDI6YO5FQ/bundle.json","state":"https://pith.science/pith/MQWKA25SYQZZIV2DGMDI6YO5FQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQWKA25SYQZZIV2DGMDI6YO5FQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MQWKA25SYQZZIV2DGMDI6YO5FQ","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":"5800124f7113b9ad1ef70aae3d2e1bbc23362bc5b5bba752c122cefde66325f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T13:44:27Z","title_canon_sha256":"dc6108ed9f32f057a05bf57cbba2ac4443b14449fa9e0a1d27c59227bf766a21"},"schema_version":"1.0","source":{"id":"1301.2495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2495","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2495v1","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2495","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"MQWKA25SYQZZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MQWKA25SYQZZIV2D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MQWKA25S","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:b41f8c37bbc3c5ecb48064c1ba689c495d87941c681ee7f3c8f3b6a2f93c78d0","target":"graph","created_at":"2026-05-18T03:36:37Z","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 simple adaptation of the Lempel Ziv 78' (LZ78) compression scheme ({\\em IEEE Transactions on Information Theory, 1978}) that supports efficient random access to the input string. Namely, given query access to the compressed string, it is possible to efficiently recover any symbol of the input string. The compression algorithm is given as input a parameter $\\eps >0$, and with very high probability increases the length of the compressed string by at most a factor of $(1+\\eps)$. The access time is $O(\\log n + 1/\\eps^2)$ in expectation, and $O(\\log n/\\eps^2)$ with high probability. Th","authors_text":"Akashnil Dutta, Dana Ron, Reut Levi, Ronitt Rubinfeld","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T13:44:27Z","title":"A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2495","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:4846abfee99b7f1d0fe410fb27c556be5024c08fa084454bfe088add71bcce23","target":"record","created_at":"2026-05-18T03:36:37Z","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":"5800124f7113b9ad1ef70aae3d2e1bbc23362bc5b5bba752c122cefde66325f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T13:44:27Z","title_canon_sha256":"dc6108ed9f32f057a05bf57cbba2ac4443b14449fa9e0a1d27c59227bf766a21"},"schema_version":"1.0","source":{"id":"1301.2495","kind":"arxiv","version":1}},"canonical_sha256":"642ca06bb2c43394574333068f61dd2c3af63a61f335221af1eb240104d4d740","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"642ca06bb2c43394574333068f61dd2c3af63a61f335221af1eb240104d4d740","first_computed_at":"2026-05-18T03:36:37.772264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:37.772264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mBvPQ0G9K1caxchiy2vRk9zZUxyHHnLEa17EX4CLpxMq2lSeHqrGQv20nA+bqN9+XgLiDW+/YyUgWFIC7cXvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:37.772883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4846abfee99b7f1d0fe410fb27c556be5024c08fa084454bfe088add71bcce23","sha256:b41f8c37bbc3c5ecb48064c1ba689c495d87941c681ee7f3c8f3b6a2f93c78d0"],"state_sha256":"34844ed7473d51e1ffc7e0d542754f478d0c9a170a39d9c4f843f3f442fd10a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UhNmfQm3Pj77vJ6U6p/nb+pttr51tI51vMtnR2r5u5AYe83VrzVXiQf7dnbWtXd4HsHAODVKiv2o23U4z4mABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:49:53.322066Z","bundle_sha256":"2fe09e486aef38e5402a74250bcd460da93afce34e5e85a40accf74b62c7f61a"}}