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 "on the broadcast latency in finite cooperative wireless networks"):
  Abstract: The aim of this paper is to study the effect of cooperation on system delay, quantified as the number of retransmissions required to deliver a broadcast message to all intended receivers. Unlike existing works on broadcast scenarios, where distance between nodes is not explicitly considered, we examine the joint effect of small scale fading and propagation path loss. Also, we study cooperation in application to finite networks, i.e. when the number of cooperating nodes is small. Stochastic geometry and order statistics are used to develop analytical models that tightly match the simulation results for non-cooperative scenario and provide a lower bound for delay in a cooperative setting. We demonstrate that even for a simple flooding scenario, cooperative broadcast achieves significantly lower system delay.

Includes members:
  Member "distance distributions in finite uniformly random networks theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")
  Member "a geometric interpretation of fading in wireless networks theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy analysis of random mimo wireless networks over alpha mu fading channels")
  Member "fundamental limits and scaling behavior of cooperative multicasting in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "device to device aided multicasting")

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)