{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T06:41:16Z","timestamp":1764225676266},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s11432-020-3069-4","type":"journal-article","created":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T11:02:59Z","timestamp":1617793379000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving diversified top-k weight clique search problem"],"prefix":"10.1007","volume":"64","author":[{"given":"Junping","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Chumin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Mingyang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lili","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Jianan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,29]]},"reference":[{"key":"3069_CR1","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.jplph.2010.09.010","volume":"168","author":"X Q Zheng","year":"2011","unstructured":"Zheng X Q, Liu T G, Yang Z N, et al. Large cliques in Arabidopsis gene coexpression network and motif discovery. J Plant Physiol, 2011, 168: 611\u2013618","journal-title":"J Plant Physiol"},{"key":"3069_CR2","unstructured":"Conrad L, Aaron M, Fergal R, et al. Detecting highly overlapping community structure by greedy clique expansion. In: Proceedings the 4th SNA-KDD Workshop on Social Network Mining and Analysis, Washington, 2010. 112\u2013119"},{"key":"3069_CR3","unstructured":"Krause A, Guestrin C. Near-optimal observation selection using submodular functions. In: Proceedings AAAI Conference on Artificial Intelligence, Canada, 2007. 22\u201326"},{"key":"3069_CR4","unstructured":"Berry N M, Ko T H, Moy T, et al. Emergent clique formation in terrorist recruitment. In: Proceedings the AAAI Workshop on Agent Organizations: Theory and Practice, Menlo Park, 2004"},{"key":"3069_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U. A threshold of ln n for approximating set cover. J ACM, 1998, 45: 634\u2013652","journal-title":"J ACM"},{"key":"3069_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan L, Qin L, Lin X M, et al. Diversified top-k clique search. VLDB J, 2016, 25: 171\u2013196","journal-title":"VLDB J"},{"key":"3069_CR7","doi-asserted-by":"crossref","unstructured":"Li C M, Many\u00e0 F, Quan Z, et al. Exact MinSAT solving. In: Proceedings the 13th International Conference on Theory and Applications of Satisfiability Testing, Edinburgh, 2010. 363\u2013368","DOI":"10.1007\/978-3-642-14186-7_33"},{"key":"3069_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/SAT190116","volume":"11","author":"I Alexey","year":"2019","unstructured":"Alexey I, Morgado A, Marques-Silva J. RC2: an efficient MaxSAT solver. J Satisfiability Boolean Modeling Comput, 2019, 11: 53\u201364","journal-title":"J Satisfiability Boolean Modeling Comput"},{"key":"3069_CR9","unstructured":"Fahiem B, Matti J, Ruben M. MaxSAT Evaluation 2019: Solver and Benchmark Descriptions. Department of Computer Science Report Series B-2019-2. 2019"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3069-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-3069-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3069-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T20:04:36Z","timestamp":1655669076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-3069-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,29]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["3069"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-3069-4","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,29]]},"assertion":[{"value":"18 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"150105"}}