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"):
  Abstract: Proof-of-work (PoW) is a popular algorithmic tool used to enhance network security by imposing a computational cost on participating devices. Unfortunately, traditional PoW schemes require that correct devices work perpetually in order to remain vigilant against possible malicious behavior. In other words, computational costs are unbounded regardless of whether the network is under attack. This shortcoming is highlighted by recent studies showing that PoW is highly inefficient with respect to operating cost and ecological footprint. #R##N#We address this issue by designing a general PoW scheme for securing open distributed systems, whereby the cost to devices grows slowly as a function of the cost incurred by an attacker. Consequently, if the network is attacked, our scheme guarantees security, with algorithmic costs that are commensurate with the cost of the attacker. Conversely, in the absence of attack, algorithmic costs are small. #R##N#Our results hold in a dynamic system where participants join and depart over time. We demonstrate how our PoW scheme can be leveraged to address important security problems in distributed computing including: Sybil attacks, Byzantine consensus, and Committee election.

Includes members:
  Member "algorand the efficient and democratic ledger":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consistency of proof of stake blockchains with concurrent honest slot leaders")
  Member "bitcoin ng a scalable blockchain protocol":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "resource competitive sybil defenses")
  Member "the sybil attacks and defenses a survey":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource competitive sybil defenses")
  Member "sybilcontrol practical sybil defense with computational puzzles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource competitive sybil defenses")
  Member "uncovering social network sybils in the wild":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fawkes protecting personal privacy against unauthorized deep learning models")
  Member "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "in search for a linear byzantine agreement")

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)