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: "stability of a peer to peer communication system"
  Abstract: This paper focuses on the stationary portion of file download in an unstructured peer-to-peer network, which typically follows for many hours after a flash crowd initiation. The model includes the case that peers can have some pieces at the time of arrival. The contribution of the paper is to identify how much help is needed from the seeds, either fixed seeds or peer seeds (which are peers remaining in the system after obtaining a complete collection) to stabilize the system. The dominant cause for instability is the missing piece syndrome, whereby one piece becomes very rare in the network. It is shown that stability can be achieved with only a small amount of help from peer seeds--even with very little help from a fixed seed, peers need dwell as peer seeds on average only long enough to upload one additional piece. The region of stability is insensitive to the piece selection policy. Network coding can substantially increase the region of stability in case a portion of the new peers arrive with randomly coded pieces.

Connected through hyperedge HE-1 (induced by source paper "stability and scalability of blockchain systems"):
  with members:
    - "prism scaling bitcoin by 10 000x"
    - "markov processes in blockchain systems"
    - "decentralization in bitcoin and ethereum networks"
    - "dandelion lightweight cryptocurrency networking with formal anonymity guarantees"
    - "dandelion redesigning the bitcoin network for anonymity"
    - "majority is not enough bitcoin mining is vulnerable"
    - "can p2p networks be super scalable"
    - "gossiping with multiple messages"

Connected through hyperedge HE-2 (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"
    - "the missing piece syndrome in peer to peer communication"
    - "rarest first and choke algorithms are enough"

Connected through hyperedge HE-3 (induced by source paper "mode suppression a simple stable and scalable chunk sharing algorithm for p2p networks"):
  with members:
    - "a new stable peer to peer protocol with non persistent peers"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-4 (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"
    - "the missing piece syndrome in peer to peer communication"
    - "clustering and sharing incentives in bittorrent systems"

Connected through hyperedge HE-5 (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"
    - "on the stability of two chunk file sharing systems"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-6 (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"
    - "on client interactive behaviour to design peer selection policies for bittorrent like protocols"
    - "enabling information centric networks through opportunistic search routing and caching"
    - "heterogeneous download times in a homogeneous bittorrent swarm"
    - "rarest first and choke algorithms are enough"

Connected through hyperedge HE-7 (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"
    - "on the stability of two chunk file sharing systems"
    - "sustaining the internet with hyperbolic mapping"
    - "the missing piece syndrome in peer to peer communication"

Connected through hyperedge HE-8 (induced by source paper "tree dynamics for peer to peer streaming"):
  with members:
    - "the missing piece syndrome in peer to peer communication"
    - "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.PF(Performance)