{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:18Z","timestamp":1773377718025,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518068","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"3225-3230","source":"Crossref","is-referenced-by-count":1,"title":["Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs"],"prefix":"10.1109","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[{"name":"Technion-Israel Institute of Technology,Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20532"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.08.025"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2806486"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301004631"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-01-06058-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557276"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046253"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055150"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(77)90083-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.782146"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990538"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90019-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/4145187"},{"key":"ref5","first-page":"241","article-title":"On two problems of information theory","volume":"8","author":"erd?s","year":"1963","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"ref8","article-title":"Three tutorial lectures on entropy and counting","author":"galvin","year":"2014","journal-title":"First Lake Michigan Workshop on Combinatorics and Graph Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05446-9_10"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0976-z"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200002"},{"key":"ref20","first-page":"1","article-title":"Entropy and counting","author":"radhakrishnan","year":"2001","journal-title":"Proceedings of the IIT Kharagpur Golden Jubilee Volume on Computational Mathematics Modelling and Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.2727"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/e23030270"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2019.01.007"},{"key":"ref26","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"vizing","year":"1964","journal-title":"Diskret Analiz"},{"key":"ref25","author":"sason","year":"2021","journal-title":"Entropy-based proofs of combinatorial results on bipartite graphs"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518068.pdf?arnumber=9518068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:58Z","timestamp":1773347698000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518068\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518068","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}