{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:14Z","timestamp":1773377054381,"version":"3.50.1"},"reference-count":8,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195467","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bounds on Access-Redundancy Tradeoffs in Quantized Linear Computations"],"prefix":"10.1109","author":[{"given":"Ching-Fang","family":"Li","sequence":"first","affiliation":[{"name":"Stanford University,Department of Electrical Engineering,CA,USA"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Stanford University,Departments of Computer Science and Electrical Engineering,CA,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3425808"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/allerton58177.2023.10313505"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/isit57864.2024.10619536"},{"key":"ref4","volume-title":"Covering codes","author":"Cohen","year":"1997"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/12.737680"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834464"},{"issue":"17","key":"ref7","volume-title":"Probabilistic methods in combinatorics, ser. Probability and mathematical statistics","author":"Erdos","year":"1974"},{"issue":"11","key":"ref8","first-page":"4311","article-title":"K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume-title":"conference Name: IEEE Transactions on Signal Processing","volume":"54","author":"Aharon"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195467.pdf?arnumber=11195467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:21Z","timestamp":1773347421000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195467\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195467","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}