{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T23:00:56Z","timestamp":1768777256679,"version":"3.49.0"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tit.2017.2744608","type":"journal-article","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T14:23:36Z","timestamp":1503584616000},"page":"7569-7574","source":"Crossref","is-referenced-by-count":5,"title":["Testing Equality in Communication Graphs"],"prefix":"10.1109","volume":"63","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Klim","family":"Efremenko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3307-9475","authenticated-orcid":false,"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"575","article-title":"Brief announcement: Private channel models in multi-party communication complexity","author":"ellen","year":"2013","journal-title":"Proc DISC"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01504345"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22212-2_23"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60408-9_29"},{"key":"ref14","first-page":"939","article-title":"Triple systems with no six points carrying three triangles","volume":"2","author":"ruzsa","year":"1976","journal-title":"Proc 5th Hungarian Colloq"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00493-014-2960-3","article-title":"Shorter tours by nicer ears: 7\/5-Approximation for the graph-TSP, 3\/2 for the path version, and 4\/3 for two-edge-connected subgraphs","volume":"34","author":"seb\u00f6","year":"2014","journal-title":"COMBINATORICA"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1932-1501641-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.32.12.331"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214074"},{"key":"ref6","author":"brody","year":"2012","journal-title":"private communication"},{"key":"ref5","first-page":"651","volume":"244","author":"bondy","year":"2008","journal-title":"Graph Theory Graduate Texts in Mathematics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_43"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808737"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3177"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10056"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.73"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8071168\/08016410.pdf?arnumber=8016410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:39Z","timestamp":1641987579000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8016410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":16,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2744608","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}