Search arXiv⌕ Search

arXiv · 2609.35385

Attentional DoS: Repeat Reposting, Collective Attention, and Information Diffusion on X

Abstract

Collective attention is a finite shared resource, and social media posts compete for limited opportunities to be seen. On X, users can undo a repost and repost it again. By repeating this cycle, a user can put the same post back into followers' timelines any number of times without making new content. We call this procedure repeat reposting, and we read it as placing repeated demand on this shared resource (Attentional DoS). We formalize this idea and explore repeat reposting in a large-scale dataset of cascades with at least 1,000 reactions, originating from posts classified as Japanese on X, covering April 2025 to March 2026. Repeat reposts are rare, appearing in a small share of all (user, post) pairs. Even so, close to a million posts have at least one repeater, and most repeats come from a small group of habitual accounts. The central result is that subsequent audience growth is associated less with the number of repeats than with the estimated reach of the repeating accounts. Through the lens of seriality, how habitually the same groups of accounts repeat reposts across many posts, a distinct distributed form emerges: several serial amplifiers converge on the same post (Attentional DDoS). Its synchrony, how closely their actions are timed together, forms a continuum from bursts on the scale of minutes to a daily clock. A check of the content of 99.7% of amplified posts shows that most ADDoS repeat events are directed at Chinese-script content, which our vocabulary matching and sample inspection indicate is predominantly commercial spam. Repeat reposting thus lets a post re-enter the competition for visibility. The observed pattern is better characterized as repeated temporal coverage of an existing audience and the self-reinforcement of posts that are already growing, rather than as evidence that repeat reposting takes reach from other content.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Genta Toya, Bruno T. Sugano, Kei Ichikawa, Qianyun Wu, Shuhei Saigusa, Yasuhiro Hashimoto, Masashi Toyoda, Naoki Yoshinaga, Kazutoshi Sasahara. 2026-09-28. Attentional DoS: Repeat Reposting, Collective Attention, and Information Diffusion on X. https://arxiv.org/abs/2609.35385

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Minimizing cumulative infections in SIS epidemic models over networks via an edge deletion algorithm

In this paper, we investigate the discrete SIS (Susceptible-Infected-Susceptible) models. We focus on minimizing epidemic spreading over networks by extending an existing edge deletion algorithm to the SIS model. To achieve this, we employ the mean-field approximation to linearize the network dynamics into a deterministic SIS model. We analytically demonstrate that the total number of infections is upper-bounded by a super-modular function, thereby ensuring the efficiency of the edge-deletion approach. To evaluate the proposed method, we conduct experiments on synthetic Erdos-Renyi networks and the real-world dataset collected from BBC Pandemic Haslemere app. Numerical simulations validate our theoretical results, confirming that both configurations converge to the stable, disease-free equilibrium.

cs.SI↗

OranSim: Simulating Consumer Response to Social Media Campaigns Before Launch

Social simulation studies how individual behavior and social interaction produce collective outcomes. In social media marketing, campaign actions shape which consumers encounter the content and how they respond; these responses then spread through the population. We propose OranSim, a social simulation framework that connects creative, creator, targeting, and budget choices to this process. Heterogeneous consumers receive exposure according to content matching and platform allocation and generate initial responses, which propagate among 60 population segments. Candidate campaigns share the initial population and aligned random numbers, making their response trajectories comparable under action changes. In a controlled synthetic campaign, doubling the budget approximately doubles reach while lowering mean content match and engagement probability among the reached consumers; mean 14-day cumulative simulated response mass rises to 1.96 times the baseline. LightGBM predictors fitted to 39,000 historical RedNote notes estimate platform engagement with log-scale $R^2$ of 0.56--0.62 in five-fold cross-validation; a separate 12,154-note corpus supplies temporal, unseen-creator, and held-out-niche test splits. Public-data experiments evaluate policy-value estimation and audience ranking, and paired synthetic outcomes test counterfactual scoring. Together, scenario trajectories and engagement estimates support campaign selection according to a prespecified marketing objective. Code is available at https://github.com/OranAi-Ltd/oransim.

cs.SI↗

Uncovering Non-Normality in Information Flow: Network Structure and Dynamics of Social Media Cascades

Information cascades on social media are conventionally conceptualized as directed, feedforward branching processes. However, real-world diffusion pathways frequently deviate from pure hierarchical trees due to localized clustering, reciprocal commentary, and multi-wave temporal surges. In this work, we quantify the directional asymmetry and hierarchical structure of empirical information cascades on X (formerly Twitter) using spectral non-normality via Henrici's departure from normality. Analyzing approximately 58,000 cascade networks across diverse topics (including politics, entertainment, natural disasters, etc.), we investigate (1) how non-normality relates to temporal dynamics such as endogenous-like versus exogenous-like patterns and burstiness, (2) whether non-normality is correlated with the peak concentration or overall size of a cascade, (3) whether the overall non-normality of a cascade's network structure can be predicted from its early stages. We find that non-normality strongly aligns with peak concentration (peak/N) rather than overall cascade size, characterizing cascades governed by rapid, asymmetric forwarding. Furthermore, while early-stage structural forecasting (<= 30% of nodes observed) exhibits expected baseline uncertainty (51%-72% accuracy at a +/- 20% error tolerance), predictability consolidates rapidly during intermediate growth, exceeding 80% across all dynamic clusters once 50%-60% of the network is observed. By identifying the topological and dynamic correlates of cascade structures, this study advances our understanding of information flow and establishes a quantifiable benchmark for forecasting directional diffusion architectures.

cs.SI↗