{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:59:12Z","timestamp":1776977952103,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"EK\u00d6P-25 University Research Scholarship Program"},{"name":"University Excellence Fund of E\u00f6tv\u00f6s Lor\u00e1nd University"},{"name":"Bolyai Scholarship of the Hungarian Academy of Sciences"},{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"crossref","award":["138596"],"award-info":[{"award-number":["138596"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"crossref","award":["FK 142993"],"award-info":[{"award-number":["FK 142993"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"crossref","award":["STARTING 150576"],"award-info":[{"award-number":["STARTING 150576"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Australian Research Council (ARC) Discovery Project","award":["DP250104965"],"award-info":[{"award-number":["DP250104965"]}]},{"name":"EXCELLENCE-24 Combinatorics and Geometry of the National Research, Development and Innovation Office (NRDI) Fund","award":["151504"],"award-info":[{"award-number":["151504"]}]},{"name":"NSF","award":["DMS-2154063"],"award-info":[{"award-number":["DMS-2154063"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tit.2026.3665439","type":"journal-article","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T21:06:14Z","timestamp":1771275974000},"page":"2907-2914","source":"Crossref","is-referenced-by-count":0,"title":["The Generalized Trifference Problem"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0232-428X","authenticated-orcid":false,"given":"Anurag","family":"Bishnoi","sequence":"first","affiliation":[{"name":"Delft Institute of Applied Mathematics, TU Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8904-4485","authenticated-orcid":false,"given":"Bart\u0142omiej","family":"Kielak","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Masaryk University, Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedek","family":"Kov\u00e1cs","sequence":"additional","affiliation":[{"name":"ELTE Linear Hypergraphs Research Group, Eötvös Loránd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2062-5668","authenticated-orcid":false,"given":"Zolt\u00e1n L\u00f3r\u00e1nt","family":"Nagy","sequence":"additional","affiliation":[{"name":"ELTE Linear Hypergraphs Research Group, Eötvös Loránd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5761-7579","authenticated-orcid":false,"given":"G\u00e1bor","family":"Somlai","sequence":"additional","affiliation":[{"name":"Algebra and Number Theory Department, Eötvös Loránd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2360-3918","authenticated-orcid":false,"given":"M\u00e1t\u00e9","family":"Vizer","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyu","family":"Zheng","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80048-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3068"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592920"},{"key":"ref4","article-title":"Hash families and cover-free families with cryptographic applications","author":"Zaverucha","year":"2010"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12938"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/21M1391493"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123730"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.exco.2024.100139"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-024-00130-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3183619"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3648920"},{"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.1137\/0605009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.335947"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933424"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2021.105580"},{"key":"ref17","volume-title":"The Theory of Error-Correcting Codes","volume":"16","author":"MacWilliams","year":"1977"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613089"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"issue":"4","key":"ref21","first-page":"32","article-title":"New upper bounds for error correcting codes","volume":"1","author":"Bassalygo","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2011.5.119"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/9205"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3070377"},{"key":"ref25","volume-title":"Gurobi Optimizer Reference Manual","year":"2024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/fms.2017.12"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11493629\/11397417-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11493629\/11397417.pdf?arnumber=11397417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T19:58:43Z","timestamp":1776974323000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11397417\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":26,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3665439","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}