{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:16:56Z","timestamp":1780571816007,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":0,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T00:00:00Z","timestamp":1582675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1726550"],"award-info":[{"award-number":["1726550"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,26]]},"DOI":"10.1145\/3328778.3372544","type":"proceedings-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T09:02:03Z","timestamp":1582621323000},"page":"1418-1418","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Deep Thought"],"prefix":"10.1145","author":[{"given":"Mehak","family":"Maniktala","sequence":"first","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tiffany","family":"Barnes","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,2,26]]},"event":{"name":"SIGCSE '20: The 51st ACM Technical Symposium on Computer Science Education","location":"Portland OR USA","acronym":"SIGCSE '20","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 51st ACM Technical Symposium on Computer Science Education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328778.3372544","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3328778.3372544","content-type":"text\/html","content-version":"vor","intended-application":"syndication"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:45Z","timestamp":1750199565000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328778.3372544"}},"subtitle":["An Intelligent Logic Tutor for Discrete Math"],"short-title":[],"issued":{"date-parts":[[2020,2,26]]},"references-count":0,"alternative-id":["10.1145\/3328778.3372544","10.1145\/3328778"],"URL":"https:\/\/doi.org\/10.1145\/3328778.3372544","relation":{},"subject":[],"published":{"date-parts":[[2020,2,26]]},"assertion":[{"value":"2020-02-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}