{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:56:40Z","timestamp":1781078200215,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF (National Science Foundation)","award":["CCF-2106759, CCF-1918989"],"award-info":[{"award-number":["CCF-2106759, CCF-1918989"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649614","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Single-Source Shortest Paths with Negative Real Weights in\n            <i>\n              \u00d5(\ud835\udc5a\ud835\udc5b\n              <sup>8\/9<\/sup>\n              )\n            <\/i>\n            Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7483-4532","authenticated-orcid":false,"given":"Jeremy T.","family":"Fineman","sequence":"first","affiliation":[{"name":"Georgetown University, WASHINGTON, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00018"},{"key":"e_1_3_2_1_2_1","volume-title":"On a Routing Problem. Quart. Appl. Math., 16, 1","author":"Bellman Richard","year":"1958","unstructured":"Richard Bellman. 1958. On a Routing Problem. Quart. Appl. Math., 16, 1 (1958)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00063"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00038"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.48"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, 3rd Edition. MIT Press. isbn:978-0-262-03384-8","edition":"3"},{"key":"e_1_3_2_1_8_1","volume-title":"C","author":"Dinitz Yefim","year":"2017","unstructured":"Yefim Dinitz and Rotem Itzhak. 2017. Hybrid Bellman-Ford-Dijkstra Algorithm. J. of Discrete Algorithms, 42, C (2017), jan, 35\u201344. issn:1570\u20138667"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00035"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00099"},{"key":"e_1_3_2_1_11_1","unstructured":"Lester R. Ford. 1956. Paper P-923. Network Flow Theory."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.68"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218069"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792231179"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.92"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the International Symposium on the Theory of Switching. 285\u2013292","author":"Moore Edward F.","year":"1959","unstructured":"Edward F. Moore. 1959. The Shortest Path Through a Maze. In Proceedings of the International Symposium on the Theory of Switching. 285\u2013292."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702419650"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the Symposium on Information Networks. 199\u2013203","author":"Shimbel Alfonso","year":"1955","unstructured":"Alfonso Shimbel. 1955. Structure in Communication Nets. In Proceedings of the Symposium on Information Networks. 199\u2013203."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00090"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649614","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:47Z","timestamp":1750178207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":21,"alternative-id":["10.1145\/3618260.3649614","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649614","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}