{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JG6D3QNSAFGDLT2QZGKT6NEOQB","short_pith_number":"pith:JG6D3QNS","canonical_record":{"source":{"id":"2605.23323","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-22T07:37:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"afb2a6006477b3ae441f7b85f80c2efe536f8cd8b26026f3472a8fdbb5a27c1f","abstract_canon_sha256":"33f9386490587dc3ea44c1f6e9d7e043350b73984295b1afb0585f3e18efb470"},"schema_version":"1.0"},"canonical_sha256":"49bc3dc1b2014c35cf50c9953f348e80576ca12cc596f2066840687923e61415","source":{"kind":"arxiv","id":"2605.23323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23323","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23323v1","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23323","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"pith_short_12","alias_value":"JG6D3QNSAFGD","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"pith_short_16","alias_value":"JG6D3QNSAFGDLT2Q","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"pith_short_8","alias_value":"JG6D3QNS","created_at":"2026-05-25T02:01:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JG6D3QNSAFGDLT2QZGKT6NEOQB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23323","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-22T07:37:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"afb2a6006477b3ae441f7b85f80c2efe536f8cd8b26026f3472a8fdbb5a27c1f","abstract_canon_sha256":"33f9386490587dc3ea44c1f6e9d7e043350b73984295b1afb0585f3e18efb470"},"schema_version":"1.0"},"canonical_sha256":"49bc3dc1b2014c35cf50c9953f348e80576ca12cc596f2066840687923e61415","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:48.948222Z","signature_b64":"a1VgXUnXV9XgkOWOnW71WcjCqFuTH28VU2q9xB/wRKwTXC8zTS4Wj67eW/MXB7v5uEDinVZHkKy7hiFo1w7HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49bc3dc1b2014c35cf50c9953f348e80576ca12cc596f2066840687923e61415","last_reissued_at":"2026-05-25T02:01:48.947671Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:48.947671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23323","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-25T02:01:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u79mlZIRzxeEuYFINzVdiZgckeAdvtmQFDkUO1u6gXS/VyUKyd/0BKnpDfKRD0D3MFRsXfJ485KiLYdrX376DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:51.888156Z"},"content_sha256":"2e5f6c67093b2346063daba252a8f007941d9775e26473e94e6f8e34f3a9e83c","schema_version":"1.0","event_id":"sha256:2e5f6c67093b2346063daba252a8f007941d9775e26473e94e6f8e34f3a9e83c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JG6D3QNSAFGDLT2QZGKT6NEOQB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Learned Image Compression without Entropy Coding","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Hao Cao, Jungong Han, Wenqi Guo, Zhijin Qin","submitted_at":"2026-05-22T07:37:30Z","abstract_excerpt":"Entropy coding is widely used in typical learned image compression (LIC) that converts latents into a compact bitstream. However, entropy coding is typically sequential and becomes the coding latency bottleneck. To overcome it, we present Entropy-Coding Free Learned Image Compression (EF-LIC), a multi-rate framework that generates compact representation by removing statistical and correlation redundancy with low coding latency. First, we introduce unconstrained vector quantization and prove that its index distribution approaches the maximum-entropy bound, yielding minimal statistical redundanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23323","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.23323/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-25T02:01:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBpNfWxEs6x3EkoUgUhLnrFQ4If8k+Cw+UD6P4x1LIjqqvZUg7iQXd194rVBMNDfMzK9EBkYUA2D5qCRWYuVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:51.888874Z"},"content_sha256":"b790f62094854b225ae021ce4090af7f33142ead2175447d3a06fa11ace4df4e","schema_version":"1.0","event_id":"sha256:b790f62094854b225ae021ce4090af7f33142ead2175447d3a06fa11ace4df4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/bundle.json","state_url":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/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-27T00:24:51Z","links":{"resolver":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB","bundle":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/bundle.json","state":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JG6D3QNSAFGDLT2QZGKT6NEOQB","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":"33f9386490587dc3ea44c1f6e9d7e043350b73984295b1afb0585f3e18efb470","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-22T07:37:30Z","title_canon_sha256":"afb2a6006477b3ae441f7b85f80c2efe536f8cd8b26026f3472a8fdbb5a27c1f"},"schema_version":"1.0","source":{"id":"2605.23323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23323","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23323v1","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23323","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"pith_short_12","alias_value":"JG6D3QNSAFGD","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"pith_short_16","alias_value":"JG6D3QNSAFGDLT2Q","created_at":"2026-05-25T02:01:48Z"},{"alias_kind":"pith_short_8","alias_value":"JG6D3QNS","created_at":"2026-05-25T02:01:48Z"}],"graph_snapshots":[{"event_id":"sha256:b790f62094854b225ae021ce4090af7f33142ead2175447d3a06fa11ace4df4e","target":"graph","created_at":"2026-05-25T02:01: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.23323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Entropy coding is widely used in typical learned image compression (LIC) that converts latents into a compact bitstream. However, entropy coding is typically sequential and becomes the coding latency bottleneck. To overcome it, we present Entropy-Coding Free Learned Image Compression (EF-LIC), a multi-rate framework that generates compact representation by removing statistical and correlation redundancy with low coding latency. First, we introduce unconstrained vector quantization and prove that its index distribution approaches the maximum-entropy bound, yielding minimal statistical redundanc","authors_text":"Hao Cao, Jungong Han, Wenqi Guo, Zhijin Qin","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23323","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:2e5f6c67093b2346063daba252a8f007941d9775e26473e94e6f8e34f3a9e83c","target":"record","created_at":"2026-05-25T02:01: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":"33f9386490587dc3ea44c1f6e9d7e043350b73984295b1afb0585f3e18efb470","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-22T07:37:30Z","title_canon_sha256":"afb2a6006477b3ae441f7b85f80c2efe536f8cd8b26026f3472a8fdbb5a27c1f"},"schema_version":"1.0","source":{"id":"2605.23323","kind":"arxiv","version":1}},"canonical_sha256":"49bc3dc1b2014c35cf50c9953f348e80576ca12cc596f2066840687923e61415","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49bc3dc1b2014c35cf50c9953f348e80576ca12cc596f2066840687923e61415","first_computed_at":"2026-05-25T02:01:48.947671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:48.947671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1VgXUnXV9XgkOWOnW71WcjCqFuTH28VU2q9xB/wRKwTXC8zTS4Wj67eW/MXB7v5uEDinVZHkKy7hiFo1w7HCw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:48.948222Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e5f6c67093b2346063daba252a8f007941d9775e26473e94e6f8e34f3a9e83c","sha256:b790f62094854b225ae021ce4090af7f33142ead2175447d3a06fa11ace4df4e"],"state_sha256":"63bf1c1c1d24d7aa14b2460401602b49f528f86bfba71b7586562528c6449bad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROVU8xDkM2VdxcxBxyvt5CmFEw8RCo4qDCFVXY5TCpCy1XDoaZoGlPaGVZo2d0OZqXwutl9L3yUQkG0gpDkMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:24:51.892189Z","bundle_sha256":"68a7d3a2fc7078b8c9d6c7111f866bcce1fce55938acf6d5b156550bea6d3a3d"}}