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 outage probability of the full duplex interference limited relay channel"):
  Abstract: In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and interfering users are distributed as a Poisson point process. In this case, the asymptotic error probability is upper bounded by the outage probability (OP). We investigate the outage behavior for well-known cooperative schemes, namely, decode-and-forward (DF) and compress-and-forward (CF) considering fading and path loss. For DF we determine the exact OP and develop upper bounds which are tight in typical operating conditions. Also, we find the correlation coefficient between source and relay signals which minimizes the OP when the density of interferers is small. For CF, the achievable rates are determined by the spatial correlation of the interferences, and a straightforward analysis isn't possible. To handle this issue, we show the rate with correlated noises is at most one bit worse than with uncorrelated noises, and thus find an upper bound on the performance of CF. These results are useful to evaluate the performance and to optimize relaying schemes in the context of full-duplex wireless networks.

Includes members:
  Member "analysis of a cooperative strategy for a large decentralized wireless network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance evaluation of advanced relaying protocols in large wireless networks")
  Member "a tractable model for noncoherent joint transmission base station cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "edge computing enabled cell free massive mimo systems")
  Member "coverage by pairwise base station cooperation under adaptive geometric policies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "how to group wireless nodes together")
  Member "modeling and analysis of k tier downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "high sir transmission capacity of wireless networks with general fading and node distribution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on interference dynamics in matern networks")
  Member "study of gaussian relay channels with correlated noises":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interference mitigation via relaying")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "outage probability of general ad hoc networks in the high reliability regime":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)