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 "active hypothesis testing for quickest anomaly detection"):
  Abstract: The problem of quickest detection of an anomalous process among M processes is considered. At each time, a subset of the processes can be observed, and the observations from each chosen process follow two different distributions, depending on whether the process is normal or abnormal. The objective is a sequential search strategy that minimizes the expected detection time subject to an error probability constraint. This problem can be considered as a special case of active hypothesis testing first considered by Chernoff in 1959 where a randomized strategy, referred to as the Chernoff test, was proposed and shown to be asymptotically (as the error probability approaches zero) optimal. For the special case considered in this paper, we show that a simple deterministic test achieves asymptotic optimality and offers better performance in the finite regime. We further extend the problem to the case where multiple anomalous processes are present. In particular, we examine the case where only an upper bound on the number of anomalous processes is known.

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 "universal outlier hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "error exponents of mismatched likelihood ratio testing")
  Member "active sequential hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "searching for anomalies over composite hypotheses")
  Member "controlled sensing for multihypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "searching for anomalies over composite hypotheses")
  Member "quickest change detection of a markov process across a sensor array":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multisensor sequential change detection with unknown change propagation pattern")
  Member "one shot schemes for decentralized quickest change detection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multisensor sequential change detection with unknown change propagation pattern")

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)