{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:58Z","timestamp":1772164078664,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research","award":["DE-SC0024386"],"award-info":[{"award-number":["DE-SC0024386"]}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1745301, CAREER-2045641, CNS-2102963, CNS-2106299, CNS-2146814, CPS-2136197, CPS-2136199, NGSDI-2105494, NGSDI-2105648, CNS-2325956, 2020888, 2021693, 2045641, 2213636, 2211888"],"award-info":[{"award-number":["DGE-1745301, CAREER-2045641, CNS-2102963, CNS-2106299, CNS-2146814, CPS-2136197, CPS-2136199, NGSDI-2105494, NGSDI-2105648, CNS-2325956, 2020888, 2021693, 2045641, 2213636, 2211888"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/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":[[2025,6,9]]},"DOI":"10.1145\/3726854.3727292","type":"proceedings-article","created":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T09:46:42Z","timestamp":1749030402000},"page":"169-171","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7774-9939","authenticated-orcid":false,"given":"Adam","family":"Lechowicz","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, Massachusetts, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8330-8964","authenticated-orcid":false,"given":"Nicolas","family":"Christianson","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Pasadena, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3172-7811","authenticated-orcid":false,"given":"Bo","family":"Sun","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9304-910X","authenticated-orcid":false,"given":"Noman","family":"Bashir","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-2254","authenticated-orcid":false,"given":"Mohammad","family":"Hajiesmaili","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, Massachusetts, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5923-0199","authenticated-orcid":false,"given":"Adam","family":"Wierman","sequence":"additional","affiliation":[{"name":"California Institute of Technology, Pasadena, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5435-1901","authenticated-orcid":false,"given":"Prashant","family":"Shenoy","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, Massachusetts, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"3","article-title":"A tight bound on approximating arbitrary metrics by tree metrics","volume":"69","author":"Fakcharoenphol Jittat","year":"2007","unstructured":"Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. 2007. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci., Vol. 69, 3 (October 2007).","journal-title":"J. Comput. System Sci."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3711701"}],"event":{"name":"SIGMETRICS '25: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"Stony Brook NY USA","acronym":"SIGMETRICS '25","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstracts of the 2025 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726854.3727292","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726854.3727292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T22:22:28Z","timestamp":1752704548000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726854.3727292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":2,"alternative-id":["10.1145\/3726854.3727292","10.1145\/3726854"],"URL":"https:\/\/doi.org\/10.1145\/3726854.3727292","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3744970.3727292","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"2025-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}