{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XN5GH5KIHG4WMDA7LDRI2WXNTX","short_pith_number":"pith:XN5GH5KI","canonical_record":{"source":{"id":"2405.04144","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T09:19:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c0e6ca137a0c6a9cef2022f3122168642fc38ef7444b9dc264c1b72b220805dc","abstract_canon_sha256":"4e03e89845dd4215e8cefbb06fa6f6dc0d216da3dbc6c35e88c0111c117763d8"},"schema_version":"1.0"},"canonical_sha256":"bb7a63f54839b9660c1f58e28d5aed9de83bdf2f5aeb605c0b23b3425d78a260","source":{"kind":"arxiv","id":"2405.04144","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04144","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04144v3","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04144","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"XN5GH5KIHG4W","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"pith_short_16","alias_value":"XN5GH5KIHG4WMDA7","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"pith_short_8","alias_value":"XN5GH5KI","created_at":"2026-07-05T10:02:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XN5GH5KIHG4WMDA7LDRI2WXNTX","target":"record","payload":{"canonical_record":{"source":{"id":"2405.04144","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T09:19:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c0e6ca137a0c6a9cef2022f3122168642fc38ef7444b9dc264c1b72b220805dc","abstract_canon_sha256":"4e03e89845dd4215e8cefbb06fa6f6dc0d216da3dbc6c35e88c0111c117763d8"},"schema_version":"1.0"},"canonical_sha256":"bb7a63f54839b9660c1f58e28d5aed9de83bdf2f5aeb605c0b23b3425d78a260","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:46.088437Z","signature_b64":"+IJ6TI8ttN6FSdULBKH0tTyP32/4YcSI7dyp1fuzapuHy4vTvj1rHfLltAJEHcMXe0/Aa2hRLxi4RnQYHwECAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb7a63f54839b9660c1f58e28d5aed9de83bdf2f5aeb605c0b23b3425d78a260","last_reissued_at":"2026-07-05T10:02:46.087918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:46.087918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.04144","source_version":3,"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-07-05T10:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wehW2xK2aV95m83Cowhr20AVrOlvcKWQcypvqOj04Ia6bzaiM03mDaItk0Ke/IxCzyG6fGedim18mv8o9hS4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T15:59:44.768676Z"},"content_sha256":"7c54ab870857ac4e4da57bc802f2c752c2affccd3f82e8b736736440d81481fa","schema_version":"1.0","event_id":"sha256:7c54ab870857ac4e4da57bc802f2c752c2affccd3f82e8b736736440d81481fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XN5GH5KIHG4WMDA7LDRI2WXNTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task-Oriented Lossy Compression with Data, Perception, and Classification Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shuai Ma, Ying-Jun Angela Zhang, Youlong Wu, Yuhan Wang","submitted_at":"2024-05-07T09:19:53Z","abstract_excerpt":"By extracting task-relevant information while maximally compressing the input, the information bottleneck (IB) principle has provided a guideline for learning effective and robust representations of the target inference. However, extending the idea to the multi-task learning scenario with joint consideration of generative tasks and traditional reconstruction tasks remains unexplored. This paper addresses this gap by reconsidering the lossy compression problem with diverse constraints on data reconstruction, perceptual quality, and classification accuracy. Firstly, we study two ternary relation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04144","kind":"arxiv","version":3},"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/2405.04144/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"},"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-07-05T10:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1l8TD00q2SX+/snNmOVLVpAzAcKFo9OHKN5VYc4TDDK9rlz0tGL2TyH0T4cu4+DPmt0FapC0DLEYVt2FtPaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T15:59:44.769592Z"},"content_sha256":"bc40f113bdd7104f1b32e2dac33f0583a89441dae449df8346391095681158a6","schema_version":"1.0","event_id":"sha256:bc40f113bdd7104f1b32e2dac33f0583a89441dae449df8346391095681158a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XN5GH5KIHG4WMDA7LDRI2WXNTX/bundle.json","state_url":"https://pith.science/pith/XN5GH5KIHG4WMDA7LDRI2WXNTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XN5GH5KIHG4WMDA7LDRI2WXNTX/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-08-07T15:59:44Z","links":{"resolver":"https://pith.science/pith/XN5GH5KIHG4WMDA7LDRI2WXNTX","bundle":"https://pith.science/pith/XN5GH5KIHG4WMDA7LDRI2WXNTX/bundle.json","state":"https://pith.science/pith/XN5GH5KIHG4WMDA7LDRI2WXNTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XN5GH5KIHG4WMDA7LDRI2WXNTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XN5GH5KIHG4WMDA7LDRI2WXNTX","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":"4e03e89845dd4215e8cefbb06fa6f6dc0d216da3dbc6c35e88c0111c117763d8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T09:19:53Z","title_canon_sha256":"c0e6ca137a0c6a9cef2022f3122168642fc38ef7444b9dc264c1b72b220805dc"},"schema_version":"1.0","source":{"id":"2405.04144","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04144","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04144v3","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04144","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"XN5GH5KIHG4W","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"pith_short_16","alias_value":"XN5GH5KIHG4WMDA7","created_at":"2026-07-05T10:02:46Z"},{"alias_kind":"pith_short_8","alias_value":"XN5GH5KI","created_at":"2026-07-05T10:02:46Z"}],"graph_snapshots":[{"event_id":"sha256:bc40f113bdd7104f1b32e2dac33f0583a89441dae449df8346391095681158a6","target":"graph","created_at":"2026-07-05T10:02:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.04144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"By extracting task-relevant information while maximally compressing the input, the information bottleneck (IB) principle has provided a guideline for learning effective and robust representations of the target inference. However, extending the idea to the multi-task learning scenario with joint consideration of generative tasks and traditional reconstruction tasks remains unexplored. This paper addresses this gap by reconsidering the lossy compression problem with diverse constraints on data reconstruction, perceptual quality, and classification accuracy. Firstly, we study two ternary relation","authors_text":"Shuai Ma, Ying-Jun Angela Zhang, Youlong Wu, Yuhan Wang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T09:19:53Z","title":"Task-Oriented Lossy Compression with Data, Perception, and Classification Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04144","kind":"arxiv","version":3},"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:7c54ab870857ac4e4da57bc802f2c752c2affccd3f82e8b736736440d81481fa","target":"record","created_at":"2026-07-05T10:02:46Z","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":"4e03e89845dd4215e8cefbb06fa6f6dc0d216da3dbc6c35e88c0111c117763d8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T09:19:53Z","title_canon_sha256":"c0e6ca137a0c6a9cef2022f3122168642fc38ef7444b9dc264c1b72b220805dc"},"schema_version":"1.0","source":{"id":"2405.04144","kind":"arxiv","version":3}},"canonical_sha256":"bb7a63f54839b9660c1f58e28d5aed9de83bdf2f5aeb605c0b23b3425d78a260","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb7a63f54839b9660c1f58e28d5aed9de83bdf2f5aeb605c0b23b3425d78a260","first_computed_at":"2026-07-05T10:02:46.087918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:02:46.087918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+IJ6TI8ttN6FSdULBKH0tTyP32/4YcSI7dyp1fuzapuHy4vTvj1rHfLltAJEHcMXe0/Aa2hRLxi4RnQYHwECAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:02:46.088437Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.04144","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c54ab870857ac4e4da57bc802f2c752c2affccd3f82e8b736736440d81481fa","sha256:bc40f113bdd7104f1b32e2dac33f0583a89441dae449df8346391095681158a6"],"state_sha256":"11bfcfe0895b27883ca17dbeb65934ca5949e7107515aaab8098a8abe6a15cc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EQTCPKTA4XXBPvJmjeKyus/muayfdQl7aVmtFfD2QVsj7X2Nb8bj0YxS/Cascb62DodrCMs/tB8mSu6KqOrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T15:59:44.784456Z","bundle_sha256":"e6d5ae9e88aadca0dae1317800e8bd33f489c23054765733bb24be7f6acc28bc"}}