Towards understanding news plagiarism: theoretical and experimental analysis
摘要
This paper introduces a mathematical framework to analyze news propagation and influence. We develop a software tool to crawl news websites and construct a temporal graph model of influence between outlets based on content similarity and publication times. Our primary contribution is the formulation of novel Budgeted Influence Maximization problems on these temporal grapfhs, which aim to identify how a limited set of news sources can achieve maximum influence over the network. We prove these problems are NP-hard and establish hardness-of-approximation results. To validate our approach, we solve these problems as integer programs on both real-world data and synthetic data from a statistically-validated random generator. Our key finding is that a resource budget of 40-60% of the total network cost is sufficient to achieve over 75% of the maximum possible influence. This work provides a quantitative framework and practical tools for analyzing influence and vulnerability in news ecosystems.