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 "distributed hypothesis testing over discrete memoryless channels"):
  Abstract: A distributed binary hypothesis testing problem is studied in which multiple helpers transmit their observations to a remote detector over orthogonal discrete memoryless channels. The detector uses the received samples from the helpers along with its own observations to test for the joint distribution of the data. Single-letter inner and outer bounds for the type 2 error exponent (T2EE) is established for the special case of testing against conditional independence (TACI). Specializing this result for the one-helper problem, a single-letter characterization of the optimal T2EE is obtained. For the general hypothesis testing problem, a lower bound on the T2EE is established by using a separation based scheme that performs independent channel coding and hypothesis testing. It is shown that this separation based scheme recovers the optimal T2EE previously obtained when specialized for the case of TACI. Finally, a joint hypothesis testing and channel coding scheme based on hybrid coding is proposed and the T2EE achievable under this scheme is analyzed. In general, this scheme is expected to achieve a better performance compared to the separation based scheme.

Includes members:
  Member "on the reliability function of distributed hypothesis testing under optimal detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "distributed hypothesis testing over noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "hypothesis testing over the two hop relay network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the reliability function of distributed hypothesis testing under optimal detection")
  Member "distributed binary detection with lossy data compression":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "neyman pearson test for zero rate multiterminal hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed hypothesis testing cooperation and concurrent detection")
  Member "collaborative distributed hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed hypothesis testing cooperation and concurrent detection")
  Member "unequal error protection an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "privacy aware distributed hypothesis 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)