{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:59Z","timestamp":1760202719199,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2016,8,19]]},"DOI":"10.3233\/fi-2016-1359","type":"journal-article","created":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T14:23:52Z","timestamp":1471616632000},"page":"243-256","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Number of Input Clues in Robust Information Retrieval"],"prefix":"10.1177","volume":"145","author":[{"given":"Ville","family":"Junnila","sequence":"first","affiliation":[]},{"given":"Tero","family":"Laihonen","sequence":"additional","affiliation":[]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2016-1359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:57:00Z","timestamp":1751367420000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-2016-1359"}},"subtitle":[],"editor":[{"given":"J.","family":"Karhum\u00e4ki","sequence":"additional","affiliation":[]},{"given":"V.","family":"Mazalov","sequence":"additional","affiliation":[]},{"given":"Yu.","family":"Matiyasevich","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2016,8,19]]},"references-count":0,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/fi-2016-1359","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2016,8,19]]}}}