{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:34:54Z","timestamp":1773707694452,"version":"3.50.1"},"publisher-location":"Providence, Rhode\n                    Island","reference-count":0,"publisher":"American Mathematical\n                    Society","isbn-type":[{"value":"9780821843833","type":"print"},{"value":"9781470417789","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7,28]]},"DOI":"10.1090\/dimacs\/074\/06","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:34:37Z","timestamp":1493246077000},"page":"141-174","source":"Crossref","is-referenced-by-count":11,"title":["Highway hierarchies star"],"prefix":"10.1090","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Dominik","family":"Schultes","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","The Shortest Path Problem"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:18:32Z","timestamp":1773703112000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/074\/06"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,28]]},"ISBN":["9780821843833","9781470417789"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/074\/06","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,28]]}}}