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 "threshold logical clocks for asynchronous distributed coordination and consensus"):
  Abstract: Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. This paper attempts to simplify asynchronous consensus by building atop a novel threshold logical clock abstraction, which enables upper layers to operate as if on a synchronous network. This approach yields an asynchronous consensus protocol for fail-stop nodes that may be simpler and more robust than Paxos and its leader-based variants, requiring no common coins and achieving consensus in a constant expected number of rounds. The same approach can be strengthened against Byzantine failures by building on well-established techniques such as tamper-evident logging and gossip, accountable state machines, threshold signatures and witness cosigning, and verifiable secret sharing. This combination of existing abstractions and threshold logical clocks yields a modular, cleanly-layered approach to building practical and efficient Byzantine consensus, distributed key generation, time, timestamping, and randomness beacons, and other critical services.

Includes members:
  Member "sok transparent dishonesty front running attacks on blockchain":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the convergence of artificial intelligence and distributed ledger technology a scoping review and future research agenda")
  Member "validated asynchronous byzantine agreement with optimal resilience and asymptotically optimal time and word communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved extension protocols for byzantine broadcast and agreement")
  Member "blockmania from block dags to consensus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sok tools for game theoretic models of security for cryptocurrencies")
  Member "towards more reliable bitcoin timestamps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "presto a systematic framework for blockchain consensus protocols")
  Member "coconut threshold issuance selective disclosure credentials with applications to distributed ledgers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a taxonomic approach to understanding emerging blockchain identity management systems")
  Member "enhancing bitcoin security and performance with strong consistency via collective signing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "hijacking bitcoin large scale network attacks on cryptocurrencies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hijacking routes in payment channel networks a predictability tradeoff")
  Member "on reducing the complexity of matrix clocks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "que sera consensus simple asynchronous agreement with private coins and threshold logical clocks")

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)