human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "asymmetric distributed trust"
  Abstract: Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other problems. This paper introduces asymmetric Byzantine quorum systems that model subjective trust. Every process is free to choose which combinations of other processes it trusts and which ones it considers faulty. Asymmetric quorum systems strictly generalize standard Byzantine quorum systems, which have only one global trust assumption for all processes. This work also presents protocols that implement abstractions of shared memory and broadcast primitives with processes prone to Byzantine faults and asymmetric trust. The model and protocols pave the way for realizing more elaborate algorithms with asymmetric trust.

Connected through hyperedge HE-1 (induced by source paper "the sum of its parts analysis of federated byzantine agreement systems"):
  with members:
    - "rationality is self defeating in permissionless systems"
    - "mathematical analysis and algorithms for federated byzantine agreement systems"
    - "complexity of the quorum intersection property of the federated byzantine agreement system"
    - "mir bft high throughput bft for blockchains"
    - "committee selection is more similar than you think evidence from avalanche and stellar"
    - "is stellar as secure as you think"

Connected through hyperedge HE-2 (induced by source paper "a survey of distributed consensus protocols for blockchain networks"):
  with members:
    - "deconstructing blockchains a comprehensive survey on consensus membership and structure"
    - "a survey on consensus mechanisms and mining strategy management in blockchain networks"
    - "scalable bft consensus mechanism through aggregated signature gossip"
    - "decentralization in bitcoin and ethereum networks"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "correctness and fairness of tendermint core blockchains"
    - "blockchains consensus protocols in the wild"

Question: Please tell me which class the center node 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)