human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "early detection of promoted campaigns on social media"):
  Abstract: Social media expose millions of users every day to information campaigns --- some emerging organically from grassroots activity, others sustained by advertising or other coordinated efforts. These campaigns contribute to the shaping of collective opinions. While most information campaigns are benign, some may be deployed for nefarious purposes. It is therefore important to be able to detect whether a meme is being artificially promoted at the very moment it becomes wildly popular. This problem has important social implications and poses numerous technical challenges. As a first step, here we focus on discriminating between trending memes that are either organic or promoted by means of advertisement. The classification is not trivial: ads cause bursts of attention that can be easily mistaken for those of organic trends. We designed a machine learning framework to classify memes that have been labeled as trending on Twitter.After trending, we can rely on a large volume of activity data. Early detection, occurring immediately at trending time, is a more challenging problem due to the minimal volume of activity data that is available prior to trending.Our supervised learning framework exploits hundreds of time-varying features to capture changing network and diffusion patterns, content and sentiment information, timing signals, and user meta-data. We explore different methods for encoding feature time series. Using millions of tweets containing trending hashtags, we achieve 75% AUC score for early detection, increasing to above 95% after trending. We evaluate the robustness of the algorithms by introducing random temporal shifts on the trend time series. Feature selection analysis reveals that content cues provide consistently useful signals; user features are more informative for early detection, while network and timing features are more helpful once more data is available.

Includes members:
  Member "online human bot interactions detection estimation and characterization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "don t feed the troll detecting troll behavior via inverse reinforcement learning")
  Member "predicting online extremism content adopters and interaction reciprocity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "midmod osn a microscopic level information diffusion model for online social networks")
  Member "botornot a system to evaluate social bots":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "don t feed the troll detecting troll behavior via inverse reinforcement learning")
  Member "the darpa twitter bot challenge":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "don t feed the troll detecting troll behavior via inverse reinforcement learning")
  Member "do cascades recur":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "estimating attention flow in online video networks")
  Member "the rise of social bots":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a feature driven approach for identifying pathogenic social media accounts")
  Member "science vs conspiracy collective narratives in the age of misinformation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the covid 19 social media infodemic")
  Member "computational fact checking from knowledge networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "knowledge graphs")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.SI(Social and Information Networks)