{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:BJ4IBBDJY2YI4LZ27CYZFVWBPB","short_pith_number":"pith:BJ4IBBDJ","canonical_record":{"source":{"id":"2107.05328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-12T11:35:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"01439596c9a2f0b9dee8cce02afb1d116ca6a467c40f44c9bc662a5402bfdab0","abstract_canon_sha256":"e353abfcab80db8b615f9b9ed952b7dd276f4f4bd54906ee5366ee050432a618"},"schema_version":"1.0"},"canonical_sha256":"0a78808469c6b08e2f3af8b192d6c17860cb48a06237c99aa33f11f632732de3","source":{"kind":"arxiv","id":"2107.05328","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.05328","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"arxiv_version","alias_value":"2107.05328v2","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.05328","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"pith_short_12","alias_value":"BJ4IBBDJY2YI","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"pith_short_16","alias_value":"BJ4IBBDJY2YI4LZ2","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"pith_short_8","alias_value":"BJ4IBBDJ","created_at":"2026-07-05T03:24:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:BJ4IBBDJY2YI4LZ27CYZFVWBPB","target":"record","payload":{"canonical_record":{"source":{"id":"2107.05328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-12T11:35:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"01439596c9a2f0b9dee8cce02afb1d116ca6a467c40f44c9bc662a5402bfdab0","abstract_canon_sha256":"e353abfcab80db8b615f9b9ed952b7dd276f4f4bd54906ee5366ee050432a618"},"schema_version":"1.0"},"canonical_sha256":"0a78808469c6b08e2f3af8b192d6c17860cb48a06237c99aa33f11f632732de3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:30.490608Z","signature_b64":"NcKoJZJQ104/RvkmRU5GgmdjVvS61+zZDSYAYxdZqu52OQMslsQjvBf7Vu/Tvo/y4J5rWGlqqFr2azX5AT7KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a78808469c6b08e2f3af8b192d6c17860cb48a06237c99aa33f11f632732de3","last_reissued_at":"2026-07-05T03:24:30.490073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:30.490073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.05328","source_version":2,"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-05T03:24:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oR28sYGto2ItOKc5tslKXb+0ZyrpKPxchp+x0XcvPttGq6ejDE9Vz4R+b+HwZDOy73Z+R/JN3UDYilUITC7qDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:19:48.831166Z"},"content_sha256":"f40caf9ee4f2339620cb201a36bcff1c0ed39dc878dc8a1095cbe00be72232c6","schema_version":"1.0","event_id":"sha256:f40caf9ee4f2339620cb201a36bcff1c0ed39dc878dc8a1095cbe00be72232c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:BJ4IBBDJY2YI4LZ27CYZFVWBPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Directional Pruning via Perturbation Orthogonal Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Qing Wang, Xiaofeng Liu, Yanhui Geng, Yinchuan Li, Yunfeng Shao","submitted_at":"2021-07-12T11:35:47Z","abstract_excerpt":"Structured pruning is an effective compression technique to reduce the computation of neural networks, which is usually achieved by adding perturbations to reduce network parameters at the cost of slightly increasing training loss. A more reasonable approach is to find a sparse minimizer along the flat minimum valley found by optimizers, i.e. stochastic gradient descent, which keeps the training loss constant. To achieve this goal, we propose the structured directional pruning based on orthogonal projecting the perturbations onto the flat minimum valley. We also propose a fast solver sDprun an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.05328","kind":"arxiv","version":2},"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.05328/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-05T03:24:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZiSw1L9PMuowLtqi3n7dx7fx1nFI4A1vixu+Bgu5kSSZG0Gh6xJZPLvD1Y6Dv1r/b86VLvYLBw0Zb+Z0JMySAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:19:48.832071Z"},"content_sha256":"840f9d61fd9a3c862c19265ee377ba0fce1aa48036bd5901e2c1be3dc5b7c5b2","schema_version":"1.0","event_id":"sha256:840f9d61fd9a3c862c19265ee377ba0fce1aa48036bd5901e2c1be3dc5b7c5b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJ4IBBDJY2YI4LZ27CYZFVWBPB/bundle.json","state_url":"https://pith.science/pith/BJ4IBBDJY2YI4LZ27CYZFVWBPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJ4IBBDJY2YI4LZ27CYZFVWBPB/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-09T08:19:48Z","links":{"resolver":"https://pith.science/pith/BJ4IBBDJY2YI4LZ27CYZFVWBPB","bundle":"https://pith.science/pith/BJ4IBBDJY2YI4LZ27CYZFVWBPB/bundle.json","state":"https://pith.science/pith/BJ4IBBDJY2YI4LZ27CYZFVWBPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJ4IBBDJY2YI4LZ27CYZFVWBPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:BJ4IBBDJY2YI4LZ27CYZFVWBPB","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":"e353abfcab80db8b615f9b9ed952b7dd276f4f4bd54906ee5366ee050432a618","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-12T11:35:47Z","title_canon_sha256":"01439596c9a2f0b9dee8cce02afb1d116ca6a467c40f44c9bc662a5402bfdab0"},"schema_version":"1.0","source":{"id":"2107.05328","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.05328","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"arxiv_version","alias_value":"2107.05328v2","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.05328","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"pith_short_12","alias_value":"BJ4IBBDJY2YI","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"pith_short_16","alias_value":"BJ4IBBDJY2YI4LZ2","created_at":"2026-07-05T03:24:30Z"},{"alias_kind":"pith_short_8","alias_value":"BJ4IBBDJ","created_at":"2026-07-05T03:24:30Z"}],"graph_snapshots":[{"event_id":"sha256:840f9d61fd9a3c862c19265ee377ba0fce1aa48036bd5901e2c1be3dc5b7c5b2","target":"graph","created_at":"2026-07-05T03:24:30Z","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.05328/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Structured pruning is an effective compression technique to reduce the computation of neural networks, which is usually achieved by adding perturbations to reduce network parameters at the cost of slightly increasing training loss. A more reasonable approach is to find a sparse minimizer along the flat minimum valley found by optimizers, i.e. stochastic gradient descent, which keeps the training loss constant. To achieve this goal, we propose the structured directional pruning based on orthogonal projecting the perturbations onto the flat minimum valley. We also propose a fast solver sDprun an","authors_text":"Qing Wang, Xiaofeng Liu, Yanhui Geng, Yinchuan Li, Yunfeng Shao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-12T11:35:47Z","title":"Structured Directional Pruning via Perturbation Orthogonal Projection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.05328","kind":"arxiv","version":2},"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:f40caf9ee4f2339620cb201a36bcff1c0ed39dc878dc8a1095cbe00be72232c6","target":"record","created_at":"2026-07-05T03:24:30Z","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":"e353abfcab80db8b615f9b9ed952b7dd276f4f4bd54906ee5366ee050432a618","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-12T11:35:47Z","title_canon_sha256":"01439596c9a2f0b9dee8cce02afb1d116ca6a467c40f44c9bc662a5402bfdab0"},"schema_version":"1.0","source":{"id":"2107.05328","kind":"arxiv","version":2}},"canonical_sha256":"0a78808469c6b08e2f3af8b192d6c17860cb48a06237c99aa33f11f632732de3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a78808469c6b08e2f3af8b192d6c17860cb48a06237c99aa33f11f632732de3","first_computed_at":"2026-07-05T03:24:30.490073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:24:30.490073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NcKoJZJQ104/RvkmRU5GgmdjVvS61+zZDSYAYxdZqu52OQMslsQjvBf7Vu/Tvo/y4J5rWGlqqFr2azX5AT7KDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:24:30.490608Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.05328","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f40caf9ee4f2339620cb201a36bcff1c0ed39dc878dc8a1095cbe00be72232c6","sha256:840f9d61fd9a3c862c19265ee377ba0fce1aa48036bd5901e2c1be3dc5b7c5b2"],"state_sha256":"cce9d3c8cad3b532ef05411bbe35ce788426dd6728dbc13bf87385c9f3518918"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LeV1Fw81lW2HBvWYeulk/1jN5eJ6f7BR+D1Uh7dM2iMCiXoWEjpgcr/dJfycyVDSBCgB5IJL5ZnTiYtph8yMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:19:48.837826Z","bundle_sha256":"8748593dabbd4798f7cb43084b1e91d16daf0542e81c327d779b5479b65398f9"}}