{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:09:22Z","timestamp":1648678162580},"reference-count":0,"publisher":"Institute of Information Theory and Automation","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Kybernetika"],"DOI":"10.14736\/kyb-2017-5-0820","type":"journal-article","created":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T19:34:24Z","timestamp":1513971264000},"page":"820-837","source":"Crossref","is-referenced-by-count":1,"title":["Alternate checking criteria for reachable controllability of rectangular descriptor systems"],"prefix":"10.14736","author":[{"given":"Vikas","family":"Kumar Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nutan","family":"Kumar Tomar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"5778","published-online":{"date-parts":[[2017,12,22]]},"container-title":["Kybernetika"],"original-title":[],"language":"en","deposited":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T19:34:24Z","timestamp":1513971264000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.kybernetika.cz\/content\/2017\/5\/820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"references-count":0,"URL":"https:\/\/doi.org\/10.14736\/kyb-2017-5-0820","relation":{},"ISSN":["0023-5954","1805-949X"],"issn-type":[{"value":"0023-5954","type":"print"},{"value":"1805-949X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}