{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:21:59Z","timestamp":1743024119426,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031346705"},{"type":"electronic","value":"9783031346712"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34671-2_35","type":"book-chapter","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T23:02:58Z","timestamp":1687302178000},"page":"501-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Existence of\u00a0Highly Organized Communities in\u00a0Networks of\u00a0Locally Interacting Agents"],"prefix":"10.1007","author":[{"given":"Vasiliki","family":"Liagkou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis E.","family":"Nastou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis C.","family":"Stamatiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-72905-8_4","volume-title":"Mathematics of Ramsey Theory. Algorithms and Combinatorics","author":"J Beck","year":"1990","unstructured":"Beck, J.: On size Ramsey number of paths, trees and circuits. II. In: Ne\u0161et\u0159il, J., R\u00f6dl, V. (eds.) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol. 5, pp. 34\u201345. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/978-3-642-72905-8_4"},{"key":"35_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","volume":"34","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V., R\u00f6dl, V., Szemer\u00e9di, E., Trotter, W.T., Jr.: The Ramsey number of a graph with bounded maximum degree. J. Combin. Theory Ser. B 34, 239\u2013243 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00493-012-2710-3","volume":"32","author":"D Conlon","year":"2012","unstructured":"Conlon, D., Fox, J., Sudakov, B.: On two problems in graph Ramsey theory. Combinatorica 32, 513\u2013535 (2012)","journal-title":"Combinatorica"},{"key":"35_CR5","volume-title":"Graph Theory","author":"R Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S0963548300001619","volume":"4","author":"PE Haxell","year":"1995","unstructured":"Haxell, P.E., Kohayakawa, Y., \u0141uczak, T.: The induced size-Ramsey number of cycles. Combin. Probab. Comput. 4, 217\u2013240 (1995)","journal-title":"Combin. Probab. Comput."},{"key":"35_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M Li","year":"2019","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 4th edn. Springer, New York (2019). https:\/\/doi.org\/10.1007\/978-0-387-49820-1","edition":"4"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1006\/jctb.1996.0025","volume":"66","author":"T \u0141uczak","year":"1996","unstructured":"\u0141uczak, T., R\u00f6dl, V.: On induced Ramsey numbers for graphs with bounded maximum degree. J. Combin. Theory Ser. B 66, 324\u2013333 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. 30, 264\u2013286 (1930)","journal-title":"Proc. London Math. Soc."},{"key":"35_CR10","unstructured":"Peyton Young, H.: The diffusion of innovations in social networks. In: Blume, L.E., Durlauf, S.N. (eds.) Proceedings of the Economy as a Complex Evolving System, vol. III. Oxford University Press (2003)"},{"key":"35_CR11","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley Professional (2011)"}],"container-title":["Lecture Notes in Computer Science","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34671-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:24:41Z","timestamp":1710332681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34671-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031346705","9783031346712"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34671-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"70","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":"21","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":"15","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":"30% - 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":"4","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":"5","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)"}}]}}