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: "fantom a scalable framework for asynchronous distributed systems"
  Abstract: We describe \emph{Fantom}, a framework for asynchronous distributed systems. \emph{Fantom} is based on the Lachesis Protocol~\cite{lachesis01}, which uses asynchronous event transmission for practical Byzantine fault tolerance (pBFT) to create a leaderless, scalable, asynchronous Directed Acyclic Graph (DAG). #R##N#We further optimize the \emph{Lachesis Protocol} by introducing a permission-less network for dynamic participation. Root selection cost is further optimized by the introduction of an n-row flag table, as well as optimizing path selection by introducing domination relationships. #R##N#We propose an alternative framework for distributed ledgers, based on asynchronous partially ordered sets with logical time ordering instead of blockchains. #R##N#This paper builds upon the original proposed family of \emph{Lachesis-class} consensus protocols. We formalize our proofs into a model that can be applied to abstract asynchronous distributed system.

Connected through hyperedge HE-1 (induced by source paper "on probabilistic byzantine fault tolerance"):
  with members:
    - "stakedag stake based consensus for scalable trustless systems"
    - "practical synchronous byzantine consensus"
    - "efficient synchronous byzantine consensus"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-2 (induced by source paper "asynchronous consensus algorithm"):
  with members:
    - "opera reasoning about continuous common knowledge in asynchronous distributed systems"

Connected through hyperedge HE-3 (induced by source paper "stairdag cross dag validation for scalable bft consensus"):
  with members:
    - "onlay online layering for scalable asynchronous bft system"
    - "stakedag stake based consensus for scalable trustless systems"
    - "blockmania from block dags to consensus"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "opera reasoning about continuous common knowledge in asynchronous distributed systems"
    - "algorand the efficient and democratic ledger"
    - "cryptocurrencies without proof of work"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-4 (induced by source paper "stakedag stake based consensus for scalable trustless systems"):
  with members:
    - "onlay online layering for scalable asynchronous bft system"
    - "blockmania from block dags to consensus"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "cryptocurrencies without proof of work"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-5 (induced by source paper "onlay online layering for scalable asynchronous bft system"):
  with members:
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "algorand the efficient and democratic ledger"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-6 (induced by source paper "fast stochastic peer selection in proof of stake protocols"):
  with members:
    - "stairdag cross dag validation for scalable bft consensus"
    - "stakedag stake based consensus for scalable trustless systems"
    - "roulette wheel selection via stochastic acceptance"

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)