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 cooperation and concurrent detection"):
  Abstract: A single-sensor two-detectors system is considered where the sensor communicates with both detectors and Detector 1 communicates with Detector 2, all over noise-free rate-limited links. The sensor and both detectors observe discrete memoryless source sequences whose joint probability mass function depends on a binary hypothesis. The goal at each detector is to guess the binary hypothesis in a way that, for increasing observation lengths, the probability of error under one of the hypotheses decays to zero with largest possible exponential decay, whereas the probability of error under the other hypothesis can decay to zero arbitrarily slow. For the setting with zero-rate communication on both links, we exactly characterize the set of possible exponents and the gain brought up by cooperation, in function of the number of bits that are sent over the two links. Notice that, for this setting, tradeoffs between the exponents achieved at the two detectors arise only in few particular cases. In all other cases, each detector achieves the same performance as if it were the only detector in the system. For the setting with positive communication rates from the sensor to the detectors, we characterize the set of all possible exponents in a special case of testing against independence. In this case the cooperation link allows Detector~2 to increase its Type-II error exponent by an amount that is equal to the exponent attained at Detector 1. We also provide a general inner bound on the set of achievable error exponents. For most cases it shows a tradeoff between the two exponents.

Includes members:
  Member "optimal rate exponent region for a class of hypothesis testing against conditional independence problems":
    also connected through other hyperedges:
      (none)
  Member "vector gaussian ceo problem under logarithmic loss and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vector gaussian ceo problem under logarithmic loss")
  Member "distributed hypothesis testing with collaborative detection":
    also connected through other hyperedges:
      (none)
  Member "distributed hypothesis testing with privacy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "distributed hypothesis testing with concurrent detections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal rate exponent region for a class of hypothesis testing against conditional independence problems")
  Member "on hypothesis testing against independence with multiple decision centers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal rate exponent region for a class of hypothesis testing against conditional independence problems")
  Member "hypothesis testing under mutual information privacy constraints in the high privacy regime":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "hypothesis testing under maximal leakage privacy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a practical approach to navigating the tradeoff between privacy and precise utility")

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)