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: "modeling and efficient cancellation of nonlinear self interference in mimo full duplex transceivers"
  Abstract: This paper addresses the modeling and digital cancellation of self-interference in in-band full-duplex (FD) transceivers with multiple transmit and receive antennas. The self-interference modeling and the proposed nonlinear spatio-temporal digital canceller structure takes into account, by design, the effects of I/Q modulator imbalances and power amplifier (PA) nonlinearities with memory, in addition to the multipath self-interference propagation channels and the analog RF cancellation stage. The proposed solution is the first cancellation technique in the literature which can handle such a self-interference scenario. It is shown by comprehensive simulations with realistic RF component parameters and with two different PA models to clearly outperform the current state-of-the-art digital self-interference cancellers, and to clearly extend the usable transmit power range.

Connected through hyperedge HE-1 (induced by source paper "compact full duplex mimo radios in d2d underlaid cellular networks from system design to prototype results"):
  with members:
    - "wideband self adaptive rf cancellation circuit for full duplex radio operating principle and measurements"
    - "prototyping real time full duplex radios"
    - "cancellation of power amplifier induced nonlinear self interference in full duplex transceivers"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "simultaneous transmission and reception algorithm design and system level performance"
    - "in band full duplex wireless challenges and opportunities"
    - "power control for d2d underlaid cellular networks modeling algorithms and analysis"

Connected through hyperedge HE-2 (induced by source paper "hybrid full half duplex system analysis in heterogeneous wireless networks"):
  with members:
    - "throughput analysis for wireless networks with full duplex radios"
    - "interference coordination random clustering and adaptive limited feedback"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "in band full duplex wireless challenges and opportunities"
    - "fundamentals of heterogeneous cellular networks with energy harvesting"
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "analytical modeling of uplink cellular networks"
    - "load aware modeling and analysis of heterogeneous 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.IT(Information Theory)