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 detection in ad hoc networks through quantized consensus"):
  Abstract: We study the asymptotic performance of distributed detection in large scale connected sensor networks. Contrasting to the canonical parallel network where a single node has access to local decisions from all other nodes, each node can only exchange information with its direct neighbors in the present setting. We establish that, with each node employing an identical one-bit quantizer for local information exchange, a novel consensus reaching approach can achieve the optimal asymptotic performance of centralized detection as the network size scales. The statement is true under three different detection frameworks: 1) the Bayesian criterion where the maximum  a posteriori  detector is optimal; 2) the Neyman–Pearson criterion with a constant type-I error probability constraint; and 3) the Neyman–Pearson criterion with an exponential type-I error probability constraint. Leveraging recent development in distributed consensus reaching using bounded quantizers with possibly unbounded data (which are log-likelihood ratios of local observations in the context of distributed detection), we design a one-bit deterministic quantizer with a controllable threshold that leads to desirable consensus error bounds. The obtained bounds are key to establishing the optimal asymptotic detection performance. In addition, we examine the non-asymptotic performance of the proposed approach and show that the type-I and type-II error probabilities at each node can be made arbitrarily close to the centralized ones simultaneously when a continuity condition is satisfied.

Includes members:
  Member "quantized consensus by the admm probabilistic versus deterministic quantizers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "detection under one bit messaging over adaptive networks")
  Member "distributed detection over noisy networks large deviations analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed learning with adversarial agents under relaxed network condition")
  Member "large deviations performance of consensus innovations distributed detection with non gaussian observations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "detection under one bit messaging over adaptive networks")
  Member "distributed consensus algorithms in sensor networks quantized data and random link failures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fully decentralized multi agent reinforcement learning with networked agents")
  Member "topology for distributed inference on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "byzantine resilient locally optimum detection using collaborative autonomous networks")

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)