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: "performance analysis of cooperative communications at road intersections using stochastic geometry tools"
  Abstract: Vehicular safety communications (VSC) are known to provide relevant contributions to avoid congestions and prevent road accidents, and more particularly at road intersections since these areas are more prone to accidents. In this context, one of the main impairments that affect the performance of VSC are interference. In this paper, we develop a tractable framework to model cooperative transmissions in presence of interference for VSC at intersections. We use tools from stochastic geometry, and model interferer vehicles locations as a Poisson point process. First, we calculate the outage probability (OP) for a direct transmission when the received node can be anywhere on the plan. Then, we analyze the OP performance of a cooperative transmission scheme. The analysis takes into account two dimensions: the decoding strategy at the receiver, and the vehicles mobility. We derive the optimal relay position, from analytical and simulation results, for different traffic densities and for different vehicles mobility models. We also show that the OP does not improve after the number of infrastructure relays reached a threshold value. Finally, we show that the OP performance of VSC is higher at intersections than on highways. We validated our analytical results by Monte-Carlo simulations.

Connected through hyperedge HE-1 (induced by source paper "on the performance of cooperative noma using mrc at road intersections in the presence of interference"):
  with members:
    - "outage analysis of cooperative noma using maximum ratio combining at intersections"
    - "vehicle to vehicle communications with urban intersection path loss models"
    - "relay selection for cooperative noma"
    - "cooperative non orthogonal multiple access with simultaneous wireless information and power transfer"
    - "on the outage probability of the full duplex interference limited relay channel"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"

Connected through hyperedge HE-2 (induced by source paper "performance evaluation of adaptive cooperative noma protocol at road junctions"):
  with members:
    - "outage analysis of cooperative noma using maximum ratio combining at intersections"
    - "vehicle to vehicle communications with urban intersection path loss models"
    - "relay selection for cooperative noma"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"

Connected through hyperedge HE-3 (induced by source paper "outage analysis of cooperative noma using maximum ratio combining at intersections"):
  with members:
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"
    - "non orthogonal multiple access in large scale heterogeneous networks"
    - "full duplex multi antenna relay assisted cooperative non orthogonal multiple access"
    - "modeling and design of millimeter wave networks for highway vehicular communication"
    - "vehicle to vehicle communications with urban intersection path loss models"
    - "relay selection for cooperative noma"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"

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)