{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NB6Q465X3FIGWNUC3JRPSGJY5L","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":"74c3de286f69809bffc30093fd7ee04d9a44aee2de98857d529104d0902d1547","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-04-15T10:21:05Z","title_canon_sha256":"dc24782ec4390f5752d6b5804ac49b60f9f85361c51ccab96c49affbed5776cb"},"schema_version":"1.0","source":{"id":"2204.07412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.07412","created_at":"2026-07-05T04:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"2204.07412v1","created_at":"2026-07-05T04:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.07412","created_at":"2026-07-05T04:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"NB6Q465X3FIG","created_at":"2026-07-05T04:15:03Z"},{"alias_kind":"pith_short_16","alias_value":"NB6Q465X3FIGWNUC","created_at":"2026-07-05T04:15:03Z"},{"alias_kind":"pith_short_8","alias_value":"NB6Q465X","created_at":"2026-07-05T04:15:03Z"}],"graph_snapshots":[{"event_id":"sha256:4b754c24498373c70c21e8c52473182d9008931425abfad1fe94fa70f76fc9f0","target":"graph","created_at":"2026-07-05T04:15:03Z","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/2204.07412/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present a novel sensitivity-based filter pruning algorithm (SbF-Pruner) to learn the importance scores of filters of each layer end-to-end. Our method learns the scores from the filter weights, enabling it to account for the correlations between the filters of each layer. Moreover, by training the pruning scores of all layers simultaneously our method can account for layer interdependencies, which is essential to find a performant sparse sub-network. Our proposed method can train and generate a pruned network from scratch in a straightforward, one-stage training process witho","authors_text":"Daniela Rus, Lucas Liebenwein, Radu Grosu, Ramin Hasani, Zahra Babaiee","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-04-15T10:21:05Z","title":"End-to-End Sensitivity-Based Filter Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.07412","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:35a126f419a35c51442a37f7b38c5b32c19e055f816d5698bb4565a40f6a20fd","target":"record","created_at":"2026-07-05T04:15:03Z","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":"74c3de286f69809bffc30093fd7ee04d9a44aee2de98857d529104d0902d1547","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-04-15T10:21:05Z","title_canon_sha256":"dc24782ec4390f5752d6b5804ac49b60f9f85361c51ccab96c49affbed5776cb"},"schema_version":"1.0","source":{"id":"2204.07412","kind":"arxiv","version":1}},"canonical_sha256":"687d0e7bb7d9506b3682da62f91938eaf696401a05342003d873d12ec7864cc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"687d0e7bb7d9506b3682da62f91938eaf696401a05342003d873d12ec7864cc6","first_computed_at":"2026-07-05T04:15:03.737563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:15:03.737563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V03yO88ETl3oQr84GG79hXupGCZ1R0vbNhoyhyMoJFDjC2fFxstMHvlTQA82+0aZ0VzKaEm/fsgYF0xGhbWnAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:15:03.737928Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.07412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35a126f419a35c51442a37f7b38c5b32c19e055f816d5698bb4565a40f6a20fd","sha256:4b754c24498373c70c21e8c52473182d9008931425abfad1fe94fa70f76fc9f0"],"state_sha256":"f72b15f2940290cb2f449c167655dc373275d5d08c0a1341c5dd48fb75f24855"}