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: "derivatives of parsing expression grammars"
  Abstract: This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars. Derivative parsing is shown to have a polynomial worst-case time bound, an improvement on the exponential bound of the recursive descent algorithm. This work also introduces asymptotic analysis based on inputs with a constant bound on both grammar nesting depth and number of backtracking choices; derivative and recursive descent parsing are shown to run in linear time and constant space on this useful class of inputs, with both the theoretical bounds and the reasonability of the input class validated empirically. This common-case constant memory usage of derivative parsing is an improvement on the linear space required by the packrat algorithm.

Connected through hyperedge HE-1 (induced by source paper "the computational power of parsing expression grammars"):
  with members:
    - "recognising and generating terms using derivatives of parsing expression grammars"
    - "linear parsing expression grammars"
    - "parsing expression grammars made practical"
    - "a declarative extension of parsing expression grammars for recognizing most programming languages"
    - "fast flexible and declarative construction of abstract syntax trees with pegs"
    - "a proof of the pumping lemma for context free languages through pushdown automata"
    - "trx a formally verified parser interpreter"
    - "a new approach to formal language theory by kolmogorov complexity"

Connected through hyperedge HE-2 (induced by source paper "simplified parsing expression derivatives"):
  with members:
    - "recognising and generating terms using derivatives of parsing expression grammars"
    - "on the complexity and performance of parsing with derivatives"

Connected through hyperedge HE-3 (induced by source paper "recognising and generating terms using derivatives of parsing expression grammars"):
  with members:
    - "left recursion in parsing expression grammars"
    - "random grammar based testing for covering all non terminals"

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)