{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T06:14:18Z","timestamp":1777616058988,"version":"3.51.4"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2012,12,1]]},"DOI":"10.1093\/comjnl\/bxr137","type":"journal-article","created":{"date-parts":[[2012,1,18]],"date-time":"2012-01-18T02:05:48Z","timestamp":1326852348000},"page":"1440-1446","source":"Crossref","is-referenced-by-count":19,"title":["Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks"],"prefix":"10.1093","volume":"55","author":[{"given":"A.","family":"Bossard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Kaneko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2012,1,16]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/55\/12\/1440\/1176762\/bxr137.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T01:15:08Z","timestamp":1503450908000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxr137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,16]]},"references-count":0,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2012,11,30]]},"published-print":{"date-parts":[[2012,12,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxr137","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,16]]}}}