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: "software mutational robustness"
  Abstract: Neutral landscapes and mutational robustness are believed to be important enablers of evolvability in biology. We apply these concepts to software, defining mutational robustness to be the fraction of random mutations that leave a program's behavior unchanged. Test cases are used to measure program behavior and mutation operators are taken from genetic programming. Although software is often viewed as brittle, with small changes leading to catastrophic changes in behavior, our results show surprising robustness in the face of random software mutations. #R##N#The paper describes empirical studies of the mutational robustness of 22 programs, including 14 production software projects, the Siemens benchmarks, and 4 specially constructed programs. We find that over 30% of random mutations are neutral with respect to their test suite. The results hold across all classes of programs, for mutations at both the source code and assembly instruction levels, across various programming languages, and are only weakly related to test suite coverage. We conclude that mutational robustness is an inherent property of software, and that neutral variants (i.e., those that pass the test suite) often fulfill the program's original purpose or specification. #R##N#Based on these results, we conjecture that neutral mutations can be leveraged as a mechanism for generating software diversity. We demonstrate this idea by generating a population of neutral program variants and showing that the variants automatically repair unknown bugs with high probability. Neutral landscapes also provide a partial explanation for recent results that use evolutionary computation to automatically repair software bugs.

Connected through hyperedge HE-1 (induced by source paper "ifixr bug report driven program repair"):
  with members:
    - "d c a divide and conquer approach to ir based bug localization"
    - "tbar revisiting template based automated program repair"
    - "sorting and transforming program repair ingredients via deep learning code similarities"
    - "alleviating patch overfitting with automatic test generation a study of feasibility and effectiveness for the nopol repair system"
    - "getafix learning to fix bugs automatically"
    - "avatar fixing semantic bugs with fix patterns of static analysis violations"
    - "on reliability of patch correctness assessment"
    - "fixminer mining relevant fix patterns for automated program repair"

Connected through hyperedge HE-2 (induced by source paper "a journey among java neutral program variants"):
  with members:
    - "source code optimization using equivalent mutants"
    - "darwinian data structure selection"
    - "arja automated repair of java programs via multi objective genetic programming"
    - "correctness attraction a study of stability of software behavior under runtime perturbation"
    - "the multiple facets of software diversity recent developments in year 2000 and beyond"
    - "tailored source code transformations to synthesize computationally diverse program variants"

Connected through hyperedge HE-3 (induced by source paper "a search for improved performance in regular expressions"):
  with members:
    - "ponyge2 grammatical evolution in python"

Connected through hyperedge HE-4 (induced by source paper "a theoretical framework for understanding mutation based testing methods"):
  with members:
    - "what good are strong specifications"

Connected through hyperedge HE-5 (induced by source paper "the multiple facets of software diversity recent developments in year 2000 and beyond"):
  with members:
    - "tailored source code transformations to synthesize computationally diverse program variants"
    - "empirical evidence of large scale diversity in api usage of object oriented software"

Connected through hyperedge HE-6 (induced by source paper "automatic software diversity in the light of test suites"):
  with members:
    - "the multiple facets of software diversity recent developments in year 2000 and beyond"
    - "tailored source code transformations to synthesize computationally diverse program variants"

Connected through hyperedge HE-7 (induced by source paper "dspot test amplification for automatic assessment of computational diversity"):
  with members:
    - "tailored source code transformations to synthesize computationally diverse program variants"

Connected through hyperedge HE-8 (induced by source paper "tailored source code transformations to synthesize computationally diverse program variants"):
  with members:
    - "a critical review of automatic patch generation learned from human written patches essay on the problem statement and the evaluation of automatic software repair"

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.SE(Software Engineering)