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: "recognising and generating terms using derivatives of parsing expression grammars"
  Abstract: Grammar-based sentence generation has been thoroughly explored for Context-Free Grammars (CFGs), but remains unsolved for recognition-based approaches such as Parsing Expression Grammars (PEGs). Lacking tool support, language designers using PEGs have difficulty predicting the behaviour of their parsers. In this paper, we extend the idea of derivatives, originally formulated for regular expressions, to PEGs. We then present a novel technique for sentence generation based on derivatives, applicable to any grammatical formalism for which the derivative can be defined--now including PEGs. Finally, we propose applying derivatives more generally to other problems facing language designers and implementers.

Connected through hyperedge HE-1 (induced by source paper "the computational power of parsing expression grammars"):
  with members:
    - "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"
    - "derivatives of parsing expression grammars"
    - "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 "automatic syntax error reporting and recovery in parsing expression grammars"):
  with members:
    - "simplified parsing expression derivatives"
    - "syntax error recovery in parsing expression grammars"
    - "on the relation between context free grammars and parsing expression grammars"

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

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.PL(Programming Languages)