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 "on the scalability of p2p swarming systems"):
  Abstract: Abstract   One of the fundamental problems in the realm of peer-to-peer systems is that of determining their service capacities. In this paper we focus on P2P scalability issues and propose models to compute the achievable throughput under distinct policies for selecting both peers and blocks. From these models, we obtain novel insights on the behavior of P2P swarming systems that motivate new mechanisms for publishers and peers to improve the overall performance. In particular, we obtain operational regions for swarm system. In addition, we show that system capacity significantly increases if publishers adopt the most deprived peer selection and peers reduce their service rates when they have all the file blocks but one.

Includes members:
  Member "a new stable peer to peer protocol with non persistent peers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mode suppression a simple stable and scalable chunk sharing algorithm for p2p networks")
  Member "a stable fountain code mechanism for peer to peer content distribution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new stable peer to peer protocol with non persistent peers")
  Member "tree dynamics for peer to peer streaming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deterministic near optimal p2p streaming")
  Member "can p2p networks be super scalable":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stability and scalability of blockchain systems")
  Member "heterogeneous download times in a homogeneous bittorrent swarm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the optimization of bittorrent like protocols for interactive on demand streaming systems")
  Member "on the stability of two chunk file sharing systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a new stable peer to peer protocol with non persistent peers")
  Member "stability of a peer to peer communication system":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stability and scalability of blockchain systems")
  Member "the missing piece syndrome in peer to peer communication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mode suppression a simple stable and scalable chunk sharing algorithm for p2p 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)