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: "on client interactive behaviour to design peer selection policies for bittorrent like protocols"
  Abstract: Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet. This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand streaming system. The vast majority of these proposals focus on modifying the piece and peer selection policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been given to the piece selection policy rather than to the peer selection policy. Within this context, this article proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols, considering interactive scenarios. To this end, we analyze the client interactive behaviour when accessing real multimedia systems. This analysis consists of looking into workloads of real content providers and assessing three important metrics, namely temporal dispersion, spatial dispersion and object position popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our knowledge, this is the first time that the client interactive behaviour is specially considered to derive an algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges and possible future work in this research field.

Connected through hyperedge HE-1 (induced by source paper "improving bittorrent s peer selection for multimedia content on demand delivery"):
  with members:
    - "on the optimization of bittorrent like protocols for interactive on demand streaming systems"

Connected through hyperedge HE-2 (induced by source paper "on the optimization of bittorrent like protocols for interactive on demand streaming systems"):
  with members:
    - "on the scalability of p2p swarming systems"
    - "enabling information centric networks through opportunistic search routing and caching"
    - "heterogeneous download times in a homogeneous bittorrent swarm"
    - "stability of a peer to peer communication system"
    - "rarest first and choke algorithms are enough"

Connected through hyperedge HE-3 (induced by source paper "analyzing peer selection policies for bittorrent multimedia on demand streaming systems in internet"):
  with members:
    - "heterogeneous download times in a homogeneous bittorrent swarm"
    - "pushing bittorrent locality to the limit"
    - "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)