{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:18:12Z","timestamp":1760401092236,"version":"build-2065373602"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ICG"],"published-print":{"date-parts":[[1996,3,1]]},"DOI":"10.3233\/icg-1996-19102","type":"journal-article","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T13:15:46Z","timestamp":1517318146000},"page":"3-16","source":"Crossref","is-referenced-by-count":0,"title":["The ABDADA Distributed Minimax-Search Algorithm"],"prefix":"10.1177","volume":"19","author":[{"given":"Jean-Christophe","family":"Weill","sequence":"first","affiliation":[{"name":"Paris, France"}]}],"member":"179","container-title":["ICGA Journal"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/ICG-1996-19102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T06:55:46Z","timestamp":1760338546000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/ICG-1996-19102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3,1]]},"references-count":0,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/icg-1996-19102","relation":{},"ISSN":["2468-2438","1389-6911"],"issn-type":[{"type":"electronic","value":"2468-2438"},{"type":"print","value":"1389-6911"}],"subject":[],"published":{"date-parts":[[1996,3,1]]}}}