{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T05:19:25Z","timestamp":1672636765843},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:00:00Z","timestamp":1564963200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSPATIAL Special"],"published-print":{"date-parts":[[2019,8,5]]},"abstract":"\n ACM SIGSPATIAL Cup 2018 was the 7th GIS-focused algorithm contest hosted by the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2018). The contest explored the problem of analyzing large spatial networks (e.g., utility networks) in order to find\n upstream<\/jats:italic>\n features from a given set of starting points (a feature is considered to be upstream if it is on a simple path between a starting point and a controller).\n <\/jats:p>","DOI":"10.1145\/3355491.3355498","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:20:55Z","timestamp":1565094055000},"page":"32-35","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["ACM SIGSPATIAL cup 2018 - identifying upstream features in large spatial networks"],"prefix":"10.1145","volume":"11","author":[{"given":"Dev","family":"Oliver","sequence":"first","affiliation":[{"name":"Environmental Systems Research Institute (Esri)"}]},{"given":"Bo","family":"Xu","sequence":"additional","affiliation":[{"name":"HERE"}]},{"given":"Yuanyuan","family":"Pao","sequence":"additional","affiliation":[{"name":"Lyft"}]}],"member":"320","published-online":{"date-parts":[[2019,8,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139958.3139980"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3276476"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820879"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3276474"},{"key":"e_1_2_1_5_1","volume-title":"Esri Press Redlands","author":"Meehan B.","year":"2013"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274899"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"R. Tarjan. Depth-first search and linear graph algorithms. SIAM journal on computing 1(2):146--160 1972. R. Tarjan. Depth-first search and linear graph algorithms. SIAM journal on computing 1(2):146--160 1972.","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3276475"}],"container-title":["SIGSPATIAL Special"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3355491.3355498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T10:12:33Z","timestamp":1672567953000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3355491.3355498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,5]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,8,5]]}},"alternative-id":["10.1145\/3355491.3355498"],"URL":"https:\/\/doi.org\/10.1145\/3355491.3355498","relation":{},"ISSN":["1946-7729"],"issn-type":[{"value":"1946-7729","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,5]]},"assertion":[{"value":"2019-08-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}