{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T01:17:53Z","timestamp":1747444673687,"version":"3.28.0"},"reference-count":42,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/focs.2017.84","type":"proceedings-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T08:59:34Z","timestamp":1510649974000},"page":"859-867","source":"Crossref","is-referenced-by-count":3,"title":["A Characterization of Testable Hypergraph Properties"],"prefix":"10.1109","author":[{"given":"Felix","family":"Joos","sequence":"first","affiliation":[]},{"given":"Jaehoon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Daniela","family":"Kuhn","sequence":"additional","affiliation":[]},{"given":"Deryk","family":"Osthus","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060614"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20182"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/15M1007355"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548314000765"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2005.v001a009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001621"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102410973"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00019-1"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15369-3_30"},{"key":"ref34","article-title":"Removal lemmas for matrices","author":"alon","year":"2016","journal-title":"arXiv 1609 04235"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02351586"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2009.10.018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008565"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008553"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2007.166.897"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.11.006"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/060652324"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250862"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-009-2320-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/060652294"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s11856-014-1096-x","article-title":"Deterministic vs non-deterministic graph property testing","volume":"204","author":"lior","year":"2014","journal-title":"Israel J Math"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"ref27","article-title":"On the complexity of nondeterministically testable hypergraph parameters","author":"karpinski","year":"2015","journal-title":"arXiv 1503 07093"},{"key":"ref3","first-page":"939","article-title":"Triple systems with no six points carrying three triangles","volume":"18","author":"ruzsa","year":"1978","journal-title":"Combinatorics (Proc Fifth Hungarian Colloq Keszthely 1976) Vol II ser Colloq Math Soc János Bolyai"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/06064888X"},{"key":"ref29","article-title":"Explicit bounds for nondetermini stic ally testable hypergraph parameters","author":"karpinski","year":"2015","journal-title":"arXiv 1509 03046"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/050633445"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/060667177"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10078"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970445603"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_87"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132556"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20300"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3217"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-010-0060-7"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/120890946"},{"key":"ref23","volume":"60","author":"lov\u00e1sz","year":"2012","journal-title":"Large networks and graph limits ser American Mathematical Society Colloquium Publications"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548313000205"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2012.06.022"}],"event":{"name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2017,10,15]]},"location":"Berkeley, CA","end":{"date-parts":[[2017,10,17]]}},"container-title":["2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8100284\/8104011\/08104116.pdf?arnumber=8104116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T23:54:28Z","timestamp":1570319668000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8104116\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/focs.2017.84","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}