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: "automatic repair of infinite loops"
  Abstract: Research on automatic software repair is concerned with the development of systems that automatically detect and repair bugs. One well-known class of bugs is the infinite loop. Every computer programmer or user has, at least once, experienced this type of bug. We state the problem of repairing infinite loops in the context of test-suite based software repair: given a test suite with at least one failing test, generate a patch that makes all test cases pass. Consequently, repairing infinites loop means having at least one test case that hangs by triggering the infinite loop. Our system to automatically repair infinite loops is called Infinitel. We develop a technique to manipulate loops so that one can dynamically analyze the number of iterations of loops; decide to interrupt the loop execution; and dynamically examine the state of the loop on a per-iteration basis. Then, in order to synthesize a new loop condition, we encode this set of program states as a code synthesis problem using a technique based on Satisfiability Modulo Theory (SMT). We evaluate our technique on seven seeded-bugs and on seven real-bugs. Infinitel is able to repair all of them, within seconds up to one hour on a standard laptop configuration.

Connected through hyperedge HE-1 (induced by source paper "automatic software repair a bibliography"):
  with members:
    - "automatic repair of real bugs in java a large scale experiment on the defects4j dataset"
    - "principles of antifragile software"
    - "mining software repair models for reasoning on the search space of automated program fixing"
    - "automatic repair of real bugs an experience report on the defects4j dataset"
    - "a critical review of automatic patch generation learned from human written patches essay on the problem statement and the evaluation of automatic software repair"
    - "do the fix ingredients already exist an empirical inquiry into the redundancy assumptions of program repair approaches"
    - "automatic repair of buggy if conditions and missing preconditions with smt"
    - "automated fixing of programs with contracts"

Connected through hyperedge HE-2 (induced by source paper "nopol automatic repair of conditional statement bugs in java programs"):
  with members:
    - "automatic repair of real bugs in java a large scale experiment on the defects4j dataset"
    - "mining software repair models for reasoning on the search space of automated program fixing"
    - "automatic repair of real bugs an experience report on the defects4j dataset"
    - "dynamic analysis can be improved with automatic test suite refactoring"
    - "a critical review of automatic patch generation learned from human written patches essay on the problem statement and the evaluation of automatic software repair"
    - "do the fix ingredients already exist an empirical inquiry into the redundancy assumptions of program repair approaches"
    - "test case purification for improving fault localization"
    - "automatic repair of buggy if conditions and missing preconditions with smt"

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)