{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T20:31:16Z","timestamp":1787085076639,"version":"build-2736575974"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["ADVANCED 153096"],"award-info":[{"award-number":["ADVANCED 153096"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015498","name":"Innov\u00e1ci\u00f3s \u00e9s Technol\u00f3giai Miniszt\u00e9rium","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100015498","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","award":["KKP-133819"],"award-info":[{"award-number":["KKP-133819"]}],"id":[{"id":"10.13039\/501100011019","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,11]]},"DOI":"10.1016\/j.dam.2026.06.018","type":"journal-article","created":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T11:29:40Z","timestamp":1783078180000},"page":"162-173","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Finding the diameter of a tree with distance queries"],"prefix":"10.1016","volume":"393","author":[{"given":"D\u00e1niel","family":"Gerbner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e1s","family":"Imolay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9504-7551","authenticated-orcid":false,"given":"Kartal","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bal\u00e1zs","family":"Patk\u00f3s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krist\u00f3f","family":"Z\u00f3lomy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.06.018_b1","unstructured":"H. Abasi, B. Nader, On Learning Graphs with Edge-Detecting Queries, in: Proceedings of the 30th International Conference on Algorithmic Learning Theory, PMLR 98:3-30, 2019."},{"issue":"2","key":"10.1016\/j.dam.2026.06.018_b2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/S0097539702420139","article-title":"Learning a hidden matching","volume":"33","author":"Alon","year":"2004","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.dam.2026.06.018_b3","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","volume":"74","author":"Angluin","year":"2008","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/j.dam.2026.06.018_b4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1089\/cmb.1996.3.425","article-title":"Poisson process approximation for sequence repeats, and sequencing by hybridization","volume":"3","author":"Arratia","year":"1996","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.dam.2026.06.018_b5","series-title":"29th Annual European Symposium on Algorithms (ESA 2021)","first-page":"7:1","article-title":"Graph connectivity and single element recovery via linear and or queries","author":"Assadi","year":"2021"},{"key":"10.1016\/j.dam.2026.06.018_b6","series-title":"Distance reconstruction of sparse random graphs","author":"Bastide","year":"2024"},{"key":"10.1016\/j.dam.2026.06.018_b7","unstructured":"P. Bastide, C. Groenland, Quasi-linear distance query reconstruction for graphs of bounded treelength, in: \u00c9douard Bonnet, Pawe\u0142 Rza\u017cewski (Eds.), in: 19th International Symposium on Parameterized and Exact Computation (IPEC 2024), vol. 20, 20, pp. 20:1\u201320:11."},{"key":"10.1016\/j.dam.2026.06.018_b8","series-title":"Optimal distance query reconstruction for graphs without long induced cycles","author":"Bastide","year":"2023"},{"issue":"12","key":"10.1016\/j.dam.2026.06.018_b9","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","article-title":"Network discovery and verification","volume":"24","author":"Beerliova","year":"2006","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.dam.2026.06.018_b10","unstructured":"R. Coxteau, Finding the diameter of an unknown tree: Is BFS optimal?.https:\/\/mathoverflow.net\/questions\/479713\/finding-the-diameter-of-an-unknown-tree-is-bfs-optimal."},{"issue":"2","key":"10.1016\/j.dam.2026.06.018_b11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1089\/cmb.1994.1.105","article-title":"The probability of unique solutions of sequencing by hybridization","volume":"1","author":"Dyer","year":"1994","journal-title":"J. Comput. Biol."},{"issue":"1","key":"10.1016\/j.dam.2026.06.018_b12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jagm.1996.0035","article-title":"Determining the evolutionary tree using experiments","volume":"21","author":"Kannan","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/j.dam.2026.06.018_b13","series-title":"Reconstructing random graphs from distance queries","author":"Krivelevich","year":"2024"},{"issue":"12","key":"10.1016\/j.dam.2026.06.018_b14","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0167822","article-title":"On the reconstruction of text phylogeny trees: evaluation and analysis of textual relationships","volume":"11","author":"Marmerola","year":"2016","journal-title":"PLoS One"},{"issue":"4","key":"10.1016\/j.dam.2026.06.018_b15","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0895480103431071","article-title":"Learning a hidden subgraph","volume":"18","author":"N.\u00a0Alon","year":"2005","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.06.018_b16","doi-asserted-by":"crossref","unstructured":"L. Reyzin, N. Srivastava, Learning and verifying graphs using queries with a focus on edge counting. 8th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007. Proceedings 18 (pp. 285-297). Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-75225-7_24"},{"key":"10.1016\/j.dam.2026.06.018_b17","series-title":"Reconstruction of geometric random graphs with the simple algorithm","author":"Stegehuis","year":"2024"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003495?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003495?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T20:11:14Z","timestamp":1787083874000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":17,"alternative-id":["S0166218X26003495"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.018","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Finding the diameter of a tree with distance queries","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}