{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:53:48Z","timestamp":1772502828779,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2121952"],"award-info":[{"award-number":["CCF-2121952"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1991\/1"],"award-info":[{"award-number":["1991\/1"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538414","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Can't See the Forest for the Trees"],"prefix":"10.1145","author":[{"given":"Omri","family":"Kahalon","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Hung","family":"Le","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]},{"given":"Lazar","family":"Milenkovi\u0107","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Shay","family":"Solomon","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371039"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham and Cyril Gavoille. 2006. Object location using path separators. In PODC. ACM 188--197.  Ittai Abraham and Cyril Gavoille. 2006. Object location using path separators. In PODC. ACM 188--197.","DOI":"10.1145\/1146381.1146411"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.72"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham and Dahlia Malkhi. 2004. Compact routing on euclidian metrics. In PODC. ACM 141--149.  Ittai Abraham and Dahlia Malkhi. 2004. Compact routing on euclidian metrics. In PODC. ACM 141--149.","DOI":"10.1145\/1011767.1011789"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940874"},{"key":"e_1_3_2_2_6_1","unstructured":"Noga Alon and Baruch Schieber. 1987. Optimal preprocessing for answering on-line product queries. Citeseer.  Noga Alon and Baruch Schieber. 1987. Optimal preprocessing for answering on-line product queries. Citeseer."},{"key":"e_1_3_2_2_7_1","volume-title":"Esben Bistrup Halvorsen, and Kasper Green Larsen","author":"Alstrup Stephen","year":"2014","unstructured":"Stephen Alstrup , Esben Bistrup Halvorsen, and Kasper Green Larsen . 2014 . Near-optimal labeling schemes for nearest common ancestors. In SODA. SIAM , 972--982. Stephen Alstrup, Esben Bistrup Halvorsen, and Kasper Green Larsen. 2014. Near-optimal labeling schemes for nearest common ancestors. In SODA. SIAM, 972--982."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing (STOC '95)","author":"Arya S.","unstructured":"S. Arya , G. Das , D. M. Mount , J. S. Salowe , and M. Smid . 1995. Euclidean Spanners: Short, Thin, and Lanky . In Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing (STOC '95) . 489--498. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. 1995. Euclidean Spanners: Short, Thin, and Lanky. In Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing (STOC '95). 489--498."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523237"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323621"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Baruch Awerbuch Amotz Bar-Noy Nathan Linial and David Peleg. 1989. Compact Distributed Data Structures for Adaptive Routing (Extended Abstract). In STOC. ACM 479--489.  Baruch Awerbuch Amotz Bar-Noy Nathan Linial and David Peleg. 1989. Compact Distributed Data Structures for Adaptive Routing (Extended Abstract). In STOC. ACM 479--489.","DOI":"10.1145\/73007.73053"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90017-9"},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC'90)","author":"Awerbuch B.","unstructured":"B. Awerbuch , A. Baratz , and D. Peleg . 1990. Cost-sensitive analysis of communication protocols . In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC'90) . 177--187. B. Awerbuch, A. Baratz, and D. Peleg. 1990. Cost-sensitive analysis of communication protocols. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC'90). 177--187."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405013"},{"key":"e_1_3_2_2_17_1","volume-title":"46th International Colloquium on Automata, Languages, and Programming (ICALP'19)","author":"Bartal Y.","year":"2019","unstructured":"Y. Bartal , N. Fandina , and O. Neiman . 2019. Covering Metric Spaces by Few Trees. In 46th International Colloquium on Automata, Languages, and Programming (ICALP'19) . 20:1--20:16. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP. 2019 .20 10.4230\/LIPIcs.ICALP.2019.20 Y. Bartal, N. Fandina, and O. Neiman. 2019. Covering Metric Spaces by Few Trees. In 46th International Colloquium on Automata, Languages, and Programming (ICALP'19). 20:1--20:16. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.20"},{"key":"e_1_3_2_2_18_1","volume-title":"precise and dynamic distance queries","author":"Bartal Yair","unstructured":"Yair Bartal , Lee-Ad Gottlieb , Tsvi Kopelowitz , Moshe Lewenstein , and Liam Roditty . 2011. Fast , precise and dynamic distance queries . In SODA. SIAM , 840--853. Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, and Liam Roditty. 2011. Fast, precise and dynamic distance queries. In SODA. SIAM, 840--853."},{"key":"e_1_3_2_2_19_1","volume-title":"SODA","author":"Ben-Levy Uri","unstructured":"Uri Ben-Levy and Merav Parter . 2020. New () Spanners and Hopsets. In SODA . SIAM , 1695--1714. Uri Ben-Levy and Merav Parter. 2020. New () Spanners and Hopsets. In SODA. SIAM, 1695--1714."},{"key":"e_1_3_2_2_20_1","volume-title":"Latin American Symposium on Theoretical Informatics (LATIN '00)","author":"Bender M. A.","year":"1983","unstructured":"M. A. Bender and M. Farach-Colton . 2000. The LCA problem revisited . In Latin American Symposium on Theoretical Informatics (LATIN '00) . 88--94. https: \/\/doi.org\/10.1007\/107 1983 9_9 10.1007\/10719839_9 M. A. Bender and M. Farach-Colton. 2000. The LCA problem revisited. In Latin American Symposium on Theoretical Informatics (LATIN '00). 88--94. https: \/\/doi.org\/10.1007\/10719839_9"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.05.002"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Aaron Bernstein. 2009. Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. In FOCS. IEEE Computer Society 693--702.  Aaron Bernstein. 2009. Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. In FOCS. IEEE Computer Society 693--702.","DOI":"10.1109\/FOCS.2009.16"},{"key":"e_1_3_2_2_23_1","volume-title":"Greedy spanners are optimal in doubling metrics. CoRR abs\/1712.05007","author":"Borradaile Glencora","year":"2017","unstructured":"Glencora Borradaile , Hung Le , and Christian Wulff-Nilsen . 2017. Greedy spanners are optimal in doubling metrics. CoRR abs\/1712.05007 ( 2017 ). arXiv:1712.05007 http:\/\/arxiv.org\/abs\/1712.05007 Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen. 2017. Greedy spanners are optimal in doubling metrics. CoRR abs\/1712.05007 (2017). arXiv:1712.05007 http:\/\/arxiv.org\/abs\/1712.05007"},{"key":"e_1_3_2_2_24_1","volume-title":"The 5th International Conference on Open Architectures and Network Programming (OPENARCH'02)","author":"Braynard R.","unstructured":"R. Braynard , D. Kostic , A. Rodriguez , J. Chase , and A. Vahdat . 2002. Opus: an Overlay Peer Utility Service . In The 5th International Conference on Open Architectures and Network Programming (OPENARCH'02) . R. Braynard, D. Kostic, A. Rodriguez, J. Chase, and A. Vahdat. 2002. Opus: an Overlay Peer Utility Service. In The 5th International Conference on Open Architectures and Network Programming (OPENARCH'02)."},{"key":"e_1_3_2_2_25_1","volume-title":"Westbrook","author":"Buchsbaum Adam L.","year":"1998","unstructured":"Adam L. Buchsbaum , Haim Kaplan , Anne Rogers , and Jeffery R . Westbrook . 1998 . Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. In STOC. ACM , 279--288. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, and Jeffery R. Westbrook. 1998. Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. In STOC. ACM, 279--288."},{"key":"e_1_3_2_2_26_1","article-title":"On Hierarchical Routing in Doubling Metrics","volume":"12","author":"Hubert Chan T.-H.","year":"2016","unstructured":"T.-H. Hubert Chan , Anupam Gupta , Bruce M. Maggs , and Shuheng Zhou . 2016 . On Hierarchical Routing in Doubling Metrics . ACM Trans. Algorithms 12 , 4 (2016), 55:1--55:22. Preliminary version appeared in SODA 2005.. T.-H. Hubert Chan, Anupam Gupta, Bruce M. Maggs, and Shuheng Zhou. 2016. On Hierarchical Routing in Doubling Metrics. ACM Trans. Algorithms 12, 4 (2016), 55:1--55:22. Preliminary version appeared in SODA 2005..","journal-title":"ACM Trans. Algorithms"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9115-5"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/130930984"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.02.008"},{"key":"e_1_3_2_2_30_1","volume-title":"Proceedings of the Eighth Annual Symposium on Computational Geometry.","author":"Chandra B.","unstructured":"B. Chandra , G. Das , G. Narasimhan , and J. Soares . 1992. New Sparseness Results on Graph Spanners . In Proceedings of the Eighth Annual Symposium on Computational Geometry. B. Chandra, G. Das, G. Narasimhan, and J. Soares. 1992. New Sparseness Results on Graph Spanners. In Proceedings of the Eighth Annual Symposium on Computational Geometry."},{"key":"e_1_3_2_2_31_1","volume-title":"Computing on a Free Tree via Complexity-Preserving Mappings","author":"Chazelle Bernard","unstructured":"Bernard Chazelle . 1984. Computing on a Free Tree via Complexity-Preserving Mappings . In FOCS. IEEE Computer Society , 358--368. Bernard Chazelle. 1984. Computing on a Free Tree via Complexity-Preserving Mappings. In FOCS. IEEE Computer Society, 358--368."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840366"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355562"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Shiri Chechik. 2013. Compact routing schemes with improved stretch. In PODC. ACM 33--41.  Shiri Chechik. 2013. Compact routing schemes with improved stretch. In PODC. ACM 33--41.","DOI":"10.1145\/2484239.2484268"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Shiri Chechik. 2014. Approximate distance oracles with constant query time. In STOC. ACM 654--663.  Shiri Chechik. 2014. Approximate distance oracles with constant query time. In STOC. ACM 654--663.","DOI":"10.1145\/2591796.2591801"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Shiri Chechik. 2015. Approximate Distance Oracles with Improved Bounds. In STOC. ACM 1--10.  Shiri Chechik. 2015. Approximate Distance Oracles with Improved Bounds. In STOC. ACM 1--10.","DOI":"10.1145\/2746539.2746562"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10534"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28402"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331610"},{"key":"e_1_3_2_2_40_1","volume-title":"Proceedings of the 38th annual ACM Symposium on Theory of Computing (STOC '06)","author":"Cole R.","unstructured":"R. Cole and L. Gottlieb . 2006. Searching dynamic point sets in spaces with bounded doubling dimension . In Proceedings of the 38th annual ACM Symposium on Theory of Computing (STOC '06) . https:\/\/doi.org\/10.1145\/1132516.1132599 10.1145\/1132516.1132599 R. Cole and L. Gottlieb. 2006. Searching dynamic point sets in spaces with bounded doubling dimension. In Proceedings of the 38th annual ACM Symposium on Theory of Computing (STOC '06). https:\/\/doi.org\/10.1145\/1132516.1132599"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1134"},{"key":"e_1_3_2_2_42_1","volume-title":"Pemmaraju","author":"Damian Mirela","year":"2006","unstructured":"Mirela Damian , Saurav Pandit , and Sriram V . Pemmaraju . 2006 . Distributed Spanner Construction in Doubling Metric Spaces. In OPODIS (Lecture Notes in Computer Science , Vol. 4305). Springer, 157-- 171 . Mirela Damian, Saurav Pandit, and Sriram V. Pemmaraju. 2006. Distributed Spanner Construction in Doubling Metric Spaces. In OPODIS (Lecture Notes in Computer Science, Vol. 4305). Springer, 157--171."},{"key":"e_1_3_2_2_43_1","volume-title":"Pemmaraju","author":"Damian Mirela","year":"2006","unstructured":"Mirela Damian , Saurav Pandit , and Sriram V . Pemmaraju . 2006 . Local approximation schemes for topology control. In PODC. ACM , 208--217. Mirela Damian, Saurav Pandit, and Sriram V. Pemmaraju. 2006. Local approximation schemes for topology control. In PODC. ACM, 208--217."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221070"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00002-6"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Michael Elkin Arnold Filtser and Ofer Neiman. 2020. Distributed Construction of Light Networks. In PODC. ACM 483--492.  Michael Elkin Arnold Filtser and Ofer Neiman. 2020. Distributed Construction of Light Networks. In PODC. ACM 483--492.","DOI":"10.1145\/3382734.3405701"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2819008"},{"key":"e_1_3_2_2_48_1","volume-title":"Optimal Spanners for Unit Ball Graphs in Doubling Metrics. CoRR abs\/2106.15234","author":"Eppstein David","year":"2021","unstructured":"David Eppstein and Hadi Khodabandeh . 2021. Optimal Spanners for Unit Ball Graphs in Doubling Metrics. CoRR abs\/2106.15234 ( 2021 ). David Eppstein and Hadi Khodabandeh. 2021. Optimal Spanners for Unit Ball Graphs in Doubling Metrics. CoRR abs\/2106.15234 (2021)."},{"key":"e_1_3_2_2_49_1","volume-title":"62nd FOCS.","author":"Filtser Arnold","unstructured":"Arnold Filtser . 2021. Hop-Constrained Metric Embeddings and their Applications . In 62nd FOCS. Arnold Filtser. 2021. Hop-Constrained Metric Embeddings and their Applications. In 62nd FOCS."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1210678"},{"key":"e_1_3_2_2_51_1","volume-title":"Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICAL '01. 757--772","author":"Fraigniaud F.","unstructured":"F. Fraigniaud and C. Gavoille . 2001. Routing in Trees . In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICAL '01. 757--772 . https:\/\/doi.org\/10.1007\/3--540--48224--5_62 10.1007\/3--540--48224--5_62 F. Fraigniaud and C. Gavoille. 2001. Routing in Trees. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICAL '01. 757--772. https:\/\/doi.org\/10.1007\/3--540--48224--5_62"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80064-9"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087804"},{"key":"e_1_3_2_2_55_1","volume-title":"Proc. of 20th SoCG. 190--199","author":"Gao J.","unstructured":"J. Gao , L. J. Guibas , and A. Nguyen . 2004. Deformable spanners and applications . In Proc. of 20th SoCG. 190--199 . J. Gao, L. J. Guibas, and A. Nguyen. 2004. Deformable spanners and applications. In Proc. of 20th SoCG. 190--199."},{"key":"e_1_3_2_2_56_1","volume-title":"MST, and Min-Cut","author":"Ghaffari Mohsen","unstructured":"Mohsen Ghaffari and Bernhard Haeupler . 2016. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts , MST, and Min-Cut . In SODA. SIAM , 202--219. Mohsen Ghaffari and Bernhard Haeupler. 2016. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. In SODA. SIAM, 202--219."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari and Bernhard Haeupler. 2021. Low-Congestion Shortcuts for Graphs Excluding Dense Minors. In PODC. ACM 213--221.  Mohsen Ghaffari and Bernhard Haeupler. 2021. Low-Congestion Shortcuts for Graphs Excluding Dense Minors. In PODC. ACM 213--221.","DOI":"10.1145\/3465084.3467935"},{"key":"e_1_3_2_2_58_1","first-page":"1","article-title":"Near-Optimal Distributed DFS in Planar Graphs. In DISC (LIPIcs, Vol. 91)","volume":"21","author":"Ghaffari Mohsen","year":"2017","unstructured":"Mohsen Ghaffari and Merav Parter . 2017 . Near-Optimal Distributed DFS in Planar Graphs. In DISC (LIPIcs, Vol. 91) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 21 : 1 -- 21 :16. Mohsen Ghaffari and Merav Parter. 2017. Near-Optimal Distributed DFS in Planar Graphs. In DISC (LIPIcs, Vol. 91). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 21:1--21:16.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.52"},{"key":"e_1_3_2_2_60_1","volume-title":"Proceedings of the 19th Annual","author":"Gottlieb L.","unstructured":"L. Gottlieb and L. Roditty . 2008. Improved Algorithms for Fully Dynamic Geometric Spanners and Geometric Routing . In Proceedings of the 19th Annual L. Gottlieb and L. Roditty. 2008. Improved Algorithms for Fully Dynamic Geometric Spanners and Geometric Routing. In Proceedings of the 19th Annual"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538414","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538414","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538414"}},"subtitle":["Navigating Metric Spaces by Bounded Hop-Diameter Spanners"],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":59,"alternative-id":["10.1145\/3519270.3538414","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538414","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}