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: "state space adaptive nonlinear self interference cancellation for full duplex communication"
  Abstract: Full-duplex transmission comprises the ability to transmit and receive at the same time on the same frequency band. It allows for more efficient utilization of spectral resources, but raises the challenge of strong self-interference (SI). Cancellation of SI is generally implemented as a multi-stage approach. This paper proposes a novel adaptive SI cancellation algorithm in the digital domain based on Kalman filter theory that creates the following advances: first, the number of unknowns of the nonlinear SI model in cascade structure is significantly reduced compared to the conventional Hammerstein parallel model since it decouples the identification of linear and nonlinear elements; second, the remote signal-of-interest (SoI) is explicitly considered in the algorithm since the Kalman filter approach tunes its adaptation by the SoI power or performs successive cancellation; third, temporal variations of the SI channel are covered by a composite state-space model. In our simulation results, we analyze the performance by evaluating residual interference, system identification accuracy, and communication rate. We show that our Kalman filter solution in cascade structure delivers good performance with low computational complexity. In this configuration, the performance lines up with that of the monolithic (parallel) Kalman filter or the recursive-least squares (RLS) algorithms with parallel Hammerstein models. We implement our algorithm as a component of a practical prototype that demonstrates the benefits of a slender algorithmic design like the proposed cascade structure.

Connected through hyperedge HE-1 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems"):
  with members:
    - "all digital self interference cancellation technique for full duplex systems"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"
    - "multipair full duplex relaying with massive arrays and linear processing"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "low complexity end to end performance optimization in mimo full duplex relay systems"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "understanding the impact of phase noise on active cancellation in wireless full duplex"

Connected through hyperedge HE-2 (induced by source paper "robust transceiver design for mimo decode and forward full duplex relay"):
  with members:
    - "all digital self interference cancellation technique for full duplex systems"
    - "multipair full duplex relaying with massive arrays and linear processing"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "low complexity end to end performance optimization in mimo full duplex relay systems"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "understanding the impact of phase noise on active cancellation in wireless full duplex"

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)