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: "clustering and sharing incentives in bittorrent systems"
  Abstract: Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. Consequently, it is important to gain a full understanding of how these protocols behave in practice and how their parameters impact overall performance. We present the first experimental investigation of the peer selection strategy of the popular BitTorrent protocol in an instrumented private torrent. By observing the decisions of more than 40 nodes, we validate three BitTorrent properties that, though widely believed to hold, have not been demonstrated experimentally. These include the clustering of similar-bandwidth peers, the effectiveness of BitTorrent's sharing incentives, and the peers' high average upload utilization. In addition, our results show that BitTorrent's new choking algorithm in seed state provides uniform service to all peers, and that an underprovisioned initial seed leads to the absence of peer clustering and less effective sharing incentives. Based on our observations, we provide guidelines for seed provisioning by content providers, and discuss a tracker protocol extension that addresses an identified limitation of the protocol.

Connected through hyperedge HE-1 (induced by source paper "on the scalability of p2p swarming systems"):
  with members:
    - "a new stable peer to peer protocol with non persistent peers"
    - "a stable fountain code mechanism for peer to peer content distribution"
    - "tree dynamics for peer to peer streaming"
    - "can p2p networks be super scalable"
    - "heterogeneous download times in a homogeneous bittorrent swarm"
    - "on the stability of two chunk file sharing systems"
    - "stability of a peer to peer communication system"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-2 (induced by source paper "a new stable peer to peer protocol with non persistent peers"):
  with members:
    - "a stable fountain code mechanism for peer to peer content distribution"
    - "on the stability of two chunk file sharing systems"
    - "stability of a peer to peer communication system"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-3 (induced by source paper "isp friendly peer assisted on demand streaming of long duration content in bbc iplayer"):
  with members:
    - "pushing bittorrent locality to the limit"

Connected through hyperedge HE-4 (induced by source paper "experimenting with bittorrent on a cluster a good or a bad idea"):
  with members:
    - "can realistic bittorrent experiments be performed on clusters"
    - "rarest first and choke algorithms are enough"

Connected through hyperedge HE-5 (induced by source paper "performance modeling of bittorrent peer to peer file sharing networks"):
  with members:
    - "rarest first and choke algorithms are enough"

Connected through hyperedge HE-6 (induced by source paper "design and analysis of coalitions in data swarming systems"):
  with members:
    - "estimating self sustainability in peer to peer swarming systems"
    - "a distributed merge and split algorithm for fair cooperation in wireless networks"

Connected through hyperedge HE-7 (induced by source paper "pros cons of model based bandwidth control for client assisted content delivery"):
  with members:
    - "rarest first and choke algorithms are enough"

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

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)