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 "resource competitive sybil defenses"):
  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 significant computational work in perpetuity, even when the system is not under attack. We address this issue by designing general PoW protocols that ensure two properties. First, the fraction of identities in the system that are controlled by an attacker is a minority. Second, the computational cost of our protocol is comparable to the cost of an attacker. In particular, we present an efficient algorithm, GMCOM, which guarantees that the average computational cost to the good ID per unit time is O(J + sqrt(T(J+1))), where J is the average number of joins by the good IDs and T is the average computational spending of the adversary. Additionally, we discuss a precursor to this algorithm, CCOM, which guarantees an average computational cost to good IDs per unit time of O(J+T). We prove a lower bound showing that GMCOM's spending rate is asymptotically optimal among a large family of algorithms. Finally, we provide empirical evidence that our algorithms can be significantly more efficient than previous defenses under various attack scenarios.

Includes members:
  Member "proof of work without all the work":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "proof of execution reaching consensus through fault tolerant speculation")
  Member "secure one way interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proof of work without all the work computationally efficient attack resistant systems")
  Member "torbricks blocking resistant tor bridge distribution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scalable and secure computation among strangers resource competitive byzantine protocols")
  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 "bitcoin ng a scalable blockchain protocol":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "the mason test a defense against sybil attacks in wireless networks without trusted authorities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decentralized trust management risk analysis and trust aggregation")
  Member "self healing computation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "proof of work without all the work computationally efficient attack resistant systems")
  Member "the sybil attacks and defenses a survey":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "proof of work without all the work computationally efficient attack resistant systems")

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)