{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B4CNZMLS32VHATHMH4RLRAWLDA","short_pith_number":"pith:B4CNZMLS","canonical_record":{"source":{"id":"1802.03646","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T19:43:42Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"a5abf6386631ad1ff9c4fa2f70aa40dbeb2c127ade6c2ee20b580fa80c984da4","abstract_canon_sha256":"5d49117226c65c9e224d62810c677ea835819e0aaab0871cff9a9a5cc07609e6"},"schema_version":"1.0"},"canonical_sha256":"0f04dcb172deaa704cec3f22b882cb182d08805c94bd2c5d13fcae6faab0aa24","source":{"kind":"arxiv","id":"1802.03646","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03646","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03646v4","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03646","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"B4CNZMLS32VH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B4CNZMLS32VHATHM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B4CNZMLS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B4CNZMLS32VHATHMH4RLRAWLDA","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03646","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T19:43:42Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"a5abf6386631ad1ff9c4fa2f70aa40dbeb2c127ade6c2ee20b580fa80c984da4","abstract_canon_sha256":"5d49117226c65c9e224d62810c677ea835819e0aaab0871cff9a9a5cc07609e6"},"schema_version":"1.0"},"canonical_sha256":"0f04dcb172deaa704cec3f22b882cb182d08805c94bd2c5d13fcae6faab0aa24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.007235Z","signature_b64":"EJUdpkxot72wXAhEslixrFWURERYHEll2R5mo6lQJNlT+b1LjGvCpvIc53Y+q3O3/T39zmMEvddrLzqHYPgOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f04dcb172deaa704cec3f22b882cb182d08805c94bd2c5d13fcae6faab0aa24","last_reissued_at":"2026-05-17T23:56:30.006852Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.006852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03646","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCoNICI4W4aWLpbjuSmsRwtXbmZ+y/o83JihTKCqx9xYWHAvpDLKSJ/O+o5XVd9PPlAz36U2r/U66NGbHbrpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:17:27.133552Z"},"content_sha256":"34c36b612b83b2acb98131fc2a7d7c411d695a7475925959735682df60704fc2","schema_version":"1.0","event_id":"sha256:34c36b612b83b2acb98131fc2a7d7c411d695a7475925959735682df60704fc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B4CNZMLS32VHATHMH4RLRAWLDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Universal Approximability and Complexity Bounds of Quantized ReLU Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Jinglan Liu, Jinjun Xiong, Yiyu Shi, Yukun Ding","submitted_at":"2018-02-10T19:43:42Z","abstract_excerpt":"Compression is a key step to deploy large neural networks on resource-constrained platforms. As a popular compression technique, quantization constrains the number of distinct weight values and thus reducing the number of bits required to represent and store each weight. In this paper, we study the representation power of quantized neural networks. First, we prove the universal approximability of quantized ReLU networks on a wide class of functions. Then we provide upper bounds on the number of weights and the memory size for a given approximation error bound and the bit-width of weights for f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03646","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tSgc8s0E5TIQlwZ6wB8J9x7/c2a+eKRbChBA3jNP+LzKy9nYddkwZD+XBvT6qOQIcEnEQtz3+tcykSgJkVyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:17:27.134378Z"},"content_sha256":"dbcfa7f79b9590044a5cc0299dd6daf6de0a8156a1d01f2e2f1a75dcef6578a8","schema_version":"1.0","event_id":"sha256:dbcfa7f79b9590044a5cc0299dd6daf6de0a8156a1d01f2e2f1a75dcef6578a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4CNZMLS32VHATHMH4RLRAWLDA/bundle.json","state_url":"https://pith.science/pith/B4CNZMLS32VHATHMH4RLRAWLDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4CNZMLS32VHATHMH4RLRAWLDA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T08:17:27Z","links":{"resolver":"https://pith.science/pith/B4CNZMLS32VHATHMH4RLRAWLDA","bundle":"https://pith.science/pith/B4CNZMLS32VHATHMH4RLRAWLDA/bundle.json","state":"https://pith.science/pith/B4CNZMLS32VHATHMH4RLRAWLDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4CNZMLS32VHATHMH4RLRAWLDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B4CNZMLS32VHATHMH4RLRAWLDA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5d49117226c65c9e224d62810c677ea835819e0aaab0871cff9a9a5cc07609e6","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T19:43:42Z","title_canon_sha256":"a5abf6386631ad1ff9c4fa2f70aa40dbeb2c127ade6c2ee20b580fa80c984da4"},"schema_version":"1.0","source":{"id":"1802.03646","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03646","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03646v4","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03646","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"B4CNZMLS32VH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B4CNZMLS32VHATHM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B4CNZMLS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:dbcfa7f79b9590044a5cc0299dd6daf6de0a8156a1d01f2e2f1a75dcef6578a8","target":"graph","created_at":"2026-05-17T23:56:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Compression is a key step to deploy large neural networks on resource-constrained platforms. As a popular compression technique, quantization constrains the number of distinct weight values and thus reducing the number of bits required to represent and store each weight. In this paper, we study the representation power of quantized neural networks. First, we prove the universal approximability of quantized ReLU networks on a wide class of functions. Then we provide upper bounds on the number of weights and the memory size for a given approximation error bound and the bit-width of weights for f","authors_text":"Jinglan Liu, Jinjun Xiong, Yiyu Shi, Yukun Ding","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T19:43:42Z","title":"On the Universal Approximability and Complexity Bounds of Quantized ReLU Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03646","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:34c36b612b83b2acb98131fc2a7d7c411d695a7475925959735682df60704fc2","target":"record","created_at":"2026-05-17T23:56:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5d49117226c65c9e224d62810c677ea835819e0aaab0871cff9a9a5cc07609e6","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-10T19:43:42Z","title_canon_sha256":"a5abf6386631ad1ff9c4fa2f70aa40dbeb2c127ade6c2ee20b580fa80c984da4"},"schema_version":"1.0","source":{"id":"1802.03646","kind":"arxiv","version":4}},"canonical_sha256":"0f04dcb172deaa704cec3f22b882cb182d08805c94bd2c5d13fcae6faab0aa24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f04dcb172deaa704cec3f22b882cb182d08805c94bd2c5d13fcae6faab0aa24","first_computed_at":"2026-05-17T23:56:30.006852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:30.006852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EJUdpkxot72wXAhEslixrFWURERYHEll2R5mo6lQJNlT+b1LjGvCpvIc53Y+q3O3/T39zmMEvddrLzqHYPgOCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:30.007235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03646","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34c36b612b83b2acb98131fc2a7d7c411d695a7475925959735682df60704fc2","sha256:dbcfa7f79b9590044a5cc0299dd6daf6de0a8156a1d01f2e2f1a75dcef6578a8"],"state_sha256":"34d92ea54aeaac410b9e10995ced1ef23c4f42b187bd81c548b0be0932a18139"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XleKMkc+LIpj81Wrgxw0bUHNgyFPElwt2qnLHUZyqcjFImyMXRNh5g0NApxrF/+D5dwyph/B8gIIwDvzGMVHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:17:27.137787Z","bundle_sha256":"cd5d87b192edd8c1c912a64310cc8e5b7687b1075f8b10ff336f90861f2d2682"}}