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: "trx a formally verified parser interpreter"
  Abstract: Parsing is an important problem in computer science and yet surprisingly#N#little attention has been devoted to its formal verification. In this paper, we#N#present TRX: a parser interpreter formally developed in the proof assistant#N#Coq, capable of producing formally correct parsers. We are using parsing#N#expression grammars (PEGs), a formalism essentially representing recursive#N#descent parsing, which we consider an attractive alternative to context-free#N#grammars (CFGs). From this formalization we can extract a parser for an#N#arbitrary PEG grammar with the warranty of total correctness, i.e., the#N#resulting parser is terminating and correct with respect to its grammar and the#N#semantics of PEGs; both properties formally proven in Coq.

Connected through hyperedge HE-1 (induced by source paper "a verified packrat parser interpreter for parsing expression grammars"):
  with members:
    - "certified context free parsing a formalisation of valiant s algorithm in agda"

Connected through hyperedge HE-2 (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"
    - "derivatives of parsing expression grammars"
    - "a proof of the pumping lemma for context free languages through pushdown automata"
    - "a new approach to formal language theory by kolmogorov complexity"

Connected through hyperedge HE-3 (induced by source paper "inferring input grammars from dynamic control flow"):
  with members:
    - "building fast fuzzers"
    - "sample free learning of input grammars for comprehensive software fuzzing"
    - "neuzz efficient fuzzing with neural program smoothing"
    - "active learning of input grammars"
    - "not all bytes are equal neural byte sieve for fuzzing"
    - "learn fuzz machine learning for input fuzzing"
    - "synthesizing program input grammars"

Connected through hyperedge HE-4 (induced by source paper "ll 1 parsing with derivatives and zippers"):
  with members:
    - "on the complexity and performance of parsing with derivatives"

Connected through hyperedge HE-5 (induced by source paper "narcissus deriving correct by construction decoders and encoders from binary formats"):
  with members:
    - "synthesizing bijective lenses"
    - "certified context free parsing a formalisation of valiant s algorithm in agda"
    - "formal derivation of concurrent garbage collectors"

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.LO(Logic in Computer Science)