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: "static analysis for regular expression denial of service attacks"
  Abstract: Regular expressions are a concise yet expressive language for expressing patterns. For instance, in networked software, they are used for input validation and intrusion detection. Yet some widely deployed regular expression matchers based on backtracking are themselves vulnerable to denial-of-service attacks, since their runtime can be exponential for certain input strings. This paper presents a static analysis for detecting such vulnerable regular expressions. The running time of the analysis compares favourably with tools based on fuzzing, that is, randomly generating inputs and measuring how long matching them takes. Unlike fuzzers, the analysis pinpoints the source of the vulnerability and generates possible malicious inputs for programmers to use in security testing. Moreover, the analysis has a firm theoretical foundation in abstract machines. Testing the analysis on two large repositories of regular expressions shows that the analysis is able to find significant numbers of vulnerable regular expressions in a matter of seconds.

Connected through hyperedge HE-1 (induced by source paper "hotfuzz discovering algorithmic denial of service vulnerabilities through guided micro fuzzing"):
  with members:
    - "evaluating fuzz testing"
    - "improving function coverage with munch a hybrid fuzzing and directed symbolic execution approach"
    - "badger complexity analysis with fuzzing and symbolic execution"
    - "discriminating traces with time"
    - "slowfuzz automated domain independent detection of algorithmic complexity vulnerabilities"
    - "rise of the hacrs augmenting autonomous cyber reasoning systems with human assistance"

Connected through hyperedge HE-2 (induced by source paper "static detection of dos vulnerabilities in programs that use regular expressions extended version"):
  with members:
    - "static analysis for regular expression exponential runtime via substructural logics"
    - "analyzing catastrophic backtracking behavior in practical regular expression matching"

Connected through hyperedge HE-3 (induced by source paper "slowfuzz automated domain independent detection of algorithmic complexity vulnerabilities"):
  with members:
    - "analyzing catastrophic backtracking behavior in practical regular expression matching"

Connected through hyperedge HE-4 (induced by source paper "analyzing catastrophic backtracking behavior in practical regular expression matching"):
  with members:
    - "from regexes to parsing expression grammars"
    - "general algorithms for testing the ambiguity of finite automata"

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)