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 "decentralization in open quorum systems"):
  Abstract: Decentralisation is one of the promises introduced by blockchain technologies: fair and secure interaction amongst peers with no dominant positions, single points of failure or censorship. Decentralisation, however, appears difficult to be formally defined, possibly a continuum property of systems that can be more or less decentralised, or can tend to decentralisation in their lifetime. In this paper we focus on decentralisation in quorum-based approaches to open (permissionless) consensus as illustrated in influential protocols such as the Ripple and Stellar protocols. Drawing from game theory and computational complexity, we establish limiting results concerning the decentralisation vs. safety trade-off in Ripple and Stellar, and we propose a novel methodology to formalise and quantitatively analyse decentralisation in this type of blockchains.

Includes members:
  Member "complexity of the quorum intersection property of the federated byzantine agreement system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the sum of its parts analysis of federated byzantine agreement systems")
  Member "is stellar as secure as you think":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the sum of its parts analysis of federated byzantine agreement systems")
  Member "analysis of the xrp ledger consensus protocol":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deconstructing blockchains a comprehensive survey on consensus membership and structure")
  Member "cobalt bft governance in open networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two more algorithms for randomized signature free asynchronous binary byzantine consensus with t n 3 and o n 2 messages and o 1 round expected termination")
  Member "blockchains consensus protocols in the wild":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "a tutorial on modeling and analysis of dynamic social networks part i":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ideotrace a framework for ideology tracing with a case study on the 2016 u s presidential election")
  Member "majority is not enough bitcoin mining is vulnerable":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the convergence of artificial intelligence and distributed ledger technology a scoping review and future research agenda")

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)