human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "distributed hypothesis testing with concurrent detections"
  Abstract: A detection system with a single sensor and $\mathsf{K}$ detectors is considered, where each of the terminals observes a memoryless source sequence and the sensor sends a common message to all the detectors. The communication of this message is assumed error-free but rate-limited. The joint probability mass function (pmf) of the source sequences observed at the terminals depends on an $\mathsf{M}$-ary hypothesis $(\mathsf{M} \geq \mathsf{K})$, and the goal of the communication is that each detector can guess the underlying hypothesis. Each detector $k$ aims to maximize the error exponent under hypothesis $k$, while ensuring a small probability of error under all other hypotheses. This paper presents an achievable exponents region for the case of positive communication rate, and characterizes the optimal exponents region for the case of zero communication rate. All results extend also to a composite hypothesis testing scenario.

Connected through hyperedge HE-1 (induced by source paper "distributed hypothesis testing cooperation and concurrent detection"):
  with members:
    - "optimal rate exponent region for a class of hypothesis testing against conditional independence problems"
    - "vector gaussian ceo problem under logarithmic loss and applications"
    - "distributed hypothesis testing with collaborative detection"
    - "distributed hypothesis testing with privacy constraints"
    - "on hypothesis testing against independence with multiple decision centers"
    - "hypothesis testing under mutual information privacy constraints in the high privacy regime"
    - "hypothesis testing under maximal leakage privacy constraints"
    - "distributed hypothesis testing over noisy channels"

Connected through hyperedge HE-2 (induced by source paper "optimal rate exponent region for a class of hypothesis testing against conditional independence problems"):
  with members:
    - "on hypothesis testing against independence with multiple decision centers"
    - "hypothesis testing under maximal leakage privacy constraints"
    - "an outer bound for the vector gaussian ceo problem"
    - "multiterminal source coding under logarithmic loss"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-3 (induced by source paper "distributed hypothesis testing based on unequal error protection codes"):
  with members:
    - "on hypothesis testing against independence with multiple decision centers"
    - "collaborative distributed hypothesis testing"

Connected through hyperedge HE-4 (induced by source paper "distributed hypothesis testing with collaborative detection"):
  with members:
    - "collaborative distributed hypothesis testing"

Connected through hyperedge HE-5 (induced by source paper "hypothesis testing over the two hop relay network"):
  with members:
    - "strong converse for hypothesis testing against independence over a two hop network"
    - "distributed hypothesis testing based on unequal error protection codes"
    - "distributed hypothesis testing over discrete memoryless channels"
    - "on hypothesis testing against independence with multiple decision centers"
    - "universal outlier hypothesis testing"
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "cascade and triangular source coding with side information at the first two nodes"
    - "cascade triangular and two way source coding with degraded side information at the second user"

Question: Please tell me which class the center node 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)