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 "ddos attacks with randomized traffic innovation botnet identification challenges and strategies"):
  Abstract: Distributed Denial-of-Service (DDoS) attacks are usually launched through the $botnet$, an "army" of compromised nodes hidden in the network. Inferential tools for DDoS mitigation should accordingly enable an early and reliable discrimination of the normal users from the compromised ones. Unfortunately, the recent emergence of attacks performed at the application layer has multiplied the number of possibilities that a botnet can exploit to conceal its malicious activities. New challenges arise, which cannot be addressed by simply borrowing the tools that have been successfully applied so far to earlier DDoS paradigms. In this work, we offer basically three contributions: $i)$ we introduce an abstract model for the aforementioned class of attacks, where the botnet emulates normal traffic by continually learning admissible patterns from the environment; $ii)$ we devise an inference algorithm that is shown to provide a consistent (i.e., converging to the true solution as time progresses) estimate of the botnet possibly hidden in the network; and $iii)$ we verify the validity of the proposed inferential strategy over $real$ network traces.

Includes members:
  Member "distributed detection in tree networks byzantines and mitigation techniques":
    also connected through other hyperedges:
      (none)
  Member "estimating traffic and anomaly maps via network tomography":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "network volume anomaly detection and identification in large scale networks based on online time structured traffic tensor tracking")
  Member "binary hypothesis testing game with training data":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cnn based adversarial embedding for image steganography")
  Member "the embedding capacity of information flows under renewal traffic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "inverse graph learning over optimization networks")
  Member "recovery of low rank plus compressed sparse matrices with application to unveiling traffic anomalies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust subspace clustering with compressed data")
  Member "dynamic anomalography tracking network anomalies via sparsity and low rank":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "static and dynamic robust pca and matrix completion a review")
  Member "mitigation of random query string dos via gossip":
    also connected through other hyperedges:
      (none)
  Member "anonymous networking amidst eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inverse graph learning over optimization networks")

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.IT(Information Theory)