{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GUXHDV3WEYKGZY5FQPIHNGT35C","short_pith_number":"pith:GUXHDV3W","canonical_record":{"source":{"id":"2004.02164","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-04-05T11:28:39Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b748f1f14cb933b6f38d6a4d9b38b5e81d3f43684ce47a1fd2730b5dabb1b5bd","abstract_canon_sha256":"fdb263647ce74043ed8b7c408fe56c2bc94134cb31070f07f3fc0cd42ec3deb6"},"schema_version":"1.0"},"canonical_sha256":"352e71d77626146ce3a583d0769a7be8ae7a28a1e1feec3380f08759bf7565eb","source":{"kind":"arxiv","id":"2004.02164","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02164","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02164v5","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02164","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"GUXHDV3WEYKG","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"pith_short_16","alias_value":"GUXHDV3WEYKGZY5F","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"pith_short_8","alias_value":"GUXHDV3W","created_at":"2026-07-05T01:20:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GUXHDV3WEYKGZY5FQPIHNGT35C","target":"record","payload":{"canonical_record":{"source":{"id":"2004.02164","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-04-05T11:28:39Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b748f1f14cb933b6f38d6a4d9b38b5e81d3f43684ce47a1fd2730b5dabb1b5bd","abstract_canon_sha256":"fdb263647ce74043ed8b7c408fe56c2bc94134cb31070f07f3fc0cd42ec3deb6"},"schema_version":"1.0"},"canonical_sha256":"352e71d77626146ce3a583d0769a7be8ae7a28a1e1feec3380f08759bf7565eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:16.954217Z","signature_b64":"wTQWiPuDDPbr26hLcP76r4+plzQabhKeyHIMSzbyEIyYZAapMmalB0EWvY1D5NvVWgYdOI6S7ZqpewejIWGsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"352e71d77626146ce3a583d0769a7be8ae7a28a1e1feec3380f08759bf7565eb","last_reissued_at":"2026-07-05T01:20:16.953797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:16.953797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.02164","source_version":5,"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-05T01:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdGxMPObB00fSHcCWQCJKGqGB6ptO5JpxieBeHJQNtnGOVJqFLhCInbHYtS9QrP+Wng0EB6KO/2YhdB6dob7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:10:10.806604Z"},"content_sha256":"8aac01330e49d14a58a054b993f432151d2a029b2c6e53876b26368bfa0aaa28","schema_version":"1.0","event_id":"sha256:8aac01330e49d14a58a054b993f432151d2a029b2c6e53876b26368bfa0aaa28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GUXHDV3WEYKGZY5FQPIHNGT35C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Huazhong Yang, Peng Lei, Tianchen Zhao, Wenshuo Li, Xuefei Ning, Yu Wang","submitted_at":"2020-04-05T11:28:39Z","abstract_excerpt":"Budgeted pruning is the problem of pruning under resource constraints. In budgeted pruning, how to distribute the resources across layers (i.e., sparsity allocation) is the key problem. Traditional methods solve it by discretely searching for the layer-wise pruning ratios, which lacks efficiency. In this paper, we propose Differentiable Sparsity Allocation (DSA), an efficient end-to-end budgeted pruning flow. Utilizing a novel differentiable pruning process, DSA finds the layer-wise pruning ratios with gradient-based optimization. It allocates sparsity in continuous space, which is more effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02164","kind":"arxiv","version":5},"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/2004.02164/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-05T01:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/Tmfnf8aOEoAh4XWDDGMCDg2AzLKKz51/Zt+fhNtSaGoo3OArcdIgYd01ZlB7e1L7w3rpwgOIphcIw0F+2rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:10:10.807114Z"},"content_sha256":"bdf02b7b27693cb71f8b6a801f65f99c43bd79f40f52bd4e83c06148a0af78c6","schema_version":"1.0","event_id":"sha256:bdf02b7b27693cb71f8b6a801f65f99c43bd79f40f52bd4e83c06148a0af78c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUXHDV3WEYKGZY5FQPIHNGT35C/bundle.json","state_url":"https://pith.science/pith/GUXHDV3WEYKGZY5FQPIHNGT35C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUXHDV3WEYKGZY5FQPIHNGT35C/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-05T22:10:10Z","links":{"resolver":"https://pith.science/pith/GUXHDV3WEYKGZY5FQPIHNGT35C","bundle":"https://pith.science/pith/GUXHDV3WEYKGZY5FQPIHNGT35C/bundle.json","state":"https://pith.science/pith/GUXHDV3WEYKGZY5FQPIHNGT35C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUXHDV3WEYKGZY5FQPIHNGT35C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GUXHDV3WEYKGZY5FQPIHNGT35C","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":"fdb263647ce74043ed8b7c408fe56c2bc94134cb31070f07f3fc0cd42ec3deb6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-04-05T11:28:39Z","title_canon_sha256":"b748f1f14cb933b6f38d6a4d9b38b5e81d3f43684ce47a1fd2730b5dabb1b5bd"},"schema_version":"1.0","source":{"id":"2004.02164","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02164","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02164v5","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02164","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"GUXHDV3WEYKG","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"pith_short_16","alias_value":"GUXHDV3WEYKGZY5F","created_at":"2026-07-05T01:20:16Z"},{"alias_kind":"pith_short_8","alias_value":"GUXHDV3W","created_at":"2026-07-05T01:20:16Z"}],"graph_snapshots":[{"event_id":"sha256:bdf02b7b27693cb71f8b6a801f65f99c43bd79f40f52bd4e83c06148a0af78c6","target":"graph","created_at":"2026-07-05T01:20:16Z","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/2004.02164/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Budgeted pruning is the problem of pruning under resource constraints. In budgeted pruning, how to distribute the resources across layers (i.e., sparsity allocation) is the key problem. Traditional methods solve it by discretely searching for the layer-wise pruning ratios, which lacks efficiency. In this paper, we propose Differentiable Sparsity Allocation (DSA), an efficient end-to-end budgeted pruning flow. Utilizing a novel differentiable pruning process, DSA finds the layer-wise pruning ratios with gradient-based optimization. It allocates sparsity in continuous space, which is more effici","authors_text":"Huazhong Yang, Peng Lei, Tianchen Zhao, Wenshuo Li, Xuefei Ning, Yu Wang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-04-05T11:28:39Z","title":"DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02164","kind":"arxiv","version":5},"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:8aac01330e49d14a58a054b993f432151d2a029b2c6e53876b26368bfa0aaa28","target":"record","created_at":"2026-07-05T01:20:16Z","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":"fdb263647ce74043ed8b7c408fe56c2bc94134cb31070f07f3fc0cd42ec3deb6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-04-05T11:28:39Z","title_canon_sha256":"b748f1f14cb933b6f38d6a4d9b38b5e81d3f43684ce47a1fd2730b5dabb1b5bd"},"schema_version":"1.0","source":{"id":"2004.02164","kind":"arxiv","version":5}},"canonical_sha256":"352e71d77626146ce3a583d0769a7be8ae7a28a1e1feec3380f08759bf7565eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"352e71d77626146ce3a583d0769a7be8ae7a28a1e1feec3380f08759bf7565eb","first_computed_at":"2026-07-05T01:20:16.953797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:20:16.953797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wTQWiPuDDPbr26hLcP76r4+plzQabhKeyHIMSzbyEIyYZAapMmalB0EWvY1D5NvVWgYdOI6S7ZqpewejIWGsDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:20:16.954217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.02164","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aac01330e49d14a58a054b993f432151d2a029b2c6e53876b26368bfa0aaa28","sha256:bdf02b7b27693cb71f8b6a801f65f99c43bd79f40f52bd4e83c06148a0af78c6"],"state_sha256":"3ebb6820ed01bc62f4e41c051ec8a1e80b8d99cced2d3e2dd582f7067cfe217b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4U1Nj9IMpFVm/Mue/dxnJ7njUXmLSk9hmRbI1+hi19iT5ddpBteyCM7/eEMtGGaPA96oirZmkNabkTAyh4TZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:10:10.811801Z","bundle_sha256":"96c370b904e1af60de351482a9e4f469f82f8c5c6f9600d57fc248a06c15abf8"}}