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: "smartmtd a graph based approach for effective multi truth discovery"
  Abstract: The Big Data era features a huge amount of data that are contributed by numerous sources and used by many critical data-driven applications. Due to the varying reliability of sources, it is common to see conflicts among the multi-source data, making it difficult to determine which data sources to trust. Recently, truth discovery has emerged as a means of addressing this challenging issue by determining data veracity jointly with estimating the reliability of data sources. A fundamental issue with current truth discovery methods is that they generally assume only one true value for each object, while in reality, objects may have multiple true values. In this paper, we propose a graph-based approach, called SmartMTD, to unravel the truth discovery problem beyond the single-truth assumption, or the multi-truth discovery problem. SmartMTD models and quantifies two types of source relations to estimate source reliability precisely and to detect malicious agreement among sources for effective multi-truth discovery. In particular, two graphs are constructed based on the modeled source relations. They are further used to derive the two aspects of source reliability (i.e., positive precision and negative precision) via random walk computation. Empirical studies on two large real-world datasets demonstrate the effectiveness of our approach.

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