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 "tree automatic well founded trees"):
  Abstract: We investigate tree-automatic well-founded trees. Using Delhomme's#N#decomposition technique for tree-automatic structures, we show that the#N#(ordinal) rank of a tree-automatic well-founded tree is strictly below#N#omega^omega. Moreover, we make a step towards proving that the ranks of#N#tree-automatic well-founded partial orders are bounded by omega^omega^omega: we#N#prove this bound for what we call upwards linear partial orders. As an#N#application of our result, we show that the isomorphism problem for#N#tree-automatic well-founded trees is complete for level Delta^0_{omega^omega}#N#of the hyperarithmetical hierarchy with respect to Turing-reductions.

Includes members:
  Member "word automaticity of tree automatic scattered linear orderings is decidable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the rank of tree automatic linear orderings")
  Member "automatic structures of bounded degree revisited":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "observation and distinction representing information in infinite games")
  Member "automatic structures richness and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automatic supermartingales acting on sequences")

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)