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: "microreboot a technique for cheap recovery"
  Abstract: A significant fraction of software failures in large-scale Internet systems are cured by rebooting, even when the exact failure causes are unknown. However, rebooting can be expensive, causing nontrivial service disruption or downtime even when clusters and failover are employed. In this work we separate process recovery from data recovery to enable microrebooting -- a fine-grain technique for surgically recovering faulty application components, without disturbing the rest of the application. #R##N#We evaluate microrebooting in an Internet auction system running on an application server. Microreboots recover most of the same failures as full reboots, but do so an order of magnitude faster and result in an order of magnitude savings in lost work. This cheap form of recovery engenders a new approach to high availability: microreboots can be employed at the slightest hint of failure, prior to node failover in multi-node clusters, even when mistakes in failure detection are likely; failure and recovery can be masked from end users through transparent call-level retries; and systems can be rejuvenated by parts, without ever being shut down.

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"
    - "automatic repair of infinite loops"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "restart based security mechanisms for safety critical embedded systems"):
  with members:
    - "time dependent analysis with dynamic counter measure trees"

Connected through hyperedge HE-3 (induced by source paper "dynamic verification for file safety of multithreaded programs"):
  with members:
    - "dead code elimination based pointer analysis for multithreaded programs"
    - "probabilistic pointer analysis for multithreaded programs"
    - "program optimization based pointer analysis and live stack heap analysis"
    - "partial redundancy elimination for multi threaded programs"

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.OS(Operating Systems)