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: "relating knowledge and coordinated action the knowledge of preconditions principle"
  Abstract: The Knowledge of Preconditions principle (KoP) is proposed as a widely applicable connection between knowledge and action in multi-agent systems. Roughly speaking, it asserts that if some condition is a necessary condition for performing a given action A, then knowing that this condition holds is also a necessary condition for performing A. Since the specifications of tasks often involve necessary conditions for actions, the KoP principle shows that such specifications induce knowledge preconditions for the actions. Distributed protocols or multi-agent plans that satisfy the specifications must ensure that this knowledge be attained, and that it is detected by the agents as a condition for action. The knowledge of preconditions principle is formalised in the runs and systems framework, and is proven to hold in a wide class of settings. Well-known connections between knowledge and coordinated action are extended and shown to derive directly from the KoP principle: a "common knowledge of preconditions" principle is established showing that common knowledge is a necessary condition for performing simultaneous actions, and a "nested knowledge of preconditions" principle is proven, showing that coordinating actions to be performed in linear temporal order requires a corresponding form of nested knowledge.

Connected through hyperedge HE-1 (induced by source paper "causality and epistemic reasoning in byzantine multi agent systems"):
  with members:
    - "knowledge and common knowledge in a distributed environment"
    - "common knowledge revisited"

Connected through hyperedge HE-2 (induced by source paper "a simplicial complex model for dynamic epistemic logic to study distributed task computability"):
  with members:
    - "a simplicial complex model of dynamic epistemic logic for fault tolerant distributed computing"
    - "models of fault tolerant distributed computation via dynamic epistemic logic"
    - "unbeatable set consensus via topological and combinatorial reasoning"

Connected through hyperedge HE-3 (induced by source paper "on using time without clocks via zigzag causality"):
  with members:
    - "the shape of reactive coordination tasks"
    - "timely common knowledge"
    - "agent time epistemics and coordination"

Connected through hyperedge HE-4 (induced by source paper "unbeatable set consensus via topological and combinatorial reasoning"):
  with members:
    - "knowledge and common knowledge in a distributed environment"

Connected through hyperedge HE-5 (induced by source paper "hierarchical information and the synthesis of distributed strategies"):
  with members:
    - "hierarchical information patterns and distributed strategy synthesis"
    - "distributed synthesis for acyclic architectures"

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.MA(Multiagent Systems)