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: "consensus on transaction commit"
  Abstract: The distributed transaction commit problem requires reaching agreement on whether a transaction is committed or aborted. The classic Two-Phase Commit protocol blocks if the coordinator fails. Fault-tolerant consensus algorithms also reach agreement, but do not block whenever any majority of the processes are working. Running a Paxos consensus algorithm on the commit/abort decision of each participant yields a transaction commit protocol that uses 2F +1 coordinators and makes progress if at least F +1 of them are working. In the fault-free case, this algorithm requires one extra message delay but has the same stable-storage write delay as Two-Phase Commit. The classic Two-Phase Commit algorithm is obtained as the special F = 0 case of the general Paxos Commit algorithm.

Connected through hyperedge HE-1 (induced by source paper "blockchain meets database design and implementation of a blockchain relational database"):
  with members:
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "xft practical fault tolerance beyond crashes"
    - "serializable snapshot isolation in postgresql"
    - "middleware based database replication the gaps between theory and practice"
    - "a critique of ansi sql isolation levels"

Connected through hyperedge HE-2 (induced by source paper "cross chain payment protocols with success guarantees"):
  with members:
    - "cross chain deals and adversarial commerce"
    - "atomic appends selling cars and coordinating armies with multiple distributed ledgers"
    - "atomic cross chain swaps"

Connected through hyperedge HE-3 (induced by source paper "towards a public key management framework for virtual assets and virtual asset service providers"):
  with members:
    - "verifiable anonymous identities and access control in permissioned blockchains"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"

Connected through hyperedge HE-4 (induced by source paper "partitioned paxos via the network data plane"):
  with members:
    - "paxos made switch y"
    - "building global and scalable systems with atomic multicast"

Connected through hyperedge HE-5 (induced by source paper "spectrum a framework for adapting consensus protocols"):
  with members:
    - "speeding up consensus by chasing fast decisions"

Connected through hyperedge HE-6 (induced by source paper "xpc fast and reliable synchronous transmission protocols for 2 phase commit and 3 phase commit"):
  with members:
    - "atomic sdn is synchronous flooding the solution to software defined networking in iot"

Connected through hyperedge HE-7 (induced by source paper "spacetime entangled networks i relativity and observability of stepwise consensus"):
  with members:
    - "consensus in the age of blockchains"
    - "a promise theory perspective on data networks"
    - "spacetimes with semantics"
    - "local and global trust based on the concept of promises"

Connected through hyperedge HE-8 (induced by source paper "consensus in the age of blockchains"):
  with members:
    - "implicit consensus blockchain with unbounded throughput"
    - "blockchains consensus protocols in the wild"
    - "chainspace a sharded smart contracts platform"
    - "practical synchronous byzantine consensus"
    - "blockbench a framework for analyzing private blockchains"
    - "interactive proof of stake"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "service oriented sharding with aspen"

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)