{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:37:01Z","timestamp":1743151021093,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031534676"},{"type":"electronic","value":"9783031534683"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53468-3_38","type":"book-chapter","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T13:03:57Z","timestamp":1708347837000},"page":"452-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep Distance Sensitivity Oracles"],"prefix":"10.1007","author":[{"given":"Davin","family":"Jeong","sequence":"first","affiliation":[]},{"given":"Allison","family":"Gunby-Mann","sequence":"additional","affiliation":[]},{"given":"Sarel","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Maximilian","family":"Katzmann","sequence":"additional","affiliation":[]},{"given":"Chau","family":"Pham","sequence":"additional","affiliation":[]},{"given":"Arnav","family":"Bhakta","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Chin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"issue":"4","key":"38_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00446-002-0080-6","volume":"15","author":"Y Afek","year":"2002","unstructured":"Afek, Y., Bremler-Barr, A., Kaplan, H., Cohen, E., Merritt, M.: Restoration by path concatenation: fast recovery of MPLS paths. Dis. Comput. 15(4), 273\u2013283 (2002). https:\/\/doi.org\/10.1007\/s00446-002-0080-6","journal-title":"Dis. Comput."},{"key":"38_CR2","doi-asserted-by":"publisher","unstructured":"Baswana, S., Khanna, N.: Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs. Algorithmica 66, 18\u201350 (2013).https:\/\/doi.org\/10.1007\/s00453-012-9621-y","DOI":"10.1007\/s00453-012-9621-y"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Bernstein, A., Karger, D.R.: A nearly optimal oracle for avoiding failed vertices and edges. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May - 2 June 2009, pp. 101\u2013110. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536431","DOI":"10.1145\/1536414.1536431"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.econlet.2016.10.028","volume":"149","author":"P Billand","year":"2016","unstructured":"Billand, P., Bravard, C., Iyengar, S.S., Kumar, R., Sarangi, S.: Network connectivity under node failure. Econ. Lett. 149, 164\u2013167 (2016)","journal-title":"Econ. Lett."},{"key":"38_CR5","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Friedrich, T., Katzmann, M., Krohmer, A.: Hyperbolic embeddings for near-optimal greedy routing. ACM J. Exp. Algorithmics 25 (2020). https:\/\/doi.org\/10.1145\/3381751. https:\/\/doi.org\/10.1145\/3381751","DOI":"10.1145\/3381751"},{"issue":"9","key":"38_CR6","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"38_CR7","unstructured":"Cai, T., Luo, S., Xu, K., He, D., Liu, T.y., Wang, L.: Graphnorm: a principled approach to accelerating graph neural network training. In: International Conference on Machine Learning, pp. 1204\u20131215. PMLR (2021)"},{"key":"38_CR8","doi-asserted-by":"publisher","unstructured":"Chechik, S., Cohen, S.: Distance sensitivity oracles with subcubic preprocessing time and fast query time. In: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22-26 June 2020, pp. 1375\u20131388. ACM (2020). https:\/\/doi.org\/10.1145\/3357713.3384253","DOI":"10.1145\/3357713.3384253"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s00453-011-9543-0","volume":"63","author":"S Chechik","year":"2012","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: $$f$$-sensitivity distance oracles and routing schemes. Algorithmica 63, 861\u2013882 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9543-0","journal-title":"Algorithmica"},{"issue":"10","key":"38_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.3390\/ijgi11100514","volume":"11","author":"X Chen","year":"2022","unstructured":"Chen, X., et al.: Ndist2vec: node with landmark and new distance to vector method for predicting shortest path distance along road networks. ISPRS Int. J. Geo Inf. 11(10), 514 (2022)","journal-title":"ISPRS Int. J. Geo Inf."},{"issue":"1","key":"38_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-018-2163-9","volume":"19","author":"G Crichton","year":"2018","unstructured":"Crichton, G., Guo, Y., Pyysalo, S., Korhonen, A.: Neural networks for link prediction in realistic biomedical graphs: a multi-dimensional evaluation of graph embedding-based approaches. BMC Bioinform. 19(1), 1\u201311 (2018)","journal-title":"BMC Bioinform."},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Cvetkovski, A., Crovella, M.: Hyperbolic embedding and routing for dynamic graphs. In: IEEE INFOCOM 2009, pp. 1647\u20131655. IEEE (2009)","DOI":"10.1109\/INFCOM.2009.5062083"},{"issue":"5","key":"38_CR13","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/S0097539705429847","volume":"37","author":"C Demetrescu","year":"2008","unstructured":"Demetrescu, C., Thorup, M., Chowdhury, R.A., Ramachandran, V.: Oracles for distances avoiding a failed node or link. SIAM J. Comput. 37(5), 1299\u20131318 (2008). https:\/\/doi.org\/10.1137\/S0097539705429847","journal-title":"SIAM J. Comput."},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-319-62127-2_30","volume-title":"Algorithms and Data Structures","author":"R Duan","year":"2017","unstructured":"Duan, R., Zhang, T.: Improved distance sensitivity oracles via tree partitioning. In: WADS 2017. LNCS, vol. 10389, pp. 349\u2013360. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_30"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"38_CR16","doi-asserted-by":"publisher","unstructured":"Gu, Y., Ren, H.: Constructing a Distance Sensitivity Oracle in $$O(n^2.5794 M)$$ Time. In: Bansal, N., Merelli, E., Worrell, J. (eds.) 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Leibniz International Proceedings in Informatics (LIPIcs), vol. 198, pp. 76:1\u201376:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.76. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/14145","DOI":"10.4230\/LIPIcs.ICALP.2021.76"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Huang, S., Wang, Y., Zhao, T., Li, G.: A learning-based method for computing shortest path distances on road networks. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 360\u2013371. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00038"},{"key":"38_CR18","unstructured":"Jindal, I., Chen, X., Nokleby, M., Ye, J., et\u00a0al.: A unified neural network approach for estimating travel time and distance for a taxi trip. arXiv preprint arXiv:1710.04350 (2017)"},{"key":"38_CR19","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"38_CR20","doi-asserted-by":"publisher","unstructured":"Lincoln, A., Williams, V.V., Williams, R.R.: Tight hardness for shortest cycles and paths in sparse graphs. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7-10 January 2018, pp. 1236\u20131252. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.80","DOI":"10.1137\/1.9781611975031.80"},{"key":"38_CR21","unstructured":"Qi, J., Wang, W., Zhang, R., Zhao, Z.: A learning based approach to predict shortest-path distances. In: EDBT, pp. 367\u2013370 (2020)"},{"key":"38_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jcss.2021.08.005","volume":"123","author":"H Ren","year":"2022","unstructured":"Ren, H.: Improved distance sensitivity oracles with subcubic preprocessing time. J. Comput. Syst. Sci. 123, 159\u2013170 (2022). https:\/\/doi.org\/10.1016\/j.jcss.2021.08.005","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"38_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-018-2480-z","volume":"19","author":"Y Ren","year":"2018","unstructured":"Ren, Y., Ay, A., Kahveci, T.: Shortest path counting in probabilistic biological networks. BMC Bioinform. 19(1), 1\u201319 (2018)","journal-title":"BMC Bioinform."},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"Rizi, F.S., Schloetterer, J., Granitzer, M.: Shortest path distance approximation using deep learning techniques. In: 2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 1007\u20131014. IEEE (2018)","DOI":"10.1109\/ASONAM.2018.8508763"},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"38_CR26","doi-asserted-by":"crossref","unstructured":"Tian, X., Song, Y., Wang, X., Gong, X.: Shortest path based potential common friend recommendation in social networks. In: 2012 Second International Conference on Cloud and Green Computing, pp. 541\u2013548. IEEE (2012)","DOI":"10.1109\/CGC.2012.106"},{"key":"38_CR27","doi-asserted-by":"crossref","unstructured":"Ukkonen, A., Castillo, C., Donato, D., Gionis, A.: Searching the wikipedia with contextual information. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 1351\u20131352 (2008)","DOI":"10.1145\/1458082.1458274"},{"key":"38_CR28","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"38_CR29","unstructured":"Wang, H.S., Zhu, X., Peh, L.S., Malik, S.: Orion: a power-performance simulator for interconnection networks. In: 35th Annual IEEE\/ACM International Symposium on Microarchitecture, 2002.(MICRO-35), Proceedings., pp. 294\u2013305. IEEE (2002)"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, X., Mu, J., Liu, H., Zhang, X.: Graphnet: graph clustering with deep neural networks. In: ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3800\u20133804. IEEE (2021)","DOI":"10.1109\/ICASSP39728.2021.9413809"},{"key":"38_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, X., Sala, A., Zheng, H., Zhao, B.Y.: Efficient shortest paths on massive social graphs. In: 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), pp. 77\u201386. IEEE (2011)","DOI":"10.4108\/icst.collaboratecom.2011.247162"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications XII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53468-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T13:13:54Z","timestamp":1718630034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53468-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031534676","9783031534683"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53468-3_38","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Menton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}