{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HP74GMAF47PBDPNRGRBPSVC5VW","short_pith_number":"pith:HP74GMAF","canonical_record":{"source":{"id":"2107.04380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T12:12:25Z","cross_cats_sorted":[],"title_canon_sha256":"f549b3f9be11c78a818979238b010317a9e3965180bb53a81a943a9451d8353a","abstract_canon_sha256":"8081df75c0dd8a4fcf5c7c86c688261b5bb74c7f64a375c3151b572de77e21ec"},"schema_version":"1.0"},"canonical_sha256":"3bffc33005e7de11bdb13442f9545dadacd6b3abf838226eb21aa9d3d3c15849","source":{"kind":"arxiv","id":"2107.04380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04380","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04380v1","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04380","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"HP74GMAF47PB","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"HP74GMAF47PBDPNR","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"HP74GMAF","created_at":"2026-07-05T02:56:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HP74GMAF47PBDPNRGRBPSVC5VW","target":"record","payload":{"canonical_record":{"source":{"id":"2107.04380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T12:12:25Z","cross_cats_sorted":[],"title_canon_sha256":"f549b3f9be11c78a818979238b010317a9e3965180bb53a81a943a9451d8353a","abstract_canon_sha256":"8081df75c0dd8a4fcf5c7c86c688261b5bb74c7f64a375c3151b572de77e21ec"},"schema_version":"1.0"},"canonical_sha256":"3bffc33005e7de11bdb13442f9545dadacd6b3abf838226eb21aa9d3d3c15849","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:32.764651Z","signature_b64":"qABPkNKMKgy1bbWzpqszZG0lCPx7iGmLWIwqA9FPG3R1OfCecqBaMY5LhtLqGcK1yaT5hIptsFamshqA2s5YCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bffc33005e7de11bdb13442f9545dadacd6b3abf838226eb21aa9d3d3c15849","last_reissued_at":"2026-07-05T02:56:32.764248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:32.764248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.04380","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-05T02:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GJuqZ8QqZcO3v0yIehLSi2K7rHLbI9WtP7UFa5nB/QzXaPyMQNbfiUrfdbX0sgbQuvp3gj/khBl05L1vvP2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T12:16:09.952684Z"},"content_sha256":"63dd4920e3b04960b0bc93683a87b4ffb9ad2555093c601dd7651b5e2233e506","schema_version":"1.0","event_id":"sha256:63dd4920e3b04960b0bc93683a87b4ffb9ad2555093c601dd7651b5e2233e506"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HP74GMAF47PBDPNRGRBPSVC5VW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model compression as constrained optimization, with application to neural nets. Part V: combining compressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Yerlan Idelbayev","submitted_at":"2021-07-09T12:12:25Z","abstract_excerpt":"Model compression is generally performed by using quantization, low-rank approximation or pruning, for which various algorithms have been researched in recent years. One fundamental question is: what types of compression work better for a given model? Or even better: can we improve by combining compressions in a suitable way? We formulate this generally as a problem of optimizing the loss but where the weights are constrained to equal an additive combination of separately compressed parts; and we give an algorithm to learn the corresponding parts' parameters. Experimentally with deep neural ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04380","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/2107.04380/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-05T02:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Au4fKI4kavjayAA4Uul+Z9bQLtYj6EMIwRWzH40iRcQfeUy7INbtNq+MQ9e5T/AQDHjamJCuHlKdyBtrZs24BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T12:16:09.953071Z"},"content_sha256":"72f7d4435f42baa67ecb8475f6e2d708e0076791a20febe9c36b3d79fd8331e0","schema_version":"1.0","event_id":"sha256:72f7d4435f42baa67ecb8475f6e2d708e0076791a20febe9c36b3d79fd8331e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HP74GMAF47PBDPNRGRBPSVC5VW/bundle.json","state_url":"https://pith.science/pith/HP74GMAF47PBDPNRGRBPSVC5VW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HP74GMAF47PBDPNRGRBPSVC5VW/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-07-10T12:16:09Z","links":{"resolver":"https://pith.science/pith/HP74GMAF47PBDPNRGRBPSVC5VW","bundle":"https://pith.science/pith/HP74GMAF47PBDPNRGRBPSVC5VW/bundle.json","state":"https://pith.science/pith/HP74GMAF47PBDPNRGRBPSVC5VW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HP74GMAF47PBDPNRGRBPSVC5VW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HP74GMAF47PBDPNRGRBPSVC5VW","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":"8081df75c0dd8a4fcf5c7c86c688261b5bb74c7f64a375c3151b572de77e21ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T12:12:25Z","title_canon_sha256":"f549b3f9be11c78a818979238b010317a9e3965180bb53a81a943a9451d8353a"},"schema_version":"1.0","source":{"id":"2107.04380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04380","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04380v1","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04380","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"HP74GMAF47PB","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"HP74GMAF47PBDPNR","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"HP74GMAF","created_at":"2026-07-05T02:56:32Z"}],"graph_snapshots":[{"event_id":"sha256:72f7d4435f42baa67ecb8475f6e2d708e0076791a20febe9c36b3d79fd8331e0","target":"graph","created_at":"2026-07-05T02:56:32Z","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/2107.04380/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Model compression is generally performed by using quantization, low-rank approximation or pruning, for which various algorithms have been researched in recent years. One fundamental question is: what types of compression work better for a given model? Or even better: can we improve by combining compressions in a suitable way? We formulate this generally as a problem of optimizing the loss but where the weights are constrained to equal an additive combination of separately compressed parts; and we give an algorithm to learn the corresponding parts' parameters. Experimentally with deep neural ne","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Yerlan Idelbayev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T12:12:25Z","title":"Model compression as constrained optimization, with application to neural nets. Part V: combining compressions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04380","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:63dd4920e3b04960b0bc93683a87b4ffb9ad2555093c601dd7651b5e2233e506","target":"record","created_at":"2026-07-05T02:56:32Z","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":"8081df75c0dd8a4fcf5c7c86c688261b5bb74c7f64a375c3151b572de77e21ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-09T12:12:25Z","title_canon_sha256":"f549b3f9be11c78a818979238b010317a9e3965180bb53a81a943a9451d8353a"},"schema_version":"1.0","source":{"id":"2107.04380","kind":"arxiv","version":1}},"canonical_sha256":"3bffc33005e7de11bdb13442f9545dadacd6b3abf838226eb21aa9d3d3c15849","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bffc33005e7de11bdb13442f9545dadacd6b3abf838226eb21aa9d3d3c15849","first_computed_at":"2026-07-05T02:56:32.764248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:56:32.764248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qABPkNKMKgy1bbWzpqszZG0lCPx7iGmLWIwqA9FPG3R1OfCecqBaMY5LhtLqGcK1yaT5hIptsFamshqA2s5YCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:56:32.764651Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.04380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63dd4920e3b04960b0bc93683a87b4ffb9ad2555093c601dd7651b5e2233e506","sha256:72f7d4435f42baa67ecb8475f6e2d708e0076791a20febe9c36b3d79fd8331e0"],"state_sha256":"6b75e5274a05fdceb035dc0c0f4be076b3305ac9d9eea47a85ffcb47254f2c9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I46bZhloklGJYrh6IrZAMmDXU6ujgWWDhpApT6UpRI4hi/wPetRV03tmn7q5PdecZZ3xpdemwLGrtbK/ABVACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T12:16:09.956557Z","bundle_sha256":"a387a9b3cc3866bffa1d60e8ed111b7c937d6ffe784a33277221f69403ce101e"}}