{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:19:37Z","timestamp":1766578777810},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"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":[[2022,11,1]]},"DOI":"10.1109\/itw54588.2022.9965883","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"696-701","source":"Crossref","is-referenced-by-count":2,"title":["Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach"],"prefix":"10.1109","author":[{"given":"Tulasi Sowjanya","family":"B.","sequence":"first","affiliation":[{"name":"International Institute of Information Technology Hyderabad,Signal Processing & Communications Research Center,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Visvesh","family":"Subramanian","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology Hyderabad,Signal Processing & Communications Research Center,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Krishnan","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology Hyderabad,Signal Processing & Communications Research Center,India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518120"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702431840"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279876"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2954338"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2947669"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2752088"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849527"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849812"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477821"},{"article-title":"Bounding the optimal length of pliable index coding via a hypergraph-based approach","year":"2022","author":"tulasi sowjanya","key":"ref1"},{"article-title":"Improved lower bounds for pliable index coding using absent receivers","year":"2019","author":"ong","key":"ref9"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965883.pdf?arnumber=9965883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:35Z","timestamp":1672083755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965883\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965883","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}