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: "analog baseband cancellation for full duplex an experiment driven analysis"
  Abstract: Recent wireless testbed implementations have proven that full-duplex communication is in fact possible and can outperform half-duplex systems. Many of these implementations modify existing half-duplex systems to operate in full-duplex. To realize the full potential of full-duplex, radios need to be designed with self-interference in mind. In our work, we use a novel patch antenna prototype in an experimental setup to characterize the self-interference channel between transmit and receive radios. We derive an equivalent analytical baseband model and propose analog baseband cancellation techniques to complement the RF cancellation provided by the patch antenna prototype. Our results show that a wide bandwidth, moderate isolation scheme achieves up to 2.4 bps/Hz higher achievable rate than a narrow bandwidth, high isolation scheme. Furthermore, the analog baseband cancellation yields a 10-10,000 improvement in BER over RF only cancellation.

Connected through hyperedge HE-1 (induced by source paper "resource allocation in heterogenous full duplex ofdma networks design and analysis"):
  with members:
    - "performance evaluation of user scheduling for full duplex small cells in ultra dense networks"
    - "resource allocation in ofdma networks with half duplex and imperfect full duplex users"
    - "all digital self interference cancellation technique for full duplex systems"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-2 (induced by source paper "feasibility of in band full duplex radio transceivers with imperfect rf components analysis and enhanced cancellation algorithms"):
  with members:
    - "cancellation of power amplifier induced nonlinear self interference in full duplex transceivers"
    - "advanced self interference cancellation and multiantenna techniques for full duplex radios"
    - "analysis of oscillator phase noise effects on self interference cancellation in full duplex ofdm radio transceivers"
    - "widely linear digital self interference cancellation in direct conversion full duplex transceiver"
    - "full duplex transceiver system calculations analysis of adc and linearity challenges"
    - "self interference cancellation with nonlinear distortion suppression for full duplex systems"
    - "understanding the impact of phase noise on active cancellation in wireless full duplex"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-3 (induced by source paper "an analog baseband approach for designing full duplex radios"):
  with members:
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "experiment driven characterization of full duplex wireless systems"

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)