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 "throughput efficient large m2m networks through incremental redundancy combining"):
  Abstract: In this paper, we investigate the performance of incremental redundancy combining as a new cooperative relaying protocol for large M2M networks with opportunistic relaying. The nodes in the large M2M network are modeled by a Poisson Point Process, experience Rayleigh fading and utilize slotted ALOHA as the MAC protocol. The progress rate density (PRD) of the M2M network is used to quantify the performance of proposed relaying protocol and compare it to conventional multihop relaying with no cooperation. It is shown that incremental redundancy combining in a large M2M network provides substantial throughput improvements over conventional relaying with no cooperation at all practical values of the network parameters.

Includes members:
  Member "cooperative relaying for large random multihop networks":
    also connected through other hyperedges:
      (none)
  Member "opportunistic routing in ad hoc networks how many relays should there be what rate should nodes use":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cooperative relaying for large random multihop networks")
  Member "spatial analysis of opportunistic downlink relaying in a two hop cellular system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure transmission in linear multihop relaying 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)