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: "logics for unranked trees an overview"
  Abstract: Labeled unranked trees are used as a model of XML documents, and logical#N#languages for them have been studied actively over the past several years. Such#N#logics have different purposes: some are better suited for extracting data,#N#some for expressing navigational properties, and some make it easy to relate#N#complex properties of trees to the existence of tree automata for those#N#properties. Furthermore, logics differ significantly in their model-checking#N#properties, their automata models, and their behavior on ordered and unordered#N#trees. In this paper we present a survey of logics for unranked trees.

Connected through hyperedge HE-1 (induced by source paper "css minification via constraint solving technical report"):
  with members:
    - "detecting redundant css rules in html5 applications a tree rewriting approach"

Connected through hyperedge HE-2 (induced by source paper "streaming property testing of visibly pushdown languages"):
  with members:
    - "validating xml documents in the streaming model with external memory"
    - "recognizing well parenthesized expressions in the streaming model"
    - "first order and temporal logics for nested words"

Connected through hyperedge HE-3 (induced by source paper "node selection query languages for trees"):
  with members:
    - "monadic datalog and the expressive power of languages for web information extraction"

Connected through hyperedge HE-4 (induced by source paper "detecting redundant css rules in html5 applications a tree rewriting approach"):
  with members:
    - "senescent ground tree rewrite systems"
    - "verifying recursive active documents with positive data tree rewriting"

Connected through hyperedge HE-5 (induced by source paper "a note on monadic datalog on unranked trees"):
  with members:
    - "monadic datalog and the expressive power of languages for web information extraction"

Connected through hyperedge HE-6 (induced by source paper "wreath products of forest algebras with applications to tree logics"):
  with members:
    - "piecewise testable tree languages"
    - "a decidable characterization of locally testable tree languages"
    - "tree languages defined in first order logic with one quantifier alternation"
    - "two way unary temporal logic over trees"
    - "algebraic recognizability of regular tree languages"

Connected through hyperedge HE-7 (induced by source paper "complete axiomatizations of fragments of monadic second order logic on finite trees"):
  with members:
    - "monadic datalog and the expressive power of languages for web information extraction"

Connected through hyperedge HE-8 (induced by source paper "learning xml twig queries"):
  with members:
    - "learning deterministic regular expressions for the inference of schemas from xml data"

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.LO(Logic in Computer Science)