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: "on hypothesis testing against independence with multiple decision centers"
  Abstract: A distributed binary hypothesis testing problem is studied with one observer and two decision centers. The type-II error exponents region is derived for testing against independence when the observer communicates with the two decision centers over one common and two individual noise-free bit pipes. When there is only a common noise-free bit pipe, the type-II error exponents region is derived for testing against conditional independence. Finally, when the observer can communicate to the two decision centers over a discrete memoryless broadcast channel, an achievable type-II error exponents region is derived for testing against conditional independence. The last type-II error exponent is obtained by splitting the observations into subblocks, having the transmitter apply hybrid joint source-channel coding with side-information independently to each subblock, and having each receiver apply a Neyman-Pearson test jointly over the subblocks. This decision approach avoids introducing further error exponents due to the binning or the decoding procedures.

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"
    - "distributed hypothesis testing with concurrent detections"
    - "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:
    - "distributed hypothesis testing with concurrent detections"
    - "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 "on the reliability function of distributed hypothesis testing under optimal detection"):
  with members:
    - "on binary distributed hypothesis testing"
    - "distributed hypothesis testing over noisy channels"
    - "hypothesis testing over the two hop relay network"
    - "a large deviations approach to secure lossy compression"
    - "distributed binary detection with lossy data compression"
    - "neyman pearson test for zero rate multiterminal hypothesis testing"
    - "collaborative distributed hypothesis testing"
    - "on the reliability function of variable rate slepian wolf coding"

Connected through hyperedge HE-4 (induced by source paper "distributed hypothesis testing with privacy constraints"):
  with members:
    - "technical privacy metrics a systematic survey"
    - "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"
    - "neyman pearson test for zero rate multiterminal hypothesis testing"
    - "euclidean information theory of networks"
    - "utility privacy tradeoffs in databases an information theoretic approach"

Connected through hyperedge HE-5 (induced by source paper "distributed hypothesis testing based on unequal error protection codes"):
  with members:
    - "distributed hypothesis testing with concurrent detections"
    - "collaborative distributed hypothesis testing"

Connected through hyperedge HE-6 (induced by source paper "hypothesis testing over the two hop relay network"):
  with members:
    - "distributed hypothesis testing with concurrent detections"
    - "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"
    - "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)