{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DULHQRWXRQDH4MUXA2JQZDIJ2I","short_pith_number":"pith:DULHQRWX","canonical_record":{"source":{"id":"2506.01229","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.IV","submitted_at":"2025-06-02T00:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"f6a55fd66b0bf373deceffee872970d899b2d1e2dc9f9b1edc89d0d1544e23ab","abstract_canon_sha256":"956063386c234e254142d9b0d712fdcbdd48da886a99fe8707ab4d5b20db2f87"},"schema_version":"1.0"},"canonical_sha256":"1d167846d78c067e329706930c8d09d23b229c4f7f23d8e96e34ea4f52293669","source":{"kind":"arxiv","id":"2506.01229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01229","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01229v1","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01229","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"DULHQRWXRQDH","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"pith_short_16","alias_value":"DULHQRWXRQDH4MUX","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"pith_short_8","alias_value":"DULHQRWX","created_at":"2026-07-05T11:14:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DULHQRWXRQDH4MUXA2JQZDIJ2I","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01229","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.IV","submitted_at":"2025-06-02T00:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"f6a55fd66b0bf373deceffee872970d899b2d1e2dc9f9b1edc89d0d1544e23ab","abstract_canon_sha256":"956063386c234e254142d9b0d712fdcbdd48da886a99fe8707ab4d5b20db2f87"},"schema_version":"1.0"},"canonical_sha256":"1d167846d78c067e329706930c8d09d23b229c4f7f23d8e96e34ea4f52293669","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:10.136758Z","signature_b64":"rmcCX8klTbDGaY4jRXw4s9vYn/sTLlbGYDLoalwWj+S18Mb6ZOZNJzUDXZlDDD8Q7DmJDGfoXHuROlwtakc2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d167846d78c067e329706930c8d09d23b229c4f7f23d8e96e34ea4f52293669","last_reissued_at":"2026-07-05T11:14:10.136364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:10.136364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01229","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-07-05T11:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2YTYx7kFibBRYhi1YT1NDwDjeqrS31NAXj82RD88fDBh69b8K+g0LkVo26bjYn8Jhs0UNVTKSKl8955hqE9RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:55:37.020719Z"},"content_sha256":"981cbb7a723dc948cfecb7890c05c77509d52ef7d152f2c9e8927c8df58289e1","schema_version":"1.0","event_id":"sha256:981cbb7a723dc948cfecb7890c05c77509d52ef7d152f2c9e8927c8df58289e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DULHQRWXRQDH4MUXA2JQZDIJ2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Pruning and Quantization for Learned Image Compression","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.IV","authors_text":"Fengqing Zhu, Md Adnan Faisal Hossain","submitted_at":"2025-06-02T00:40:53Z","abstract_excerpt":"The high computational costs associated with large deep learning models significantly hinder their practical deployment. Model pruning has been widely explored in deep learning literature to reduce their computational burden, but its application has been largely limited to computer vision tasks such as image classification and object detection. In this work, we propose a structured pruning method targeted for Learned Image Compression (LIC) models that aims to reduce the computational costs associated with image compression while maintaining the rate-distortion performance. We employ a Neural "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01229/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-05T11:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D92uJYIMSXCozMzX4yLvzABl24jGCHp2uuJ37SWpgTrvFJEYJO8SBN3nmzrgfFKKvF8jOGaBsnT3QxOU8wRrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:55:37.021622Z"},"content_sha256":"a236199e5ade1656bacb85a7649930eca9b11c6e5e5d6a73c8c549082c0beaca","schema_version":"1.0","event_id":"sha256:a236199e5ade1656bacb85a7649930eca9b11c6e5e5d6a73c8c549082c0beaca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DULHQRWXRQDH4MUXA2JQZDIJ2I/bundle.json","state_url":"https://pith.science/pith/DULHQRWXRQDH4MUXA2JQZDIJ2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DULHQRWXRQDH4MUXA2JQZDIJ2I/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-08T11:55:37Z","links":{"resolver":"https://pith.science/pith/DULHQRWXRQDH4MUXA2JQZDIJ2I","bundle":"https://pith.science/pith/DULHQRWXRQDH4MUXA2JQZDIJ2I/bundle.json","state":"https://pith.science/pith/DULHQRWXRQDH4MUXA2JQZDIJ2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DULHQRWXRQDH4MUXA2JQZDIJ2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DULHQRWXRQDH4MUXA2JQZDIJ2I","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":"956063386c234e254142d9b0d712fdcbdd48da886a99fe8707ab4d5b20db2f87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.IV","submitted_at":"2025-06-02T00:40:53Z","title_canon_sha256":"f6a55fd66b0bf373deceffee872970d899b2d1e2dc9f9b1edc89d0d1544e23ab"},"schema_version":"1.0","source":{"id":"2506.01229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01229","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01229v1","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01229","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"DULHQRWXRQDH","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"pith_short_16","alias_value":"DULHQRWXRQDH4MUX","created_at":"2026-07-05T11:14:10Z"},{"alias_kind":"pith_short_8","alias_value":"DULHQRWX","created_at":"2026-07-05T11:14:10Z"}],"graph_snapshots":[{"event_id":"sha256:a236199e5ade1656bacb85a7649930eca9b11c6e5e5d6a73c8c549082c0beaca","target":"graph","created_at":"2026-07-05T11:14: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.01229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The high computational costs associated with large deep learning models significantly hinder their practical deployment. Model pruning has been widely explored in deep learning literature to reduce their computational burden, but its application has been largely limited to computer vision tasks such as image classification and object detection. In this work, we propose a structured pruning method targeted for Learned Image Compression (LIC) models that aims to reduce the computational costs associated with image compression while maintaining the rate-distortion performance. We employ a Neural ","authors_text":"Fengqing Zhu, Md Adnan Faisal Hossain","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.IV","submitted_at":"2025-06-02T00:40:53Z","title":"Structured Pruning and Quantization for Learned Image Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01229","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:981cbb7a723dc948cfecb7890c05c77509d52ef7d152f2c9e8927c8df58289e1","target":"record","created_at":"2026-07-05T11:14: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":"956063386c234e254142d9b0d712fdcbdd48da886a99fe8707ab4d5b20db2f87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.IV","submitted_at":"2025-06-02T00:40:53Z","title_canon_sha256":"f6a55fd66b0bf373deceffee872970d899b2d1e2dc9f9b1edc89d0d1544e23ab"},"schema_version":"1.0","source":{"id":"2506.01229","kind":"arxiv","version":1}},"canonical_sha256":"1d167846d78c067e329706930c8d09d23b229c4f7f23d8e96e34ea4f52293669","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d167846d78c067e329706930c8d09d23b229c4f7f23d8e96e34ea4f52293669","first_computed_at":"2026-07-05T11:14:10.136364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:10.136364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rmcCX8klTbDGaY4jRXw4s9vYn/sTLlbGYDLoalwWj+S18Mb6ZOZNJzUDXZlDDD8Q7DmJDGfoXHuROlwtakc2Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:10.136758Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:981cbb7a723dc948cfecb7890c05c77509d52ef7d152f2c9e8927c8df58289e1","sha256:a236199e5ade1656bacb85a7649930eca9b11c6e5e5d6a73c8c549082c0beaca"],"state_sha256":"f27949492f2e82153f20e73383b8ea9155aa6e66f18af516fb18df40ce2649ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGbzPgXcm5vesO56mCuWrVDBnYCkEtWCfADmeU7emUt2XPQFdDK02OJOEeFQfIty7MRDvyoh52Km3djSkZFhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:55:37.027799Z","bundle_sha256":"fb4926fb0de4f6e768ce468c10656ffd433a47776e47ff277d6af6f67e17f295"}}