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 "a general method for the design of tree networks under communication constraints"):
  Abstract: We consider a distributed detection system with communication constraints, where several nodes are arranged in an arbitrary tree topology, under the assumption of conditionally independent observations. We propose a cyclic design procedure using the minimum expected error probability as a design criterion while adopting a person-by-person methodology. We design each node jointly together with the fusion center, while other nodes are kept fixed, and show that the design of each node using the person-by-person methodology is analogous to the design of a network with two nodes, a network which we refer to as the restricted model. We further show how the parameters in the restricted model for the design of a node in the tree network can be found in a computationally efficient manner. The proposed numerical methodology can be applied for the design of nodes arranged in arbitrary tree topologies with arbitrary channel rates for the links between nodes and for a general M-ary hypothesis testing problem.

Includes members:
  Member "bayesian design of tandem networks for distributed detection with multi bit sensor decisions":
    also connected through other hyperedges:
      (none)
  Member "data fusion trees for detection does architecture matter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed detection with empirically observed statistics")

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)