{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GHKNJ3DSDWJACSZ5FHBOXKLBTF","short_pith_number":"pith:GHKNJ3DS","canonical_record":{"source":{"id":"1911.07412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-18T03:56:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ad618c1557d9f2430e140502337f0b7fcda5460856fa431bc8de11a68235bf8c","abstract_canon_sha256":"9f86c34fb1f2b1a2bc59aa07051b51611098df1edcadd7705c0322cdde0ca930"},"schema_version":"1.0"},"canonical_sha256":"31d4d4ec721d92014b3d29c2eba961994ed98fc8d816a85f3fe23327ef2c4d25","source":{"kind":"arxiv","id":"1911.07412","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07412","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07412v2","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07412","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"GHKNJ3DSDWJA","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"pith_short_16","alias_value":"GHKNJ3DSDWJACSZ5","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"pith_short_8","alias_value":"GHKNJ3DS","created_at":"2026-07-05T00:49:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GHKNJ3DSDWJACSZ5FHBOXKLBTF","target":"record","payload":{"canonical_record":{"source":{"id":"1911.07412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-18T03:56:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ad618c1557d9f2430e140502337f0b7fcda5460856fa431bc8de11a68235bf8c","abstract_canon_sha256":"9f86c34fb1f2b1a2bc59aa07051b51611098df1edcadd7705c0322cdde0ca930"},"schema_version":"1.0"},"canonical_sha256":"31d4d4ec721d92014b3d29c2eba961994ed98fc8d816a85f3fe23327ef2c4d25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:39.775207Z","signature_b64":"9IDjxPH6FwUtQKeaP3QXi417RH30l2Yfwl2TE5YviKNvojrLpNs3g+o0U4FUZ2DQ7PtfBQUY88Xc5yM/7hOQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31d4d4ec721d92014b3d29c2eba961994ed98fc8d816a85f3fe23327ef2c4d25","last_reissued_at":"2026-07-05T00:49:39.774725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:39.774725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.07412","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-05T00:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYtPlZaTYQ0IBWrUYmzGSNhZWJwhFMOqlNvgv+f/eQjfTRPsY8JnaSKNI5lwA1VzvKxF18o7RghoAx5BX3ZqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:50:54.581199Z"},"content_sha256":"53282df8062697f7074dba920eae23269685259893ed34c51eda952ca6947fde","schema_version":"1.0","event_id":"sha256:53282df8062697f7074dba920eae23269685259893ed34c51eda952ca6947fde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GHKNJ3DSDWJACSZ5FHBOXKLBTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Filter Pruning for Efficient Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cenk Baykal, Dan Feldman, Daniela Rus, Harry Lang, Lucas Liebenwein","submitted_at":"2019-11-18T03:56:49Z","abstract_excerpt":"We present a provable, sampling-based approach for generating compact Convolutional Neural Networks (CNNs) by identifying and removing redundant filters from an over-parameterized network. Our algorithm uses a small batch of input data points to assign a saliency score to each filter and constructs an importance sampling distribution where filters that highly affect the output are sampled with correspondingly high probability. In contrast to existing filter pruning approaches, our method is simultaneously data-informed, exhibits provable guarantees on the size and performance of the pruned net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07412","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/1911.07412/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-05T00:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GuawLj9M4Cm5XyQw64hnJEzS3njk0JOViUJsPvQ1lSyTDyQt1QiaG5Lmr1BvPFFlzKrGYndGZpSqO8EUBDP/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:50:54.581713Z"},"content_sha256":"796a8887a30269d901930d73036d92bbd32de40bb6462b798203500063536e7a","schema_version":"1.0","event_id":"sha256:796a8887a30269d901930d73036d92bbd32de40bb6462b798203500063536e7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHKNJ3DSDWJACSZ5FHBOXKLBTF/bundle.json","state_url":"https://pith.science/pith/GHKNJ3DSDWJACSZ5FHBOXKLBTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHKNJ3DSDWJACSZ5FHBOXKLBTF/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-05T20:50:54Z","links":{"resolver":"https://pith.science/pith/GHKNJ3DSDWJACSZ5FHBOXKLBTF","bundle":"https://pith.science/pith/GHKNJ3DSDWJACSZ5FHBOXKLBTF/bundle.json","state":"https://pith.science/pith/GHKNJ3DSDWJACSZ5FHBOXKLBTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHKNJ3DSDWJACSZ5FHBOXKLBTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GHKNJ3DSDWJACSZ5FHBOXKLBTF","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":"9f86c34fb1f2b1a2bc59aa07051b51611098df1edcadd7705c0322cdde0ca930","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-18T03:56:49Z","title_canon_sha256":"ad618c1557d9f2430e140502337f0b7fcda5460856fa431bc8de11a68235bf8c"},"schema_version":"1.0","source":{"id":"1911.07412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07412","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07412v2","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07412","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"GHKNJ3DSDWJA","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"pith_short_16","alias_value":"GHKNJ3DSDWJACSZ5","created_at":"2026-07-05T00:49:39Z"},{"alias_kind":"pith_short_8","alias_value":"GHKNJ3DS","created_at":"2026-07-05T00:49:39Z"}],"graph_snapshots":[{"event_id":"sha256:796a8887a30269d901930d73036d92bbd32de40bb6462b798203500063536e7a","target":"graph","created_at":"2026-07-05T00:49:39Z","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/1911.07412/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a provable, sampling-based approach for generating compact Convolutional Neural Networks (CNNs) by identifying and removing redundant filters from an over-parameterized network. Our algorithm uses a small batch of input data points to assign a saliency score to each filter and constructs an importance sampling distribution where filters that highly affect the output are sampled with correspondingly high probability. In contrast to existing filter pruning approaches, our method is simultaneously data-informed, exhibits provable guarantees on the size and performance of the pruned net","authors_text":"Cenk Baykal, Dan Feldman, Daniela Rus, Harry Lang, Lucas Liebenwein","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-18T03:56:49Z","title":"Provable Filter Pruning for Efficient Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07412","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:53282df8062697f7074dba920eae23269685259893ed34c51eda952ca6947fde","target":"record","created_at":"2026-07-05T00:49:39Z","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":"9f86c34fb1f2b1a2bc59aa07051b51611098df1edcadd7705c0322cdde0ca930","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-18T03:56:49Z","title_canon_sha256":"ad618c1557d9f2430e140502337f0b7fcda5460856fa431bc8de11a68235bf8c"},"schema_version":"1.0","source":{"id":"1911.07412","kind":"arxiv","version":2}},"canonical_sha256":"31d4d4ec721d92014b3d29c2eba961994ed98fc8d816a85f3fe23327ef2c4d25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31d4d4ec721d92014b3d29c2eba961994ed98fc8d816a85f3fe23327ef2c4d25","first_computed_at":"2026-07-05T00:49:39.774725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:39.774725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9IDjxPH6FwUtQKeaP3QXi417RH30l2Yfwl2TE5YviKNvojrLpNs3g+o0U4FUZ2DQ7PtfBQUY88Xc5yM/7hOQDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:39.775207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.07412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53282df8062697f7074dba920eae23269685259893ed34c51eda952ca6947fde","sha256:796a8887a30269d901930d73036d92bbd32de40bb6462b798203500063536e7a"],"state_sha256":"e025463e04537192de556935549ee9f1a0bbc9561d2f7e6101edddd95279758f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDJBBO9K7FcgrT73rnptQ+5FyqlB1iUEFLceegeeuqsnqm5i2WsjYboBU/Lb3ySfhdukyqq8mGdVF1u21sw7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T20:50:54.586979Z","bundle_sha256":"eb58a16a9ce0b92984dda7c2e66e70f94da00508a937b7dc542b9d5275bdb5b4"}}