{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:12Z","timestamp":1725489132955},"publisher-location":"Berlin, Heidelberg","reference-count":0,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442745"},{"type":"electronic","value":"9783540458135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45813-1_2","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:05:07Z","timestamp":1186844707000},"page":"10-12","source":"Crossref","is-referenced-by-count":0,"title":["Toward a Theory of Hierarchical Definability (THD)"],"prefix":"10.1007","author":[{"given":"Lotfi A.","family":"Zadeh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"container-title":["Lecture Notes in Computer Science","Rough Sets and Current Trends in Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45813-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2014,8,25]],"date-time":"2014-08-25T18:47:51Z","timestamp":1408992471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45813-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442745","9783540458135"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/3-540-45813-1_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}