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 "the computational power of parsing expression grammars"):
  Abstract: We study the computational power of parsing expression grammars (PEGs). We begin by constructing PEGs with unexpected behaviour, and surprising new examples of languages with PEGs, including the language of palindromes whose length is a power of two, and a binary-counting language. We then propose a new computational model, the scaffolding automaton, and prove that it exactly characterises the computational power of parsing expression grammars (PEGs). #R##N#Using this characterisation we show that: #R##N#(*) PEGs have unexpected power and semantics. We present several PEGs with surprising behaviour, and languages which, unexpectedly, have PEGs, including a PEG for the language of palindromes whose length is a power of two. #R##N#(*) PEGs are computationally `universal', in the following sense: take any computable function $f:\{0,1\}^\ast\to \{0,1\}^\ast$; then there exists a computable function $g: \{0,1\}^\ast \to \mathbb{N}$ such that $\{ f(x) \#^{g(x)} x \mid x \in \{0,1\}^\ast \}$ has a PEG. #R##N#(*) There can be no pumping lemma for PEGs. There is no total computable function $A$ with the following property: for every well-formed PEG $G$, there exists $n_0$ such that for every string $x \in \mathcal{L}(G)$ of size $|x| \ge n_0$, the output $y = A(G, x)$ is in $\mathcal{L}(G)$ and has $|y| > |x|$. #R##N#(*) PEGs are strongly non real-time for Turing machines. There exists a language with a PEG, such that neither it nor its reverse can be recognised by any multi-tape online Turing machine which is allowed to do only $o(n/\log n)$ steps after reading each input symbol.

Includes members:
  Member "recognising and generating terms using derivatives of parsing expression grammars":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automatic syntax error reporting and recovery in parsing expression grammars")
  Member "linear parsing expression grammars":
    also connected through other hyperedges:
      (none)
  Member "parsing expression grammars made practical":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "derivatives of parsing expression grammars")
  Member "a declarative extension of parsing expression grammars for recognizing most programming languages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nez practical open grammar language")
  Member "fast flexible and declarative construction of abstract syntax trees with pegs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nez practical open grammar language")
  Member "derivatives of parsing expression grammars":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simplified parsing expression derivatives")
  Member "a proof of the pumping lemma for context free languages through pushdown automata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a stack vector routing protocol for automatic tunneling")
  Member "trx a formally verified parser interpreter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a verified packrat parser interpreter for parsing expression grammars")

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