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: "rcfd a novel channel access scheme for full duplex wireless networks based on contention in time and frequency domains"
  Abstract: In the last years, the advancements in signal processing and integrated circuits technology allowed several research groups to develop working prototypes of in-band full-duplex wireless systems. The introduction of such a revolutionary concept is promising in terms of increasing network performance, but at the same time poses several new challenges, especially at the MAC layer. Consequently, innovative channel access strategies are needed to exploit the opportunities provided by full-duplex while dealing with the increased complexity derived from its adoption. In this direction, this paper proposes RTS/CTS in the Frequency Domain (RCFD), a MAC layer scheme for full-duplex ad hoc wireless networks, based on the idea of time-frequency channel contention. According to this approach, different OFDM subcarriers are used to coordinate how nodes access the shared medium. The proposed scheme leads to efficient transmission scheduling with the result of avoiding collisions and exploiting full-duplex opportunities. The considerable performance improvements with respect to standard and state-of-the-art MAC protocols for wireless networks are highlighted through both theoretical analysis and network simulations.

Connected through hyperedge HE-1 (induced by source paper "performance analysis and enhancements for in band full duplex wireless local area networks"):
  with members:
    - "performance analysis of csma ca based medium access in full duplex wireless communications"
    - "all digital self interference cancellation technique for full duplex systems"
    - "full duplex mac protocol design and analysis"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "self interference cancellation with nonlinear distortion suppression for full duplex systems"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-2 (induced by source paper "analysis of statistical qos in half duplex and full duplex dense heterogeneous cellular networks"):
  with members:
    - "statistical qos analysis of full duplex and half duplex heterogeneous cellular networks"
    - "the ginibre point process as a model for wireless networks with repulsion"
    - "what will 5g be"
    - "in band full duplex wireless challenges and opportunities"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "experiment driven characterization of full duplex wireless systems"
    - "a tractable approach to coverage and rate in cellular networks"

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.NI(Networking and Internet Architecture)