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 "nopol automatic repair of conditional statement bugs in java programs"):
  Abstract: We propose  Nopol , an approach to automatic repair of buggy conditional statements (i.e.,   if-then-else  statements). This approach takes a buggy program as well as a test suite as input and generates a patch with a conditional expression as output. The test suite is required to contain passing test cases to model the expected behavior of the program and at least one failing test case that reveals the bug to be repaired. The process of  Nopol  consists of three major phases. First,  Nopol  employs angelic fix localization to identify expected values of a condition during the test execution. Second, runtime trace collection is used to collect variables and their actual values, including primitive data types and objected-oriented features (e.g., nullness checks), to serve as building blocks for patch generation. Third,  Nopol  encodes these collected data into an instance of a Satisfiability Modulo Theory (SMT) problem; then a feasible solution to the SMT instance is translated back into a code patch. We evaluate  Nopol  on 22 real-world bugs (16 bugs with buggy  if  conditions and six bugs with missing preconditions) on two large open-source projects, namely Apache Commons Math and Apache Commons Lang. Empirical analysis on these bugs shows that our approach can effectively fix bugs with buggy  if  conditions and missing preconditions. We illustrate the capabilities and limitations of  Nopol  using case studies of real bug fixes.

Includes members:
  Member "automatic repair of real bugs in java a large scale experiment on the defects4j dataset":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "e apr mapping the effectiveness of automated program repair")
  Member "automatic repair of infinite loops":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automatic software repair a bibliography")
  Member "mining software repair models for reasoning on the search space of automated program fixing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "e apr mapping the effectiveness of automated program repair")
  Member "automatic repair of real bugs an experience report on the defects4j dataset":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a comprehensive study of automatic program repair on the quixbugs benchmark")
  Member "dynamic analysis can be improved with automatic test suite refactoring":
    also connected through other hyperedges:
      (none)
  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-5 (induced by source paper "ifixr bug report driven program repair")
  Member "do the fix ingredients already exist an empirical inquiry into the redundancy assumptions of program repair approaches":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sorting and transforming program repair ingredients via deep learning code similarities")
  Member "test case purification for improving fault localization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tbar revisiting template based automated 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)