Pith. sign in

REVIEW 1 cited by

A Proposal for Uncovering Hidden Social Bots via Genetic Similarity

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 2410.13512 v1 pith:WPMHF5EE submitted 2024-10-17 cs.SI

classification cs.SI
keywords botssocialgeneticspeciesusersaccountsalgorithmsclassify
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Social media platforms face an ongoing challenge in combating the proliferation of social bots, automated accounts that are also known to distort public opinion and support the spread of disinformation. Over the years, social bots have evolved greatly, often becoming indistinguishable from real users, and more recently, families of bots have been identified that are powered by Large Language Models to produce content for posting. We suggest an idea to classify social users as bots or not using genetic similarity algorithms. These algorithms provide an adaptive method for analyzing user behavior, allowing for the continuous evolution of detection criteria in response to the ever-changing tactics of social bots. Our proposal involves an initial clustering of social users into distinct macro species based on the similarities of their timelines. Macro species are then classified as either bot or genuine based on genetic characteristics. The preliminary idea we present, once fully developed, will allow existing detection applications based on timeline equality alone to be extended to detect bots. By incorporating new metrics, our approach will systematically classify non-trivial accounts into appropriate categories, effectively peeling back layers to reveal non-obvious species.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. BotHash: Efficient and Training-Free Bot Detection Through Approximate Nearest Neighbor

    cs.SI 2025-06 conditional novelty 6.0 of 10

    Approximate nearest-neighbor search over MinHash-encoded behavior sequences detects social bots without training, outperforming several ML baselines on public X/Twitter datasets.

Pith tools