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 "collision resolution and interference elimination in multiaccess communication networks"):
  Abstract: We define a multiaccess communication scheme that effectively eliminates interference and resolves collisions in many-to-one and many-to-many communication scenarios. Each transmitter is uniquely identified by a steering vector. All signals issued from a specific transmitter will be steered into the same single-dimensional or double-dimensional subspace at all receivers hearing this transmission. This subspace is orthogonal to the noise subspace at a receiver and the signals within the subspace can be extracted using the root-MUSIC method. At high SNR, local channel knowledge and strict synchronization, the algorithm asymptotically achieves full network capacity on condition that a channel remains constant within a single time slot. Without synchronization, the worst case asymptotic performance is still greater than the $50\%$ throughput achieved by collision resolution algorithms and interference management techniques like interference alignment.

Includes members:
  Member "role of interference alignment in wireless cellular network optimization":
    also connected through other hyperedges:
      (none)
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")

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)