{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ATBZ64PVUN5CHURINIRISM7JSZ","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":"b958f1431733db43326d98f2cd94d692d88e0faed73541f953827d8693cf537c","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-22T17:45:16Z","title_canon_sha256":"348acd58ea2338b3e6c3d6ba43221c5f16a820280ccb3b265b2913d183f48f7e"},"schema_version":"1.0","source":{"id":"2006.12463","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.12463","created_at":"2026-07-05T03:41:49Z"},{"alias_kind":"arxiv_version","alias_value":"2006.12463v3","created_at":"2026-07-05T03:41:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.12463","created_at":"2026-07-05T03:41:49Z"},{"alias_kind":"pith_short_12","alias_value":"ATBZ64PVUN5C","created_at":"2026-07-05T03:41:49Z"},{"alias_kind":"pith_short_16","alias_value":"ATBZ64PVUN5CHURI","created_at":"2026-07-05T03:41:49Z"},{"alias_kind":"pith_short_8","alias_value":"ATBZ64PV","created_at":"2026-07-05T03:41:49Z"}],"graph_snapshots":[{"event_id":"sha256:0878fcf13909a0328053f6d86d498a06e55700a1ed16e6f84ad17cdf89a796bd","target":"graph","created_at":"2026-07-05T03:41:49Z","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/2006.12463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In general, deep neural network (DNN) pruning methods fall into two categories: 1) Weight-based deterministic constraints, and 2) Probabilistic frameworks. While each approach has its merits and limitations there are a set of common practical issues such as, trial-and-error to analyze sensitivity and hyper-parameters to prune DNNs, which plague them both. In this work, we propose a new single-shot, fully automated pruning algorithm called Slimming Neural networks using Adaptive Connectivity Scores (SNACS). Our proposed approach combines a probabilistic pruning framework with constraints on the","authors_text":"Dawsin Blanchard, Jason J. Corso, Madan Ravi Ganesh, Salimeh Yasaei Sekeh","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-22T17:45:16Z","title":"Slimming Neural Networks using Adaptive Connectivity Scores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.12463","kind":"arxiv","version":3},"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:e5ed9a5290113066c4862ea8d2829037cbff2c559f8233f1aba5af8b7e315798","target":"record","created_at":"2026-07-05T03:41:49Z","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":"b958f1431733db43326d98f2cd94d692d88e0faed73541f953827d8693cf537c","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-22T17:45:16Z","title_canon_sha256":"348acd58ea2338b3e6c3d6ba43221c5f16a820280ccb3b265b2913d183f48f7e"},"schema_version":"1.0","source":{"id":"2006.12463","kind":"arxiv","version":3}},"canonical_sha256":"04c39f71f5a37a23d2286a228933e9964d745af4ccd92dc252139ed3159647a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04c39f71f5a37a23d2286a228933e9964d745af4ccd92dc252139ed3159647a0","first_computed_at":"2026-07-05T03:41:49.533653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:41:49.533653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UxWlNyyUqfS5IN8wEtc5CvT52rVbtezAqgskL1U7nsW5c93TOy9Pvp7wjgKoir4H8MklBAQcIFHjX/tK5P+VCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:41:49.534000Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.12463","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5ed9a5290113066c4862ea8d2829037cbff2c559f8233f1aba5af8b7e315798","sha256:0878fcf13909a0328053f6d86d498a06e55700a1ed16e6f84ad17cdf89a796bd"],"state_sha256":"ed7af4caadbd0844f6505246469f28afd413cccb17d0348342a1cf570fb9ea7f"}