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 "evaluating active learning heuristics for sequential diagnosis"):
  Abstract: Given a malfunctioning system, sequential diagnosis aims at identifying the root cause of the failure in terms of abnormally behaving system components. As initial system observations usually do not suffice to deterministically pin down just one explanation of the system's misbehavior, additional system measurements can help to differentiate between possible explanations. The goal is to restrict the space of explanations until there is only one (highly probable) explanation left. To achieve this with a minimal-cost set of measurements, various (active learning) heuristics for selecting the best next measurement have been proposed. #R##N#We report preliminary results of extensive ongoing experiments with a set of selection heuristics on real-world diagnosis cases. In particular, we try to answer questions such as "Is some heuristic always superior to all others?", "On which factors does the (relative) performance of the particular heuristics depend?" or "Under which circumstances should I use which heuristic?"

Includes members:
  Member "a generally applicable highly scalable measurement computation and optimization approach to sequential model based diagnosis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "inexpensive cost optimized measurement proposal for sequential model based diagnosis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "towards better response times and higher quality queries in interactive knowledge base debugging":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "interactive debugging of knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "rio minimizing user interaction in ontology debugging":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "interactive ontology debugging two query strategies for efficient fault localization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")

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.AI(Artificial Intelligence)