{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:27:54Z","timestamp":1746001674875,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"TCO-pRIvacy and SEcurity in public BLOCKchains and their application to datamarketplaces (RISEBLOCK), Ministerio de Asuntos Econ\u00f3micos y Transformaci\u00f3n Digitalb","award":["PID2019-110224RB-I00"],"award-info":[{"award-number":["PID2019-110224RB-I00"]}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-109379RB-I00"],"award-info":[{"award-number":["PID2019-109379RB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1109\/tit.2023.3282452","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T17:23:52Z","timestamp":1686331432000},"page":"7049-7069","source":"Crossref","is-referenced-by-count":2,"title":["Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lov\u00e1sz Local Lemma"],"prefix":"10.1109","volume":"69","author":[{"given":"Marcel","family":"Fern\u00e1ndez","sequence":"first","affiliation":[{"name":"Department of Network Engineering, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6409-4286","authenticated-orcid":false,"given":"John","family":"Livieratos","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9799-6793","authenticated-orcid":false,"given":"Sebasti\u00e0","family":"Mart\u00edn","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2003.08.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3177"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006388"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100376848"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2003.08.012"},{"issue":"1","key":"ref6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0097-3165(03)00030-X","article-title":"An upper bound on the size of a code with the k-identifiable parent property","volume":"102","author":"Blackburn","year":"2003","journal-title":"J. Combinat. Theory A"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"ref8","first-page":"53","article-title":"Some extremal problems on r-graphs","volume-title":"Proc. New Directions Theory Graphs 3rd Ann. Arbor Conf.","author":"Brown"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0203-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9253-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/B:DESI.0000029217.97956.26"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946019030049"},{"issue":"2","key":"ref14","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","volume":"10","author":"Erd\u0151s","year":"1975","journal-title":"Infinite Finite Sets"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095194"},{"volume-title":"Concatenated Codes","year":"1966","author":"Forney","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01884295"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973761.2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.12.011"},{"key":"ref21","first-page":"148","article-title":"Alternative proofs of the asymmetric Lov\u00e1sz local lemma and Shearer\u2019s lemma","volume-title":"Proc. 11th Int. Conf. Random Exhaustive Gener. Combinat. Struct. (GASCom)","author":"Giotis"},{"issue":"1","key":"ref22","first-page":"170","article-title":"Codes on algebraic curves","volume":"24","author":"Goppa","year":"1981","journal-title":"Soviet Math. Dokl."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2851"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-019-09671-5"},{"article-title":"Constraint satisfaction problems: Probabilistic approach Applications to social choice theory","year":"2020","author":"Livieratos","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536462"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1006\/jmaa.2000.6911"},{"volume-title":"An Introduction to the Analysis of Algorithms","year":"2013","author":"Sedgewick","key":"ref31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/19M1248108"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.945244"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.915661"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-005-6402-5"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1983.10018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1276103"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10288603\/10147798.pdf?arnumber=10147798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T04:30:48Z","timestamp":1712982648000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10147798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":37,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3282452","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}