{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T13:08:52Z","timestamp":1769000932125,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6102,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/0012-365x(95)00153-n","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"115-125","source":"Crossref","is-referenced-by-count":17,"title":["Maximum planar sets that determine k distances"],"prefix":"10.1016","volume":"160","author":[{"given":"Paul","family":"Erd\u0151s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Fishburn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00153-N_BIB1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.2307\/2312883","article-title":"On a problem of P. Erd\u0151s","volume":"70","author":"Altman","year":"1963","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(95)00153-N_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02187820","article-title":"The number of different distances determined by a set of points in the Euclidean plane","volume":"7","author":"Chung","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0012-365X(95)00153-N_BIB3","doi-asserted-by":"crossref","first-page":"248","DOI":"10.2307\/2305092","article-title":"On sets of distances of n points","volume":"53","author":"Erd\u0151s","year":"1946","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(95)00153-N_BIB4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF00147368","article-title":"Convex nonagons with five intervertex distances","volume":"60","author":"Erd\u0151s","year":"1996","journal-title":"Geometriae Dedicata"},{"key":"10.1016\/0012-365X(95)00153-N_BIB5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0925-7721(94)00020-V","article-title":"Convex polygons with few intervertex distances","volume":"5","author":"Fishburn","year":"1995","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/0012-365X(95)00153-N_BIB6","article-title":"Convex polygons with few vertices","author":"Fishburn","year":"1992"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500153N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500153N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:28:39Z","timestamp":1556382519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500153N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0012365X9500153N"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00153-n","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}