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 "a stable fountain code mechanism for peer to peer content distribution"):
  Abstract: Most peer-to-peer content distribution sys- tems require the peers to privilege the welfare of the overall system over greedily maximizing their own utility. When downloading a file broken up into multiple pieces, peers are often asked to pass on some possible download opportunities of common pieces in order to favor rare pieces. This is to avoid the missing piece syndrome, which throttles the download rate of the peer-to-peer system to that of downloading the file straight from the server. In other situations, peers are asked to stay in the system even though they have collected all the file's pieces and have an incentive to leave right away. We propose a mechanism which allows peers to act greedily and yet stabilizes the peer-to-peer content shar- ing system. Our mechanism combines a fountain code at the server to generate innovative new pieces, and a prioritization for the server to deliver pieces only to new peers. While by itself, neither the fountain code nor the prioritization of new peers alone stabilizes the system, we demonstrate that their combination does, through both analytical and numerical evaluation. I. INTRODUCTION

Includes members:
  Member "on the benefit of information centric networks for traffic engineering":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "warp a icn architecture for social data")
  Member "contentflow mapping content to flows in software defined networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exploiting network awareness to enhance dash over wireless")
  Member "content based traffic engineering in software defined information centric networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploiting network awareness to enhance dash over wireless")
  Member "on the interaction of adaptive video streaming with content centric networking":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quality of experience from cache hierarchies keep your low bitrate close and high bitrate closer")
  Member "can p2p networks be super scalable":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stability and scalability of blockchain systems")
  Member "network coding meets information centric networking":
    also connected through other hyperedges:
      (none)
  Member "on the stability of two chunk file sharing systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the scalability of p2p swarming systems")
  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")

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)