{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:37:20Z","timestamp":1743057440542,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_26","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"369-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Certification of\u00a0Majority Dynamics"],"prefix":"10.1007","author":[{"given":"Diego","family":"Maldonado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Montealegre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mart\u00edn","family":"R\u00edos-Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Theyssier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Asuncion, A.U., Goodrich, M.T.: Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors. In: Proceedings of the 9th Annual ACM Workshop on Privacy in the Electronic Society, pp. 21\u201330 (2010)","DOI":"10.1145\/1866919.1866923"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jcss.2018.05.004","volume":"97","author":"A Balliu","year":"2018","unstructured":"Balliu, A., D\u2019Angelo, G., Fraigniaud, P., Olivetti, D.: What can be verified locally? J. Comput. Syst. Sci. 97, 106\u2013120 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bick, A., Kol, G., Oshman, R.: Distributed zero-knowledge proofs over networks. In: 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2426\u20132458 (2022)","DOI":"10.1137\/1.9781611977073.97"},{"key":"26_CR4","unstructured":"Bousquet, N., Feuilloley, L., Pierron, T.: Local certification of graph decompositions and applications to minor-free classes. In: 25th International Conference on Principles of Distributed Systems (OPODIS). LIPIcs, vol.\u00a0217, pp. 22:1\u201322:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Elkind, E.: Manipulating opinion diffusion in social networks. In: IJCAI International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence (2017)","DOI":"10.24963\/ijcai.2017\/124"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1103\/RevModPhys.81.591","volume":"81","author":"C Castellano","year":"2009","unstructured":"Castellano, C., Fortunato, S., Loreto, V.: Statistical physics of social dynamics. Rev. Mod. Phys. 81(2), 591 (2009)","journal-title":"Rev. Mod. Phys."},{"key":"26_CR7","unstructured":"Crescenzi, P., Fraigniaud, P., Paz, A.: Trade-offs in distributed interactive proofs. In: 33rd International Symposium on Distributed Computing (DISC). LIPIcs, vol.\u00a0146, pp. 13:1\u201313:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Deffuant, G., Neau, D., Amblard, F., Weisbuch, G.: Mixing beliefs among interacting agents. Adv. Complex Syst. 3(01n04), 87\u201398 (2000)","DOI":"10.1142\/S0219525900000078"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2022.01.023","volume":"909","author":"L Esperet","year":"2022","unstructured":"Esperet, L., L\u00e9v\u00eaque, B.: Local certification of graphs on surfaces. Theor. Comput. Sci. 909, 68\u201375 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Feuilloley, L., Bousquet, N., Pierron, T.: What can be certified compactly? Compact local certification of MSO properties in tree-like graphs. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pp. 131\u2013140 (2022)","DOI":"10.1145\/3519270.3538416"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2020.12.017","volume":"856","author":"L Feuilloley","year":"2021","unstructured":"Feuilloley, L., Fraigniaud, P., Hirvonen, J.: A hierarchy of local decision. Theor. Comput. Sci. 856, 51\u201367 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00446-020-00386-z","volume":"34","author":"L Feuilloley","year":"2021","unstructured":"Feuilloley, L., Fraigniaud, P., Hirvonen, J., Paz, A., Perry, M.: Redundancy in distributed proofs. Distrib. Comput. 34(2), 113\u2013132 (2021)","journal-title":"Distrib. Comput."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., R\u00e9mila, \u00c9., Todinca, I.: Compact distributed certification of planar graphs. Algorithmica 1\u201330 (2021)","DOI":"10.1145\/3382734.3404505"},{"key":"26_CR14","unstructured":"Feuilloley, L., Hirvonen, J.: Local verification of global proofs. In: 32nd International Symposium on Distributed Computing. LIPIcs, vol.\u00a0121, pp. 25:1\u201325:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"26_CR15","unstructured":"Fraigniaud, P., Gall, F.L., Nishimura, H., Paz, A.: Distributed quantum proofs for replicated data. In: 12th Innovations in Theoretical Computer Science Conference (ITCS). LIPIcs, vol.\u00a0185, pp. 28:1\u201328:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"26_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-031-09993-9_7","volume-title":"SIROCCO 2022","author":"P Fraigniaud","year":"2022","unstructured":"Fraigniaud, P., Montealegre, P., Rapaport, I., Todinca, I.: A meta-theorem for distributed certification. In: Parter, M. (ed.) SIROCCO 2022. LNCS, vol. 13298, pp. 116\u2013134. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09993-9_7"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00446-018-0340-8","volume":"32","author":"P Fraigniaud","year":"2019","unstructured":"Fraigniaud, P., Patt-Shamir, B., Perry, M.: Randomized proof-labeling schemes. Distrib. Comput. 32(3), 217\u2013234 (2019)","journal-title":"Distrib. Comput."},{"issue":"1\u20133","key":"26_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0012-365X(99)00228-9","volume":"215","author":"Y Ginosar","year":"2000","unstructured":"Ginosar, Y., Holzman, R.: The majority action on infinite graphs: strings and puppets. Discret. Math. 215(1\u20133), 59\u201371 (2000)","journal-title":"Discret. Math."},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2014.09.010","volume":"559","author":"E Goles","year":"2014","unstructured":"Goles, E., Montealegre, P.: Computational complexity of threshold automata networks under different updating schemes. Theoret. Comput. Sci. 559, 3\u201319 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.aam.2014.11.005","volume":"64","author":"E Goles","year":"2015","unstructured":"Goles, E., Montealegre, P.: The complexity of the majority rule on planar graphs. Adv. Appl. Math. 64, 111\u2013123 (2015)","journal-title":"Adv. Appl. Math."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2017.07.010","volume":"91","author":"E Goles","year":"2018","unstructured":"Goles, E., Montealegre, P., Perrot, K., Theyssier, G.: On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci. 91, 1\u201332 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2015.09.014","volume":"609","author":"E Goles","year":"2016","unstructured":"Goles, E., Montealegre, P., Salo, V., T\u00f6rm\u00e4, I.: Pspace-completeness of majority automata networks. Theoret. Comput. Sci. 609, 118\u2013128 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"26_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(85)90029-0","volume":"12","author":"E Goles-Chacc","year":"1985","unstructured":"Goles-Chacc, E., Fogelman-Souli\u00e9, F., Pellegrin, D.: Decreasing energy functions as a tool for studying threshold networks. Discret. Appl. Math. 12(3), 261\u2013277 (1985)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"26_CR24","first-page":"1","volume":"12","author":"M G\u00f6\u00f6s","year":"2016","unstructured":"G\u00f6\u00f6s, M., Suomela, J.: Locally checkable proofs in distributed computing. Theory Comput. 12(1), 1\u201333 (2016)","journal-title":"Theory Comput."},{"key":"26_CR25","unstructured":"Hegselmann, R., Krause, U.: Opinion dynamics and bounded confidence models, analysis and simulation. J. Artif. Soc. Soc. Simul. 5(3) (2002)"},{"issue":"1","key":"26_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/00223980.1946.9917275","volume":"21","author":"F Heider","year":"1946","unstructured":"Heider, F.: Attitudes and cognitive organization. J. Psychol. 21(1), 107\u2013112 (1946)","journal-title":"J. Psychol."},{"issue":"1","key":"26_CR27","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1177\/002200275800200106","volume":"2","author":"HC Kelman","year":"1958","unstructured":"Kelman, H.C.: Compliance, identification, and internalization three processes of attitude change. J. Conflict Resolut. 2(1), 51\u201360 (1958)","journal-title":"J. Conflict Resolut."},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Kol, G., Oshman, R., Saxena, R.R.: Interactive distributed proofs. In: ACM Symposium on Principles of Distributed Computing, pp. 255\u2013264. ACM (2018)","DOI":"10.1145\/3212734.3212771"},{"issue":"4","key":"26_CR29","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215\u2013233 (2010)","journal-title":"Distrib. Comput."},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E.: Communication complexity. In: Advances in Computers, vol.\u00a044. Elsevier (1997)","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"26_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.046106","volume":"68","author":"M Mobilia","year":"2003","unstructured":"Mobilia, M., Redner, S.: Majority versus minority dynamics: phase transition in an interacting two-state spin system. Phys. Rev. E 68, 046106 (2003)","journal-title":"Phys. Rev. E"},{"key":"26_CR32","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1023\/B:JOSS.0000015172.31951.7b","volume":"88","author":"C Moore","year":"1997","unstructured":"Moore, C.: Majority-vote cellular automata, ising dynamics, and p-completeness. J. Stat. Phys. 88, 795\u2013805 (1997)","journal-title":"J. Stat. Phys."},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Naor, M., Parter, M., Yogev, E.: The power of distributed verifiers in interactive proofs. In: 31st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1096\u2013115. SIAM (2020)","DOI":"10.1137\/1.9781611975994.67"},{"issue":"1","key":"26_CR34","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1038\/s41598-019-57086-3","volume":"10","author":"VX Nguyen","year":"2020","unstructured":"Nguyen, V.X., Xiao, G., Xu, X.J., Wu, Q., Xia, C.Y.: Dynamics of opinion formation under majority rules on complex social networks. Sci. Rep. 10(1), 456 (2020)","journal-title":"Sci. Rep."},{"key":"26_CR35","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.physa.2016.01.013","volume":"450","author":"AR Vieira","year":"2016","unstructured":"Vieira, A.R., Crokidakis, N.: Phase transitions in the majority-vote model with two types of noises. Phys. A 450, 30\u201336 (2016)","journal-title":"Phys. A"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:53Z","timestamp":1711569893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}