{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:54:12Z","timestamp":1760061252889,"version":"build-2065373602"},"reference-count":0,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1006\/jpdc.1996.0049","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T14:06:38Z","timestamp":1032357998000},"page":"111-116","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm"],"prefix":"10.1006","volume":"34","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"78","container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731596900490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731596900490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:49:22Z","timestamp":1760046562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731596900490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["S0743731596900490"],"URL":"https:\/\/doi.org\/10.1006\/jpdc.1996.0049","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1996,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1006\/jpdc.1996.0049","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Academic Press. All rights reserved.","name":"copyright","label":"Copyright"}]}}