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 the stability of two chunk file sharing systems"
  Abstract: We consider five different peer-to-peer file-sharing systems with two chunks, assuming non-altruistic peers who leave the system immediately after downloading the second chunk. Our aim is to find chunk selection algorithms that have provably stable performance with any input rate. We show that many algorithms that first looked promising lead to unstable or oscillating behaviour. However, we end up with a system with desirable properties. Most of our rigorous results concern the corresponding deterministic large system limits, but in the two simplest cases we provide proofs for the stochastic systems also.

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"
    - "stability of a peer to peer communication system"
    - "the missing piece syndrome in peer to peer communication"
    - "rarest first and choke algorithms are enough"

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"
    - "stability of a peer to peer communication system"
    - "the missing piece syndrome in peer to peer communication"
    - "clustering and sharing incentives in bittorrent systems"

Connected through hyperedge HE-3 (induced by source paper "a stable fountain code mechanism for peer to peer content distribution"):
  with members:
    - "on the benefit of information centric networks for traffic engineering"
    - "contentflow mapping content to flows in software defined networks"
    - "content based traffic engineering in software defined information centric networks"
    - "on the interaction of adaptive video streaming with content centric networking"
    - "can p2p networks be super scalable"
    - "network coding meets information centric networking"
    - "stability of a peer to peer communication system"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-4 (induced by source paper "can p2p networks be super scalable"):
  with members:
    - "spatial interactions of peers and performance of file sharing systems"
    - "stable scalable decentralized p2p file sharing with non altruistic peers"
    - "stability of a peer to peer communication system"
    - "sustaining the internet with hyperbolic mapping"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-5 (induced by source paper "spatial interactions of peers and performance of file sharing systems"):
  with members:
    - "stable scalable decentralized p2p file sharing with non altruistic peers"
    - "stability of a peer to peer communication system"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-6 (induced by source paper "stability of a peer to peer communication system"):
  with members:
    - "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"
    - "clustering and sharing incentives in bittorrent systems"

Connected through hyperedge HE-7 (induced by source paper "the missing piece syndrome in peer to peer communication"):
  with members:
    - "stability of a peer to peer communication system"
    - "estimating self sustainability in peer to peer swarming systems"
    - "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.OS(Operating Systems)