{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:26Z","timestamp":1749873986310,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2348346","CCF-2402836"],"award-info":[{"award-number":["CCF-2348346","CCF-2402836"]}],"id":[{"id":"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,16]]},"DOI":"10.1145\/3732772.3733504","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"440-443","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7442-7002","authenticated-orcid":false,"given":"Peter","family":"Robinson","sequence":"first","affiliation":[{"name":"Augusta University, Augusta, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5279-5314","authenticated-orcid":false,"given":"Ming Ming","family":"Tan","sequence":"additional","affiliation":[{"name":"Augusta University, Augusta, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Wake-on-LAN https:\/\/en.wikipedia.org\/wiki\/Wake-on-LAN. Accessed: 2024-10-11","author":"Wikipedia LAN","unstructured":"2024. Wake-on-LAN \u2014 Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Wake-on-LAN https:\/\/en.wikipedia.org\/wiki\/Wake-on-LAN. Accessed: 2024-10-11."},{"key":"e_1_3_2_1_2_1","unstructured":"Advanced Micro Devices Inc. (AMD). 1995. Magic Packet Technology. Technical Report. https:\/\/www.amd.com\/content\/dam\/amd\/en\/documents\/archived-tech-docs\/white-papers\/20213.pdf https:\/\/www.amd.com\/content\/dam\/amd\/en\/documents\/archived-tech-docs\/white-papers\/20213.pdf. Accessed: 2024-10-11."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095156"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77618"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212774"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405718"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2024.41"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146410"},{"key":"e_1_3_2_1_9_1","volume-title":"Are sleep states effective in data centers?. In 2012 international green computing conference (IGCC)","author":"Gandhi Anshul","unstructured":"Anshul Gandhi, Mor Harchol-Balter, and Michael A Kozuch. 2012. Are sleep states effective in data centers?. In 2012 international green computing conference (IGCC). IEEE, 1\u201310."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.81"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767405"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699440"},{"key":"e_1_3_2_1_14_1","volume-title":"Tight Bounds on the Message Complexity of Distributed Tree Verification. arXiv preprint arXiv:2401.11991","author":"Kutten Shay","year":"2024","unstructured":"Shay Kutten, Peter Robinson, and Ming Ming Tan. 2024. Tight Bounds on the Message Complexity of Distributed Tree Verification. arXiv preprint arXiv:2401.11991 (2024)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467909"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.126"},{"key":"e_1_3_2_1_18_1","volume-title":"Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks. arXiv preprint arXiv:2410.09980","author":"Robinson Peter","year":"2024","unstructured":"Peter Robinson and Ming Ming Tan. 2024. Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks. arXiv preprint arXiv:2410.09980 (2024)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733504","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:25:53Z","timestamp":1749824753000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":19,"alternative-id":["10.1145\/3732772.3733504","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733504","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}