{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NP7JWYM6LAMPGCK7KSOZN6XDCA","short_pith_number":"pith:NP7JWYM6","schema_version":"1.0","canonical_sha256":"6bfe9b619e5818f3095f549d96fae3103ece886e2f3e6b457e1cd56c4059f579","source":{"kind":"arxiv","id":"1906.10057","version":2},"attestation_state":"computed","paper":{"title":"Efficient and Effective Context-Based Convolutional Entropy Modeling for Image Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"David Zhang, Jane You, Kede Ma, Mu Li, Wangmeng Zuo","submitted_at":"2019-06-24T16:26:03Z","abstract_excerpt":"Precise estimation of the probabilistic structure of natural images plays an essential role in image compression. Despite the recent remarkable success of end-to-end optimized image compression, the latent codes are usually assumed to be fully statistically factorized in order to simplify entropy modeling. However, this assumption generally does not hold true and may hinder compression performance. Here we present context-based convolutional networks (CCNs) for efficient and effective entropy modeling. In particular, a 3D zigzag scanning order and a 3D code dividing technique are introduced to"},"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":"1906.10057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-06-24T16:26:03Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"02b3e480b991c9f55c5c62d04877d19c4870d21eefcd6dcbee44b9915df20dab","abstract_canon_sha256":"9a8ff5430c89676c0025cf4d6a03a41b07e7da7e71e0c6f47f9764e30724a997"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:12:20.420325Z","signature_b64":"JiE22ZA3fmbyE2kN38Jhuj7BU8U1MOMJM5zQqfaA/IfQ1ba2g+UYTcSGxPWa7p18EmOFwDwzaUjdd1xHG38XDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bfe9b619e5818f3095f549d96fae3103ece886e2f3e6b457e1cd56c4059f579","last_reissued_at":"2026-07-05T01:12:20.419917Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:12:20.419917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Effective Context-Based Convolutional Entropy Modeling for Image Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"David Zhang, Jane You, Kede Ma, Mu Li, Wangmeng Zuo","submitted_at":"2019-06-24T16:26:03Z","abstract_excerpt":"Precise estimation of the probabilistic structure of natural images plays an essential role in image compression. Despite the recent remarkable success of end-to-end optimized image compression, the latent codes are usually assumed to be fully statistically factorized in order to simplify entropy modeling. However, this assumption generally does not hold true and may hinder compression performance. Here we present context-based convolutional networks (CCNs) for efficient and effective entropy modeling. In particular, a 3D zigzag scanning order and a 3D code dividing technique are introduced to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10057","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/1906.10057/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":"1906.10057","created_at":"2026-07-05T01:12:20.419973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10057v2","created_at":"2026-07-05T01:12:20.419973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10057","created_at":"2026-07-05T01:12:20.419973+00:00"},{"alias_kind":"pith_short_12","alias_value":"NP7JWYM6LAMP","created_at":"2026-07-05T01:12:20.419973+00:00"},{"alias_kind":"pith_short_16","alias_value":"NP7JWYM6LAMPGCK7","created_at":"2026-07-05T01:12:20.419973+00:00"},{"alias_kind":"pith_short_8","alias_value":"NP7JWYM6","created_at":"2026-07-05T01:12:20.419973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00687","citing_title":"Proteus: A Truncation-Robust Entropy Model for Progressive LiDAR Compression","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA","json":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA.json","graph_json":"https://pith.science/api/pith-number/NP7JWYM6LAMPGCK7KSOZN6XDCA/graph.json","events_json":"https://pith.science/api/pith-number/NP7JWYM6LAMPGCK7KSOZN6XDCA/events.json","paper":"https://pith.science/paper/NP7JWYM6"},"agent_actions":{"view_html":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA","download_json":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA.json","view_paper":"https://pith.science/paper/NP7JWYM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10057&json=true","fetch_graph":"https://pith.science/api/pith-number/NP7JWYM6LAMPGCK7KSOZN6XDCA/graph.json","fetch_events":"https://pith.science/api/pith-number/NP7JWYM6LAMPGCK7KSOZN6XDCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA/action/storage_attestation","attest_author":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA/action/author_attestation","sign_citation":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA/action/citation_signature","submit_replication":"https://pith.science/pith/NP7JWYM6LAMPGCK7KSOZN6XDCA/action/replication_record"}},"created_at":"2026-07-05T01:12:20.419973+00:00","updated_at":"2026-07-05T01:12:20.419973+00:00"}