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: "exact byzantine consensus under local broadcast model"
  Abstract: This paper considers the problem of achieving exact Byzantine consensus in a synchronous system under a local-broadcast communication model. The nodes communicate with each other via message-passing. The communication network is modeled as an undirected graph, with each vertex representing a node in the system. Under the local-broadcast communication model, when any node transmits a message, all its neighbors in the communication graph receive the message reliably. This communication model is motivated by wireless networks. In this work, we present necessary and sufficient conditions on the underlying communication graph to achieve exact Byzantine consensus under the local-broadcast communication model.

Connected through hyperedge HE-1 (induced by source paper "exact byzantine consensus on undirected graphs under local broadcast model"):
  with members:
    - "byzantine consensus under local broadcast model tight sufficient condition"
    - "iterative byzantine vector consensus in incomplete graphs"
    - "exact byzantine consensus in directed graphs"
    - "broadcast using certified propagation algorithm in presence of byzantine faults"
    - "iterative approximate byzantine consensus under a generalized fault model"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"
    - "robustness of information diffusion algorithms to locally bounded adversaries"

Connected through hyperedge HE-2 (induced by source paper "byzantine consensus under local broadcast model tight sufficient condition"):
  with members:
    - "exact byzantine consensus in directed graphs"
    - "broadcast using certified propagation algorithm in presence of byzantine faults"
    - "robustness of information diffusion algorithms to locally bounded adversaries"

Connected through hyperedge HE-3 (induced by source paper "exact byzantine consensus on arbitrary directed graphs under local broadcast model"):
  with members:
    - "exact byzantine consensus on undirected graphs under local broadcast model"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

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)