{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:27Z","timestamp":1742913327421,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-49614-1_15","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"203-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Testing Higher-Order Clusterability on\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6912-0582","authenticated-orcid":false,"given":"Yifei","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-1804","authenticated-orcid":false,"given":"Donghua","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4119-0571","authenticated-orcid":false,"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"15_CR1","unstructured":"The internet movie database. http:\/\/www.imdb.com\/"},{"issue":"6295","key":"15_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Chiplunkar, A., Kapralov, M., Khanna, S., Mousavifar, A., Peres, Y.: Testing graph clusterability: algorithms and lower bounds. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 497\u2013508. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00054"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Peng, P., Sohler, C.: Testing cluster structure of graphs. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (2015)","DOI":"10.1145\/2746539.2746618"},{"issue":"5\u20136","key":"15_CR5","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1017\/S096354831000012X","volume":"19","author":"A Czumaj","year":"2010","unstructured":"Czumaj, A., Sohler, C.: Testing expansion in bounded-degree graphs. Comb. Probab. Comput. 19(5\u20136), 693\u2013709 (2010)","journal-title":"Comb. Probab. Comput."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Duval, A., Malliaros, F.: Higher-order clustering and pooling for graph neural networks. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 426\u2013435 (2022)","DOI":"10.1145\/3511808.3557353"},{"key":"15_CR7","unstructured":"Eden, T., Rosenbaum, W.: On sampling edges almost uniformly. In: 1st Symposium on Simplicity in Algorithms (2018)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Gama-Castro, S., et al.: Regulondb version 9.0: high-level integration of gene regulation, coexpression, motif clustering and beyond. Nucleic Acids Res. 44(D1), D133\u2013D143 (2016)","DOI":"10.1093\/nar\/gkv1156"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Gharan, S.O., Trevisan, L.: Partitioning into expanders. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1256\u20131266. SIAM (2014)","DOI":"10.1137\/1.9781611973402.93"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Gluch, G., Kapralov, M., Lattanzi, S., Mousavifar, A., Sohler, C.: Spectral clustering oracles in sublinear time. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1598\u20131617. SIAM (2021)","DOI":"10.1137\/1.9781611976465.97"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 406\u2013415 (1997)","DOI":"10.1145\/258533.258627"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1137\/100802980","volume":"40","author":"S Kale","year":"2011","unstructured":"Kale, S., Seshadhri, C.: An expansion tester for bounded degree graphs. SIAM J. Comput. 40(3), 709\u2013720 (2011)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, bad and spectral. J. ACM (JACM) 51(3), 497\u2013515 (2004)","journal-title":"J. ACM (JACM)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference, pp. 343\u2013348 (1999)","DOI":"10.1109\/DAC.1999.781339"},{"key":"15_CR15","unstructured":"Kaufman, T., Mass, D.: High dimensional random walks and colorful expansion. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Li, P., Dau, H., Puleo, G., Milenkovic, O.: Motif clustering and overlapping clustering for social network analysis. In: IEEE INFOCOM 2017-IEEE Conference on Computer Communications, pp. 1\u20139. IEEE (2017)","DOI":"10.1109\/INFOCOM.2017.8056956"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Li, P.Z., Huang, L., Wang, C.D., Lai, J.H.: Edmot: an edge enhancement approach for motif-aware community detection. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 479\u2013487 (2019)","DOI":"10.1145\/3292500.3330882"},{"issue":"suppl-1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1073\/pnas.012582999","volume":"99","author":"ME Newman","year":"2002","unstructured":"Newman, M.E., Watts, D.J., Strogatz, S.H.: Random graph models of social networks. Proc. Natl. Acad. Sci. 99(suppl-1), 2566\u20132572 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252\u2013271 (1996)","journal-title":"SIAM J. Comput."},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Spanier, E.H.: Algebraic Topology. Springer, New York (1981). https:\/\/doi.org\/10.1007\/978-1-4684-9322-1","DOI":"10.1007\/978-1-4684-9322-1"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Pachocki, J., Mitzenmacher, M.: Scalable motif-aware graph clustering. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1451\u20131460 (2017)","DOI":"10.1145\/3038912.3052653"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T16:50:40Z","timestamp":1730825440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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","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":"6","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)"}}]}}