{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T11:23:41Z","timestamp":1787570621379,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091192","type":"print"},{"value":"9783032091208","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09120-8_1","type":"book-chapter","created":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:05Z","timestamp":1763466725000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Weak Independent Sets in\u00a0Hypergraphs: Upper and\u00a0Lower Bounds"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3343-2435","authenticated-orcid":false,"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7723-9090","authenticated-orcid":false,"given":"Will","family":"Rosenbaum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: FOCS, vol. 30, pp. 364\u2013369. Citeseer (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3461458","volume":"68","author":"A Balliu","year":"2021","unstructured":"Balliu, A., Brandt, S., Hirvonen, J., Olivetti, D., Rabie, M., Suomela, J.: Lower bounds for maximal matchings and maximal independent sets. J. ACM (JACM) 68(5), 1\u201330 (2021)","journal-title":"J. ACM (JACM)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Balliu, A., Brandt, S., Kuhn, F., Olivetti, D.: Distributed maximal matching and maximal independent set on hypergraphs, pp. 2632\u20132676 (2023)","DOI":"10.1137\/1.9781611977554.ch100"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Balliu, A., Brandt, S., Kuhn, F., Olivetti, D.: Improved distributed lower bounds for mis and bounded (out-) degree dominating sets in trees. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 283\u2013293 (2021)","DOI":"10.1145\/3465084.3467901"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/20M1381770","volume":"51","author":"A Balliu","year":"2022","unstructured":"Balliu, A., Brandt, S., Olivetti, D.: Distributed lower bounds for ruling sets. SIAM J. Comput. 51(1), 70\u2013115 (2022)","journal-title":"SIAM J. Comput."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Distributed ($$\\delta $$+ 1)-coloring in linear (in $$\\delta $$) time. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 111\u2013120 (2009)","DOI":"10.1145\/1536414.1536432"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2903137","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM (JACM) 63(3), 1\u201345 (2016)","journal-title":"J. ACM (JACM)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Brandt, S.: An automatic speedup theorem for distributed problems. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 379\u2013388 (2019)","DOI":"10.1145\/3293611.3331611"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Brandt, S., et al.: A lower bound for the distributed lov\u00e1sz local lemma. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 479\u2013488 (2016)","DOI":"10.1145\/2897518.2897570"},{"issue":"2","key":"1_CR10","first-page":"609","volume":"10","author":"P Erdos","year":"1975","unstructured":"Erdos, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Infinite Finite Sets 10(2), 609\u2013627 (1975)","journal-title":"Infinite Finite Sets"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 270\u2013277. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch20"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Grunau, C.: Near-optimal deterministic network decomposition and ruling set, and improved mis. In: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pp. 2148\u20132179. IEEE (2024)","DOI":"10.1109\/FOCS61266.2024.00007"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Grunau, S., Rozho\u0148, V.: Improved deterministic network decomposition. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2904\u20132923. SIAM (2021)","DOI":"10.1137\/1.9781611976465.173"},{"key":"1_CR14","unstructured":"Kuhn, F., Zheng, C.: Efficient distributed computation of mis and generalized mis in linear hypergraphs. arXiv preprint arXiv:1805.03357 (2018)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-662-45174-8_32","volume-title":"Distributed Computing","author":"S Kutten","year":"2014","unstructured":"Kutten, S., Nanongkai, D., Pandurangan, G., Robinson, P.: Distributed symmetry breaking in hypergraphs. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 469\u2013483. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_32"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Linial, N.: Distributive graph algorithms global solutions from local data. In: 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp. 331\u2013335. IEEE (1987)","DOI":"10.1109\/SFCS.1987.20"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"1_CR18","unstructured":"Maus, Y., Tonoyan, T.: Local conflict coloring revisited: linial for lists. In: 34th International Symposium on Distributed Computing (DISC 2020), pp. 16\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Chernoff Bounds, pp. 61\u201389. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603.005"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general lov\u00e1sz local lemma. J. ACM 57(2), 1\u201315 (2010)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/PL00008932","volume":"14","author":"A Panconesi","year":"2001","unstructured":"Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14(2), 97\u2013100 (2001)","journal-title":"Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09120-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T10:52:56Z","timestamp":1787568776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09120-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"ISBN":["9783032091192","9783032091208"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09120-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"19 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}