{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:47Z","timestamp":1773378047170,"version":"3.50.1"},"reference-count":6,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849602","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2354-2358","source":"Crossref","is-referenced-by-count":1,"title":["On the size of pairwise-colliding permutations"],"prefix":"10.1109","author":[{"given":"J\u00e1nos","family":"K\u00f6rner","sequence":"first","affiliation":[{"name":"Department of Computer Science, Sapienza University of Rome, Rome, Italy"}]},{"given":"Chandra","family":"Nair","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong"}]},{"given":"David","family":"Ng","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/050632877"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"p4.22","DOI":"10.37236\/6885","article-title":"Maximum size of a family of pairwise graph-different permutations","volume":"24","author":"golowich","year":"2017","journal-title":"Electr J Comb"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref2","author":"garsia","year":"0","journal-title":"Personal Communication (to C Malvenuto)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/090765407"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849602.pdf?arnumber=8849602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:02Z","timestamp":1773347762000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849602","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}