{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L3GBFAX72EMFZSV6GIBPZ6TPSQ","short_pith_number":"pith:L3GBFAX7","canonical_record":{"source":{"id":"1807.03470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T03:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"7718b48227aa7ea57f35a514748ce583d0ed8ed794b5ad89c2b23056caf6f670","abstract_canon_sha256":"1bfe9dcfa442cffc5c4b5761a3752b10cacba97396017a09169956eea5e7e060"},"schema_version":"1.0"},"canonical_sha256":"5ecc1282ffd1185ccabe3202fcfa6f94340126797fe8cb44395416f9a7429709","source":{"kind":"arxiv","id":"1807.03470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03470","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03470v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03470","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"L3GBFAX72EMF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3GBFAX72EMFZSV6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3GBFAX7","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L3GBFAX72EMFZSV6GIBPZ6TPSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T03:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"7718b48227aa7ea57f35a514748ce583d0ed8ed794b5ad89c2b23056caf6f670","abstract_canon_sha256":"1bfe9dcfa442cffc5c4b5761a3752b10cacba97396017a09169956eea5e7e060"},"schema_version":"1.0"},"canonical_sha256":"5ecc1282ffd1185ccabe3202fcfa6f94340126797fe8cb44395416f9a7429709","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:10.352796Z","signature_b64":"KxEP2DxObFe9t1UxzGSOW7ggSyrso+MuB80n30wIrLG7GiZjIFh0rk/wiRidJ8t27aVTBbHzVcghiVkCnqBtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ecc1282ffd1185ccabe3202fcfa6f94340126797fe8cb44395416f9a7429709","last_reissued_at":"2026-05-18T00:11:10.352069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:10.352069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03470","source_version":1,"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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6IhlOrFW7m1R4X7MSebKZysxrYxwRk5qNv92OGHNCKnALSYpW7zFPgiwmnaxyplvfcrolts+cSvUcYcA93qqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:08.939664Z"},"content_sha256":"8fb8085192ad78d7b8fa463c84f60f7c4525192a0bd59f279787bfe355446b54","schema_version":"1.0","event_id":"sha256:8fb8085192ad78d7b8fa463c84f60f7c4525192a0bd59f279787bfe355446b54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L3GBFAX72EMFZSV6GIBPZ6TPSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning a Single Tucker Decomposition Network for Lossy Image Compression with Multiple Bits-Per-Pixel Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jianrui Cai, Lei Zhang, Zisheng Cao","submitted_at":"2018-07-10T03:40:36Z","abstract_excerpt":"Lossy image compression (LIC), which aims to utilize inexact approximations to represent an image more compactly, is a classical problem in image processing. Recently, deep convolutional neural networks (CNNs) have achieved interesting results in LIC by learning an encoder-quantizer-decoder network from a large amount of data. However, existing CNN-based LIC methods usually can only train a network for a specific bits-per-pixel (bpp). Such a \"one network per bpp\" problem limits the generality and flexibility of CNNs to practical LIC applications. In this paper, we propose to learn a single CNN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03470","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":""},"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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbWRXaRYqMO5BofR2fuvsEi5aQmlt96v7c3R19FZVZFyoKZ/mEw2T8p8cuiY3Xn2pQeYGGUtGWP08aXUQeByAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:08.940235Z"},"content_sha256":"a9398350fb81295d48e610d3a50577cefb46cba7b329e5c320065c0534d636b5","schema_version":"1.0","event_id":"sha256:a9398350fb81295d48e610d3a50577cefb46cba7b329e5c320065c0534d636b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3GBFAX72EMFZSV6GIBPZ6TPSQ/bundle.json","state_url":"https://pith.science/pith/L3GBFAX72EMFZSV6GIBPZ6TPSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3GBFAX72EMFZSV6GIBPZ6TPSQ/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-06-01T03:10:08Z","links":{"resolver":"https://pith.science/pith/L3GBFAX72EMFZSV6GIBPZ6TPSQ","bundle":"https://pith.science/pith/L3GBFAX72EMFZSV6GIBPZ6TPSQ/bundle.json","state":"https://pith.science/pith/L3GBFAX72EMFZSV6GIBPZ6TPSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3GBFAX72EMFZSV6GIBPZ6TPSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L3GBFAX72EMFZSV6GIBPZ6TPSQ","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":"1bfe9dcfa442cffc5c4b5761a3752b10cacba97396017a09169956eea5e7e060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T03:40:36Z","title_canon_sha256":"7718b48227aa7ea57f35a514748ce583d0ed8ed794b5ad89c2b23056caf6f670"},"schema_version":"1.0","source":{"id":"1807.03470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03470","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03470v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03470","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"L3GBFAX72EMF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3GBFAX72EMFZSV6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3GBFAX7","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:a9398350fb81295d48e610d3a50577cefb46cba7b329e5c320065c0534d636b5","target":"graph","created_at":"2026-05-18T00:11:10Z","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":"Lossy image compression (LIC), which aims to utilize inexact approximations to represent an image more compactly, is a classical problem in image processing. Recently, deep convolutional neural networks (CNNs) have achieved interesting results in LIC by learning an encoder-quantizer-decoder network from a large amount of data. However, existing CNN-based LIC methods usually can only train a network for a specific bits-per-pixel (bpp). Such a \"one network per bpp\" problem limits the generality and flexibility of CNNs to practical LIC applications. In this paper, we propose to learn a single CNN","authors_text":"Jianrui Cai, Lei Zhang, Zisheng Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T03:40:36Z","title":"Learning a Single Tucker Decomposition Network for Lossy Image Compression with Multiple Bits-Per-Pixel Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03470","kind":"arxiv","version":1},"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:8fb8085192ad78d7b8fa463c84f60f7c4525192a0bd59f279787bfe355446b54","target":"record","created_at":"2026-05-18T00:11:10Z","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":"1bfe9dcfa442cffc5c4b5761a3752b10cacba97396017a09169956eea5e7e060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-10T03:40:36Z","title_canon_sha256":"7718b48227aa7ea57f35a514748ce583d0ed8ed794b5ad89c2b23056caf6f670"},"schema_version":"1.0","source":{"id":"1807.03470","kind":"arxiv","version":1}},"canonical_sha256":"5ecc1282ffd1185ccabe3202fcfa6f94340126797fe8cb44395416f9a7429709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ecc1282ffd1185ccabe3202fcfa6f94340126797fe8cb44395416f9a7429709","first_computed_at":"2026-05-18T00:11:10.352069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:10.352069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KxEP2DxObFe9t1UxzGSOW7ggSyrso+MuB80n30wIrLG7GiZjIFh0rk/wiRidJ8t27aVTBbHzVcghiVkCnqBtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:10.352796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fb8085192ad78d7b8fa463c84f60f7c4525192a0bd59f279787bfe355446b54","sha256:a9398350fb81295d48e610d3a50577cefb46cba7b329e5c320065c0534d636b5"],"state_sha256":"7ca5d3088a8c06a385391644918e525263665c0787297603eb906266eef4786d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGeC6SnkISUhdEsNRxB9sGsWrvQ5Eu+p8Y4arJ+GM42DHIqNt85QYuK7LegDAzw6xa7Flw1aWe/YVEotlgZZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:10:08.943262Z","bundle_sha256":"e21645d257c2bc1c6cb17b253859a5826a6dbd541e8f2844c6ccd5cff61cdf4f"}}