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 "explainable fact checking with probabilistic answer set programming"):
  Abstract: One challenge in fact checking is the ability to improve the transparency of the decision. We present a fact checking method that uses reference information in knowledge graphs (KGs) to assess claims and explain its decisions. KGs contain a formal representation of knowledge with semantic descriptions of entities and their relationships. We exploit such rich semantics to produce interpretable explanations for the fact checking output. As information in a KG is inevitably incomplete, we rely on logical rule discovery and on Web text mining to gather the evidence to assess a given claim. Uncertain rules and facts are turned into logical programs and the checking task is modeled as an inference problem in a probabilistic extension of answer set programs. Experiments show that the probabilistic inference enables the efficient labeling of claims with interpretable explanations, and the quality of the results is higher than state of the art baselines.

Includes members:
  Member "claimrank detecting check worthy claims in arabic and english":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gradient based adversarial training on transformer networks for detecting check worthy factual claims")
  Member "declare debunking fake news and false claims using evidence aware deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mining disinformation and fake news concepts methods and recent advancements")
  Member "fever a large scale dataset for fact extraction and verification":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the microsoft toolkit of multi task deep neural networks for natural language understanding")
  Member "survey of the state of the art in natural language generation core tasks applications and evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "studying the effects of cognitive biases in evaluation of conversational agents")
  Member "finding streams in knowledge graphs to support fact checking":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "knowledge graphs")
  Member "computing lpmln using asp and mln solvers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strong equivalence for lpmln programs")
  Member "discriminative predicate path mining for fact checking in knowledge graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "knowledge graphs")
  Member "computational fact checking from knowledge networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "knowledge graphs")

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.DB(Databases)