{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T21:40:04Z","timestamp":1766439604493,"version":"3.48.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T00:00:00Z","timestamp":1762732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T00:00:00Z","timestamp":1762732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Italian Ministry of University and Research","award":["I53D23003680006"],"award-info":[{"award-number":["I53D23003680006"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>User migration in online social networks represents a critical phenomenon that can reshape platform dynamics and lead to abrupt structural changes, often triggered by technical, social, or competitive factors. In the context of blockchain-based online social networks, migration events can be particularly disruptive when triggered by hard forks - fundamental splits in the underlying blockchain protocol that create two incompatible versions of the platform. However, understanding how users adapt their behavior before, during, and after such events remains a challenging research question. To address this challenge, we rely on the framework of graph representation learning, with a particular focus on Temporal Graph Neural Networks (TGNNs). In particular, we analyze how node representations returned by TGNNs evolve during the migration event and examine how representation shifts can mirror changes in users\u2019 behavioral patterns and platform interactions. Our study focuses on Steemit, a blockchain-based social network that experienced a significant user migration following a hard fork in its supporting blockchain infrastructure. Our findings highlight that both the prediction performance and node representation are influenced by the occurrence of the migration event. We detect shifts in node representations that correspond to changes in individual user behavior throughout the event. Furthermore, group-centric analysis reveals changes in behavior and memberships among similar users during different transition periods. Additionally, we find a level of polarization in node representations caused by the migration event, which gradually diminishes over time, resulting in more evenly distributed dimensions of node representations months after the first migration. We compare our approach against two baselines based on network statistics and pre-trained LLM embeddings, showing that TGNNs better capture the distribution shift derived by the migration. To summarize, this work offers valuable insights into user behavior dynamics during platform migrations, demonstrating the effectiveness of temporal graph learning approaches in analyzing such transitions in an automated manner.<\/jats:p>","DOI":"10.1007\/s10994-025-06905-y","type":"journal-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T22:51:39Z","timestamp":1762815099000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["User migration in blockchain-based online social networks through the lens of temporal node representation shift"],"prefix":"10.1007","volume":"114","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4861-455X","authenticated-orcid":false,"given":"Manuel","family":"Dileo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4808-4106","authenticated-orcid":false,"given":"Matteo","family":"Zignani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"issue":"5","key":"6905_CR1","doi-asserted-by":"publisher","first-page":"3749","DOI":"10.1007\/s11063-022-10784-y","volume":"54","author":"A Abdelwahab","year":"2022","unstructured":"Abdelwahab, A., & Landwehr, N. (2022). Deep distributional sequence embeddings based on a wasserstein loss. Neural Processing Letters, 54(5), 3749\u20133769. https:\/\/doi.org\/10.1007\/s11063-022-10784-y","journal-title":"Neural Processing Letters"},{"issue":"3","key":"6905_CR2","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu, L., Tong, H., & Koutra, D. (2015). Graph-based anomaly detection and description: A survey. Data Mining And Knowledge Discovery, 29(3), 626\u2013688.","journal-title":"Data Mining And Knowledge Discovery"},{"issue":"2","key":"6905_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10115-016-0987-z","volume":"51","author":"S Aminikhanghahi","year":"2017","unstructured":"Aminikhanghahi, S., & Cook, D. J. (2017). A survey of methods for time series change point detection. Knowledge and Information Systems, 51(2), 339\u2013367. https:\/\/doi.org\/10.1007\/s10115-016-0987-z","journal-title":"Knowledge and Information Systems"},{"key":"6905_CR4","doi-asserted-by":"publisher","DOI":"10.1145\/3640020","author":"CT Ba","year":"2024","unstructured":"Ba, C. T., Dileo, M., Galdeman, A., Zignani, M., & Gaito, S. (2024). Analyzing user migration in blockchain online social networks through network structure and discussion topics of communities on multilayer networks. Distrib. Ledger Technol. https:\/\/doi.org\/10.1145\/3640020","journal-title":"Distrib. Ledger Technol."},{"doi-asserted-by":"publisher","unstructured":"Ba, C.T., Galdeman, A., Dileo, M., Zignani, M., & Gaito, S. (2023). User migration prediction in blockchain socioeconomic networks using graph neural networks. In: 2023 ACM Conference on Information Technology for Social Good, p. 333\u2013341. https:\/\/doi.org\/10.1145\/3582515.3609552","key":"6905_CR5","DOI":"10.1145\/3582515.3609552"},{"doi-asserted-by":"crossref","unstructured":"Ba, C.T., Michienzi, A., Guidi, B., Zignani, M., Ricci, L., & Gaito, S. (2022). Fork-based user migration in blockchain online social media. In: 14th ACM Web Science Conference 2022, pp. 174\u2013184","key":"6905_CR6","DOI":"10.1145\/3501247.3531597"},{"key":"6905_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-024-06579-y","author":"M Dileo","year":"2024","unstructured":"Dileo, M., & Zignani, M. (2024). Discrete-time graph neural networks for transaction prediction in web3 social platforms. Machine Learning. https:\/\/doi.org\/10.1007\/s10994-024-06579-y","journal-title":"Machine Learning"},{"unstructured":"Dileo, M., & Zignani, M. (2025). Network-wide shocking events through the lens of node representation shift. In: F.\u00a0Naretto, R.\u00a0Pellungrini (eds.) DS Late Breaking Contributions 2024, no. 3928 in CEUR Workshop Proceedings, pp. 09\u201312 . https:\/\/ceur-ws.org\/Vol-3928\/paper_54.pdf","key":"6905_CR8"},{"key":"6905_CR9","volume-title":"Discovery Science","author":"M Dileo","year":"2022","unstructured":"Dileo, M., Ba, C. T., Zignani, M., & Gaito, S. (2022). Link prediction with text in online social networks: The role of textual content on high-resolution temporal data. In P. Pascal & D. Ienco (Eds.), Discovery Science. Springer Nature Switzerland."},{"key":"6905_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-023-06475-x","author":"M Dileo","year":"2023","unstructured":"Dileo, M., Zignani, M., & Gaito, S. (2023). Temporal graph learning for dynamic link prediction with text in online social networks. Machine Learning. https:\/\/doi.org\/10.1007\/s10994-023-06475-x","journal-title":"Machine Learning"},{"unstructured":"Dileo, M., Zignani, M., & Gaito, S.T. (2025). Evaluating explainability techniques on discrete-time graph neural networks. Transactions on Machine Learning Research. https:\/\/openreview.net\/forum?id=JzmXo0rfry","key":"6905_CR11"},{"key":"6905_CR12","doi-asserted-by":"publisher","DOI":"10.1145\/3669906","author":"OA Ekle","year":"2024","unstructured":"Ekle, O. A., & Eberle, W. (2024). Anomaly detection in dynamic graphs: A comprehensive survey. Acm Transactions On Knowledge Discovery From Data. https:\/\/doi.org\/10.1145\/3669906","journal-title":"Acm Transactions On Knowledge Discovery From Data"},{"key":"6905_CR13","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.physa.2017.04.109","volume":"486","author":"R Fabbri","year":"2017","unstructured":"Fabbri, R., Fabbri, R., Antunes, D. C., Pisani, M. M., & de Oliveira, O. N. (2017). Temporal stability in human interaction networks. Physica A: Statistical Mechanics and Its Applications, 486, 92\u2013105.","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"doi-asserted-by":"crossref","unstructured":"Galdeman, A., Zignani, M., & Gaito, S. (2023). User migration across web3 online social networks: Behaviors and influence of hubs. In: ICC 2023 - IEEE International Conference on Communications, pp. 5595\u20135601. 10.1109\/ICC45041.2023.10278763","key":"6905_CR14","DOI":"10.1109\/ICC45041.2023.10278763"},{"issue":"1","key":"6905_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s41109-024-00654-y","volume":"9","author":"D Goglia","year":"2024","unstructured":"Goglia, D., & Vega, D. (2024). Structure and dynamics of growing networks of reddit threads. Applied Network Science, 9(1), 48. https:\/\/doi.org\/10.1007\/s41109-024-00654-y","journal-title":"Applied Network Science"},{"issue":"21","key":"6905_CR16","doi-asserted-by":"publisher","first-page":"9880","DOI":"10.3390\/app11219880","volume":"11","author":"B Guidi","year":"2021","unstructured":"Guidi, B. (2021). An overview of blockchain online social media from the technical point of view. Applied Sciences, 11(21), 9880.","journal-title":"Applied Sciences"},{"doi-asserted-by":"crossref","unstructured":"Huang, S., Hitti, Y., Rabusseau, G., & Rabbany, R. (2020). Laplacian change point detection for dynamic graphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD \u201920. ACM. 10.1145\/3394486.3403077","key":"6905_CR17","DOI":"10.1145\/3394486.3403077"},{"key":"6905_CR18","volume":"21","author":"SM Kazemi","year":"2020","unstructured":"Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2020). Representation learning for dynamic graphs: A survey. Journal Of Machine Learning Research, 21, Article 70:1-70:73.","journal-title":"Journal Of Machine Learning Research"},{"key":"6905_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-021-11857-1","author":"KZ Khanam","year":"2022","unstructured":"Khanam, K. Z., Srivastava, G., & Mago, V. (2022). The homophily principle in social network analysis: A survey. Multimedia Tools and Applications. https:\/\/doi.org\/10.1007\/s11042-021-11857-1","journal-title":"Multimedia Tools and Applications"},{"doi-asserted-by":"publisher","unstructured":"Khazane, A., Rider, J., Serpe, M., Gogoglou, A., Hines, K., Bruss, C.B., & Serpe, R. (2019). Deeptrax: Embedding graphs of financial transactions. In: 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA), pp. 126\u2013133. https:\/\/doi.org\/10.1109\/ICMLA.2019.00028","key":"6905_CR20","DOI":"10.1109\/ICMLA.2019.00028"},{"doi-asserted-by":"publisher","unstructured":"Kulkarni, V., Al-Rfou, R., Perozzi, B., & Skiena, S. (2015). Statistically significant detection of linguistic change. In: Proceedings of the 24th International Conference on World Wide Web, WWW \u201915, p. 625\u2013635. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE. https:\/\/doi.org\/10.1145\/2736277.2741627","key":"6905_CR21","DOI":"10.1145\/2736277.2741627"},{"unstructured":"Kutuzov, A., \u00d8vrelid, L., Szymanski, T., & Velldal, E. (2018). Diachronic word embeddings and semantic shifts: a survey. In: Proceedings of the 27th International Conference on Computational Linguistics, pp. 1384\u20131397. Association for Computational Linguistics, Santa Fe, New Mexico, USA. https:\/\/aclanthology.org\/C18-1117","key":"6905_CR22"},{"doi-asserted-by":"crossref","unstructured":"Liu, Q., Tang, S., Zhang, X., Zhao, X., Zhao, B.Y., & Zheng, H. (2016). Network growth and link prediction through an empirical lens. Proceedings of the 2016 Internet Measurement Conference","key":"6905_CR23","DOI":"10.1145\/2987443.2987452"},{"issue":"6","key":"6905_CR24","first-page":"5879","volume":"35","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Jin, M., Pan, S., Zhou, C., Zheng, Y., Xia, F., & Yu, P. S. (2023). Graph self-supervised learning: A survey. IEEE Transactions on Knowledge and Data Engineering, 35(6), 5879\u20135900.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"unstructured":"Longa, A., Lachi, V., Santin, G., Bianchini, M., Lepri, B., Lio, P., & franco scarselli, Passerini, A. (2023). Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities. Transactions on Machine Learning Research. https:\/\/openreview.net\/forum?id=pHCdMat0gI","key":"6905_CR25"},{"doi-asserted-by":"publisher","unstructured":"Montariol, S., Martinc, M., & Pivovarova, L. (2021). Scalable and interpretable semantic change detection. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 4642\u20134652. Association for Computational Linguistics, Online. https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.369","key":"6905_CR26","DOI":"10.18653\/v1\/2021.naacl-main.369"},{"unstructured":"Newell, E., Jurgens, D., Saleem, H.M., Vala, H., Sassine, J., Armstrong, C., & Ruths, D. (2016). User migration in online social networks: A case study on reddit during a period of community unrest. In: ICWSM","key":"6905_CR27"},{"doi-asserted-by":"publisher","unstructured":"Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T.B., & Leiserson, C.E. (2019). Evolvegcn: Evolving graph convolutional networks for dynamic graphs. https:\/\/doi.org\/10.48550\/ARXIV.1902.10191","key":"6905_CR28","DOI":"10.48550\/ARXIV.1902.10191"},{"doi-asserted-by":"crossref","unstructured":"Peel, L., & Clauset, A. (2015). Detecting change points in the large-scale structure of evolving networks. AAAI","key":"6905_CR29","DOI":"10.1609\/aaai.v29i1.9574"},{"issue":"5\u20136","key":"6905_CR30","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., & Cuturi, M. (2019). Computational optimal transport: With applications to data science. Foundations and Trends\u00aein Machine Learning, 11(5\u20136), 355\u2013607. https:\/\/doi.org\/10.1561\/2200000073","journal-title":"Foundations and Trends\u00aein Machine Learning"},{"doi-asserted-by":"publisher","unstructured":"Reimers, N., & Gurevych, I. (2020). Making monolingual sentence embeddings multilingual using knowledge distillation. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 4512\u20134525. ACL, Online. https:\/\/doi.org\/10.18653\/v1\/2020.emnlp-main.365","key":"6905_CR31","DOI":"10.18653\/v1\/2020.emnlp-main.365"},{"doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., & Guestrin, C. (2016). why should I trust you?: Explaining the predictions of any classifier. In: KDD, pp. 1135\u20131144. ACM","key":"6905_CR32","DOI":"10.1145\/2939672.2939778"},{"unstructured":"Rossi, E., Chamberlain, B., Frasca, F., Eynard, D., Monti, F., & Bronstein, M. (2020). Temporal graph networks for deep learning on dynamic graphs. In: ICML 2020 Workshop on Graph Representation Learning","key":"6905_CR33"},{"issue":"2","key":"6905_CR34","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., & Guibas, L. J. (2000). The earth mover\u2019s distance as a metric for image retrieval. International Journal of Computer Vision, 40(2), 99\u2013121. https:\/\/doi.org\/10.1023\/A:1026543900054","journal-title":"International Journal of Computer Vision"},{"unstructured":"Ruffinelli, D., Broscheit, S., & Gemulla, R. (2020). You can teach an old dog new tricks! on training knowledge graph embeddings. In: International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=BkxSmlBFvr","key":"6905_CR35"},{"doi-asserted-by":"crossref","unstructured":"Senaweera, M., Dissanayake, R., Chamindi, N., Shyamalal, A., Elvitigala, C., Horawalavithana, S., Wijesekara, P., Gunawardana, K., Wickramasinghe, M.I.E., & Keppitiyagama, C. (2018). A weighted network analysis of user migrations in a social network. 2018 18th International Conference on Advances in ICT for Emerging Regions (ICTer) pp. 357\u2013362","key":"6905_CR36","DOI":"10.1109\/ICTER.2018.8615571"},{"doi-asserted-by":"crossref","unstructured":"Seo, Y., Defferrard, M., Vandergheynst, P., & Bresson, X. (2018). Structured sequence modeling with graph convolutional recurrent networks. In: Neural Information Processing: 25th International Conference, ICONIP 2018, Siem Reap, Cambodia, 2018, Proceedings, Part I 25, pp. 362\u2013373. Springer","key":"6905_CR37","DOI":"10.1007\/978-3-030-04167-0_33"},{"issue":"1","key":"6905_CR38","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B, Statistical Methodology, 58(1), 267\u2013288.","journal-title":"Journal of the Royal Statistical Society. Series B, Statistical Methodology"},{"doi-asserted-by":"publisher","unstructured":"Tsakalidis, A., Bazzi, M., Cucuringu, M., Basile, P., & McGillivray, B. (2019). Mining the UK web archive for semantic change detection. In: Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP 2019), pp. 1212\u20131221. INCOMA Ltd., Varna, Bulgaria. https:\/\/doi.org\/10.26615\/978-954-452-056-4_139","key":"6905_CR39","DOI":"10.26615\/978-954-452-056-4_139"},{"unstructured":"Wang, Y., Hooi, B., Liu, Y., Zhao, T., Guo, Z., & Shah, N. (2022). Flashlight: Scalable link prediction with effective decoders. In: B.\u00a0Rieck, R.\u00a0Pascanu (eds.) Learning on Graphs Conference, LoG 2022, 9-12 December 2022, Virtual Event, Proceedings of Machine Learning Research, vol. 198, p.\u00a014. PMLR . https:\/\/proceedings.mlr.press\/v198\/wang22a.html","key":"6905_CR40"},{"unstructured":"Xu, H., Luo, D., Zha, H., & Duke, L.C. (2019). Gromov-wasserstein learning for graph matching and node embedding. In: International conference on machine learning, pp. 6932\u20136941. PMLR","key":"6905_CR41"},{"issue":"3","key":"6905_CR42","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s10115-014-0789-0","volume":"45","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Lichtenwalter, R. N., & Chawla, N. V. (2014). Evaluating link prediction methods. Knowledge and Information Systems, 45(3), 751\u2013782. https:\/\/doi.org\/10.1007\/s10115-014-0789-0","journal-title":"Knowledge and Information Systems"},{"doi-asserted-by":"publisher","unstructured":"You, J., Du, T., & Leskovec, J. (2022). Roland: Graph learning framework for dynamic graphs. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD \u201922. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/3534678.3539300","key":"6905_CR43","DOI":"10.1145\/3534678.3539300"},{"doi-asserted-by":"publisher","unstructured":"You, J., Wang, Y., Pal, A., Eksombatchai, P., Rosenberg, C., & Leskovec, J. (2019). Hierarchical temporal convolutional networks for dynamic recommender systems. In: L.\u00a0Liu, R.W. White, A.\u00a0Mantrach, F.\u00a0Silvestri, J.J. McAuley, R.\u00a0Baeza-Yates, L.\u00a0Zia (eds.) The World Wide Web Conference, WWW 2019, San Francisco, CA, USA, May 13-17, 2019, pp. 2236\u20132246. ACM. https:\/\/doi.org\/10.1145\/3308558.3313747.","key":"6905_CR44","DOI":"10.1145\/3308558.3313747"},{"issue":"2","key":"6905_CR45","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., & Livny, M. (1996). Birch: An efficient data clustering method for very large databases. SIGMOD Record, 25(2), 103\u2013114. https:\/\/doi.org\/10.1145\/235968.233324","journal-title":"SIGMOD Record"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06905-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06905-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06905-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T21:29:51Z","timestamp":1766438991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06905-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":45,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["6905"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06905-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The data collected are publicly available and accessible on the Steem blockchain and on the websites reported in Section\n                      \n                      . We followed well-established ethical procedures for social data and obtained a waiver from the ethics committee at the University of Milan. All data is pseudo-anonymized before usage, it is stored within a secure silo, while the text is not stored in a readable format but in a vector representation.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"272"}}