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 "first order and temporal logics for nested words"):
  Abstract: Nested words are a structured model of execution paths in procedural#N#programs, reflecting their call and return nesting structure. Finite nested#N#words also capture the structure of parse trees and other tree-structured data,#N#such as XML. We provide new temporal logics for finite and infinite nested#N#words, which are natural extensions of LTL, and prove that these logics are#N#first-order expressively-complete. One of them is based on adding a "within"#N#modality, evaluating a formula on a subword, to a logic CaRet previously#N#studied in the context of verifying properties of recursive state machines#N#(RSMs). The other logic, NWTL, is based on the notion of a summary path that#N#uses both the linear and nesting structures. For NWTL we show that#N#satisfiability is EXPTIME-complete, and that model-checking can be done in time#N#polynomial in the size of the RSM model and exponential in the size of the NWTL#N#formula (and is also EXPTIME-complete). Finally, we prove that first-order#N#logic over nested words has the three-variable property, and we present a#N#temporal logic for nested words which is complete for the two-variable fragment#N#of first-order.

Includes members:
  Member "logics for unranked trees an overview":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "css minification via constraint solving technical report")
  Member "monadic datalog and the expressive power of languages for web information extraction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "monadic datalog containment on trees using the descendant axis")

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)