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: "asynchronous distributed automata a characterization of the modal mu fragment"
  Abstract: We establish the equivalence on finite directed graphs between a class of asynchronous distributed automata and a small fragment of least fixpoint logic. More specifically, the logic we consider is (a variant of) the fragment of modal $\mu$-calculus that allows least fixpoints but forbids greatest fixpoints. The corresponding automaton model uses a network of identical finite-state machines that communicate in an asynchronous manner and whose state diagram must be acyclic except for self-loops. Exploiting the connection with logic, we also prove that the expressive power of these machines is independent of whether or not messages can be lost.

Connected through hyperedge HE-1 (induced by source paper "identifiers in registers describing network algorithms with logic"):
  with members:
    - "survey of distributed decision"
    - "distributed graph automata"
    - "weak models of distributed computing with connections to modal logic"
    - "an automata theoretic approach to the verification of distributed algorithms"
    - "distributed graph automata"

Connected through hyperedge HE-2 (induced by source paper "counter machines and distributed automata a story about exchanging space and time"):
  with members:
    - "emptiness problems for distributed automata"
    - "weak models of distributed computing with connections to modal logic"

Connected through hyperedge HE-3 (induced by source paper "emptiness problems for distributed automata"):
  with members:
    - "counter machines and distributed automata a story about exchanging space and time"
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "distributed graph automata"
    - "weak models of distributed computing with connections to modal logic"
    - "distributed graph automata"
    - "infinite networks halting and local algorithms"
    - "ontology based data access a study through disjunctive datalog csp and mmsnp"

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.FL(Formal Languages and Automata Theory)