{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T19:21:54Z","timestamp":1779304914338,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372138"],"award-info":[{"award-number":["62372138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005046","name":"Natural Science Foundation of Heilongjiang Province","doi-asserted-by":"publisher","award":["HSF20230095"],"award-info":[{"award-number":["HSF20230095"]}],"id":[{"id":"10.13039\/501100005046","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["JCYJ20220818100205012"],"award-info":[{"award-number":["JCYJ20220818100205012"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Key Laboratory of Intelligent Bioinformatics","award":["ZDSYS20220422103800001"],"award-info":[{"award-number":["ZDSYS20220422103800001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10878-025-01262-x","type":"journal-article","created":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T11:46:06Z","timestamp":1744544766000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Testing Higher-order Clusterability on Graphs"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6912-0582","authenticated-orcid":false,"given":"Yifei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-1804","authenticated-orcid":false,"given":"Donghua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4119-0571","authenticated-orcid":false,"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,13]]},"reference":[{"issue":"6295","key":"1262_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"key":"1262_CR2","doi-asserted-by":"crossref","unstructured":"Chase Z (2019) The maximum number of triangles in a graph of given maximum degree. arXiv preprint arXiv:1912.01600","DOI":"10.19086\/aic.16788"},{"key":"1262_CR3","doi-asserted-by":"crossref","unstructured":"Chiplunkar A, Kapralov M, Khanna S, Mousavifar A, Peres Y (2018) Testing graph clusterability: Algorithms and lower bounds. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)","DOI":"10.1109\/FOCS.2018.00054"},{"key":"1262_CR4","doi-asserted-by":"crossref","unstructured":"Czumaj A, Peng P, Sohler C (2015) Testing cluster structure of graphs. In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","DOI":"10.1145\/2746539.2746618"},{"key":"1262_CR5","doi-asserted-by":"crossref","unstructured":"Duval A, Malliaros F (2022) Higher-order clustering and pooling for graph neural networks. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management","DOI":"10.1145\/3511808.3557353"},{"key":"1262_CR6","unstructured":"Eden T, Ron D, Rosenbaum W (2020) Almost optimal bounds for sublinear-time sampling of $$ k $$-cliques: Sampling cliques is harder than counting. arXiv preprint arXiv:2012.04090"},{"key":"1262_CR7","unstructured":"Eden T, Rosenbaum W (2018) On sampling edges almost uniformly. In: 1st Symposium on Simplicity in Algorithms"},{"key":"1262_CR8","doi-asserted-by":"crossref","unstructured":"Gama-Castro S, Salgado H, Santos-Zavaleta A, Ledezma-Tejeida D, Mu\u00f1iz-Rascado L, Garc\u00eda-Sotelo JS, Alquicira-Hern\u00e1ndez K, Mart\u00ednez-Flores I, Pannier L, Castro-Mondrag\u00f3n JA et\u00a0al (2016) Regulondb version 9.0 high-level integration of gene regulation, coexpression, motif clustering and beyond. Nucleic Acids Res 44(D1):D133\u2013D143","DOI":"10.1093\/nar\/gkv1156"},{"key":"1262_CR9","doi-asserted-by":"crossref","unstructured":"Gharan SO, Trevisan L (2014) Partitioning into expanders. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms","DOI":"10.1137\/1.9781611973402.93"},{"key":"1262_CR10","doi-asserted-by":"crossref","unstructured":"Hartmanis J (1982) Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson). SIAM Rev 24(1):90","DOI":"10.1137\/1024022"},{"issue":"3","key":"1262_CR11","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 (2004) On clusterings: good, bad and spectral. J ACM (JACM) 51(3):497\u2013515","journal-title":"J ACM (JACM)"},{"key":"1262_CR12","unstructured":"Kaufman T, Mass D (2017) High dimensional random walks and colorful expansion. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"1262_CR13","doi-asserted-by":"crossref","unstructured":"Li P, Dau H, Puleo G, Milenkovic O (2017) Motif clustering and overlapping clustering for social network analysis. In: IEEE INFOCOM 2017-IEEE Conference on Computer Communications","DOI":"10.1109\/INFOCOM.2017.8056956"},{"key":"1262_CR14","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1073\/pnas.012582999","volume":"99","author":"ME Newman","year":"2002","unstructured":"Newman ME, Watts DJ, Strogatz SH (2002) Random graph models of social networks. Proc National Aca Sci 99:2566\u20132572","journal-title":"Proc National Aca Sci"},{"issue":"2","key":"1262_CR15","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R Rubinfeld","year":"1996","unstructured":"Rubinfeld R, Sudan M (1996) Robust characterizations of polynomials with applications to program testing. SIAM J Comput 25(2):252\u2013271","journal-title":"SIAM J Comput"},{"key":"1262_CR16","unstructured":"T\u011btek J (2020) Sampling an edge uniformly in sublinear time. arXiv preprint arXiv:2009.11178"},{"key":"1262_CR17","unstructured":"The internet movie database. http:\/\/www.imdb.com\/"},{"key":"1262_CR18","doi-asserted-by":"crossref","unstructured":"Yao AC (1983) Lower bounds by probabilistic arguments. In: 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)","DOI":"10.1109\/SFCS.1983.30"},{"issue":"5","key":"1262_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.052306","volume":"97","author":"H Yin","year":"2018","unstructured":"Yin H, Benson AR, Leskovec J (2018) Higher-order clustering in networks. Phys Rev E 97(5):052306","journal-title":"Phys Rev E"},{"key":"1262_CR20","doi-asserted-by":"crossref","unstructured":"Yin H, Benson AR, Leskovec J, Gleich DF (2017) Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/3097983.3098069"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01262-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01262-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01262-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T07:56:01Z","timestamp":1745308561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01262-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1262"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01262-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]},"assertion":[{"value":"23 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"51"}}