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 "the complexity of datalog on linear orders"):
  Abstract: We study the program complexity of datalog on both finite and infinite linear#N#orders. Our main result states that on all linear orders with at least two#N#elements, the nonemptiness problem for datalog is EXPTIME-complete. While#N#containment of the nonemptiness problem in EXPTIME is known for finite linear#N#orders and actually for arbitrary finite structures, it is not obvious for#N#infinite linear orders. It sharply contrasts the situation on other infinite#N#structures; for example, the datalog nonemptiness problem on an infinite#N#successor structure is undecidable. We extend our upper bound results to#N#infinite linear orders with constants.#N#  As an application, we show that the datalog nonemptiness problem on Allen's#N#interval algebra is EXPTIME-complete.

Includes members:
  Member "datalog and constraint satisfaction with infinite templates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asnp a tame fragment of existential second order logic")
  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)