{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:37:27Z","timestamp":1780497447452,"version":"3.54.1"},"publisher-location":"Dordrecht","reference-count":0,"publisher":"Springer Netherlands","isbn-type":[{"value":"9781402027758","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-1-4020-2776-5_7","type":"book-chapter","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T21:30:57Z","timestamp":1194039057000},"page":"95-139","source":"Crossref","is-referenced-by-count":10,"title":["On Sacks forcing and the Sacks property"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Geschke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandra","family":"Quickert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","container-title":["Trends in Logic","Classical and New Paradigms of Computation and their Complexity Hierarchies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-2776-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T05:19:43Z","timestamp":1619673583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-2776-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781402027758"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-2776-5_7","relation":{},"subject":[]}}