{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EUSL3UGCJZJWXLRITHUIN3T3Y4","short_pith_number":"pith:EUSL3UGC","canonical_record":{"source":{"id":"1801.04662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-15T04:28:32Z","cross_cats_sorted":[],"title_canon_sha256":"d203355d21f92ae23c5d55f4f0f8f5adcf5fae0436e4d2aaf03bf23a4652da63","abstract_canon_sha256":"8abdacfe2d59409644e8225ba43b233ef9ec7f4b558010ac98a76f5257b31b71"},"schema_version":"1.0"},"canonical_sha256":"2524bdd0c24e536bae2899e886ee7bc73e0bf49d06854f93b4c1f14a8b504ee1","source":{"kind":"arxiv","id":"1801.04662","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04662","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04662v2","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04662","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"EUSL3UGCJZJW","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EUSL3UGCJZJWXLRI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EUSL3UGC","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EUSL3UGCJZJWXLRITHUIN3T3Y4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-15T04:28:32Z","cross_cats_sorted":[],"title_canon_sha256":"d203355d21f92ae23c5d55f4f0f8f5adcf5fae0436e4d2aaf03bf23a4652da63","abstract_canon_sha256":"8abdacfe2d59409644e8225ba43b233ef9ec7f4b558010ac98a76f5257b31b71"},"schema_version":"1.0"},"canonical_sha256":"2524bdd0c24e536bae2899e886ee7bc73e0bf49d06854f93b4c1f14a8b504ee1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:50.062580Z","signature_b64":"oD4KTsA+jzjxJqVoTxdhRIOdz7WOZcdjxRRaiZYuGJceaY5QHF08nrn1eJliNOyExI72bJVHMjsEJ/wB9aggAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2524bdd0c24e536bae2899e886ee7bc73e0bf49d06854f93b4c1f14a8b504ee1","last_reissued_at":"2026-05-18T00:11:50.061854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:50.061854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04662","source_version":2,"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-18T00:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZXG/KHqqImxgMjUgdg+TjgyKSUxbcuoDMrIRXImuOFo1c8cyN4SYQ7QRGbOH8g/hiXM8X0zZDwH2Hz4wPKEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:40:44.939425Z"},"content_sha256":"b75bfc18b19be3f45ffab88d9ca7f108d0f6d0a02f3ec3581b0e3e258f957f1a","schema_version":"1.0","event_id":"sha256:b75bfc18b19be3f45ffab88d9ca7f108d0f6d0a02f3ec3581b0e3e258f957f1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EUSL3UGCJZJWXLRITHUIN3T3Y4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enlarging Context with Low Cost: Efficient Arithmetic Coding with Trimmed Convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"David Zhang, Mu Li, Shuhang Gu, Wangmeng Zuo","submitted_at":"2018-01-15T04:28:32Z","abstract_excerpt":"Arithmetic coding is an essential class of coding techniques. One key issue of arithmetic encoding method is to predict the probability of the current coding symbol from its context, i.e., the preceding encoded symbols, which usually can be executed by building a look-up table (LUT). However, the complexity of LUT increases exponentially with the length of context. Thus, such solutions are limited to modeling large context, which inevitably restricts the compression performance. Several recent deep neural network-based solutions have been developed to account for large context, but are still c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04662","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":""},"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-18T00:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwFxTJLAic3GDdkToZ14YsEGbpJ5idjIIFAzlV43/YwdPvqLFxJleK99lk0WcHrwNt+fN+61TgM1GPz7HcP5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:40:44.940112Z"},"content_sha256":"d3ceb36e0b4d02e16ba19abfde51e3785e6f26c7f8826a277d7551625873acdb","schema_version":"1.0","event_id":"sha256:d3ceb36e0b4d02e16ba19abfde51e3785e6f26c7f8826a277d7551625873acdb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUSL3UGCJZJWXLRITHUIN3T3Y4/bundle.json","state_url":"https://pith.science/pith/EUSL3UGCJZJWXLRITHUIN3T3Y4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUSL3UGCJZJWXLRITHUIN3T3Y4/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-26T03:40:44Z","links":{"resolver":"https://pith.science/pith/EUSL3UGCJZJWXLRITHUIN3T3Y4","bundle":"https://pith.science/pith/EUSL3UGCJZJWXLRITHUIN3T3Y4/bundle.json","state":"https://pith.science/pith/EUSL3UGCJZJWXLRITHUIN3T3Y4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUSL3UGCJZJWXLRITHUIN3T3Y4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EUSL3UGCJZJWXLRITHUIN3T3Y4","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":"8abdacfe2d59409644e8225ba43b233ef9ec7f4b558010ac98a76f5257b31b71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-15T04:28:32Z","title_canon_sha256":"d203355d21f92ae23c5d55f4f0f8f5adcf5fae0436e4d2aaf03bf23a4652da63"},"schema_version":"1.0","source":{"id":"1801.04662","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04662","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04662v2","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04662","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"EUSL3UGCJZJW","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EUSL3UGCJZJWXLRI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EUSL3UGC","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:d3ceb36e0b4d02e16ba19abfde51e3785e6f26c7f8826a277d7551625873acdb","target":"graph","created_at":"2026-05-18T00:11:50Z","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"},"paper":{"abstract_excerpt":"Arithmetic coding is an essential class of coding techniques. One key issue of arithmetic encoding method is to predict the probability of the current coding symbol from its context, i.e., the preceding encoded symbols, which usually can be executed by building a look-up table (LUT). However, the complexity of LUT increases exponentially with the length of context. Thus, such solutions are limited to modeling large context, which inevitably restricts the compression performance. Several recent deep neural network-based solutions have been developed to account for large context, but are still c","authors_text":"David Zhang, Mu Li, Shuhang Gu, Wangmeng Zuo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-15T04:28:32Z","title":"Enlarging Context with Low Cost: Efficient Arithmetic Coding with Trimmed Convolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04662","kind":"arxiv","version":2},"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:b75bfc18b19be3f45ffab88d9ca7f108d0f6d0a02f3ec3581b0e3e258f957f1a","target":"record","created_at":"2026-05-18T00:11:50Z","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":"8abdacfe2d59409644e8225ba43b233ef9ec7f4b558010ac98a76f5257b31b71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-15T04:28:32Z","title_canon_sha256":"d203355d21f92ae23c5d55f4f0f8f5adcf5fae0436e4d2aaf03bf23a4652da63"},"schema_version":"1.0","source":{"id":"1801.04662","kind":"arxiv","version":2}},"canonical_sha256":"2524bdd0c24e536bae2899e886ee7bc73e0bf49d06854f93b4c1f14a8b504ee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2524bdd0c24e536bae2899e886ee7bc73e0bf49d06854f93b4c1f14a8b504ee1","first_computed_at":"2026-05-18T00:11:50.061854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:50.061854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oD4KTsA+jzjxJqVoTxdhRIOdz7WOZcdjxRRaiZYuGJceaY5QHF08nrn1eJliNOyExI72bJVHMjsEJ/wB9aggAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:50.062580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04662","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b75bfc18b19be3f45ffab88d9ca7f108d0f6d0a02f3ec3581b0e3e258f957f1a","sha256:d3ceb36e0b4d02e16ba19abfde51e3785e6f26c7f8826a277d7551625873acdb"],"state_sha256":"df867c3103d0dd9930a9ec6fd3c74a9935c8a34b2671e6ca5c03e16d4aa4a9b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AOCfvMBykTZ5mzp/Yi8NQjHq2jW3EBxSq99bUQGY9iKyxDSLjY+s2Je/533gY5heqGvMc5GQor2Kr0pPMW6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:40:44.943349Z","bundle_sha256":"06a1ddcb7107ace0f19dd00cd2c4e3678e975a67c9199c9fae0106e7690e7aff"}}