{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:39:43Z","timestamp":1740101983298,"version":"3.37.3"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175694","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T17:18:23Z","timestamp":1689355103000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Pseudorandom Finite Models"],"prefix":"10.1109","author":[{"given":"Jan","family":"Dreier","sequence":"first","affiliation":[{"name":"TU Wien,Algorithms and Complexity Group,Vienna,Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamie","family":"Tucker-Foltz","sequence":"additional","affiliation":[{"name":"Harvard University,School of Engineering and Applied Sciences,Allston,MA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594179"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511804090"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exz022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050414"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80027-9"},{"key":"ref6","first-page":"166","article-title":"Explicit graphs with extension properties","volume":"86","author":"Blass","year":"2005","journal-title":"Bull. EATCS"},{"issue":"1","key":"ref7","article-title":"The search for n-e.c. graphs","volume":"4","author":"Bonato","year":"2009","journal-title":"Contributions to Discrete Mathematics"},{"journal-title":"A Graduate Course in Applied Cryptography","year":"2015","author":"Boneh","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.37236\/1647"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28788-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s40879-021-00521-5"},{"key":"ref13","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"7","author":"Fagin","year":"1974","journal-title":"Complexity of computation"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2272945"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1063\/1.4822863"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.11"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/421173"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80029-8"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","article-title":"Descriptive complexity","volume-title":"Graduate texts in computer science","author":"Immerman","year":"1999"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/pspum\/034\/525336"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2528402"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492475"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.4064\/aa-9-4-331-340"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470706"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2023,6,26]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175694.pdf?arnumber=10175694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T13:23:43Z","timestamp":1709299423000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175694\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175694","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}