{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JSDZTHYHVFEUCFIT4ZVYEGD25W","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":"a397edc8a34bc1c9e732e184b55f93a2848c5760ae9b394faa733c1e223b87f6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-07T09:39:55Z","title_canon_sha256":"16ec569b0651682443164992a99985b23804d6f1625db250516e9ae7e35ba90f"},"schema_version":"1.0","source":{"id":"2005.03354","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.03354","created_at":"2026-07-05T01:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"2005.03354v2","created_at":"2026-07-05T01:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.03354","created_at":"2026-07-05T01:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"JSDZTHYHVFEU","created_at":"2026-07-05T01:01:24Z"},{"alias_kind":"pith_short_16","alias_value":"JSDZTHYHVFEUCFIT","created_at":"2026-07-05T01:01:24Z"},{"alias_kind":"pith_short_8","alias_value":"JSDZTHYH","created_at":"2026-07-05T01:01:24Z"}],"graph_snapshots":[{"event_id":"sha256:e0a522a0221440be634253c5c092ecb4ceee50ade29bcb0280355dfbf6459a9f","target":"graph","created_at":"2026-07-05T01:01:24Z","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/2005.03354/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent works imply that the channel pruning can be regarded as searching optimal sub-structure from unpruned networks. However, existing works based on this observation require training and evaluating a large number of structures, which limits their application. In this paper, we propose a novel differentiable method for channel pruning, named Differentiable Markov Channel Pruning (DMCP), to efficiently search the optimal sub-structure. Our method is differentiable and can be directly optimized by gradient descent with respect to standard task loss and budget regularization (e.g. FLOPs constra","authors_text":"Junjie Yan, Quanquan Li, Shaopeng Guo, Yujie Wang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-07T09:39:55Z","title":"DMCP: Differentiable Markov Channel Pruning for Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.03354","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:bc3b3ec2d9e702dc9fd8a12ff770fdf5a927c3decaf6822bff9b48d070787daa","target":"record","created_at":"2026-07-05T01:01:24Z","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":"a397edc8a34bc1c9e732e184b55f93a2848c5760ae9b394faa733c1e223b87f6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-07T09:39:55Z","title_canon_sha256":"16ec569b0651682443164992a99985b23804d6f1625db250516e9ae7e35ba90f"},"schema_version":"1.0","source":{"id":"2005.03354","kind":"arxiv","version":2}},"canonical_sha256":"4c87999f07a949411513e66b82187aedb00792dff57407743474d7a7dd1087b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c87999f07a949411513e66b82187aedb00792dff57407743474d7a7dd1087b6","first_computed_at":"2026-07-05T01:01:24.994257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:24.994257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0CQ/dTFs8Sl3oOA+vRo0I8btfxD0dhO/p+7Zkml1r+1rsv83tRRkVobJdnaTbB3z50VwUH7eq8QJ9T/abaF8Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:24.994671Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.03354","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc3b3ec2d9e702dc9fd8a12ff770fdf5a927c3decaf6822bff9b48d070787daa","sha256:e0a522a0221440be634253c5c092ecb4ceee50ade29bcb0280355dfbf6459a9f"],"state_sha256":"3f05817b9e877d576146bd91dddd15d4204b3e4f243e06ae05ca830ab92a42e2"}