{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:52:56Z","timestamp":1768787576866,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"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":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10619-022-07415-9","type":"journal-article","created":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T11:03:56Z","timestamp":1658747036000},"page":"299-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scalable probabilistic truss decomposition using central limit theorem and H-index"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0697-0131","authenticated-orcid":false,"given":"Fatemeh","family":"Esfahani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahsa","family":"Daneshmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kui","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,25]]},"reference":[{"issue":"9","key":"7415_CR1","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. VLDB 5(9), 812\u2013823 (2012)","journal-title":"VLDB"},{"issue":"2","key":"7415_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.14778\/2535568.2448942","volume":"6","author":"F Zhao","year":"2012","unstructured":"Zhao, F., Tung, A.K.: Large scale cohesive subgraphs discovery for social network visual analysis. Proc. VLDB Endow. 6(2), 85\u201396 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"7415_CR3","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.: Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"7415_CR4","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.: Truss decomposition of probabilistic graphs: Semantics and algorithms. In: Proceedings of the 2016 ACM SIGMOD International Conference on Management of Data, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"key":"7415_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: 2012 IEEE International Conference on Data Engineering, pp. 1049\u20131060 (2012). IEEE","DOI":"10.1109\/ICDE.2012.35"},{"key":"7415_CR6","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, A., Seshadhri, C., Pinar, A.: Local algorithms for hierarchical dense subgraph discovery. VLDB (2019)","DOI":"10.14778\/3275536.3275540"},{"issue":"1","key":"7415_CR7","first-page":"197","volume":"50","author":"Z Zou","year":"2017","unstructured":"Zou, Z., Zhu, R.: Truss decomposition of uncertain graphs. KAIS 50(1), 197\u2013230 (2017)","journal-title":"KAIS"},{"key":"7415_CR8","unstructured":"Lyapunov, A.: Nouvelle forme de la th\u00e9oreme dur la limite de probabilit\u00e9. M\u00e9moires de l\u2019Academie Imp\u00e9riale des Sci. de St. Petersbourg 12, 1\u201324 (1901)"},{"issue":"6","key":"7415_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01896-1","volume":"4","author":"L Chen","year":"2012","unstructured":"Chen, L., Lian, X.: Query processing over uncertain databases. Synth. Lect. Data Manag. 4(6), 1\u2013101 (2012)","journal-title":"Synth. Lect. Data Manag."},{"issue":"11","key":"7415_CR10","first-page":"2078","volume":"30","author":"A Khan","year":"2018","unstructured":"Khan, A., Bonchi, F., Gullo, F., Nufer, A.: Conditional reliability in uncertain graphs. IEEE Trans. Knowl. Data Eng. 30(11), 2078\u20132092 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7415_CR11","doi-asserted-by":"crossref","unstructured":"Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: The pursuit of a good possible world: extracting representative instances of uncertain graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 967\u2013978 (2014)","DOI":"10.1145\/2588555.2593668"},{"issue":"12","key":"7415_CR12","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1109\/TKDE.2012.222","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. IEEE Trans. Knowl. Data Eng. 25(12), 2767\u20132779 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"7415_CR13","doi-asserted-by":"publisher","first-page":"876","DOI":"10.14778\/3402707.3402726","volume":"4","author":"Y Yuan","year":"2011","unstructured":"Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. Proc. VLDB Endow. 4(11), 876\u2013886 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"7415_CR14","doi-asserted-by":"crossref","unstructured":"Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 633\u2013642 (2010)","DOI":"10.1145\/1835804.1835885"},{"issue":"9","key":"7415_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.14778\/2002938.2002941","volume":"4","author":"R Jin","year":"2011","unstructured":"Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. Proc. VLDB Endow. 4(9), 551\u2013562 (2011)","journal-title":"Proc. VLDB Endow."},{"issue":"1\u20132","key":"7415_CR16","doi-asserted-by":"publisher","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: K-nearest neighbors in uncertain graphs. Proc. VLDB Endow. 3(1\u20132), 997\u20131008 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"7415_CR17","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1109\/TKDE.2018.2819651","volume":"30","author":"P Parchas","year":"2018","unstructured":"Parchas, P., Papailiou, N., Papadias, D., Bonchi, F.: Uncertain graph sparsification. IEEE Trans. Knowl. Data Eng. 30(12), 2435\u20132449 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7415_CR18","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. In: 2010 IEEE 26th International Conference on Data Engineering, pp. 649\u2013652 (2010). IEEE","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"7415_CR19","doi-asserted-by":"crossref","unstructured":"Xing, Y., Xiao, N., Lu, Y., Li, R., Yu, S., Gao, S.: Fast truss decomposition in memory. In: International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage, pp. 719\u2013729 (2017)","DOI":"10.1007\/978-3-319-72395-2_64"},{"issue":"10","key":"7415_CR20","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.14778\/3401960.3401971","volume":"13","author":"Y Che","year":"2020","unstructured":"Che, Y., Lai, Z., Sun, S., Wang, Y., Luo, Q.: Accelerating truss decomposition on heterogeneous processors. Proc. VLDB Endow. 13(10), 1751\u20131764 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"7415_CR21","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1316\u20131325 (2014)","DOI":"10.1145\/2623330.2623655"},{"key":"7415_CR22","volume-title":"Mathematical Methods of Statistics (PMS-9)","year":"2016","unstructured":"Cram\u00e9r, H. (ed.): Mathematical Methods of Statistics (PMS-9), vol. 9. Princeton University Press, Princeton (2016)"},{"key":"7415_CR23","volume-title":"CRC Standard Probability and Statistics Tables and Formulae","author":"D Zwillinger","year":"2000","unstructured":"Zwillinger, D., Kokoska, S.: CRC Standard Probability and Statistics Tables and Formulae. Chapman and Hall\/CRC, Boca Raton (2000)"},{"issue":"1","key":"7415_CR24","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1090\/S0002-9947-1941-0003498-3","volume":"49","author":"AC Berry","year":"1941","unstructured":"Berry, A.C.: The accuracy of the gaussian approximation to the sum of independent variates. Trans. Am. Math. Soc. 49(1), 122\u2013136 (1941)","journal-title":"Trans. Am. Math. Soc."},{"key":"7415_CR25","doi-asserted-by":"crossref","unstructured":"Wu, J., Goshulak, A., Srinivasan, V., Thomo, A.: K-truss decomposition of large networks on a single consumer-grade machine. In: Proc. ASONAM, pp. 873\u2013880 (2018). IEEE","DOI":"10.1109\/ASONAM.2018.8508642"},{"key":"7415_CR26","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the 13th International Conference on World Wide Web, pp. 595\u2013602 (2004)","DOI":"10.1145\/988672.988752"},{"key":"7415_CR27","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 587\u2013596 (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"7415_CR28","doi-asserted-by":"publisher","unstructured":"Podpe$$\\check{c}$$an, V., Ram$$\\check{s}$$ak, c., Gruden, K., Toivonen, H., Lavra$$\\check{c}$$, N.: Interactive exploration of heterogeneous biological networks with biomine explorer. Bioinformatics (2019). https:\/\/doi.org\/10.1093\/bioinformatics\/btz509","DOI":"10.1093\/bioinformatics\/btz509"},{"issue":"3","key":"7415_CR29","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.cell.2020.06.034","volume":"182","author":"M Bouhaddou","year":"2020","unstructured":"Bouhaddou, M., Memon, D., Meyer, B., White, K.M., Rezelj, V.V., Marrero, M.C., Polacco, B.J., Melnyk, J.E., Ulferts, S., Kaake, R.M., et al.: The global phosphorylation landscape of sars-cov-2 infection. Cell 182(3), 685\u2013712 (2020)","journal-title":"Cell"},{"key":"7415_CR30","doi-asserted-by":"crossref","unstructured":"Guo, Y., Esfahani, F., Shao, X., Srinivasan, V., Thomo, A., Xing, L., Zhang, X.: Integrative COVID-19 biological network inference with probabilistic core decomposition. Brief. Bioinform. (2021). https:\/\/www.biorxiv.org\/content\/10.1101\/2021.06.23.449535v1.full.pdf","DOI":"10.1101\/2021.06.23.449535"},{"issue":"2","key":"7415_CR31","doi-asserted-by":"publisher","first-page":"1007587","DOI":"10.1371\/journal.pcbi.1007587","volume":"16","author":"S Dirmeier","year":"2020","unstructured":"Dirmeier, S., D\u00e4chert, C., van Hemert, M., Tas, A., Ogando, N.S., van Kuppeveld, F., Bartenschlager, R., Kaderali, L., Binder, M., Beerenwinkel, N.: Host factor prioritization for pan-viral genetic perturbation screens using random intercept models and network propagation. PLoS Comput. Biol. 16(2), 1007587 (2020)","journal-title":"PLoS Comput. Biol."},{"key":"7415_CR32","unstructured":"Pfeiffer, J.J., Neville, J.: Methods to determine node centrality and clustering in graphs with uncertain structure. In: Fifth International AAAI Conference on Weblogs and Social Media (2011)"},{"issue":"1","key":"7415_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-018-07882-8","volume":"10","author":"Y Zhou","year":"2019","unstructured":"Zhou, Y., Zhou, B., Pache, L., Chang, M., Khodabakhshi, A.H., Tanaseichuk, O., Benner, C., Chanda, S.K.: Metascape provides a biologist-oriented resource for the analysis of systems-level datasets. Nat. Commun. 10(1), 1\u201310 (2019)","journal-title":"Nat. Commun."}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-022-07415-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-022-07415-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-022-07415-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:12:56Z","timestamp":1744204376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-022-07415-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,25]]},"references-count":33,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["7415"],"URL":"https:\/\/doi.org\/10.1007\/s10619-022-07415-9","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,25]]},"assertion":[{"value":"21 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}