{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YLWANBDPBCJGYFK3DCVSPKITB3","short_pith_number":"pith:YLWANBDP","schema_version":"1.0","canonical_sha256":"c2ec06846f08926c155b18ab27a9130ec8743696d4257d39eae92972f2759a9b","source":{"kind":"arxiv","id":"2504.00496","version":2},"attestation_state":"computed","paper":{"title":"Learned Image Compression with Dictionary-based Entropy Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jingbo Lu, Leheng Zhang, Mu Li, Shuhang Gu, Wen Li, Xingyu Zhou","submitted_at":"2025-04-01T07:43:10Z","abstract_excerpt":"Learned image compression methods have attracted great research interest and exhibited superior rate-distortion performance to the best classical image compression standards of the present. The entropy model plays a key role in learned image compression, which estimates the probability distribution of the latent representation for further entropy coding. Most existing methods employed hyper-prior and auto-regressive architectures to form their entropy models. However, they only aimed to explore the internal dependencies of latent representation while neglecting the importance of extracting pri"},"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":"2504.00496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-04-01T07:43:10Z","cross_cats_sorted":[],"title_canon_sha256":"1f4b69d10f0e0a1a3582b607495a3e988f8c20f3e11c1b46f830d8c29c00962d","abstract_canon_sha256":"a266763c8d3b210daf89784daf5da3d9c11699020938883eb19716e36446de6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:22.927933Z","signature_b64":"ZHGP5hVPI9vlSxRIxuxbEeYlPulL2M9ReE+KjBSAAw+QJ5iy/odkQM2OMI+1kZa8r/38oWwSl8PfUYHVAFtVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ec06846f08926c155b18ab27a9130ec8743696d4257d39eae92972f2759a9b","last_reissued_at":"2026-07-05T11:03:22.927438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:22.927438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learned Image Compression with Dictionary-based Entropy Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jingbo Lu, Leheng Zhang, Mu Li, Shuhang Gu, Wen Li, Xingyu Zhou","submitted_at":"2025-04-01T07:43:10Z","abstract_excerpt":"Learned image compression methods have attracted great research interest and exhibited superior rate-distortion performance to the best classical image compression standards of the present. The entropy model plays a key role in learned image compression, which estimates the probability distribution of the latent representation for further entropy coding. Most existing methods employed hyper-prior and auto-regressive architectures to form their entropy models. However, they only aimed to explore the internal dependencies of latent representation while neglecting the importance of extracting pri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00496","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.00496/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":"2504.00496","created_at":"2026-07-05T11:03:22.927500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.00496v2","created_at":"2026-07-05T11:03:22.927500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00496","created_at":"2026-07-05T11:03:22.927500+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLWANBDPBCJG","created_at":"2026-07-05T11:03:22.927500+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLWANBDPBCJGYFK3","created_at":"2026-07-05T11:03:22.927500+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLWANBDP","created_at":"2026-07-05T11:03:22.927500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10546","citing_title":"Differentiable Vector Quantization for Rate-Distortion Optimization of Generative Image Compression","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3","json":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3.json","graph_json":"https://pith.science/api/pith-number/YLWANBDPBCJGYFK3DCVSPKITB3/graph.json","events_json":"https://pith.science/api/pith-number/YLWANBDPBCJGYFK3DCVSPKITB3/events.json","paper":"https://pith.science/paper/YLWANBDP"},"agent_actions":{"view_html":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3","download_json":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3.json","view_paper":"https://pith.science/paper/YLWANBDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.00496&json=true","fetch_graph":"https://pith.science/api/pith-number/YLWANBDPBCJGYFK3DCVSPKITB3/graph.json","fetch_events":"https://pith.science/api/pith-number/YLWANBDPBCJGYFK3DCVSPKITB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3/action/storage_attestation","attest_author":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3/action/author_attestation","sign_citation":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3/action/citation_signature","submit_replication":"https://pith.science/pith/YLWANBDPBCJGYFK3DCVSPKITB3/action/replication_record"}},"created_at":"2026-07-05T11:03:22.927500+00:00","updated_at":"2026-07-05T11:03:22.927500+00:00"}