{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T22:19:14Z","timestamp":1771625954656,"version":"3.50.1"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Anusandhan National Research Foundation","award":["CRG\/2023\/008696"],"award-info":[{"award-number":["CRG\/2023\/008696"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/tit.2025.3648750","type":"journal-article","created":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T18:23:28Z","timestamp":1766773408000},"page":"1569-1589","source":"Crossref","is-referenced-by-count":0,"title":["Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-Based Approach"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6224-1123","authenticated-orcid":false,"given":"B. Tulasi","family":"Sowjanya","sequence":"first","affiliation":[{"name":"Signal Processing and Communications Research Center, International Institute of Information Technology Hyderabad, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Visvesh","family":"Subramanian","sequence":"additional","affiliation":[{"name":"IdeaForge Technology Ltd., Navi Mumbai, Maharashtra, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9182-6278","authenticated-orcid":false,"given":"Prasad","family":"Krishnan","sequence":"additional","affiliation":[{"name":"Signal Processing and Communications Research Center, International Institute of Information Technology Hyderabad, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"696","article-title":"Bounding the optimal length of pliable index coding via a hypergraph-based approach","volume-title":"Proc. IEEE Inf. Theory Workshop (ITW)","author":"Subramanian"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477821"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206846"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2954338"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965759"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2752088"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton58177.2023.10313405"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3355416"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702431840"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2947669"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849812"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279876"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849527"},{"key":"ref15","first-page":"26","article-title":"Improved lower bounds for pliable index coding using absent receivers","volume-title":"Proc. Int. Zurich Seminar Inf. Commun. (IZS)","author":"Ong"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264472"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338865"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278015"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2748562"},{"key":"ref20","volume-title":"Delgreedy-Picod-Benchmark","author":"Subramanian","year":"2025"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11400648\/11316531.pdf?arnumber=11316531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:16:33Z","timestamp":1771622193000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11316531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":20,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3648750","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}