{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T03:55:46Z","timestamp":1715658946827},"publisher-location":"Philadelphia, PA","reference-count":0,"publisher":"Society for Industrial and Applied Mathematics","isbn-type":[{"value":"9781611977554","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1137\/1.9781611977554.ch75","type":"book-chapter","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T04:24:11Z","timestamp":1673929451000},"page":"1962-1994","source":"Crossref","is-referenced-by-count":1,"title":["Superpolynomial lower bounds for decision tree learning and testing"],"prefix":"10.1137","author":[{"given":"Caleb","family":"Koch","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Carmen","family":"Strassle","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Li-Yang","family":"Tan","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"351","published-online":{"date-parts":[[2023,1,16]]},"container-title":["Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T14:09:02Z","timestamp":1686665342000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9781611977554.ch75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"ISBN":["9781611977554"],"references-count":0,"alternative-id":["10.1137\/1.9781611977554.ch75","10.1137\/1.9781611977554"],"URL":"https:\/\/doi.org\/10.1137\/1.9781611977554.ch75","relation":{},"subject":[],"published":{"date-parts":[[2023,1]]}}}