{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RDPYICXJESU2SS5LIMYO4YEP2M","short_pith_number":"pith:RDPYICXJ","schema_version":"1.0","canonical_sha256":"88df840ae924a9a94bab4330ee608fd335fb10c76174320417ca9234160666c4","source":{"kind":"arxiv","id":"1412.1442","version":1},"attestation_state":"computed","paper":{"title":"Memory Bounded Deep Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Maxwell D. Collins, Pushmeet Kohli","submitted_at":"2014-12-03T19:08:38Z","abstract_excerpt":"In this work, we investigate the use of sparsity-inducing regularizers during training of Convolution Neural Networks (CNNs). These regularizers encourage that fewer connections in the convolution and fully connected layers take non-zero values and in effect result in sparse connectivity between hidden units in the deep network. This in turn reduces the memory and runtime cost involved in deploying the learned CNNs. We show that training with such regularization can still be performed using stochastic gradient descent implying that it can be used easily in existing codebases. Experimental eval"},"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":"1412.1442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-03T19:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"39ba3770d6eb5156b8496afb2fdabc152a3f6d6c41053dd1bb636d7acbc87c78","abstract_canon_sha256":"66b7e2e7290f0416f4b5d0a5cfe2d6aa77fdb7c59f754657d84b6b0c5afb1a20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:12.475510Z","signature_b64":"3Inmx9qccsaCycM0Mfr58mfzPuQuLqvgi5q6thHS7YmkwkGHTdCxmXO2drP0QU1KTYJ8kypmGwQiqnWiTDZKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88df840ae924a9a94bab4330ee608fd335fb10c76174320417ca9234160666c4","last_reissued_at":"2026-05-18T02:32:12.475021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:12.475021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory Bounded Deep Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Maxwell D. Collins, Pushmeet Kohli","submitted_at":"2014-12-03T19:08:38Z","abstract_excerpt":"In this work, we investigate the use of sparsity-inducing regularizers during training of Convolution Neural Networks (CNNs). These regularizers encourage that fewer connections in the convolution and fully connected layers take non-zero values and in effect result in sparse connectivity between hidden units in the deep network. This in turn reduces the memory and runtime cost involved in deploying the learned CNNs. We show that training with such regularization can still be performed using stochastic gradient descent implying that it can be used easily in existing codebases. Experimental eval"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1442","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":"1412.1442","created_at":"2026-05-18T02:32:12.475091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1442v1","created_at":"2026-05-18T02:32:12.475091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1442","created_at":"2026-05-18T02:32:12.475091+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDPYICXJESU2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDPYICXJESU2SS5L","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDPYICXJ","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1510.00149","citing_title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M","json":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M.json","graph_json":"https://pith.science/api/pith-number/RDPYICXJESU2SS5LIMYO4YEP2M/graph.json","events_json":"https://pith.science/api/pith-number/RDPYICXJESU2SS5LIMYO4YEP2M/events.json","paper":"https://pith.science/paper/RDPYICXJ"},"agent_actions":{"view_html":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M","download_json":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M.json","view_paper":"https://pith.science/paper/RDPYICXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1442&json=true","fetch_graph":"https://pith.science/api/pith-number/RDPYICXJESU2SS5LIMYO4YEP2M/graph.json","fetch_events":"https://pith.science/api/pith-number/RDPYICXJESU2SS5LIMYO4YEP2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M/action/storage_attestation","attest_author":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M/action/author_attestation","sign_citation":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M/action/citation_signature","submit_replication":"https://pith.science/pith/RDPYICXJESU2SS5LIMYO4YEP2M/action/replication_record"}},"created_at":"2026-05-18T02:32:12.475091+00:00","updated_at":"2026-05-18T02:32:12.475091+00:00"}