{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:39:28Z","timestamp":1763105968185,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100011019","name":"National Research, Development and Innovation Office (NRDI), Hungary","doi-asserted-by":"publisher","award":["KKP 138270"],"award-info":[{"award-number":["KKP 138270"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1109\/tit.2023.3315304","type":"journal-article","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T17:48:00Z","timestamp":1694713680000},"page":"904-919","source":"Crossref","is-referenced-by-count":4,"title":["Conditional Graph Entropy as an Alternating Minimization Problem"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8749-6771","authenticated-orcid":false,"given":"Viktor","family":"Harangi","sequence":"first","affiliation":[{"name":"Alfréd Rényi Institute of Mathematics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5713-1739","authenticated-orcid":false,"given":"Xueyan","family":"Niu","sequence":"additional","affiliation":[{"name":"Theory Laboratory, Central Research Institute, 2012 Laboratories, Huawei Technologies Company Ltd., Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4796-8249","authenticated-orcid":false,"given":"Bo","family":"Bai","sequence":"additional","affiliation":[{"name":"Theory Laboratory, Central Research Institute, 2012 Laboratories, Huawei Technologies Company Ltd., Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.532875"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"article-title":"Information theoretic parameters for graphs and operator systems","year":"2020","author":"Boreland","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122693"},{"key":"ref6","first-page":"205","article-title":"Information geometry and alternating minimization procedures","volume":"1","author":"Csisz\u00e1r","year":"1984","journal-title":"Statist. Decisions"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050835"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365218"},{"issue":"1","key":"ref9","first-page":"19","article-title":"Coding for channel with random parameters","volume":"9","author":"Gel\u2019fand","year":"1980","journal-title":"Problems Control Inf. Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90087-0"},{"volume-title":"Graph Entropy Program Code","year":"2023","author":"Harangi","key":"ref11"},{"key":"ref12","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","volume-title":"Proc. 6th Prague Conf. Inf. Theory","author":"K\u00f6rner"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/020\/08"},{"key":"ref17","first-page":"293","article-title":"Perfect graphs and graph entropy. An updated survey","volume-title":"Perfect Graphs","author":"Simonyi","year":"2001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-020-4324-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055607"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10411830\/10251465.pdf?arnumber=10251465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:33:09Z","timestamp":1706754789000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10251465\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":20,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3315304","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2024,2]]}}}