{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T16:36:16Z","timestamp":1786984576129,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032039170","type":"print"},{"value":"9783032039187","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-03918-7_12","type":"book-chapter","created":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T22:03:06Z","timestamp":1760911386000},"page":"112-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["R\u00e9nyi\u00a0Partial Orders for\u00a0BISO Channels"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9265-827X","authenticated-orcid":false,"given":"Christoph","family":"Hirche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,20]]},"reference":[{"key":"12_CR1","unstructured":"Arimoto, S.: Information measures and capacity of order $$\\alpha $$ for discrete memoryless channels. Topics in information theory (1977)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Asoodeh, S., Diaz, M., Calmon, F.P.: Privacy analysis of online learning algorithms via contraction coefficients. In: International Symposium on Information Theory. p.\u00a01 (2020)","DOI":"10.1109\/ISIT44484.2020.9174133"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/18.370121","volume":"41","author":"I Csisz\u00e1r","year":"1995","unstructured":"Csisz\u00e1r, I.: Generalized cutoff rates and r\u00e9nyi\u2019s information measures. IEEE Trans. Inf. Theory 41(1), 26\u201334 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"12_CR4","doi-asserted-by":"publisher","first-page":"6980","DOI":"10.1109\/TIT.2013.2279392","volume":"59","author":"Y Geng","year":"2013","unstructured":"Geng, Y., Nair, C., Shitz, S.S., Wang, Z.V.: On broadcast channels with binary inputs and symmetric outputs. IEEE Trans. Inf. Theory 59(11), 6980\u20136989 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR5","unstructured":"Grosse, L., Saeidian, S., Oechtering, T.J., Skoglund, M.: Strong data processing properties of r\u00e9nyi-divergences via pinsker-type inequalities. arXiv preprint arXiv:2501.11473 (2025)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/TIT.1979.1055989","volume":"25","author":"B Hajek","year":"1979","unstructured":"Hajek, B., Pursley, M.: Evaluation of an achievable rate region for the broadcast channel. IEEE Trans. Inf. Theory 25(1), 36\u201346 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Hirche, C.: R\u00e9nyi bounds on information combining. In: 2020 IEEE International Symposium on Information Theory (ISIT). pp. 2297\u20132302. IEEE (2020)","DOI":"10.1109\/ISIT44484.2020.9174256"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Hirche, C., Guan, X., Tomamichel, M.: Chain rules for r\u00e9nyi information combining. In: 2023 IEEE International Symposium on Information Theory (ISIT). pp. 204\u2013209. IEEE (2023)","DOI":"10.1109\/ISIT54713.2023.10206941"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/TIT.2022.3199578","volume":"69","author":"C Hirche","year":"2022","unstructured":"Hirche, C., Leditzky, F.: Bounding quantum capacities via partial orders and complementarity. IEEE Trans. Inf. Theory 69(1), 283\u2013297 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"12_CR10","doi-asserted-by":"publisher","first-page":"4739","DOI":"10.1109\/tit.2018.2842180","volume":"64","author":"C Hirche","year":"2018","unstructured":"Hirche, C., Reeb, D.: Bounds on information combining with quantum side information. IEEE Trans. Inf. Theory 64(7), 4739\u20134757 (2018). https:\/\/doi.org\/10.1109\/tit.2018.2842180","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Hirche, C., Shaya, O.: Partial orders and contraction for biso channels. In: 2025 IEEE International Symposium on Information Theory (ISIT). p.\u00a0TBD. IEEE (2025)","DOI":"10.1109\/ISIT63088.2025.11195255"},{"key":"12_CR12","unstructured":"Korner, J., Marton, K., et\u00a0al.: Comparison of two noisy channels. In: Topics in information theory, pp. 411\u2013413 (1975)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-1-4939-7005-6_7","volume-title":"Convexity and Concentration","author":"Y Polyanskiy","year":"2017","unstructured":"Polyanskiy, Y., Wu, Y.: Strong data-processing inequalities for channels and bayesian networks. In: Carlen, E., Madiman, M., Werner, E.M. (eds.) Convexity and Concentration, pp. 211\u2013249. Springer, New York, New York, NY (2017)"},{"key":"12_CR14","unstructured":"R\u00e9nyi, A.: On measures of entropy and information. In: Proceedings of the fourth Berkeley symposium on mathematical statistics and probability, volume 1: contributions to the theory of statistics. vol.\u00a04, pp. 547\u2013562. University of California Press (1961)"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00537520","volume":"14","author":"R Sibson","year":"1969","unstructured":"Sibson, R.: Information radius. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete 14(2), 149\u2013160 (1969). https:\/\/doi.org\/10.1007\/BF00537520","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Verd\u00fa, S.: $$\\alpha $$-mutual information. In: 2015 Information Theory and Applications Workshop (ITA). pp.\u00a01\u20136. IEEE (2015)","DOI":"10.1109\/ITA.2015.7308959"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1109\/TIT.2016.2646342","volume":"63","author":"A Xu","year":"2016","unstructured":"Xu, A., Raginsky, M.: Information-theoretic lower bounds on bayes risk in decentralized estimation. IEEE Trans. Inf. Theory 63(3), 1580\u20131600 (2016)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-03918-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T16:15:42Z","timestamp":1786983342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-03918-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,20]]},"ISBN":["9783032039170","9783032039187"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-03918-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,20]]},"assertion":[{"value":"20 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interest.","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"GSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Geometric Science of Information","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gsi2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference-gsi.org\/gsi-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}