human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "deciding definability in fo2 h v on trees"):
  Abstract: We provide a decidable characterization of regular forest languages definable#N#in FO2(<h,<v). By FO2(<h,<v) we refer to the two variable fragment of first#N#order logic built from the descendant relation and the following sibling#N#relation. In terms of expressive power it corresponds to a fragment of the#N#navigational core of XPath that contains modalities for going up to some#N#ancestor, down to some descendant, left to some preceding sibling, and right to#N#some following sibling. We also show that our techniques can be applied to#N#other two variable first-order logics having exactly the same vertical#N#modalities as FO2(<h,<v) but having different horizontal modalities.

Includes members:
  Member "piecewise testable tree languages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "partially ordered automata and piecewise testability")
  Member "wreath products of forest algebras with applications to tree logics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "first order tree to tree functions")
  Member "a decidable characterization of locally testable tree languages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wreath products of distributive forest algebras")
  Member "tree languages defined in first order logic with one quantifier alternation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wreath products of distributive forest algebras")
  Member "two way unary temporal logic over trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wreath products of forest algebras with applications to tree logics")

Question: Please tell me which class the source paper 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.LO(Logic in Computer Science)