{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:42:26Z","timestamp":1780634546558,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030865191","type":"print"},{"value":"9783030865207","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86520-7_33","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T15:25:48Z","timestamp":1631201148000},"page":"532-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["PATHATTACK: Attacking Shortest Paths in Complex Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1649-1401","authenticated-orcid":false,"given":"Benjamin A.","family":"Miller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6154-1466","authenticated-orcid":false,"given":"Zohair","family":"Shafi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1308-2311","authenticated-orcid":false,"given":"Wheeler","family":"Ruml","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2471-5345","authenticated-orcid":false,"given":"Yevgeniy","family":"Vorobeychik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1892-1188","authenticated-orcid":false,"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8446-4993","authenticated-orcid":false,"given":"Scott","family":"Alfeld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"issue":"6794","key":"33_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378\u2013382 (2000)","journal-title":"Nature"},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10107-005-0694-0","volume":"107","author":"W Ben-Ameur","year":"2006","unstructured":"Ben-Ameur, W., Neto, J.: A constraint generation algorithm for large scale linear programs using multiple-points separation. Math. Program. 107(3), 517\u2013537 (2006)","journal-title":"Math. Program."},{"issue":"48","key":"33_CR3","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proc. Nat. Acad. Sci. 115(48), E11221\u2013E11230 (2018)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"33_CR4","unstructured":"Bojchevski, A., G\u00fcnnemann, S.: Adversarial attacks on node embeddings via graph poisoning. In: ICML, pp. 695\u2013704 (2019)"},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"33_CR6","unstructured":"Jain, M., et al.: A double oracle algorithm for zero-sum security games on graphs. In: AAMAS, pp. 327\u2013334 (2011)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-1-4757-3758-5_6","volume-title":"Cooperative Control: Models, Applications and Algorithms","author":"M Jun","year":"2003","unstructured":"Jun, M., D\u2019Andrea, R.: Path planning for unmanned aerial vehicles in uncertain and adversarial environments. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds.) Cooperative Control: Models, Applications and Algorithms, pp. 95\u2013110. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/978-1-4757-3758-5_6"},{"key":"33_CR8","doi-asserted-by":"publisher","unstructured":"Kegelmeyer, W.P., Wendt, J.D., Pinar, A.: An example of counter-adversarial community detection analysis. Technical report, SAND2018-12068, Sandia National Laboratories (2018). https:\/\/doi.org\/10.2172\/1481570","DOI":"10.2172\/1481570"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/sdata.2018.209","volume":"5","author":"H Kim","year":"2018","unstructured":"Kim, H., Olave-Rojas, D., \u00c1lvarez-Miranda, E., Son, S.W.: In-depth data on the network structure and hourly activity of the central Chilean power grid. Sci. Data 5(1), 1\u201310 (2018)","journal-title":"Sci. Data"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD, pp. 177\u2013187 (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"key":"33_CR12","unstructured":"Letchford, J., Vorobeychik, Y.: Optimal interdiction of attack plans. In: AAMAS, pp. 199\u2013206 (2013)"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(02)00438-3","volume":"296","author":"E Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding the most vital node of a shortest path. Theoret. Comput. Sci. 296(1), 167\u2013177 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR14","unstructured":"Neu, G., Gyorgy, A., Szepesvari, C.: The adversarial stochastic shortest path problem with unknown transition probabilities. In: AISTATS, pp. 805\u2013813 (2012)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-22351-8_16","volume-title":"Scientific and Statistical Database Management","author":"M Qiao","year":"2011","unstructured":"Qiao, M., Cheng, H., Yu, J.X.: Querying shortest path distance with bounded errors in large graphs. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 255\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22351-8_16"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Rayner, D.C., Bowling, M., Sturtevant, N.: Euclidean heuristic optimization. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7815"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Speicher, P., Steinmetz, M., Backes, M., Hoffmann, J., K\u00fcnnemann, R.: Stackelberg planning: towards effective leader-follower state space search. In: AAAI, pp. 6286\u20136293 (2018)","DOI":"10.1609\/aaai.v32i1.12090"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Tong, H., Prakash, B.A., Eliassi-Rad, T., Faloutsos, M., Faloutsos, C.: Gelling, and melting, large graphs by edge manipulation. In: CIKM, pp. 245\u2013254 (2012)","DOI":"10.1145\/2396761.2396795"},{"key":"33_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"issue":"2","key":"33_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/opre.43.2.243","volume":"43","author":"A Washburn","year":"1995","unstructured":"Washburn, A., Wood, K.: Two-person zero-sum games for network interdiction. Oper. Res. 43(2), 243\u2013251 (1995)","journal-title":"Oper. Res."},{"key":"33_CR21","unstructured":"West, R., Pineau, J., Precup, D.: Wikispeedia: an online game for inferring semantic distances between concepts. In: IJCAI (2009)"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner, D., Akbarnejad, A., G\u00fcnnemann, S.: Adversarial attacks on neural networks for graph data. In: KDD, pp. 2847\u20132856 (2018)","DOI":"10.1145\/3219819.3220078"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner, D., G\u00fcnnemann, S.: Certifiable robustness and robust training for graph convolutional networks. In: KDD, pp. 246\u2013256 (2019)","DOI":"10.1145\/3292500.3330905"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86520-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T22:06:20Z","timestamp":1757369180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86520-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865191","9783030865207"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86520-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"869","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"210","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}