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 "truth discovery to resolve object conflicts in linked data"):
  Abstract: In the community of Linked Data, anyone can publish their data as Linked Data on the web because of the openness of the Semantic Web. As such, RDF (Resource Description Framework) triples described the same real-world entity can be obtained from multiple sources; it inevitably results in conflicting objects for a certain predicate of a real-world entity. The objective of this study is to identify one truth from multiple conflicting objects for a certain predicate of a real-world entity. An intuitive principle based on common sense is that an object from a reliable source is trustworthy; thus, a source that provide trustworthy object is reliable. Many truth discovery methods based on this principle have been proposed to estimate source reliability and identify the truth. However, the effectiveness of existing truth discovery methods is significantly affected by the number of objects provided by each source. Therefore, these methods cannot be trivially extended to resolve conflicts in Linked Data with a scale-free property, i.e., most of the sources provide few conflicting objects, whereas only a few sources have many conflicting objects. To address this challenge, we propose a novel approach called TruthDiscover to identify the truth in Linked Data with a scale-free property. Two strategies are adopted in TruthDiscover to reduce the effect of the scale-free property on truth discovery. First, this approach leverages the topological properties of the Source Belief Graph to estimate the priori beliefs of sources, which are utilized to smooth the trustworthiness of sources. Second, this approach utilizes the Hidden Markov Random Field to model the interdependencies between objects to estimate the trust values of objects accurately. Experiments are conducted in the six datasets to evaluate TruthDiscover.

Includes members:
  Member "truth finding on the deep web is the problem solved":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "data market platforms trading data assets to solve data problems vision paper")
  Member "a survey on truth discovery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint inference on truth rumor and their sources in social networks")
  Member "knowledge based trust estimating the trustworthiness of web sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "detecting toxicity in news articles application to bulgarian")
  Member "linked data integration with conflicts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exploiting source object network to resolve object conflicts in linked data")
  Member "loopy belief propagation for approximate inference an empirical study":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "a bayesian approach to discovering truth from conflicting sources for data integration":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "open knowledge enrichment for long tail entities")

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)