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: "a language theoretic view on network protocols"
  Abstract: Parsers are a fundamental building block in the data processing pipeline of software systems. Unfortunately, they are also an important entry point for attacks. A number of different techniques have been proposed to address this problem; what is common to most of them is that their authors make claims about formal language theory to motivate their respective approaches. Surprisingly, for a number of idioms that are common in network protocols, we found that the claims made are vague or even contradictory, which we attribute to the fact that they lack any kind of formalization or proof. In this paper, we address this problem by performing the first rigorous, language-theoretic analysis of several common protocol idioms, laying a formal foundation for further research on the parsing problem. We then demonstrate the practical value of our findings by automatically generating a modular, robust, and efficient input validator for HTTP from a set of context-free grammars.

Connected through hyperedge HE-1 (induced by source paper "the geometry of syntax and semantics for directed file transformations"):
  with members:
    - "dire a neural approach to decompiled identifier naming"
    - "synthesizing bijective lenses"
    - "tree edit distance cannot be computed in strongly subcubic time unless apsp can"
    - "de bruijn entropy and string similarity"
    - "an optimal decomposition algorithm for tree edit distance"

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)