{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P4OP2HGTIZ4QKN6B2DA3PQKZQH","short_pith_number":"pith:P4OP2HGT","schema_version":"1.0","canonical_sha256":"7f1cfd1cd346790537c1d0c1b7c15981d962948c92cc962ba3d8cb0b945e12dd","source":{"kind":"arxiv","id":"1806.05355","version":1},"attestation_state":"computed","paper":{"title":"Scalable Neural Network Compression and Pruning Using Hard Clustering and L1 Regularization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Nicholas Ruozzi, Vibhav Gogate, Yibo Yang","submitted_at":"2018-06-14T03:59:37Z","abstract_excerpt":"We propose a simple and easy to implement neural network compression algorithm that achieves results competitive with more complicated state-of-the-art methods. The key idea is to modify the original optimization problem by adding K independent Gaussian priors (corresponding to the k-means objective) over the network parameters to achieve parameter quantization, as well as an L1 penalty to achieve pruning. Unlike many existing quantization-based methods, our method uses hard clustering assignments of network parameters, which adds minimal change or overhead to standard network training. We als"},"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":"1806.05355","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2018-06-14T03:59:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"885bc6d58f91c928b936fae4dce8db17d2f5d8c9cdd0319b8e861b3efc6aacdc","abstract_canon_sha256":"f1acf250f82796e7fcd0db4b148012101d0bc01bed6b891db7cf59e799fba48f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:16.248914Z","signature_b64":"LQhJk1JMXJtKtOo3sVmTkddB8xhQc3jJuayfx1siTyOwN6dNVveeT2zadIa+RT2X6EbkkvnbvryLkVUyNMl8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f1cfd1cd346790537c1d0c1b7c15981d962948c92cc962ba3d8cb0b945e12dd","last_reissued_at":"2026-05-18T00:13:16.248255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:16.248255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Neural Network Compression and Pruning Using Hard Clustering and L1 Regularization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Nicholas Ruozzi, Vibhav Gogate, Yibo Yang","submitted_at":"2018-06-14T03:59:37Z","abstract_excerpt":"We propose a simple and easy to implement neural network compression algorithm that achieves results competitive with more complicated state-of-the-art methods. The key idea is to modify the original optimization problem by adding K independent Gaussian priors (corresponding to the k-means objective) over the network parameters to achieve parameter quantization, as well as an L1 penalty to achieve pruning. Unlike many existing quantization-based methods, our method uses hard clustering assignments of network parameters, which adds minimal change or overhead to standard network training. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05355","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":"1806.05355","created_at":"2026-05-18T00:13:16.248347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05355v1","created_at":"2026-05-18T00:13:16.248347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05355","created_at":"2026-05-18T00:13:16.248347+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4OP2HGTIZ4Q","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4OP2HGTIZ4QKN6B","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4OP2HGT","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH","json":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH.json","graph_json":"https://pith.science/api/pith-number/P4OP2HGTIZ4QKN6B2DA3PQKZQH/graph.json","events_json":"https://pith.science/api/pith-number/P4OP2HGTIZ4QKN6B2DA3PQKZQH/events.json","paper":"https://pith.science/paper/P4OP2HGT"},"agent_actions":{"view_html":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH","download_json":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH.json","view_paper":"https://pith.science/paper/P4OP2HGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05355&json=true","fetch_graph":"https://pith.science/api/pith-number/P4OP2HGTIZ4QKN6B2DA3PQKZQH/graph.json","fetch_events":"https://pith.science/api/pith-number/P4OP2HGTIZ4QKN6B2DA3PQKZQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH/action/storage_attestation","attest_author":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH/action/author_attestation","sign_citation":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH/action/citation_signature","submit_replication":"https://pith.science/pith/P4OP2HGTIZ4QKN6B2DA3PQKZQH/action/replication_record"}},"created_at":"2026-05-18T00:13:16.248347+00:00","updated_at":"2026-05-18T00:13:16.248347+00:00"}