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 "sequentiality and adaptivity gains in active hypothesis testing"):
  Abstract: Consider a decision maker who is responsible to collect observations so as to enhance his information in a speedy manner about an underlying phenomena of interest. The policies under which the decision maker selects sensing actions can be categorized based on the following two factors: i) sequential versus non-sequential; ii) adaptive versus non-adaptive. Non-sequential policies collect a fixed number of observation samples and make the final decision afterwards; while under sequential policies, the sample size is not known initially and is determined by the observation outcomes. Under adaptive policies, the decision maker relies on the previous collected samples to select the next sensing action; while under non-adaptive policies, the actions are selected independent of the past observation outcomes. In this paper, performance bounds are provided for the policies in each category. Using these bounds, sequentiality gain and adaptivity gain, i.e., the gains of sequential and adaptive selection of actions are characterized.

Includes members:
  Member "active sequential hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decentralized sequential active hypothesis testing and the mac feedback capacity")
  Member "controlled sensing for multihypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "searching for anomalies over composite hypotheses")
  Member "universal and composite hypothesis testing via mismatched divergence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "error exponents of mismatched likelihood ratio testing")
  Member "non adaptive probabilistic group testing with noisy measurements near optimal bounds with efficient algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "serial quantization for sparse time sequences")
  Member "active classification theory and application to underwater inspection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost bounded active classification using partially observable markov decision processes")
  Member "robust hypothesis testing with a relative entropy tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "error exponents of mismatched likelihood ratio testing")

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)