{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Q45OONEG6EWOEYQHIGYFB7MAHN","short_pith_number":"pith:Q45OONEG","schema_version":"1.0","canonical_sha256":"873ae73486f12ce2620741b050fd803b4b475b38940162f59645d846eab3e5e6","source":{"kind":"arxiv","id":"1906.06624","version":3},"attestation_state":"computed","paper":{"title":"Scalable Model Compression by Entropy Penalized Reparameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhinav Shrivastava, Deniz Oktay, Johannes Ball\\'e, Saurabh Singh","submitted_at":"2019-06-15T22:46:33Z","abstract_excerpt":"We describe a simple and general neural network weight compression approach, in which the network parameters (weights and biases) are represented in a \"latent\" space, amounting to a reparameterization. This space is equipped with a learned probability model, which is used to impose an entropy penalty on the parameter representation during training, and to compress the representation using a simple arithmetic coder after training. Classification accuracy and model compressibility is maximized jointly, with the bitrate--accuracy trade-off specified by a hyperparameter. We evaluate the method on "},"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":"1906.06624","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-15T22:46:33Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"14001fa8d935b061f41d8b3dbbdb3c99079f0e7a8dadb145443e6d4cdced1511","abstract_canon_sha256":"be80b88e997bf4ca2d072d40462a650dfe8d32731dc03a76a6008a6603515973"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:56.281938Z","signature_b64":"FMIhbARnPj8J1yDQO356pjZapxnob2dIl5zyy2IsIRR20T3iJOdjNncZct/L1iaahizasXorzb/Kb872ygRrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"873ae73486f12ce2620741b050fd803b4b475b38940162f59645d846eab3e5e6","last_reissued_at":"2026-07-05T00:40:56.281457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:56.281457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Model Compression by Entropy Penalized Reparameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhinav Shrivastava, Deniz Oktay, Johannes Ball\\'e, Saurabh Singh","submitted_at":"2019-06-15T22:46:33Z","abstract_excerpt":"We describe a simple and general neural network weight compression approach, in which the network parameters (weights and biases) are represented in a \"latent\" space, amounting to a reparameterization. This space is equipped with a learned probability model, which is used to impose an entropy penalty on the parameter representation during training, and to compress the representation using a simple arithmetic coder after training. Classification accuracy and model compressibility is maximized jointly, with the bitrate--accuracy trade-off specified by a hyperparameter. We evaluate the method on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06624","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.06624/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1906.06624","created_at":"2026-07-05T00:40:56.281515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06624v3","created_at":"2026-07-05T00:40:56.281515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06624","created_at":"2026-07-05T00:40:56.281515+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q45OONEG6EWO","created_at":"2026-07-05T00:40:56.281515+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q45OONEG6EWOEYQH","created_at":"2026-07-05T00:40:56.281515+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q45OONEG","created_at":"2026-07-05T00:40:56.281515+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/Q45OONEG6EWOEYQHIGYFB7MAHN","json":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN.json","graph_json":"https://pith.science/api/pith-number/Q45OONEG6EWOEYQHIGYFB7MAHN/graph.json","events_json":"https://pith.science/api/pith-number/Q45OONEG6EWOEYQHIGYFB7MAHN/events.json","paper":"https://pith.science/paper/Q45OONEG"},"agent_actions":{"view_html":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN","download_json":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN.json","view_paper":"https://pith.science/paper/Q45OONEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06624&json=true","fetch_graph":"https://pith.science/api/pith-number/Q45OONEG6EWOEYQHIGYFB7MAHN/graph.json","fetch_events":"https://pith.science/api/pith-number/Q45OONEG6EWOEYQHIGYFB7MAHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN/action/storage_attestation","attest_author":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN/action/author_attestation","sign_citation":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN/action/citation_signature","submit_replication":"https://pith.science/pith/Q45OONEG6EWOEYQHIGYFB7MAHN/action/replication_record"}},"created_at":"2026-07-05T00:40:56.281515+00:00","updated_at":"2026-07-05T00:40:56.281515+00:00"}