human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "passive self interference suppression for full duplex infrastructure nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi objective antenna selection in a full duplex base station")
  Member "self interference cancellation with phase noise induced ici suppression for full duplex systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transceiver design to maximize the weighted sum secrecy rate in full duplex swipt systems")
  Member "distributed full duplex via wireless side channels bounds and protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cache aided full duplex small cells")
  Member "understanding the impact of phase noise on active cancellation in wireless full duplex":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  Member "virtual full duplex wireless communication via rapid on off division duplex":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressed neighbour discovery using sparse kerdock matrices")

Question: Please tell me which class the source paper 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)