{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:45Z","timestamp":1781463285837,"version":"3.54.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000145","name":"National Science Foundation Division of Information and Intelligent Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.011","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:26:41Z","timestamp":1779449201000},"page":"382-391","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Metric dimension and resolvability of Jaccard spaces"],"prefix":"10.1016","volume":"391","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-6845","authenticated-orcid":false,"given":"Manuel E.","family":"Lladser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander J.","family":"Paradise","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.05.011_b1","series-title":"The Probabilistic Method","author":"Alon","year":"2004"},{"key":"10.1016\/j.dam.2026.05.011_b2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s40315-013-0024-0","article-title":"The metric dimension of metric spaces","volume":"13","author":"Bau","year":"2013","journal-title":"Comput. Methods Funct. Theory"},{"key":"10.1016\/j.dam.2026.05.011_b3","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1016\/j.dam.2013.02.012","article-title":"Resolving the Hypercube","volume":"161","author":"Beardon","year":"2013","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.05.011_b4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","article-title":"Resolvability in graphs and the metric dimension of a graph","volume":"105","author":"Chartrand","year":"2000","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.05.011_b5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1112\/S0025579300005222","article-title":"On the dimension of a graph","volume":"12","author":"Erd\u00f6s","year":"1965","journal-title":"Mathematika"},{"key":"10.1016\/j.dam.2026.05.011_b6","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2026.05.011_b7","doi-asserted-by":"crossref","first-page":"pp 174","DOI":"10.1038\/239174c0","article-title":"Distance between sets","volume":"239","author":"Gilbert","year":"1972","journal-title":"Nature"},{"key":"10.1016\/j.dam.2026.05.011_b8","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2026.05.011_b9","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.jda.2011.12.010","article-title":"Approximation complexity of metric dimension problem","volume":"14","author":"Hauptmann","year":"2012","journal-title":"J. Discrete Algorithms"},{"issue":"142","key":"10.1016\/j.dam.2026.05.011_b10","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des alpes et du jura","volume":"37","author":"Jaccard","year":"1901","journal-title":"Bull. Soci\u00e9t\u00e9 Vaudoise Sci. Nat."},{"key":"10.1016\/j.dam.2026.05.011_b11","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.dam.2026.05.011_b12","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1997"},{"key":"10.1016\/j.dam.2026.05.011_b13","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.patrec.2018.12.007","article-title":"A note on the triangle inequality for the Jaccard distance","volume":"120","author":"Kosub","year":"2019","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.dam.2026.05.011_b14","series-title":"Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results","author":"Kuziak","year":"2021"},{"issue":"4","key":"10.1016\/j.dam.2026.05.011_b15","doi-asserted-by":"crossref","first-page":"2063","DOI":"10.1137\/19M1274511","article-title":"Resolvability of Hamming graphs","volume":"34","author":"Laird","year":"2020","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.05.011_b16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2140\/pjm.1975.60.159","article-title":"A metric basis characterization of Euclidean space","volume":"60","author":"Murphy","year":"1975","journal-title":"Pac. J. Math."},{"key":"10.1016\/j.dam.2026.05.011_b17","series-title":"Quantitative Encoding of Bags-of-Words for Sentiment and Sarcasm Detection in Textual Data","author":"Paradise","year":"2024"},{"issue":"4","key":"10.1016\/j.dam.2026.05.011_b18","first-page":"1261","article-title":"Exact lower and upper bounds on the incomplete gamma function","volume":"23","author":"Pinelis","year":"2020","journal-title":"Math. Inequal. Appl."},{"issue":"1","key":"10.1016\/j.dam.2026.05.011_b19","first-page":"26","article-title":"A remark on Stirling\u2019s formula","volume":"62","author":"Robbins","year":"1955","journal-title":"Am. Math. Mon."},{"issue":"5","key":"10.1016\/j.dam.2026.05.011_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.113310","article-title":"Levenshtein graphs: Resolvability, automorphisms & determining sets","volume":"346","author":"Ruth","year":"2023","journal-title":"Discrete Math."},{"issue":"549\u2013559","key":"10.1016\/j.dam.2026.05.011_b21","first-page":"37","article-title":"Leaves of trees","volume":"14","author":"Slater","year":"1975","journal-title":"Congr. Numer."},{"issue":"10","key":"10.1016\/j.dam.2026.05.011_b22","doi-asserted-by":"crossref","first-page":"53881","DOI":"10.4249\/scholarpedia.53881","article-title":"Metric dimension","volume":"14","author":"Tillquist","year":"2019","journal-title":"Scholarpedia"},{"issue":"4","key":"10.1016\/j.dam.2026.05.011_b23","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1137\/21M1409512","article-title":"Getting the lay of the land in discrete space: A survey of metric dimension and its applications","volume":"65","author":"Tillquist","year":"2023","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.dam.2026.05.011_b24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00285-019-01348-1","article-title":"Low-dimensional representation of genomic sequences","volume":"79","author":"Tillquist","year":"2019","journal-title":"J. Math. Biol."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600291X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600291X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:06:22Z","timestamp":1781460382000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600291X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":24,"alternative-id":["S0166218X2600291X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.011","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Metric dimension and resolvability of Jaccard spaces","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}