{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:27:11Z","timestamp":1757615231062,"version":"3.44.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6041,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-9208913"],"award-info":[{"award-number":["CCR-9208913"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/0012-365x(95)00314-m","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"173-200","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["A (3 + ) competitive algorithm for the counterfeit coin problem"],"prefix":"10.1016","volume":"163","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00314-M_BIB1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1080\/00029890.1963.11990056","article-title":"Balance scale sorting","volume":"70","author":"Cairns","year":"1963","journal-title":"Amer. Math. Monthly"},{"year":"1993","author":"Du","series-title":"Combinatoria' Group Testing and its Applications","key":"10.1016\/0012-365X(95)00314-M_BIB2"},{"issue":"5","key":"10.1016\/0012-365X(95)00314-M_BIB3","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1137\/S0097539793246690","article-title":"On Competitive Group Testing","volume":"23","author":"Du","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00314-M_BIB4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(94)90122-8","article-title":"A new competitive algorithm for the counterfeit coin problem","volume":"51","author":"Hu","year":"1994","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0012-365X(95)00314-M_BIB5","series-title":"Minimax and Applications","first-page":"241","article-title":"A competitive algorithm for the counterfeit coin problem","author":"Hu","year":"1995"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500314M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500314M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:34:32Z","timestamp":1757079272000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500314M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["0012365X9500314M"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00314-m","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A  competitive algorithm for the counterfeit coin problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(95)00314-M","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}