Pith. sign in

REVIEW 2 cited by

Twitter Spam and False Accounts Prevalence, Detection and Characterization: A Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.05913 v4 pith:APGJXPZL submitted 2022-11-10 cs.SI

classification cs.SI
keywords accountsfalsespamprevalenceresearchtwitteraimedcharacterizing
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The issue of quantifying and characterizing various forms of social media manipulation and abuse has been at the forefront of the computational social science research community for over a decade. In this paper, I provide a (non-comprehensive) survey of research efforts aimed at estimating the prevalence of spam and false accounts on Twitter, as well as characterizing their use, activity, and behavior. I propose a taxonomy of spam and false accounts, enumerating known techniques used to create and detect them. Then, I summarize studies estimating the prevalence of spam and false accounts on Twitter. Finally, I report on research that illustrates how spam and false accounts are used for scams and frauds, stock market manipulation, political disinformation and deception, conspiracy amplification, coordinated influence, public health misinformation campaigns, radical propaganda and recruitment, and more. I will conclude with a set of recommendations aimed at charting the path forward to combat these problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Complexity of Eliminating (Majority) Illusion in Directed Networks

    cs.DS 2026-04 unverdicted novelty 6.0 of 10

    The minimum recoloring problem to eliminate p-illusion is NP-hard on general directed graphs and bipartite DAGs but solvable in polynomial time on trees, cycles, and outerplanar networks.

  2. Boosting Bot Detection via Heterophily-Aware Representation Learning and Prototype-Guided Cluster Discovery

    cs.AI 2025-06 conditional novelty 6.0 of 10

    BotHP combines a dual-encoder (graph and MLP) with prototype-guided clustering to pre-train graph bot detectors, improving F1 by 1.3-6.0 points on TwiBot-20 and MGTAB.

Pith tools