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 "inferring input grammars from dynamic control flow"):
  Abstract: A program is characterized by its input model, and a formal input model can be of use in diverse areas including vulnerability analysis, reverse engineering, fuzzing and software testing, clone detection and refactoring. Unfortunately, input models for typical programs are often unavailable or out of date. While there exist algorithms that can mine the syntactical structure of program inputs, they either produce unwieldy and incomprehensible grammars, or require heuristics that target specific parsing patterns. #R##N#In this paper, we present a general algorithm that takes a program and a small set of sample inputs and automatically infers a readable context-free grammar capturing the input language of the program. We infer the syntactic input structure only by observing access of input characters at different locations of the input parser. This works on all program stack based recursive descent input parsers, including PEG and parser combinators, and can do entirely without program specific heuristics. Our Mimid prototype produced accurate and readable grammars for a variety of evaluation subjects, including expr, URLparse, and microJSON.

Includes members:
  Member "building fast fuzzers":
    also connected through other hyperedges:
      (none)
  Member "sample free learning of input grammars for comprehensive software fuzzing":
    also connected through other hyperedges:
      (none)
  Member "neuzz efficient fuzzing with neural program smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "privacy for all demystify vulnerability disparity of differential privacy against membership inference attack")
  Member "active learning of input grammars":
    also connected through other hyperedges:
      (none)
  Member "not all bytes are equal neural byte sieve for fuzzing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "meuzz smart seed scheduling for hybrid fuzzing")
  Member "learn fuzz machine learning for input fuzzing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "meuzz smart seed scheduling for hybrid fuzzing")
  Member "synthesizing program input grammars":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a systematic review of fuzzing based on machine learning techniques")
  Member "trx a formally verified parser interpreter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.SE(Software Engineering)