{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:01:03Z","timestamp":1740178863722,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T00:00:00Z","timestamp":1689897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T00:00:00Z","timestamp":1689897600000},"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":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s41468-023-00129-6","type":"journal-article","created":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:01:43Z","timestamp":1689930103000},"page":"1417-1444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4556-0071","authenticated-orcid":false,"given":"Disha","family":"Shur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8107-6474","authenticated-orcid":false,"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,21]]},"reference":[{"key":"129_CR1","doi-asserted-by":"crossref","unstructured":"Amburg, I., Veldt, N., Benson, A.R.: Clustering in graphs and hypergraphs with categorical edge labels. In: Proceedings of the Web Conference (2020)","DOI":"10.1145\/3366423.3380152"},{"key":"129_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 475\u2013486. IEEE (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"129_CR3","doi-asserted-by":"publisher","unstructured":"Bar-Yossef, Z., Mashiach, L.T.: Local approximation of PageRank and reverse PageRank. In: CIKM \u201908: Proceeding of the 17th ACM Conference on Information and Knowledge Management. ACM, New York, NY, USA, pp 279\u2013288 (2008). https:\/\/doi.org\/10.1145\/1458082.1458122","DOI":"10.1145\/1458082.1458122"},{"issue":"1","key":"129_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1326561.1326563","volume":"2","author":"L Becchetti","year":"2008","unstructured":"Becchetti, L., Castillo, C., Donato, D., et al.: Link analysis for web spam detection. ACM Trans. Web 2(1), 1\u201342 (2008). https:\/\/doi.org\/10.1145\/1326561.1326563","journal-title":"ACM Trans. Web"},{"key":"129_CR5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., et al.: Simplicial closure and higher-order link prediction. Proc. Natl. Acad. Sci. (2018). https:\/\/doi.org\/10.1073\/pnas.1800683115","journal-title":"Proc. Natl. Acad. Sci."},{"key":"129_CR6","doi-asserted-by":"publisher","unstructured":"Bern, M., Mitchell, S., Ruppert, J.: Linear-size nonobtuse triangulation of polygons. In: Proceedings of the Tenth Annual Symposium on Computational Geometry, pp. 221\u2013230. Association for Computing Machinery, New York, NY, USA, SCG \u201994 (1994). https:\/\/doi.org\/10.1145\/177424.177974,","DOI":"10.1145\/177424.177974"},{"key":"129_CR7","doi-asserted-by":"publisher","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1), 107\u2013117 (1998). https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X. Proceedings of the Seventh International World Wide Web Conference","DOI":"10.1016\/S0169-7552(98)00110-X"},{"issue":"022","key":"129_CR8","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1103\/PhysRevE.101.022308","volume":"101","author":"T Carletti","year":"2020","unstructured":"Carletti, T., Battiston, F., Cencetti, G., et al.: Random walks on hypergraphs. Phys. Rev. E 101(022), 308 (2020). https:\/\/doi.org\/10.1103\/PhysRevE.101.022308","journal-title":"Phys. Rev. E"},{"key":"129_CR9","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1145\/3394486.3403185","volume-title":"InfiniteWalk: Deep Network Embeddings as Laplacian Embeddings with a Nonlinearity","author":"S Chanpuriya","year":"2020","unstructured":"Chanpuriya, S., Musco, C.: InfiniteWalk: Deep Network Embeddings as Laplacian Embeddings with a Nonlinearity, pp. 1325\u20131333. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3394486.3403185"},{"key":"129_CR10","volume-title":"Spectral Graph Theory","author":"FRL Chung","year":"1992","unstructured":"Chung, F.R.L.: Spectral Graph Theory. American Mathematical Society, Providence (1992)"},{"key":"129_CR11","doi-asserted-by":"publisher","unstructured":"Chung, F.: The heat kernel as the pagerank of a graph. Proc. Natl. Acad. Sci. 104(50):19,735\u201319,740 (2007). https:\/\/doi.org\/10.1073\/pnas.0708838104","DOI":"10.1073\/pnas.0708838104"},{"key":"129_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-21286-4_9","volume-title":"Algorithms and Models for the Web Graph","author":"F Chung","year":"2011","unstructured":"Chung, F., Tsiatas, A., Xu, W.: Dirichlet pagerank and trust-based ranking algorithms. In: Frieze, A., Horn, P., Pra\u0142at, P. (eds.) Algorithms and Models for the Web Graph, pp. 103\u2013114. Springer, Berlin (2011)"},{"key":"129_CR13","doi-asserted-by":"publisher","unstructured":"Constantine, P.G., Gleich, D.F.: Tall and skinny QR factorizations in MapReduce architectures. In: Proceedings of the Second International Workshop on MapReduce and Its Applications, pp. 43\u201350. ACM, New York, NY, USA, MapReduce \u201911 (2011). https:\/\/doi.org\/10.1145\/1996092.1996103","DOI":"10.1145\/1996092.1996103"},{"key":"129_CR14","unstructured":"Constantine, P., Gleich, D.: Computing active subspaces with Monte Carlo (2014). arXiv preprint arXiv:1408.0545"},{"key":"129_CR15","doi-asserted-by":"publisher","unstructured":"Donnat, C., Zitnik, M., Hallac, D., et\u00a0al.: Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1320\u20131329. Association for Computing Machinery, New York, NY, USA, KDD\u201918 (2018). https:\/\/doi.org\/10.1145\/3219819.3220025,","DOI":"10.1145\/3219819.3220025"},{"issue":"1","key":"129_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/18M1163658","volume":"40","author":"P Drineas","year":"2019","unstructured":"Drineas, P., Ipsen, I.C.: Low-rank matrix approximations do not need a singular value gap. SIAM J. Matrix Anal. Appl. 40(1), 299\u2013319 (2019)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"129_CR17","unstructured":"Fountoulakis, K., Liu, M., Gleich, D.F., et\u00a0al.: Flow-based algorithms for improving clusters: A unifying framework, software, and performance (2020). arXiv:2004.09608"},{"key":"129_CR18","unstructured":"Frobenius, G.: \u00dcber matrizen aus nicht negativen elementen. K\u00f6nigliche Akademie der Wissenschaften Sitzungsber, K\u00f6n, pp. 456\u2013477 (1912)"},{"key":"129_CR19","unstructured":"Gleich, D.F.: Models and algorithms for PageRank sensitivity (2009). Ph.D. thesis, Stanford University. http:\/\/www.stanford.edu\/group\/SOL\/dissertations\/pagerank-sensitivity-thesis-online.pdf"},{"issue":"3","key":"129_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich, D.F.: Pagerank beyond the web. SIAM Rev. 57(3), 321\u2013363 (2015). https:\/\/doi.org\/10.1137\/140976649","journal-title":"SIAM Rev."},{"key":"129_CR21","unstructured":"Gleich, D., Mahoney, M.: Anti-differentiating approximation algorithms: a case study with min-cuts, spectral, and flow. In: Xing, E.P., Jebara, T. (eds.) Proceedings of the 31st International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a032, pp. 1018\u20131025. PMLR, Bejing (2014). https:\/\/proceedings.mlr.press\/v32\/gleich14.html"},{"key":"129_CR22","doi-asserted-by":"publisher","unstructured":"Grover, A., Leskovec, J.: Node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864. Association for Computing Machinery, New York, NY, USA, KDD \u201916 (2016). https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"issue":"3","key":"129_CR23","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"KM Hall","year":"1970","unstructured":"Hall, K.M.: An R-dimensional quadratic placement algorithm. Manag. Sci. 17(3), 219\u2013229 (1970)","journal-title":"Manag. Sci."},{"issue":"2","key":"129_CR24","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.acha.2010.04.005","volume":"30","author":"DK Hammond","year":"2011","unstructured":"Hammond, D.K., Vandergheynst, P., Gribonval, R.: Wavelets on graphs via spectral graph theory. Appl. Comput. Harmonic Anal. 30(2), 129\u2013150 (2011). https:\/\/doi.org\/10.1016\/j.acha.2010.04.005","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"12","key":"129_CR25","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1093\/bioinformatics\/btx029","volume":"33","author":"B Jiang","year":"2017","unstructured":"Jiang, B., Kloster, K., Gleich, D.F., et al.: AptRank: an adaptive PageRank model for protein function prediction on bi-relational graphs. Bioinformatics 33(12), 1829\u20131836 (2017). https:\/\/doi.org\/10.1093\/bioinformatics\/btx029","journal-title":"Bioinformatics"},{"key":"129_CR26","unstructured":"Klicpera, J., Bojchevski, A., G\u00fcnnemann, S.: Combining neural networks with personalized pagerank for classification on graphs. In: International Conference on Learning Representations (2019). https:\/\/openreview.net\/forum?id=H1gL-2A9Ym"},{"key":"129_CR27","unstructured":"Kloster, K.: Graph diffusions and matrix functions: fast algorithms and localization results. Ph.D. thesis, Purdue University (2016). https:\/\/docs.lib.purdue.edu\/open_access_dissertations\/1404\/"},{"key":"129_CR28","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45071-8_50","volume-title":"Computing and Combinatorics","author":"Y Koren","year":"2003","unstructured":"Koren, Y.: On spectral graph drawing. In: Warnow, T., Zhu, B. (eds.) Computing and Combinatorics, pp. 496\u2013508. Springer, Berlin (2003)"},{"key":"129_CR29","unstructured":"Lang, K.: (2005) Fixing two weaknesses of the spectral method. In: Advances in Neural Information Processing Systems 18"},{"key":"129_CR30","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"AN Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"key":"129_CR31","unstructured":"Levy, O., Goldberg, Y.: (2014) Neural word embedding as implicit matrix factorization. In: Advances in Neural Information Processing Systems 27"},{"key":"129_CR32","doi-asserted-by":"publisher","unstructured":"Liu, M., Veldt, N., Song, H., et\u00a0al.: Strongly local hypergraph diffusions for clustering and semi-supervised learning. In: Leskovec, J., Grobelnik, M., Najork, M., et\u00a0al. (eds) WWW \u201921: The Web Conference 2021, Virtual Event\/Ljubljana, Slovenia, April 19\u201323, 2021, pp 2092\u20132103. ACM\/IW3C2 (2021). https:\/\/doi.org\/10.1145\/3442381.3449887,","DOI":"10.1145\/3442381.3449887"},{"issue":"1","key":"129_CR33","first-page":"2339","volume":"13","author":"MW Mahoney","year":"2012","unstructured":"Mahoney, M.W., Orecchia, L., Vishnoi, N.K.: A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J. Mach. Learn. Res. 13(1), 2339\u20132365 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"129_CR34","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TPAMI.2016.2574706","volume":"39","author":"Q Nguyen","year":"2017","unstructured":"Nguyen, Q., Tudisco, F., Gautier, A., et al.: An efficient multilinear optimization framework for hypergraph matching. IEEE Trans. Pattern Anal. Mach. Intell. 39(6), 1054\u20131075 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"129_CR35","doi-asserted-by":"publisher","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, KDD \u201914, pp. 701\u2013710 (2014) . https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"issue":"2","key":"129_CR36","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/BF01449896","volume":"64","author":"O Perron","year":"1907","unstructured":"Perron, O.: Zur theorie der matrices. Math. Ann. 64(2), 248\u2013263 (1907)","journal-title":"Math. Ann."},{"key":"129_CR37","unstructured":"Postavaru, S., Tsitsulin, A., de\u00a0Almeida, F.M.G., et\u00a0al.: Instantembedding: Efficient local node representations (2021). https:\/\/openreview.net\/forum?id=4vDf4Qtodh"},{"key":"129_CR38","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 430\u2013452 (1990). https:\/\/doi.org\/10.1137\/0611030","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"129_CR39","doi-asserted-by":"publisher","unstructured":"Qiu, J., Dong, Y., Ma, H., et\u00a0al.: Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining. Association for Computing Machinery, New York, NY, USA, WSDM \u201918, pp. 459\u2013467 (2018). https:\/\/doi.org\/10.1145\/3159652.3159706","DOI":"10.1145\/3159652.3159706"},{"issue":"2","key":"129_CR40","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/S0895479804441407","volume":"27","author":"S Serra-Capizzano","year":"2005","unstructured":"Serra-Capizzano, S.: Jordan canonical form of the google matrix: a potential contribution to the pagerank computation. SIAM J. Matrix Anal. Appl. 27(2), 305\u2013312 (2005). https:\/\/doi.org\/10.1137\/S0895479804441407","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"8","key":"129_CR41","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000). https:\/\/doi.org\/10.1109\/34.868688","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"129_CR42","doi-asserted-by":"publisher","unstructured":"Stehl\u00e9, J., Voirin, N., Barrat, A., et\u00a0al.: High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6(8), e23,176 (2011). https:\/\/doi.org\/10.1371\/journal.pone.0023176,","DOI":"10.1371\/journal.pone.0023176"},{"issue":"4","key":"129_CR43","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1137\/1015095","volume":"15","author":"GW Stewart","year":"1973","unstructured":"Stewart, G.W.: Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Rev. 15(4), 727\u2013764 (1973)","journal-title":"SIAM Rev."},{"key":"129_CR44","doi-asserted-by":"publisher","unstructured":"Takai, Y., Miyauchi, A., Ikeda, M., et\u00a0al.: Hypergraph Clustering Based on PageRank, Association for Computing Machinery, New York, NY, USA, p 1970\u20131978 (2020). https:\/\/doi.org\/10.1145\/3394486.3403248","DOI":"10.1145\/3394486.3403248"},{"key":"129_CR45","doi-asserted-by":"publisher","unstructured":"Tang, J., Qu, M., Mei, Q.: Pte: Predictive text embedding through large-scale heterogeneous text networks. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, KDD \u201915, pp. 1165\u20131174 (2015a). https:\/\/doi.org\/10.1145\/2783258.2783307","DOI":"10.1145\/2783258.2783307"},{"key":"129_CR46","doi-asserted-by":"publisher","unstructured":"Tang, J., Qu, M., Wang, M., et\u00a0al.: Line: Large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, WWW \u201915, pp. 1067\u20131077 (2015b). https:\/\/doi.org\/10.1145\/2736277.2741093","DOI":"10.1145\/2736277.2741093"},{"key":"129_CR47","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.Y.: Fast random walk with restart and its applications. In: Sixth International Conference on Data Mining (ICDM\u201906). IEEE, pp. 613\u2013622 (2006)","DOI":"10.1109\/ICDM.2006.70"},{"issue":"4","key":"129_CR48","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4), 389\u2013434 (2012)","journal-title":"Found. Comput. Math."},{"issue":"6","key":"129_CR49","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.14778\/3447689.3447713","volume":"14","author":"A Tsitsulin","year":"2021","unstructured":"Tsitsulin, A., Munkhoeva, M., Mottin, D., et al.: FREDE: anytime graph embeddings. Proc. VLDB Endow. 14(6), 1102\u20131110 (2021). https:\/\/doi.org\/10.14778\/3447689.3447713","journal-title":"Proc. VLDB Endow."},{"key":"129_CR50","doi-asserted-by":"crossref","unstructured":"Tudisco, F., Higham, D.J.: Node and edge nonlinear eigenvector centrality for hypergraphs (2021). arXiv:2101.06215","DOI":"10.21203\/rs.3.rs-148524\/v1"},{"key":"129_CR51","doi-asserted-by":"publisher","unstructured":"Tudisco, F., Benson, A.R., Prokopchik, K.: Nonlinear higher-order label spreading. In: Proceedings of the Web Conference 2021. Association for Computing Machinery, New York, NY, USA, WWW \u201921, pp. 2402\u20132413 (2021a). https:\/\/doi.org\/10.1145\/3442381.3450035","DOI":"10.1145\/3442381.3450035"},{"key":"129_CR52","unstructured":"Tudisco, F., Prokopchik, K., Benson, A.R.: A nonlinear diffusion method for semi-supervised learning on hypergraphs (2021b). arXiv:2103.14867"},{"key":"129_CR53","doi-asserted-by":"crossref","unstructured":"Veldt, N., Benson, A.R., Kleinberg, J.: Minimizing localized ratio cut objectives in hypergraphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press (2020a)","DOI":"10.1145\/3394486.3403222"},{"key":"129_CR54","doi-asserted-by":"crossref","unstructured":"Veldt, N., Benson, A.R., Kleinberg, J.: Minimizing localized ratio cut objectives in hypergraphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1708\u20131718 (2020b)","DOI":"10.1145\/3394486.3403222"},{"issue":"5","key":"129_CR55","doi-asserted-by":"publisher","first-page":"670","DOI":"10.14778\/3377369.3377376","volume":"13","author":"R Yang","year":"2020","unstructured":"Yang, R., Shi, J., Xiao, X., et al.: Homogeneous network embedding for massive graphs via reweighted personalized pagerank. Proc VLDB Endow 13(5), 670\u2013683 (2020). https:\/\/doi.org\/10.14778\/3377369.3377376","journal-title":"Proc VLDB Endow"},{"key":"129_CR56","doi-asserted-by":"publisher","unstructured":"Yin, Y., Wei, Z.: Scalable graph embeddings via sparse transpose proximities. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, KDD \u201919, pp. 1429\u20131437 (2019). https:\/\/doi.org\/10.1145\/3292500.3330860","DOI":"10.1145\/3292500.3330860"},{"key":"129_CR57","doi-asserted-by":"publisher","unstructured":"Zhou, C., Liu, Y., Liu, X., et\u00a0al.: Scalable graph embedding for asymmetric proximity. In: Proceedings of the AAAI Conference on Artificial Intelligence 31(1). https:\/\/doi.org\/10.1609\/aaai.v31i1.10878. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/10878 (2017)","DOI":"10.1609\/aaai.v31i1.10878"}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-023-00129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-023-00129-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-023-00129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T10:12:07Z","timestamp":1729591927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-023-00129-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,21]]},"references-count":57,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s41468-023-00129-6","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"type":"print","value":"2367-1726"},{"type":"electronic","value":"2367-1734"}],"subject":[],"published":{"date-parts":[[2023,7,21]]},"assertion":[{"value":"30 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}