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 "a comprehensive study of automatic program repair on the quixbugs benchmark"):
  Abstract: Automatic program repair papers tend to repeatedly use the same benchmarks. This poses a threat to the external validity of the findings of the program repair research community. In this paper, we perform an automatic repair experiment on a benchmark called QuixBugs that has never been studied in the context of program repair. In this study, we report on the characteristics of QuixBugs, and study five repair systems, Arja, Astor, Nopol, NPEfix and RSRepair, which are representatives of generate-and-validate repair techniques and synthesis repair techniques. We propose three patch correctness assessment techniques to comprehensively study overfitting and incorrect patches. Our key results are: 1) 15 / 40 buggy programs in the QuixBugs can be repaired with a test-suite adequate patch; 2) a total of 64 plausible patches for those 15 buggy programs in the QuixBugs are present in the search space of the considered tools; 3) the three patch assessment techniques discard in total 33 / 64 patches that are overfitting. This sets a baseline for future research of automatic repair on QuixBugs. Our experiment also highlights the major properties and challenges of how to perform automated correctness assessment of program repair patches. All experimental results are publicly available on Github in order to facilitate future research on automatic program repair.

Includes members:
  Member "alleviating patch overfitting with automatic test generation a study of feasibility and effectiveness for the nopol repair system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "e apr mapping the effectiveness of automated program repair")
  Member "automatic software repair a bibliography":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a recurrent neural network based patch recommender for linux kernel bugs")
  Member "arja automated repair of java programs via multi objective genetic programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "e apr mapping the effectiveness of automated program repair")
  Member "nopol automatic repair of conditional statement bugs in java programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "e apr mapping the effectiveness of automated program repair")
  Member "precise condition synthesis for program repair":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "encore ensemble learning using convolution neural machine translation for automatic program repair")
  Member "npefix automatic runtime repair of null pointer exceptions in java":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "getafix learning to fix bugs automatically")
  Member "automatic repair of real bugs an experience report on the defects4j dataset":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "harnessing evolution for multi hunk program repair")
  Member "a critical review of automatic patch generation learned from human written patches essay on the problem statement and the evaluation of automatic software repair":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ifixr bug report driven program repair")

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)