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: "the wadge hierarchy of deterministic tree languages"
  Abstract: We provide a complete description of the Wadge hierarchy for#N#deterministically recognisable sets of infinite trees. In particular we give an#N#elementary procedure to decide if one deterministic tree language is#N#continuously reducible to another. This extends Wagner's results on the#N#hierarchy of omega-regular languages of words to the case of trees.

Connected through hyperedge HE-1 (induced by source paper "regular tree languages in low levels of wadge hierarchy"):
  with members:
    - "recognisable languages over monads"
    - "index problems for game automata"
    - "deciding the borel complexity of regular tree languages"

Connected through hyperedge HE-2 (induced by source paper "an upper bound on the complexity of recognizable tree languages"):
  with members:
    - "deciding the borel complexity of regular tree languages"
    - "infinite games specified by 2 tape automata"
    - "unambiguous tree languages are topologically harder than deterministic ones"
    - "the determinacy of context free games"

Connected through hyperedge HE-3 (induced by source paper "unambiguous buchi is weak"):
  with members:
    - "unambiguous tree languages are topologically harder than deterministic ones"

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)