{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T05:29:57Z","timestamp":1739510997026,"version":"3.37.0"},"reference-count":0,"publisher":"Springer Science and Business Media LLC","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJNDC"],"DOI":"10.2991\/ijndc.2015.3.4.1","type":"journal-article","created":{"date-parts":[[2015,12,14]],"date-time":"2015-12-14T13:53:38Z","timestamp":1450101218000},"page":"202","source":"Crossref","is-referenced-by-count":5,"title":["A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint"],"prefix":"10.1007","volume":"3","author":[{"given":"Antoine","family":"Bossard","sequence":"first","affiliation":[]},{"given":"Keiichi","family":"Kaneko","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015]]},"container-title":["International Journal of Networked and Distributed Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T19:34:53Z","timestamp":1739475293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.2991\/ijndc.2015.3.4.1"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015]]}},"alternative-id":["25841971"],"URL":"https:\/\/doi.org\/10.2991\/ijndc.2015.3.4.1","relation":{},"ISSN":["2211-7946"],"issn-type":[{"type":"electronic","value":"2211-7946"}],"subject":[],"published":{"date-parts":[[2015]]}}}