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: "passive loop interference suppression in large scale full duplex cellular networks"
  Abstract: Loop interference (LI) in wireless communications, is a notion resulting from the full-duplex (FD) operation. In a large-scale network, FD also increases the multiuser interference due to the large number of active wireless links that exist. Hence, in order to realize the FD potentials, this interference needs to be restricted. This paper presents a stochastic geometry model of FD cellular networks where the users and base stations employ directional antennas. Based on previous experimental results, we model the passive suppression of the LI at each FD terminal as a function of the angle between the two antennas and show the significant gains that can be achieved by this method. Together with the reduction of multiuser interference resulting from antenna directionality, our model demonstrates that FD can potentially be implemented in large-scale directional networks.

Connected through hyperedge HE-1 (induced by source paper "directional antennas for interference management in full duplex cellular networks"):
  with members:
    - "a primer on cellular network analysis using stochastic geometry"
    - "throughput and coverage for a mixed full and half duplex small cell network"
    - "uplink performance analysis of dense cellular networks with los and nlos transmissions"
    - "full duplex radio for uplink downlink transmission with spatial randomness"
    - "full duplex mimo small cell networks performance analysis"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "exploiting known interference as green signal power for downlink beamforming optimization"
    - "in band alpha duplex scheme for cellular networks a stochastic geometry approach"

Connected through hyperedge HE-2 (induced by source paper "impact of directionality on interference mitigation in full duplex cellular network"):
  with members:
    - "full duplex mimo small cell networks performance analysis"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "exploiting known interference as green signal power for downlink beamforming optimization"
    - "full duplex radio for uplink downlink wireless access with spatially random nodes"
    - "joint beamforming optimization and power control for full duplex mimo two way relay channel"
    - "outage analysis of full duplex architectures in cellular networks"
    - "multipair full duplex relaying with massive arrays and linear processing"
    - "passive self interference suppression for full duplex infrastructure nodes"

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)