{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WU26WTKTHUKPBHH2YQ6NJL2AXG","short_pith_number":"pith:WU26WTKT","canonical_record":{"source":{"id":"1801.10447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T13:40:47Z","cross_cats_sorted":[],"title_canon_sha256":"2b5f45fe457b2418e6a288f985f1b45d8c8e22d783c56c8eb6637ce1aaf4c097","abstract_canon_sha256":"ed56d11e9caf5484811e67c478451bd68f64a6d205be0ebd63f8f6b38efbcbef"},"schema_version":"1.0"},"canonical_sha256":"b535eb4d533d14f09cfac43cd4af40b99f0e880a76a1f789c9974b0f3aa47d8c","source":{"kind":"arxiv","id":"1801.10447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10447","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10447v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10447","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"WU26WTKTHUKP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WU26WTKTHUKPBHH2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WU26WTKT","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WU26WTKTHUKPBHH2YQ6NJL2AXG","target":"record","payload":{"canonical_record":{"source":{"id":"1801.10447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T13:40:47Z","cross_cats_sorted":[],"title_canon_sha256":"2b5f45fe457b2418e6a288f985f1b45d8c8e22d783c56c8eb6637ce1aaf4c097","abstract_canon_sha256":"ed56d11e9caf5484811e67c478451bd68f64a6d205be0ebd63f8f6b38efbcbef"},"schema_version":"1.0"},"canonical_sha256":"b535eb4d533d14f09cfac43cd4af40b99f0e880a76a1f789c9974b0f3aa47d8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:40.789602Z","signature_b64":"3vxEiJqiDDVLed7dcDOLg88v8lW2l1wdLXDpsUoQG1ZusO6rOGt75hHwBYYMdhQuRK/Jkrp1ThYAZ1sNsZq0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b535eb4d533d14f09cfac43cd4af40b99f0e880a76a1f789c9974b0f3aa47d8c","last_reissued_at":"2026-05-18T00:24:40.788904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:40.788904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.10447","source_version":1,"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-05-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdUUYg0Lknc9tWkfS3gSWXNehzhnC46NNWkGRvHGemjJetobukd/dHUBavCcRkjigl6AnXOlx1VP897c+f4vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:14:43.549767Z"},"content_sha256":"913e73533def2f08f57246697c9287181cd62d651b3a3677e4976846bf6d3a39","schema_version":"1.0","event_id":"sha256:913e73533def2f08f57246697c9287181cd62d651b3a3677e4976846bf6d3a39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WU26WTKTHUKPBHH2YQ6NJL2AXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recovering from Random Pruning: On the Plasticity of Deep Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Balaraman Ravindran, Deepak Mittal, Mitesh M. Khapra, Shweta Bhardwaj","submitted_at":"2018-01-31T13:40:47Z","abstract_excerpt":"Recently there has been a lot of work on pruning filters from deep convolutional neural networks (CNNs) with the intention of reducing computations. The key idea is to rank the filters based on a certain criterion (say, $l_1$-norm, average percentage of zeros, etc) and retain only the top ranked filters. Once the low scoring filters are pruned away the remainder of the network is fine tuned and is shown to give performance comparable to the original unpruned network. In this work, we report experiments which suggest that the comparable performance of the pruned network is not due to the specif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10447","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xLCJVJcZmAQqbaaevUzWUX8xiLa8/OzViW74cUPESGGIOtDs8LJNcP4F6bXD7YuQLpZwto3UFjkI5sKleuOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:14:43.550300Z"},"content_sha256":"835d8f379aef6db80e9f0516d7ee6250f6be5576e1571f51f6f8509c8060cbe7","schema_version":"1.0","event_id":"sha256:835d8f379aef6db80e9f0516d7ee6250f6be5576e1571f51f6f8509c8060cbe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WU26WTKTHUKPBHH2YQ6NJL2AXG/bundle.json","state_url":"https://pith.science/pith/WU26WTKTHUKPBHH2YQ6NJL2AXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WU26WTKTHUKPBHH2YQ6NJL2AXG/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-05-18T19:14:43Z","links":{"resolver":"https://pith.science/pith/WU26WTKTHUKPBHH2YQ6NJL2AXG","bundle":"https://pith.science/pith/WU26WTKTHUKPBHH2YQ6NJL2AXG/bundle.json","state":"https://pith.science/pith/WU26WTKTHUKPBHH2YQ6NJL2AXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WU26WTKTHUKPBHH2YQ6NJL2AXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WU26WTKTHUKPBHH2YQ6NJL2AXG","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":"ed56d11e9caf5484811e67c478451bd68f64a6d205be0ebd63f8f6b38efbcbef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T13:40:47Z","title_canon_sha256":"2b5f45fe457b2418e6a288f985f1b45d8c8e22d783c56c8eb6637ce1aaf4c097"},"schema_version":"1.0","source":{"id":"1801.10447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10447","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10447v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10447","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"WU26WTKTHUKP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WU26WTKTHUKPBHH2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WU26WTKT","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:835d8f379aef6db80e9f0516d7ee6250f6be5576e1571f51f6f8509c8060cbe7","target":"graph","created_at":"2026-05-18T00:24:40Z","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"},"paper":{"abstract_excerpt":"Recently there has been a lot of work on pruning filters from deep convolutional neural networks (CNNs) with the intention of reducing computations. The key idea is to rank the filters based on a certain criterion (say, $l_1$-norm, average percentage of zeros, etc) and retain only the top ranked filters. Once the low scoring filters are pruned away the remainder of the network is fine tuned and is shown to give performance comparable to the original unpruned network. In this work, we report experiments which suggest that the comparable performance of the pruned network is not due to the specif","authors_text":"Balaraman Ravindran, Deepak Mittal, Mitesh M. Khapra, Shweta Bhardwaj","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T13:40:47Z","title":"Recovering from Random Pruning: On the Plasticity of Deep Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10447","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:913e73533def2f08f57246697c9287181cd62d651b3a3677e4976846bf6d3a39","target":"record","created_at":"2026-05-18T00:24:40Z","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":"ed56d11e9caf5484811e67c478451bd68f64a6d205be0ebd63f8f6b38efbcbef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T13:40:47Z","title_canon_sha256":"2b5f45fe457b2418e6a288f985f1b45d8c8e22d783c56c8eb6637ce1aaf4c097"},"schema_version":"1.0","source":{"id":"1801.10447","kind":"arxiv","version":1}},"canonical_sha256":"b535eb4d533d14f09cfac43cd4af40b99f0e880a76a1f789c9974b0f3aa47d8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b535eb4d533d14f09cfac43cd4af40b99f0e880a76a1f789c9974b0f3aa47d8c","first_computed_at":"2026-05-18T00:24:40.788904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:40.788904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3vxEiJqiDDVLed7dcDOLg88v8lW2l1wdLXDpsUoQG1ZusO6rOGt75hHwBYYMdhQuRK/Jkrp1ThYAZ1sNsZq0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:40.789602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:913e73533def2f08f57246697c9287181cd62d651b3a3677e4976846bf6d3a39","sha256:835d8f379aef6db80e9f0516d7ee6250f6be5576e1571f51f6f8509c8060cbe7"],"state_sha256":"33c6791cfcd9a3e97d0a10bc60e7f131e498715cc276e996e336eb2d9b1fca29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMaxtJ4mfPSJjT/lELjnSKW6orFcaPWmKVfZBeTWP+RtWcbh83tiYSEhSNUXQxtk3iU3g6l2xR3Hd7Tgr6IyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T19:14:43.551985Z","bundle_sha256":"f3ca8d5f929dc0a7c0f8c35119d2ed03f3994e34fe0791d472938d67ac7c0b6f"}}