{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3QXCTSQWIB6KNUHBD6LEQY4PWL","short_pith_number":"pith:3QXCTSQW","canonical_record":{"source":{"id":"1812.10240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T06:26:06Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"bf85f70645d6105c33f07bead510fec52a42e081bc38b1d642d39d7046192b83","abstract_canon_sha256":"99c9366d639139c206a4d48429e9620f476e461f3abb94f31cac54ac626fc5a0"},"schema_version":"1.0"},"canonical_sha256":"dc2e29ca16407ca6d0e11f9648638fb2ef3e6a5a59b4bde8707dd28774762ec8","source":{"kind":"arxiv","id":"1812.10240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10240","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10240v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10240","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"3QXCTSQWIB6K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QXCTSQWIB6KNUHB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QXCTSQW","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3QXCTSQWIB6KNUHBD6LEQY4PWL","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T06:26:06Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"bf85f70645d6105c33f07bead510fec52a42e081bc38b1d642d39d7046192b83","abstract_canon_sha256":"99c9366d639139c206a4d48429e9620f476e461f3abb94f31cac54ac626fc5a0"},"schema_version":"1.0"},"canonical_sha256":"dc2e29ca16407ca6d0e11f9648638fb2ef3e6a5a59b4bde8707dd28774762ec8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:24.700813Z","signature_b64":"2WHXi9m8WLFOTv7ssEGDlBeSIxTHd5goA0xvQE26HC6encVdsuMPlDrHZ/++xl6BmtkpYqnxLyuHTuDRU6x8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc2e29ca16407ca6d0e11f9648638fb2ef3e6a5a59b4bde8707dd28774762ec8","last_reissued_at":"2026-05-17T23:57:24.700285Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:24.700285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10240","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-17T23:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4di40oxVp4pXfgVc3+/UUjhTePIhcqFyK/MRDEzK0NBZvUzHrEVwMKeWMhHrBuuNfVUYjY5FEW7npSejq2kDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:21:42.790158Z"},"content_sha256":"b4a8904005cc3870b89940d8f6f028dc1ac967bd3e28404937e65ef2b9ffcec7","schema_version":"1.0","event_id":"sha256:b4a8904005cc3870b89940d8f6f028dc1ac967bd3e28404937e65ef2b9ffcec7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3QXCTSQWIB6KNUHBD6LEQY4PWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Studying the Plasticity in Deep Convolutional Neural Networks using Random Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Balaraman Ravindran, Deepak Mittal, Mitesh M. Khapra, Shweta Bhardwaj","submitted_at":"2018-12-26T06:26:06Z","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, l1-norm) 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 specific criterion chosen but due to the inh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10240","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-17T23:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MRAYlV2hL58xcz/qng42B8sg3Mjuayy/FmgHRr1QM50EJSjLcwrWr+NXSFLF+Qn8xKywVip/3kk9tbAj5vmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:21:42.790762Z"},"content_sha256":"902d4aa3da72679ee99e9f8562144399626cfcaab3dc6ca3aa56a1f5330c1558","schema_version":"1.0","event_id":"sha256:902d4aa3da72679ee99e9f8562144399626cfcaab3dc6ca3aa56a1f5330c1558"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QXCTSQWIB6KNUHBD6LEQY4PWL/bundle.json","state_url":"https://pith.science/pith/3QXCTSQWIB6KNUHBD6LEQY4PWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QXCTSQWIB6KNUHBD6LEQY4PWL/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-25T21:21:42Z","links":{"resolver":"https://pith.science/pith/3QXCTSQWIB6KNUHBD6LEQY4PWL","bundle":"https://pith.science/pith/3QXCTSQWIB6KNUHBD6LEQY4PWL/bundle.json","state":"https://pith.science/pith/3QXCTSQWIB6KNUHBD6LEQY4PWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QXCTSQWIB6KNUHBD6LEQY4PWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3QXCTSQWIB6KNUHBD6LEQY4PWL","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":"99c9366d639139c206a4d48429e9620f476e461f3abb94f31cac54ac626fc5a0","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T06:26:06Z","title_canon_sha256":"bf85f70645d6105c33f07bead510fec52a42e081bc38b1d642d39d7046192b83"},"schema_version":"1.0","source":{"id":"1812.10240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10240","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10240v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10240","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"3QXCTSQWIB6K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QXCTSQWIB6KNUHB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QXCTSQW","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:902d4aa3da72679ee99e9f8562144399626cfcaab3dc6ca3aa56a1f5330c1558","target":"graph","created_at":"2026-05-17T23:57: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"},"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, l1-norm) 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 specific criterion chosen but due to the inh","authors_text":"Balaraman Ravindran, Deepak Mittal, Mitesh M. Khapra, Shweta Bhardwaj","cross_cats":["cs.CV","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T06:26:06Z","title":"Studying the Plasticity in Deep Convolutional Neural Networks using Random Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10240","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:b4a8904005cc3870b89940d8f6f028dc1ac967bd3e28404937e65ef2b9ffcec7","target":"record","created_at":"2026-05-17T23:57: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":"99c9366d639139c206a4d48429e9620f476e461f3abb94f31cac54ac626fc5a0","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T06:26:06Z","title_canon_sha256":"bf85f70645d6105c33f07bead510fec52a42e081bc38b1d642d39d7046192b83"},"schema_version":"1.0","source":{"id":"1812.10240","kind":"arxiv","version":1}},"canonical_sha256":"dc2e29ca16407ca6d0e11f9648638fb2ef3e6a5a59b4bde8707dd28774762ec8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc2e29ca16407ca6d0e11f9648638fb2ef3e6a5a59b4bde8707dd28774762ec8","first_computed_at":"2026-05-17T23:57:24.700285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:24.700285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2WHXi9m8WLFOTv7ssEGDlBeSIxTHd5goA0xvQE26HC6encVdsuMPlDrHZ/++xl6BmtkpYqnxLyuHTuDRU6x8Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:24.700813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4a8904005cc3870b89940d8f6f028dc1ac967bd3e28404937e65ef2b9ffcec7","sha256:902d4aa3da72679ee99e9f8562144399626cfcaab3dc6ca3aa56a1f5330c1558"],"state_sha256":"30b014f4ad38c681884383758066e918cef03e5809ff978c03630d951635aa25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqyVdoGDGKt9k/BfkcwKm0b1WwEx/m/5dBU8bwwPPtcrup/Y1yvB5D0ab7CEwRCi2/uE0rjuZYcpIjHKwHQaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:21:42.794085Z","bundle_sha256":"bf23276ec22752f660937f80d7de017453fab96bdfea5d36959eff6ef6a5bd57"}}