{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:51:19Z","timestamp":1775440279203,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821865972","type":"print"},{"value":"9780821885758","type":"print"},{"value":"9781470439712","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993,10,25]]},"DOI":"10.1090\/dimacs\/013\/11","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:32:15Z","timestamp":1493245935000},"page":"183-193","source":"Crossref","is-referenced-by-count":20,"title":["A new lower bound theorem for read only once branching programs and its applications"],"prefix":"10.1090","author":[{"given":"Janos","family":"Simon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","Advances in Computational Complexity Theory"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:54:59Z","timestamp":1775436899000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10,25]]},"ISBN":["9780821865972","9780821885758","9781470439712"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/013\/11","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10,25]]}}}