{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:14Z","timestamp":1781028254810,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2129816"],"award-info":[{"award-number":["CCF-2129816"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800902","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1972-1983","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["From Hop Reduction to Sparsification for Negative Length Shortest Paths"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5488-2907","authenticated-orcid":false,"given":"Kent","family":"Quanrud","sequence":"first","affiliation":[{"name":"Purdue University, Department of Computer Science, West Lafayette, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6324-3404","authenticated-orcid":false,"given":"Navid","family":"Tajkhorshid","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Department of Computer Science, Urbana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00063"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3728631"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JDA.2017.01.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718179"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649614"},{"key":"e_1_3_2_1_8_1","volume-title":"Network Flow Theory","author":"Ford Lester R.","unstructured":"Lester R. Ford. 1956. Network Flow Theory.. RAND Corporation, Santa Monica, CA."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792231179"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.178"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.86"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_14_1","unstructured":"George Z. Li Jason Li Satish Rao and Junkai Zhang. 2025. Shortcutting for Negative-Weight Shortest Path. arxiv:2511.12714. arxiv:2511.12714"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of an International Symposium on the Theory of Switching","author":"Moore Edward F.","year":"1959","unstructured":"Edward F. Moore. 1959. The shortest path through a maze. In Proceedings of an International Symposium on the Theory of Switching 1957, Part II. Harvard University Press, Cambridge, Massachusetts."},{"key":"e_1_3_2_1_16_1","unstructured":"Kent Quanrud and Navid Tajkhorshid. 2025. From Hop Reduction to Sparsification for Negative Length Shortest Paths. arxiv:2511.18253. arxiv:2511.18253"},{"key":"e_1_3_2_1_17_1","unstructured":"Kent Quanrud and Navid Tajkhorshid. 2025. From Hop Reduction to Sparsification for Negative Length Shortest Paths (Full Version). arxiv:2511.18253. arxiv:2511.18253 Full version with appendix"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the Symposium on Information Networks. Polytechnic Press of the Polytechnic Institute of Brooklyn","author":"Shimbel Alfonso","year":"1955","unstructured":"Alfonso Shimbel. 1955. Structure in communication nets. In Proceedings of the Symposium on Information Networks. Polytechnic Press of the Polytechnic Institute of Brooklyn, New York, New York. 199\u2013203."}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800902","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:54:09Z","timestamp":1781027649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":18,"alternative-id":["10.1145\/3798129.3800902","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800902","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}