{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:23Z","timestamp":1773377063333,"version":"3.50.1"},"reference-count":10,"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"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004541","name":"Ministry of Human Resource Development (MHRD), Government of India","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195534","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":1,"title":["Hierarchical Coded Caching in High Memory Regime with Coded Placement"],"prefix":"10.1109","author":[{"given":"Rajlaxmi","family":"Pandey","sequence":"first","affiliation":[{"name":"Indian Institute of Science,Dept. of Electrical Communication Engineering,Bengaluru,India"}]},{"given":"Charul","family":"Rajput","sequence":"additional","affiliation":[{"name":"Aalto University,Dept. of Mathematics and Systems Analysis,Finland"}]},{"given":"B. Sundar","family":"Rajan","sequence":"additional","affiliation":[{"name":"Indian Institute of Science,Dept. of Electrical Communication Engineering,Bengaluru,India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2873723"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849624"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC55385.2023.10118860"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3164055"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195534"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/isit57864.2024.10619310"}],"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\/11195534.pdf?arnumber=11195534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:26Z","timestamp":1773347426000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195534","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}