Not All Duplicates Are Coordination: Generic vs. Non-Generic Duplicate Campaigns in Information Operations

• URL: http://arxiv.org/abs/2609.13671v1
• Date: Sat, 12 Sep 2026 02:52:57 GMT
• Title: Not All Duplicates Are Coordination: Generic vs. Non-Generic Duplicate Campaigns in Information Operations
• Abstract summary: Generic, reusable, or low-information posts may create noisy account-account links when projected into coordination graphs.<n>We study this problem using 187,000 English-language tweets from six Russian Twitter Information Operations datasets.
• Score: 0.42821598129654453
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Duplicate content is widely used to study coordinated behavior in social media information operations (IOs), but not all repetition provides equally meaningful evidence of coordination. Generic, reusable, or low-information posts may create noisy account-account links when projected into coordination graphs. We study this problem using 187,000 English-language tweets from six Russian Twitter Information Operations datasets. We introduce a generic/non-generic distinction for duplicate campaigns, label tweets using an LLM-assisted protocol with independent human validation, and train supervised classifiers over sentence embeddings to scale the labels. We construct duplicate campaigns using lexical similarity and two embedding-based methods. Generic campaigns are rare under lexical matching but account for nearly 39% of campaigns detected by embedding-based methods. Restricting graphs to non-generic campaigns reduces graph size and the largest connected component while increasing density, suggesting a smaller but more focused coordination structure. These findings show that duplicate-based coordination analysis should consider both textual similarity and semantic specificity.

Related papers

• Aligned but Not Partner-Specific: Distinguishing How Multimodal LLM Agents Succeed in Reference Games Without Human-Like Conventions [2.3410384770553154]
  We compare capable multimodal agent dyads with human dyads from the KTH Tangrams corpus.<n>Humans reduce effort through entrainment, compressing descriptions and increasing label alignment with partners.<n>Agents instead maintain fixed effort levels, producing verbose descriptions from round one, with near-ceiling label overlap that is statistically indistinguishable between real and pseudo dyads.
  arXiv  Detail & Related papers  (2026-06-06T10:05:49Z)
• Israel-Hamas War on X: A Case Study of Coordinated Campaigns and Information Integrity [34.92040311900383]
  Coordinated campaigns on social media play a critical role in shaping crisis information environments.<n>We study the interplay between coordinated campaigns and information integrity through a case study of the 2023 Israel-Hamas War on Twitter.
  arXiv  Detail & Related papers  (2026-04-12T10:22:34Z)
• Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends [1.3595147353266148]
  Social media users and inauthentic accounts may coordinate in promoting their topics.<n>It is challenging to predict if a topic is organic or a coordinated campaign due to the lack of reliable ground truth.<n>In this paper, we create such ground truth by detecting the campaigns promoted by ephemeral astroturfing attacks.
  arXiv  Detail & Related papers  (2025-03-01T19:50:32Z)
• Leveraging Ensembles and Self-Supervised Learning for Fully-Unsupervised Person Re-Identification and Text Authorship Attribution [77.85461690214551]
  Learning from fully-unlabeled data is challenging in Multimedia Forensics problems, such as Person Re-Identification and Text Authorship Attribution. Recent self-supervised learning methods have shown to be effective when dealing with fully-unlabeled data in cases where the underlying classes have significant semantic differences. We propose a strategy to tackle Person Re-Identification and Text Authorship Attribution by enabling learning from unlabeled data even when samples from different classes are not prominently diverse.
  arXiv  Detail & Related papers  (2022-02-07T13:08:11Z)
• Learning with Noisy Labels by Targeted Relabeling [52.0329205268734]
  Crowdsourcing platforms are often used to collect datasets for training deep neural networks. We propose an approach which reserves a fraction of annotations to explicitly relabel highly probable labeling errors.
  arXiv  Detail & Related papers  (2021-10-15T20:37:29Z)
• Exploiting Twitter as Source of Large Corpora of Weakly Similar Pairs for Semantic Sentence Embeddings [3.8073142980733]
  We propose a language-independent approach to build large datasets of pairs of informal texts weakly similar. We exploit Twitter's intrinsic powerful signals of relatedness: replies and quotes of tweets. Our model learns classical Semantic Textual Similarity, but also excels on tasks where pairs of sentences are not exact paraphrases.
  arXiv  Detail & Related papers  (2021-10-05T13:21:40Z)
• Rank-Consistency Deep Hashing for Scalable Multi-Label Image Search [90.30623718137244]
  We propose a novel deep hashing method for scalable multi-label image search. A new rank-consistency objective is applied to align the similarity orders from two spaces. A powerful loss function is designed to penalize the samples whose semantic similarity and hamming distance are mismatched.
  arXiv  Detail & Related papers  (2021-02-02T13:46:58Z)
• Relation Clustering in Narrative Knowledge Graphs [71.98234178455398]
  relational sentences in the original text are embedded (with SBERT) and clustered in order to merge together semantically similar relations. Preliminary tests show that such clustering might successfully detect similar relations, and provide a valuable preprocessing for semi-supervised approaches.
  arXiv  Detail & Related papers  (2020-11-27T10:43:04Z)
• Dynamic Semantic Matching and Aggregation Network for Few-shot Intent Detection [69.2370349274216]
  Few-shot Intent Detection is challenging due to the scarcity of available annotated utterances. Semantic components are distilled from utterances via multi-head self-attention. Our method provides a comprehensive matching measure to enhance representations of both labeled and unlabeled instances.
  arXiv  Detail & Related papers  (2020-10-06T05:16:38Z)
• Automatically Discovering and Learning New Visual Categories with Ranking Statistics [145.89790963544314]
  We tackle the problem of discovering novel classes in an image collection given labelled examples of other classes. We learn a general-purpose clustering model and use the latter to identify the new classes in the unlabelled data. We evaluate our approach on standard classification benchmarks and outperform current methods for novel category discovery by a significant margin.
  arXiv  Detail & Related papers  (2020-02-13T18:53:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.