human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "estimating self sustainability in peer to peer swarming systems"
  Abstract: Peer-to-peer swarming is one of the de facto solutions for distributed content dissemination in today's Internet. By leveraging resources provided by clients, swarming systems reduce the load on and costs to publishers. However, there is a limit to how much cost savings can be gained from swarming; for example, for unpopular content peers will always depend on the publisher in order to complete their downloads. In this paper, we investigate such a dependence of peers on a publisher. For this purpose, we propose a new metric, namely swarm self-sustainability. A swarm is referred to as self-sustaining if all its blocks are collectively held by peers; the self-sustainability of a swarm is the fraction of time in which the swarm is self-sustaining. We pose the following question: how does the self-sustainability of a swarm vary as a function of content popularity, the service capacity of the users, and the size of the file? We present a model to answer the posed question. We then propose efficient solution methods to compute self-sustainability. The accuracy of our estimates is validated against simulations. Finally, we also provide closed-form expressions for the fraction of time that a given number of blocks is collectively held by peers.

Connected through hyperedge HE-1 (induced by source paper "on client interactive behaviour to design peer selection policies for bittorrent like protocols"):
  with members:
    - "a user profile based access control model and architecture"
    - "rarest first and choke algorithms are enough"

Connected through hyperedge HE-2 (induced by source paper "design and analysis of coalitions in data swarming systems"):
  with members:
    - "a distributed merge and split algorithm for fair cooperation in wireless networks"
    - "clustering and sharing incentives in bittorrent systems"

Connected through hyperedge HE-3 (induced by source paper "heterogeneous download times in a homogeneous bittorrent swarm"):
  with members:
    - "stability of a peer to peer communication system"
    - "the missing piece syndrome in peer to peer communication"
    - "rarest first and choke algorithms are enough"
    - "clustering and sharing incentives in bittorrent systems"

Connected through hyperedge HE-4 (induced by source paper "stability of a peer to peer communication system"):
  with members:
    - "on the stability of two chunk file sharing systems"
    - "the missing piece syndrome in peer to peer communication"
    - "rarest first and choke algorithms are enough"
    - "clustering and sharing incentives in bittorrent systems"

Connected through hyperedge HE-5 (induced by source paper "the missing piece syndrome in peer to peer communication"):
  with members:
    - "on the stability of two chunk file sharing systems"
    - "stability of a peer to peer communication system"
    - "gossiping with multiple messages"

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