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: "scattered context free linear orderings"
  Abstract: We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

Connected through hyperedge HE-1 (induced by source paper "the order type of scattered context free orderings of rank one is computable"):
  with members:
    - "on the order type of scattered context free orderings"
    - "the ordinal generated by an ordinal grammar is computable"
    - "isomorphism of regular trees and words"

Connected through hyperedge HE-2 (induced by source paper "on the order type of scattered context free orderings"):
  with members:
    - "the ordinal generated by an ordinal grammar is computable"
    - "algebraic linear orderings"

Connected through hyperedge HE-3 (induced by source paper "the ordinal generated by an ordinal grammar is computable"):
  with members:
    - "isomorphisms of scattered automatic linear orders"
    - "isomorphism of regular trees and words"
    - "algebraic linear orderings"

Connected through hyperedge HE-4 (induced by source paper "on context free languages of scattered words"):
  with members:
    - "context free ordinals"
    - "isomorphism of regular trees and words"
    - "algebraic linear orderings"

Connected through hyperedge HE-5 (induced by source paper "a note on ordinal dfas"):
  with members:
    - "algebraic linear orderings"

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.FL(Formal Languages and Automata Theory)