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: "epistemic protocols for distributed gossiping"
  Abstract: Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other's secrets. We consider distributed gossip protocols which are expressed by means of epistemic logic. We provide an operational semantics of such protocols and set up an appropriate framework to argue about their correctness. Then we analyze specific protocols for complete graphs and for directed rings.

Connected through hyperedge HE-1 (induced by source paper "strengthening gossip protocols using protocol dependent knowledge"):
  with members:
    - "dynamic gossip"
    - "a logic of blockchain updates"
    - "common knowledge in a logic of gossips"
    - "plurality voting under uncertainty"
    - "discovery through gossip"
    - "simple fast and deterministic gossip and rumor spreading"
    - "dominating manipulations in voting with partial information"

Connected through hyperedge HE-2 (induced by source paper "open problems in a logic of gossips"):
  with members:
    - "common knowledge in a logic of gossips"
    - "simple epistemic planning generalised gossiping"

Connected through hyperedge HE-3 (induced by source paper "asynchronous announcements"):
  with members:
    - "a simplicial complex model for dynamic epistemic logic to study distributed task computability"
    - "knowledge and common knowledge in a distributed environment"

Connected through hyperedge HE-4 (induced by source paper "when are two gossips the same types of communication in epistemic gossip protocols"):
  with members:
    - "simple epistemic planning generalised gossiping"
    - "knowledge and common knowledge in a distributed environment"

Connected through hyperedge HE-5 (induced by source paper "common knowledge in a logic of gossips"):
  with members:
    - "simple epistemic planning generalised gossiping"

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.AI(Artificial Intelligence)