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 "distributed discovery clients for spectrum allocation"):
  Abstract: By using a distributed P2P system where the agents reside in in microprocessors already present in most radio nodes like Wi-Fi access points, base stations, TVs connected to Internet etc, these agents can discover other agents over the back-haul network. As a result, client node lists (similar to neighbor lists used in 3GPP) are created. An alternative is to use a centralized database. Why this best is done by distributed agents is discussed in this paper along with security considerations. Examples of other applications which will benefit from this system is also presented.

Includes members:
  Member "large scale distributed internet based discovery mechanism for dynamic spectrum allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a potential game for power and frequency allocation in large scale wireless networks")
  Member "a potential game for power and frequency allocation in large scale wireless networks":
    also connected through other hyperedges:
      (none)
  Member "mechanism design for base station association and resource allocation in downlink ofdma network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust radio resource allocation in miso scma assisted c ran in 5g networks")

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)