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 "detection performance in balanced binary relay trees with node and link failures"):
  Abstract: We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to N identical and independent sensors generating binary messages. The root of the tree is a fusion center making an overall decision. Every other node is a relay node that aggregates the messages received from its child nodes into a new message and sends it up toward the fusion center. We derive upper and lower bounds for the total error probability PN as explicit functions of N in the case where nodes and links fail with certain probabilities. These characterize the asymptotic decay rate of the total error probability as N goes to infinity. Naturally, this decay rate is not larger than that in the non-failure case, which is √N . However, we derive an explicit necessary and sufficient condition on the decay rate of the local failure probabilities pk (combination of node and link failure probabilities at each level) such that the decay rate of the total error probability in the failure case is the same as that of the non-failure case. More precisely, we show that logPN-1=Θ(√N) if and only if logpk-1=Ω(2k/2) .

Includes members:
  Member "detection performance of m ary relay trees with non binary message alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning in hierarchical social networks")
  Member "subexponential convergence for information aggregation on regular trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asynchronous majority dynamics in preferential attachment trees")
  Member "error probability bounds for balanced binary relay trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "average error probability in wireless sensor networks with imperfect sensing and communication for different decision rules")
  Member "data fusion trees for detection does architecture matter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)