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 "asymptotically optimal anomaly detection via sequential testing"):
  Abstract: Sequential detection of independent anomalous processes among K processes is considered. At each time, only M processes can be observed, and the observations from each chosen process follow two different distributions, depending on whether the process is normal or abnormal. Each anomalous process incurs a cost per unit time until its anomaly is identified and fixed. Switching across processes and state declarations are allowed at all times, while decisions are based on all past observations and actions. The objective is a sequential search strategy that minimizes the total expected cost incurred by all the processes during the detection process under reliability constraints. Low-complexity algorithms are established to achieve asymptotically optimal performance as the error constraints approach zero. Simulation results demonstrate strong performance in the finite regime.

Includes members:
  Member "optimal index policies for anomaly localization in resource constrained cyber systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "searching for anomalies over composite hypotheses")
  Member "active hypothesis testing for quickest anomaly detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "active search with a cost for switching actions")
  Member "universal outlier hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "error exponents of mismatched likelihood ratio testing")
  Member "quickest search over multiple sequences with mixed observations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "active hypothesis testing on a tree anomaly detection under hierarchical observations")
  Member "active sequential hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decentralized sequential active hypothesis testing and the mac feedback capacity")
  Member "sequentiality and adaptivity gains in active hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "searching for anomalies over composite hypotheses")
  Member "controlled sensing for multihypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "searching for anomalies over composite hypotheses")
  Member "sequential testing for sparse recovery":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "searching for anomalies over composite hypotheses")

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)