{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:12Z","timestamp":1750306332909,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61532012, 61572319, U1405251"],"award-info":[{"award-number":["No. 61532012, 61572319, U1405251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2942358.2947402","type":"proceedings-article","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T15:11:34Z","timestamp":1467731494000},"page":"369-370","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Reducing computational complexity of coded caching by partitioning users into groups"],"prefix":"10.1145","author":[{"given":"Wenxin","family":"Li","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]},{"given":"Shangjie","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]},{"given":"Guanchen","family":"He","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]},{"given":"Xiaohua","family":"Tian","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China and Southeast University, China"}]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1077","volume-title":"IEEE ISIT","author":"Maddah-Ali M. A.","year":"2013","unstructured":"M. A. Maddah-Ali , U. Niesen , \"Fundamental limits of caching,\" in Proc . IEEE ISIT , 2013 , pp. 1077 -- 1081 . M. A. Maddah-Ali, U. Niesen, \"Fundamental limits of caching,\" in Proc. IEEE ISIT, 2013, pp. 1077--1081."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0510-2"}],"event":{"name":"MobiHoc'16: The Seventeenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Paderborn Germany","acronym":"MobiHoc'16"},"container-title":["Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2942358.2947402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2942358.2947402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:45Z","timestamp":1750222485000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2942358.2947402"}},"subtitle":["poster"],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":2,"alternative-id":["10.1145\/2942358.2947402","10.1145\/2942358"],"URL":"https:\/\/doi.org\/10.1145\/2942358.2947402","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}