{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6QX3I2LZLYJVP4QRE2U3UX6OWW","short_pith_number":"pith:6QX3I2LZ","canonical_record":{"source":{"id":"1210.4700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-17T11:30:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4be8c7b20a9c5450b8cf5ae51ffaaac74d23e9f91624d17626e4b97cff447241","abstract_canon_sha256":"0f46e2d657c44d2ef1acea53e77c8ccc1c2efb400b7867313cf89f91b84de6d0"},"schema_version":"1.0"},"canonical_sha256":"f42fb469795e1357f21126a9ba5fceb5b275200208d864655682abcc8c7372f0","source":{"kind":"arxiv","id":"1210.4700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4700","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4700v2","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4700","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"6QX3I2LZLYJV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6QX3I2LZLYJVP4QR","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6QX3I2LZ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6QX3I2LZLYJVP4QRE2U3UX6OWW","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-17T11:30:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4be8c7b20a9c5450b8cf5ae51ffaaac74d23e9f91624d17626e4b97cff447241","abstract_canon_sha256":"0f46e2d657c44d2ef1acea53e77c8ccc1c2efb400b7867313cf89f91b84de6d0"},"schema_version":"1.0"},"canonical_sha256":"f42fb469795e1357f21126a9ba5fceb5b275200208d864655682abcc8c7372f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.625534Z","signature_b64":"E6rrQ6vSRTTxWk+x5FqXoCMz+7TlQIaTQjhPg7eMoqejR38vlQl9FRb93xuMm+hLz0l6QpuSDUbqNXGvCppOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f42fb469795e1357f21126a9ba5fceb5b275200208d864655682abcc8c7372f0","last_reissued_at":"2026-05-18T03:42:55.624955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.624955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4700","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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7FhAcIWlAkzdGUvNnVUbrno/haGQkMCw/GSMoC2ioSENciMvTtDa0TqtB+F96viKfPvZorY6SORiR8IzWsbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:40:38.327841Z"},"content_sha256":"4e77044fee3dba1300273908945f490a5e68d13df8530ca181cab4fd079f3558","schema_version":"1.0","event_id":"sha256:4e77044fee3dba1300273908945f490a5e68d13df8530ca181cab4fd079f3558"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6QX3I2LZLYJVP4QRE2U3UX6OWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Lempel-Ziv based lossy compression for memoryless data: how to make the right mistakes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dharmendra Modha, Narayana Santhanam","submitted_at":"2012-10-17T11:30:12Z","abstract_excerpt":"Compression refers to encoding data using bits, so that the representation uses as few bits as possible. Compression could be lossless: i.e. encoded data can be recovered exactly from its representation) or lossy where the data is compressed more than the lossless case, but can still be recovered to within prespecified distortion metric. In this paper, we prove the optimality of Codelet Parsing, a quasi-linear time algorithm for lossy compression of sequences of bits that are independently and identically distributed (\\iid) and Hamming distortion. Codelet Parsing extends the lossless Lempel Zi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4700","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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzFkPJVxt2T/g2qG6LeWIY22z7DOgABS5ftD0hYIybHuEUpSxZHmqf5ph3bZdvJtBmBYrXid34PxnXkdnGPqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:40:38.328183Z"},"content_sha256":"e222d6148ca7792d42820bfa88c1f6b01e25ca1333bdebb48aedd52646759181","schema_version":"1.0","event_id":"sha256:e222d6148ca7792d42820bfa88c1f6b01e25ca1333bdebb48aedd52646759181"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QX3I2LZLYJVP4QRE2U3UX6OWW/bundle.json","state_url":"https://pith.science/pith/6QX3I2LZLYJVP4QRE2U3UX6OWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QX3I2LZLYJVP4QRE2U3UX6OWW/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-03T16:40:38Z","links":{"resolver":"https://pith.science/pith/6QX3I2LZLYJVP4QRE2U3UX6OWW","bundle":"https://pith.science/pith/6QX3I2LZLYJVP4QRE2U3UX6OWW/bundle.json","state":"https://pith.science/pith/6QX3I2LZLYJVP4QRE2U3UX6OWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QX3I2LZLYJVP4QRE2U3UX6OWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6QX3I2LZLYJVP4QRE2U3UX6OWW","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":"0f46e2d657c44d2ef1acea53e77c8ccc1c2efb400b7867313cf89f91b84de6d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-17T11:30:12Z","title_canon_sha256":"4be8c7b20a9c5450b8cf5ae51ffaaac74d23e9f91624d17626e4b97cff447241"},"schema_version":"1.0","source":{"id":"1210.4700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4700","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4700v2","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4700","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"6QX3I2LZLYJV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6QX3I2LZLYJVP4QR","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6QX3I2LZ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:e222d6148ca7792d42820bfa88c1f6b01e25ca1333bdebb48aedd52646759181","target":"graph","created_at":"2026-05-18T03:42:55Z","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":"Compression refers to encoding data using bits, so that the representation uses as few bits as possible. Compression could be lossless: i.e. encoded data can be recovered exactly from its representation) or lossy where the data is compressed more than the lossless case, but can still be recovered to within prespecified distortion metric. In this paper, we prove the optimality of Codelet Parsing, a quasi-linear time algorithm for lossy compression of sequences of bits that are independently and identically distributed (\\iid) and Hamming distortion. Codelet Parsing extends the lossless Lempel Zi","authors_text":"Dharmendra Modha, Narayana Santhanam","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-17T11:30:12Z","title":"Optimal Lempel-Ziv based lossy compression for memoryless data: how to make the right mistakes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4700","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:4e77044fee3dba1300273908945f490a5e68d13df8530ca181cab4fd079f3558","target":"record","created_at":"2026-05-18T03:42:55Z","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":"0f46e2d657c44d2ef1acea53e77c8ccc1c2efb400b7867313cf89f91b84de6d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-17T11:30:12Z","title_canon_sha256":"4be8c7b20a9c5450b8cf5ae51ffaaac74d23e9f91624d17626e4b97cff447241"},"schema_version":"1.0","source":{"id":"1210.4700","kind":"arxiv","version":2}},"canonical_sha256":"f42fb469795e1357f21126a9ba5fceb5b275200208d864655682abcc8c7372f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f42fb469795e1357f21126a9ba5fceb5b275200208d864655682abcc8c7372f0","first_computed_at":"2026-05-18T03:42:55.624955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:55.624955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E6rrQ6vSRTTxWk+x5FqXoCMz+7TlQIaTQjhPg7eMoqejR38vlQl9FRb93xuMm+hLz0l6QpuSDUbqNXGvCppOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:55.625534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e77044fee3dba1300273908945f490a5e68d13df8530ca181cab4fd079f3558","sha256:e222d6148ca7792d42820bfa88c1f6b01e25ca1333bdebb48aedd52646759181"],"state_sha256":"4eb00af66079698be36a5c53776b3d1a04de53f980305e259d1ce741d6b2c42e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZL9Gh8klIsRKZFEUawFCaV5J9QIQsxIupM+9MOvflstxqB3rDyInYSFRViyYDIxkfWKgwCiiu7jnxn1TA92DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:40:38.330139Z","bundle_sha256":"089003fb89552b693a183b594b5456d7b86adc11994d803ed7d7197db7d31e62"}}