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: "unveiling eilenberg type correspondences birkhoff s theorem for finite algebras duality"
  Abstract: The purpose of the present paper is to show that: Eilenberg-type correspondences = Birkhoff's theorem for (finite) algebras + duality. We consider algebras for a monad T on a category D and we study (pseudo)varieties of T-algebras. Pseudovarieties of algebras are also known in the literature as varieties of finite algebras. Two well-known theorems that characterize varieties and pseudovarieties of algebras play an important role here: Birkhoff's theorem and Birkhoff's theorem for finite algebras, the latter also known as Reiterman's theorem. We prove, under mild assumptions, a categorical version of Birkhoff's theorem for (finite) algebras to establish a one-to-one correspondence between (pseudo)varieties of T-algebras and (pseudo)equational T-theories. Now, if C is a category that is dual to D and B is the comonad on C that is the dual of T, we get a one-to-one correspondence between (pseudo)equational T-theories and their dual, (pseudo)coequational B-theories. Particular instances of (pseudo)coequational B-theories have been already studied in language theory under the name of "varieties of languages" to establish Eilenberg-type correspondences. All in all, we get a one-to-one correspondence between (pseudo)varieties of T-algebras and (pseudo)coequational B-theories, which will be shown to be exactly the nature of Eilenberg-type correspondences.

Connected through hyperedge HE-1 (induced by source paper "varieties of data languages"):
  with members:
    - "equational axiomatization of algebras with structure"
    - "eilenberg theorems for free"
    - "regular behaviours with names"
    - "generalized eilenberg theorem i local varieties of languages"
    - "automata theory in nominal sets"

Connected through hyperedge HE-2 (induced by source paper "equational axiomatization of algebras with structure"):
  with members:
    - "on the axiomatizability of quantitative algebras"
    - "eilenberg theorems for free"
    - "regular behaviours with names"
    - "profinite monads profinite equations and reiterman s theorem"

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)