human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "proof of work without all the work computationally efficient attack resistant systems"):
  Abstract: Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a computational cost on participating devices. Unfortunately, traditional PoW schemes require that correct devices perform computational work perpetually, even when the system is not under attack. #R##N#We address this issue by designing a general PoW protocol that ensures two properties. First, the network stays secure. In particular, the fraction of identities in the system that are controlled by an attacker is always less than 1/2. Second, our protocol's computational cost is commensurate with the cost of an attacker. In particular, the total computational cost of correct devices is a linear function of the attacker's computational cost plus the number of correct devices that have joined the system. Consequently, if the network is attacked, we ensure security with cost that grows linearly with the attacker's cost; and, in the absence of attack, our computational cost remains small. We prove similar guarantees for bandwidth cost. #R##N#Our results hold in a dynamic, decentralized system where participants join and depart over time, and where the total computational power of the attacker is up to a constant fraction of the total computational power of correct devices. We demonstrate how to leverage our results to address important security problems in distributed computing including: Sybil attacks, Byzantine consensus, and Committee election.

Includes members:
  Member "proof of work without all the work":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource competitive sybil defenses")
  Member "secure one way interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource competitive sybil defenses")
  Member "torbricks blocking resistant tor bridge distribution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "resource competitive sybil defenses")
  Member "interactive communication with unknown noise rate":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "the mason test a defense against sybil attacks in wireless networks without trusted authorities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource competitive sybil defenses")
  Member "self healing computation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "resource competitive sybil defenses")
  Member "the sybil attacks and defenses a survey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource competitive sybil defenses")
  Member "storage and search in dynamic peer to peer networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "resource competitive sybil defenses")

Question: Please tell me which class the source paper 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.DC(Distributed, Parallel, and Cluster Computing)