{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JG6D3QNSAFGDLT2QZGKT6NEOQB","short_pith_number":"pith:JG6D3QNS","schema_version":"1.0","canonical_sha256":"49bc3dc1b2014c35cf50c9953f348e80576ca12cc596f2066840687923e61415","source":{"kind":"arxiv","id":"2605.23323","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.23323","created_at":"2026-05-25T02:01:48.947763+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23323v1","created_at":"2026-05-25T02:01:48.947763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23323","created_at":"2026-05-25T02:01:48.947763+00:00"},{"alias_kind":"pith_short_12","alias_value":"JG6D3QNSAFGD","created_at":"2026-05-25T02:01:48.947763+00:00"},{"alias_kind":"pith_short_16","alias_value":"JG6D3QNSAFGDLT2Q","created_at":"2026-05-25T02:01:48.947763+00:00"},{"alias_kind":"pith_short_8","alias_value":"JG6D3QNS","created_at":"2026-05-25T02:01:48.947763+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB","json":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB.json","graph_json":"https://pith.science/api/pith-number/JG6D3QNSAFGDLT2QZGKT6NEOQB/graph.json","events_json":"https://pith.science/api/pith-number/JG6D3QNSAFGDLT2QZGKT6NEOQB/events.json","paper":"https://pith.science/paper/JG6D3QNS"},"agent_actions":{"view_html":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB","download_json":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB.json","view_paper":"https://pith.science/paper/JG6D3QNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23323&json=true","fetch_graph":"https://pith.science/api/pith-number/JG6D3QNSAFGDLT2QZGKT6NEOQB/graph.json","fetch_events":"https://pith.science/api/pith-number/JG6D3QNSAFGDLT2QZGKT6NEOQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/action/storage_attestation","attest_author":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/action/author_attestation","sign_citation":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/action/citation_signature","submit_replication":"https://pith.science/pith/JG6D3QNSAFGDLT2QZGKT6NEOQB/action/replication_record"}},"created_at":"2026-05-25T02:01:48.947763+00:00","updated_at":"2026-05-25T02:01:48.947763+00:00"}