{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:14Z","timestamp":1750219814481,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100017052","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61971135,62071115"],"award-info":[{"award-number":["61971135,62071115"]}],"id":[{"id":"10.13039\/100017052","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015013","name":"National Mobile Communications Research Laboratory, Southeast University","doi-asserted-by":"publisher","award":["2023A03"],"award-info":[{"award-number":["2023A03"]}],"id":[{"id":"10.13039\/501100015013","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,5,26]]},"DOI":"10.1145\/3603781.3604224","type":"proceedings-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T18:02:29Z","timestamp":1690480949000},"page":"975-982","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Capacity Results of Coded Caching: The Pareto Optimal Frontier of the Two-User Case"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0347-7211","authenticated-orcid":false,"given":"Zhiqiang","family":"Luo","sequence":"first","affiliation":[{"name":"Southeast University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4155-0685","authenticated-orcid":false,"given":"Nan","family":"Liu","sequence":"additional","affiliation":[{"name":"Southeast University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4408-6419","authenticated-orcid":false,"given":"Wei","family":"Kang","sequence":"additional","affiliation":[{"name":"Southeast University, China"}]}],"member":"320","published-online":{"date-parts":[[2023,7,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2638841"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3181411"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.1205"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2962495"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3193316"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CompComm.2017.8322577"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2705166"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2695611"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3175900"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946361"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2930692"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3390\/e20080603"},{"key":"e_1_3_2_1_16_1","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2629\u20132633","author":"Vijith\u00a0Kumar K\u00a0P","year":"2019","unstructured":"K\u00a0P Vijith\u00a0Kumar , Brijesh\u00a0Kumar Rai , and Tony Jacob . 2019 . Pareto optimal schemes in coded caching . In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2629\u20132633 . K\u00a0P Vijith\u00a0Kumar, Brijesh\u00a0Kumar Rai, and Tony Jacob. 2019. Pareto optimal schemes in coded caching. In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2629\u20132633."},{"key":"e_1_3_2_1_17_1","volume-title":"Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching. In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2537\u20132541","author":"Vijith\u00a0Kumar K\u00a0P","year":"2021","unstructured":"K\u00a0P Vijith\u00a0Kumar , Brijesh\u00a0Kumar Rai , and Tony Jacob . 2021 . Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching. In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2537\u20132541 . K\u00a0P Vijith\u00a0Kumar, Brijesh\u00a0Kumar Rai, and Tony Jacob. 2021. Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching. In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2537\u20132541."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2856885"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2870566"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2768517"},{"key":"e_1_3_2_1_22_1","article-title":"On characterization of entropy function via information inequalities","volume":"44","author":"Zhang Z.","year":"1998","unstructured":"Z. Zhang and R.\u00a0 W. Yeung . 1998 . On characterization of entropy function via information inequalities . IEEE Transactions on Information Theory 44 , 4 (1998), P.1440\u20131452. Z. Zhang and R.\u00a0W. Yeung. 1998. On characterization of entropy function via information inequalities. IEEE Transactions on Information Theory 44, 4 (1998), P.1440\u20131452.","journal-title":"IEEE Transactions on Information Theory"}],"event":{"name":"CNIOT'23: 2023 4th International Conference on Computing, Networks and Internet of Things","acronym":"CNIOT'23","location":"Xiamen China"},"container-title":["Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3603781.3604224","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3603781.3604224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:06Z","timestamp":1750178766000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3603781.3604224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":22,"alternative-id":["10.1145\/3603781.3604224","10.1145\/3603781"],"URL":"https:\/\/doi.org\/10.1145\/3603781.3604224","relation":{},"subject":[],"published":{"date-parts":[[2023,5,26]]},"assertion":[{"value":"2023-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}