human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "uplink user assisted relaying in cellular networks"
  Abstract: We use stochastic geometry to analyze the performance of a partial decode-and-forward (PDF) relaying scheme applied in a user-assisted relaying setting, where an active user relays data through another idle user in uplink cellular communication. We present the geometric model of a network deploying user-assisted relaying and propose two geometric cooperation policies for fast and slow fading channels. We analytically derive the cooperation probability for both policies. This cooperation probability is further used in the analytical derivation of the moments of inter-cell interference power caused by system-wide deployment of this user-assisted PDF relaying. We then model the inter-cell interference power statistics using the Gamma distribution by matching the first two moments analytically derived. This cooperation and interference analysis provides the theoretical basis for quantitatively evaluating the performance impact of user-assisted relaying in cellular networks. We then numerically evaluate the average transmission rate performance and show that user-assisted relaying can significantly improve per-user transmission rate despite of increased inter-cell interference. This transmission rate gain is significant for active users near the cell edge and further increases with higher idle user density, supporting user-assisted relaying as a viable solution to crowded population areas.

Connected through hyperedge HE-1 (induced by source paper "cross mode interference characterization in cellular networks with voronoi guard regions"):
  with members:
    - "user point processes in cellular networks"
    - "the intensity matching approach a tractable stochastic geometry approximation to system level analysis of cellular networks"
    - "poisson hole process theory and applications to wireless networks"
    - "modeling cellular networks with full duplex d2d communication a stochastic geometry approach"
    - "decentralized opportunistic access for d2d underlaid cellular networks"
    - "an analytical framework for device to device communication in cellular networks"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "operational region of d2d communications for enhancing cellular network performance"

Connected through hyperedge HE-2 (induced by source paper "interference modeling for cellular networks under beamforming transmission"):
  with members:
    - "understanding noise and interference regimes in 5g millimeter wave cellular networks"
    - "gaussian approximation for the downlink interference in heterogeneous cellular networks"
    - "coverage in heterogeneous downlink millimeter wave cellular networks"
    - "a stochastic geometry framework for analyzing pairwise cooperative cellular networks"
    - "a survey of millimeter wave mmwave communications for 5g opportunities and challenges"
    - "probabilistic omnidirectional path loss models for millimeter wave outdoor communications"
    - "analysis of a cooperative strategy for a large decentralized wireless network"
    - "coverage and rate analysis for millimeter wave cellular networks"

Connected through hyperedge HE-3 (induced by source paper "link regime and power savings of decode forward relaying in fading channels"):
  with members:
    - "link state based decode forward schemes for two way relaying"
    - "spectral efficiency and outage performance for hybrid d2d infrastructure uplink cooperation"
    - "energy minimization for the half duplex relay channel with decode forward relaying"
    - "compute and forward harnessing interference through structured codes"

Question: Please tell me which class the center node 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)