{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YIFEUEEN47LIG3MGCA2OOJOUCR","short_pith_number":"pith:YIFEUEEN","schema_version":"1.0","canonical_sha256":"c20a4a108de7d6836d861034e725d4147366a4259a7c636e2cee6ea447ffdcd3","source":{"kind":"arxiv","id":"2403.10936","version":1},"attestation_state":"computed","paper":{"title":"Channel-wise Feature Decorrelation for Enhanced Learned Image Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.MM"],"primary_cat":"eess.IV","authors_text":"Farhad Pakdaman, Moncef Gabbouj","submitted_at":"2024-03-16T14:30:25Z","abstract_excerpt":"The emerging Learned Compression (LC) replaces the traditional codec modules with Deep Neural Networks (DNN), which are trained end-to-end for rate-distortion performance. This approach is considered as the future of image/video compression, and major efforts have been dedicated to improving its compression efficiency. However, most proposed works target compression efficiency by employing more complex DNNS, which contributes to higher computational complexity. Alternatively, this paper proposes to improve compression by fully exploiting the existing DNN capacity. To do so, the latent features"},"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":"2403.10936","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.IV","submitted_at":"2024-03-16T14:30:25Z","cross_cats_sorted":["cs.CV","cs.MM"],"title_canon_sha256":"f2ae855560ea3558f19252ff82864bb95449a0dd695e27ac49b506fd46ef4699","abstract_canon_sha256":"78bd835c90200630206666fedb081da8aae415bf1064c504f413f5fa082376e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:15.100369Z","signature_b64":"tyg7VEWkKTA45sOs3pOysO6b2c32YyohBrf1PPhHfUyS93EmvJ1G+aLHKOyNd198kF81BTX9PBrBNvuJovWsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c20a4a108de7d6836d861034e725d4147366a4259a7c636e2cee6ea447ffdcd3","last_reissued_at":"2026-07-05T08:40:15.099886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:15.099886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel-wise Feature Decorrelation for Enhanced Learned Image Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.MM"],"primary_cat":"eess.IV","authors_text":"Farhad Pakdaman, Moncef Gabbouj","submitted_at":"2024-03-16T14:30:25Z","abstract_excerpt":"The emerging Learned Compression (LC) replaces the traditional codec modules with Deep Neural Networks (DNN), which are trained end-to-end for rate-distortion performance. This approach is considered as the future of image/video compression, and major efforts have been dedicated to improving its compression efficiency. However, most proposed works target compression efficiency by employing more complex DNNS, which contributes to higher computational complexity. Alternatively, this paper proposes to improve compression by fully exploiting the existing DNN capacity. To do so, the latent features"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10936","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/2403.10936/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":"2403.10936","created_at":"2026-07-05T08:40:15.099940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10936v1","created_at":"2026-07-05T08:40:15.099940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10936","created_at":"2026-07-05T08:40:15.099940+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIFEUEEN47LI","created_at":"2026-07-05T08:40:15.099940+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIFEUEEN47LIG3MG","created_at":"2026-07-05T08:40:15.099940+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIFEUEEN","created_at":"2026-07-05T08:40:15.099940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00111","citing_title":"ChWDTA: Channel-wise Wavelet-Domain Transformer Attention and Entropy Modeling for Learned Image Compression","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR","json":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR.json","graph_json":"https://pith.science/api/pith-number/YIFEUEEN47LIG3MGCA2OOJOUCR/graph.json","events_json":"https://pith.science/api/pith-number/YIFEUEEN47LIG3MGCA2OOJOUCR/events.json","paper":"https://pith.science/paper/YIFEUEEN"},"agent_actions":{"view_html":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR","download_json":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR.json","view_paper":"https://pith.science/paper/YIFEUEEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10936&json=true","fetch_graph":"https://pith.science/api/pith-number/YIFEUEEN47LIG3MGCA2OOJOUCR/graph.json","fetch_events":"https://pith.science/api/pith-number/YIFEUEEN47LIG3MGCA2OOJOUCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR/action/storage_attestation","attest_author":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR/action/author_attestation","sign_citation":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR/action/citation_signature","submit_replication":"https://pith.science/pith/YIFEUEEN47LIG3MGCA2OOJOUCR/action/replication_record"}},"created_at":"2026-07-05T08:40:15.099940+00:00","updated_at":"2026-07-05T08:40:15.099940+00:00"}