{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OCR6STEUBPTLN5IGFRESFYAA2I","short_pith_number":"pith:OCR6STEU","schema_version":"1.0","canonical_sha256":"70a3e94c940be6b6f5062c4922e000d22e4d0108bcf6282539af11f2b6386273","source":{"kind":"arxiv","id":"1905.04446","version":1},"attestation_state":"computed","paper":{"title":"Play and Prune: Adaptive Filter Pruning for Deep Model Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Piyush Rai, Pravendra Singh, Vinay Kumar Verma, Vinay P. Namboodiri","submitted_at":"2019-05-11T04:37:10Z","abstract_excerpt":"While convolutional neural networks (CNN) have achieved impressive performance on various classification/recognition tasks, they typically consist of a massive number of parameters. This results in significant memory requirement as well as computational overheads. Consequently, there is a growing need for filter-level pruning approaches for compressing CNN based models that not only reduce the total number of parameters but reduce the overall computation as well. We present a new min-max framework for filter-level pruning of CNNs. Our framework, called Play and Prune (PP), jointly prunes and f"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.04446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-11T04:37:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d2ca6888afdbc01a1015c199fa8cd9bf84efbc8c18cc7f462ba5c4130faf05c3","abstract_canon_sha256":"4c4c8f42a68278a95552a8c597c6635aaa69ef8a61f5563fcf78bfaefce3487b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.827555Z","signature_b64":"xTRmbYSFn1DkhFsprUqIFetUaXufT1C3hpZoQLKDpJHWIdjWB+8SgFx2haHSypSVZTxMCnS6B4qVPTfbjmRTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70a3e94c940be6b6f5062c4922e000d22e4d0108bcf6282539af11f2b6386273","last_reissued_at":"2026-05-17T23:46:24.826922Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.826922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Play and Prune: Adaptive Filter Pruning for Deep Model Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Piyush Rai, Pravendra Singh, Vinay Kumar Verma, Vinay P. Namboodiri","submitted_at":"2019-05-11T04:37:10Z","abstract_excerpt":"While convolutional neural networks (CNN) have achieved impressive performance on various classification/recognition tasks, they typically consist of a massive number of parameters. This results in significant memory requirement as well as computational overheads. Consequently, there is a growing need for filter-level pruning approaches for compressing CNN based models that not only reduce the total number of parameters but reduce the overall computation as well. We present a new min-max framework for filter-level pruning of CNNs. Our framework, called Play and Prune (PP), jointly prunes and f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04446","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.04446","created_at":"2026-05-17T23:46:24.827011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04446v1","created_at":"2026-05-17T23:46:24.827011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04446","created_at":"2026-05-17T23:46:24.827011+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCR6STEUBPTL","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCR6STEUBPTLN5IG","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCR6STEU","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17469","citing_title":"Efficient compression of neural networks and datasets","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I","json":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I.json","graph_json":"https://pith.science/api/pith-number/OCR6STEUBPTLN5IGFRESFYAA2I/graph.json","events_json":"https://pith.science/api/pith-number/OCR6STEUBPTLN5IGFRESFYAA2I/events.json","paper":"https://pith.science/paper/OCR6STEU"},"agent_actions":{"view_html":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I","download_json":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I.json","view_paper":"https://pith.science/paper/OCR6STEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04446&json=true","fetch_graph":"https://pith.science/api/pith-number/OCR6STEUBPTLN5IGFRESFYAA2I/graph.json","fetch_events":"https://pith.science/api/pith-number/OCR6STEUBPTLN5IGFRESFYAA2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I/action/storage_attestation","attest_author":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I/action/author_attestation","sign_citation":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I/action/citation_signature","submit_replication":"https://pith.science/pith/OCR6STEUBPTLN5IGFRESFYAA2I/action/replication_record"}},"created_at":"2026-05-17T23:46:24.827011+00:00","updated_at":"2026-05-17T23:46:24.827011+00:00"}