{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4W5P5W6NOVGCXBXRXB7ZXSO2WX","short_pith_number":"pith:4W5P5W6N","canonical_record":{"source":{"id":"1911.04951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:52:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca2226eb3562570a04873545a7dad4a868b609162b489268bc9b3d968ff4d0db","abstract_canon_sha256":"cd85145a8e8f11ba3fad03b16e9102143182855f957a97af614cabacf3ce6dde"},"schema_version":"1.0"},"canonical_sha256":"e5bafedbcd754c2b86f1b87f9bc9dab5f3d07bd27c242c6d7951901840b539b8","source":{"kind":"arxiv","id":"1911.04951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04951","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04951v1","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04951","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"4W5P5W6NOVGC","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"pith_short_16","alias_value":"4W5P5W6NOVGCXBXR","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"pith_short_8","alias_value":"4W5P5W6N","created_at":"2026-07-05T06:31:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4W5P5W6NOVGCXBXRXB7ZXSO2WX","target":"record","payload":{"canonical_record":{"source":{"id":"1911.04951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:52:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca2226eb3562570a04873545a7dad4a868b609162b489268bc9b3d968ff4d0db","abstract_canon_sha256":"cd85145a8e8f11ba3fad03b16e9102143182855f957a97af614cabacf3ce6dde"},"schema_version":"1.0"},"canonical_sha256":"e5bafedbcd754c2b86f1b87f9bc9dab5f3d07bd27c242c6d7951901840b539b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:51.987099Z","signature_b64":"Z/2O1jHev76t0BFWOXowR12YdT17F3vOYLon48niL9vWNtaqlc5OJnUYIBqygFmzFh7aQOLdYlRPFn4M604qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5bafedbcd754c2b86f1b87f9bc9dab5f3d07bd27c242c6d7951901840b539b8","last_reissued_at":"2026-07-05T06:31:51.986603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:51.986603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.04951","source_version":1,"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-07-05T06:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FiVBRU7B+II1+cars49PyuqAsym7Itn98igZITrPvDvwSgh4/HoVZC6eETXzmnGSrWX/JWRD8zE3LCmzwpUiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:26:53.525700Z"},"content_sha256":"d7d7f234b9d63210b35ec3e4d7184a71e6a8355d27215ccdb588f56c59a6e50f","schema_version":"1.0","event_id":"sha256:d7d7f234b9d63210b35ec3e4d7184a71e6a8355d27215ccdb588f56c59a6e50f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4W5P5W6NOVGCXBXRXB7ZXSO2WX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iteratively Training Look-Up Tables for Network Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akira Nakamura, Fabien Cardinaux, Javier Alonso Garcia, Kazuki Yoshiyama, Lukas Mauch, Stefan Uhlich, Stephen Tiedemann, Thomas Kemp","submitted_at":"2019-11-12T15:52:36Z","abstract_excerpt":"Operating deep neural networks (DNNs) on devices with limited resources requires the reduction of their memory as well as computational footprint. Popular reduction methods are network quantization or pruning, which either reduce the word length of the network parameters or remove weights from the network if they are not needed. In this article we discuss a general framework for network reduction which we call `Look-Up Table Quantization` (LUT-Q). For each layer, we learn a value dictionary and an assignment matrix to represent the network weights. We propose a special solver which combines gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04951","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.04951/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"},"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-07-05T06:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RASEpp42M5acg56RT+r2bXFTnnoprKT+X5yCfdqzTgFRM3N42mhoBkDihLracs9WA8VnlcFW/tTxUg5tZW0lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:26:53.526074Z"},"content_sha256":"05cdd2e77f388fe0666a2df6b188a12a793435c2e6e0d490e0f294ca490949d6","schema_version":"1.0","event_id":"sha256:05cdd2e77f388fe0666a2df6b188a12a793435c2e6e0d490e0f294ca490949d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4W5P5W6NOVGCXBXRXB7ZXSO2WX/bundle.json","state_url":"https://pith.science/pith/4W5P5W6NOVGCXBXRXB7ZXSO2WX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4W5P5W6NOVGCXBXRXB7ZXSO2WX/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-07-07T09:26:53Z","links":{"resolver":"https://pith.science/pith/4W5P5W6NOVGCXBXRXB7ZXSO2WX","bundle":"https://pith.science/pith/4W5P5W6NOVGCXBXRXB7ZXSO2WX/bundle.json","state":"https://pith.science/pith/4W5P5W6NOVGCXBXRXB7ZXSO2WX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4W5P5W6NOVGCXBXRXB7ZXSO2WX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4W5P5W6NOVGCXBXRXB7ZXSO2WX","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":"cd85145a8e8f11ba3fad03b16e9102143182855f957a97af614cabacf3ce6dde","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:52:36Z","title_canon_sha256":"ca2226eb3562570a04873545a7dad4a868b609162b489268bc9b3d968ff4d0db"},"schema_version":"1.0","source":{"id":"1911.04951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04951","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04951v1","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04951","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"4W5P5W6NOVGC","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"pith_short_16","alias_value":"4W5P5W6NOVGCXBXR","created_at":"2026-07-05T06:31:51Z"},{"alias_kind":"pith_short_8","alias_value":"4W5P5W6N","created_at":"2026-07-05T06:31:51Z"}],"graph_snapshots":[{"event_id":"sha256:05cdd2e77f388fe0666a2df6b188a12a793435c2e6e0d490e0f294ca490949d6","target":"graph","created_at":"2026-07-05T06:31:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.04951/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Operating deep neural networks (DNNs) on devices with limited resources requires the reduction of their memory as well as computational footprint. Popular reduction methods are network quantization or pruning, which either reduce the word length of the network parameters or remove weights from the network if they are not needed. In this article we discuss a general framework for network reduction which we call `Look-Up Table Quantization` (LUT-Q). For each layer, we learn a value dictionary and an assignment matrix to represent the network weights. We propose a special solver which combines gr","authors_text":"Akira Nakamura, Fabien Cardinaux, Javier Alonso Garcia, Kazuki Yoshiyama, Lukas Mauch, Stefan Uhlich, Stephen Tiedemann, Thomas Kemp","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:52:36Z","title":"Iteratively Training Look-Up Tables for Network Quantization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04951","kind":"arxiv","version":1},"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:d7d7f234b9d63210b35ec3e4d7184a71e6a8355d27215ccdb588f56c59a6e50f","target":"record","created_at":"2026-07-05T06:31:51Z","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":"cd85145a8e8f11ba3fad03b16e9102143182855f957a97af614cabacf3ce6dde","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:52:36Z","title_canon_sha256":"ca2226eb3562570a04873545a7dad4a868b609162b489268bc9b3d968ff4d0db"},"schema_version":"1.0","source":{"id":"1911.04951","kind":"arxiv","version":1}},"canonical_sha256":"e5bafedbcd754c2b86f1b87f9bc9dab5f3d07bd27c242c6d7951901840b539b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5bafedbcd754c2b86f1b87f9bc9dab5f3d07bd27c242c6d7951901840b539b8","first_computed_at":"2026-07-05T06:31:51.986603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:51.986603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z/2O1jHev76t0BFWOXowR12YdT17F3vOYLon48niL9vWNtaqlc5OJnUYIBqygFmzFh7aQOLdYlRPFn4M604qDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:51.987099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.04951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7d7f234b9d63210b35ec3e4d7184a71e6a8355d27215ccdb588f56c59a6e50f","sha256:05cdd2e77f388fe0666a2df6b188a12a793435c2e6e0d490e0f294ca490949d6"],"state_sha256":"8515dcc94fcdece29109861d7f60cbea75c00a3f6ebc231c8171b9ca7bd7e31f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhF2mAwGkuMBwgE1cFJFg7Rt2nK6jegQpLpVnKo8VWKxcOVIOPlkilDgnfg0FlLBr8WhM4BQirabthOtvTPBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:26:53.528068Z","bundle_sha256":"230b4bdd8ca3920c115f1d24106f9dc2776aaea1b700a249a71b1fd5c920e834"}}