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 "is stellar as secure as you think"):
  Abstract: Stellar is one of the top ten cryptocurrencies in terms of market capitalization. It adopts a variant of Byzantine fault tolerance (BFT), named federated Byzantine agreement (FBA), which generalizes the traditional BFT algorithm to make it more suitable for open-membership blockchains. To this end, FBA introduces a quorum slice concept, which consists of a set of nodes. In FBA, a node can complete one consensus round when it receives specific messages from nodes in a quorum slice appointed by the node. In this study, we analyze FBA, whose security is highly dependent on the structure of quorum slices, and demonstrate that it is not superior to the traditional BFT algorithm in terms of safety and liveness. Then, to analyze the security of the Stellar consensus protocol (SCP), which is a construction for FBA, we investigate the current quorum slices in Stellar. We analyze the structure of quorum slices and measure the influence of each node quantitatively using two metrics, PageRank (PR) and the newly proposed NodeRank (NR). The results show that the Stellar system is significantly centralized. Thereafter, to determine how the centralized structure can have a negative impact on the Stellar system, we study the cascading failure caused by deleting only a few nodes (i.e., validators) in Stellar. We show that all of the nodes in Stellar cannot run SCP if only two nodes fail. To make matters worse, these two nodes are run and controlled by a single organization, the Stellar foundation.

Includes members:
  Member "decentralization in bitcoin and ethereum networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stability and scalability of blockchain systems")
  Member "federated byzantine quorum systems extended version":
    also connected through other hyperedges:
      (none)
  Member "an empirical analysis of linkability in the monero blockchain":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simulated blockchains for machine learning traceability and transaction values in the monero network")
  Member "be selfish and avoid dilemmas fork after withholding faw attacks on bitcoin":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploring the attack surface of blockchain a systematic overview")
  Member "optimal selfish mining strategies in bitcoin":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incentive analysis of bitcoin ng revisited")
  Member "majority is not enough bitcoin mining is vulnerable":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the convergence of artificial intelligence and distributed ledger technology a scoping review and future research agenda")
  Member "the load and availability of byzantine quorum systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mathematical analysis and algorithms for federated byzantine agreement 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)