{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:41:31Z","timestamp":1774435291793,"version":"3.50.1"},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1137\/0222071","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:38:56Z","timestamp":1109227136000},"page":"1199-1217","source":"Crossref","is-referenced-by-count":75,"title":["Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths"],"prefix":"10.1137","volume":"22","author":[{"given":"David R.","family":"Karger","sequence":"first","affiliation":[]},{"given":"Daphne","family":"Koller","sequence":"additional","affiliation":[]},{"given":"Steven J.","family":"Phillips","sequence":"additional","affiliation":[]}],"member":"351","reference":[{"key":"R1","first-page":"569","volume-title":"32nd Annual Symposium on Foundations of Computer Science (San Juan, PR, 1991)","author":"Alon Noga","year":"1991"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/363269.363610"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102788"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0205006"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1977.57"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/0218069"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.4.557"},{"key":"R19","volume-title":"Introduction to automata theory, languages, and computation","author":"Hopcroft John E.","year":"1979"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90002-3"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579443"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553908"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190847"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758778"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1137\/0202004"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"R34","volume-title":"Linear and combinatorial optimization in ordered algebraic structures","author":"Zimmerman U.","year":"1981"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0222071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T12:26:47Z","timestamp":1485692807000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0222071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["10.1137\/0222071"],"URL":"https:\/\/doi.org\/10.1137\/0222071","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}