{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4OZOFCQ6LISQR3KEJ5KJJUVF2P","short_pith_number":"pith:4OZOFCQ6","schema_version":"1.0","canonical_sha256":"e3b2e28a1e5a2508ed444f5494d2a5d3c8ec1466f7c5553265705d01980044d0","source":{"kind":"arxiv","id":"1810.00440","version":1},"attestation_state":"computed","paper":{"title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jos\\'e Miguel Hern\\'andez-Lobato, Marton Havasi, Robert Peharz","submitted_at":"2018-09-30T18:27:30Z","abstract_excerpt":"While deep neural networks are a highly successful model class, their large memory footprint puts considerable strain on energy consumption, communication bandwidth, and storage requirements. Consequently, model size reduction has become an utmost goal in deep learning. A typical approach is to train a set of deterministic weights, while applying certain techniques such as pruning and quantization, in order that the empirical weight distribution becomes amenable to Shannon-style coding schemes. However, as shown in this paper, relaxing weight determinism and using a full variational distributi"},"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":"1810.00440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-30T18:27:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"01aac792f8a18d9762eb5bdbbbc4c41b977bcae8ce467229656ffeb232ab9691","abstract_canon_sha256":"3bc1785a1c159b4e926f45da0eed6cc62671b6c50a1157db79c5afa2bd337c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:27.872959Z","signature_b64":"HzhoCCTJZZZYVoSxkvvxv1UrYtILg6Bg7X3OaH/DqgZI/kV+MyZsieHzV8uOfLQZcewmssl9l82IV2BlGO52BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b2e28a1e5a2508ed444f5494d2a5d3c8ec1466f7c5553265705d01980044d0","last_reissued_at":"2026-05-18T00:04:27.872515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:27.872515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jos\\'e Miguel Hern\\'andez-Lobato, Marton Havasi, Robert Peharz","submitted_at":"2018-09-30T18:27:30Z","abstract_excerpt":"While deep neural networks are a highly successful model class, their large memory footprint puts considerable strain on energy consumption, communication bandwidth, and storage requirements. Consequently, model size reduction has become an utmost goal in deep learning. A typical approach is to train a set of deterministic weights, while applying certain techniques such as pruning and quantization, in order that the empirical weight distribution becomes amenable to Shannon-style coding schemes. However, as shown in this paper, relaxing weight determinism and using a full variational distributi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00440","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":"1810.00440","created_at":"2026-05-18T00:04:27.872576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00440v1","created_at":"2026-05-18T00:04:27.872576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00440","created_at":"2026-05-18T00:04:27.872576+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OZOFCQ6LISQ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OZOFCQ6LISQR3KE","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OZOFCQ6","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10935","citing_title":"Progressive Compression with Universally Quantized Diffusion Models","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P","json":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P.json","graph_json":"https://pith.science/api/pith-number/4OZOFCQ6LISQR3KEJ5KJJUVF2P/graph.json","events_json":"https://pith.science/api/pith-number/4OZOFCQ6LISQR3KEJ5KJJUVF2P/events.json","paper":"https://pith.science/paper/4OZOFCQ6"},"agent_actions":{"view_html":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P","download_json":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P.json","view_paper":"https://pith.science/paper/4OZOFCQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00440&json=true","fetch_graph":"https://pith.science/api/pith-number/4OZOFCQ6LISQR3KEJ5KJJUVF2P/graph.json","fetch_events":"https://pith.science/api/pith-number/4OZOFCQ6LISQR3KEJ5KJJUVF2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P/action/storage_attestation","attest_author":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P/action/author_attestation","sign_citation":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P/action/citation_signature","submit_replication":"https://pith.science/pith/4OZOFCQ6LISQR3KEJ5KJJUVF2P/action/replication_record"}},"created_at":"2026-05-18T00:04:27.872576+00:00","updated_at":"2026-05-18T00:04:27.872576+00:00"}