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: "data conflict resolution using trust mappings"
  Abstract: In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, trust relationships often exist between users, allowing them to accept or reject other users' beliefs by default. As those trust relationships become complex, however, it becomes difficult to define and compute a consistent snapshot of the conflicting information. Previous solutions to a related problem, the update reconciliation problem, are dependent on the order in which the updates are processed and, therefore, do not guarantee a globally consistent snapshot.   This paper proposes the first principled solution to the automatic conflict resolution problem in a community database. Our semantics is based on the certain tuples of all stable models of a logic program. While evaluating stable models in general is well known to be hard, even for very simple logic programs, we show that the conflict resolution problem admits a PTIME solution. To the best of our knowledge, ours is the first PTIME algorithm that allows conflict resolution in a principled way. We further discuss extensions to negative beliefs and prove that some of these extensions are hard. This work is done in the context of the BeliefDB project at the University of Washington, which focuses on the efficient management of conflicts in community databases.

Connected through hyperedge HE-1 (induced by source paper "algorithms for automatic ranking of participants and tasks in an anonymized contest"):
  with members:
    - "minimum fill in inapproximability and almost tight lower bounds"
    - "lower bounds for the parameterized complexity of minimum fill in and other completion problems"
    - "on the threshold of intractability"
    - "a survey on truth discovery"
    - "chordal editing is fixed parameter tractable"
    - "subexponential parameterized algorithm for minimum fill in"

Connected through hyperedge HE-2 (induced by source paper "linearized and single pass belief propagation"):
  with members:
    - "semi supervised learning with heterophily"
    - "linview incremental view maintenance for complex analytical queries"
    - "vog summarizing and understanding large graphs"
    - "deltacon a principled massive graph similarity function"
    - "spectral redemption in clustering sparse networks"
    - "residual belief propagation informed scheduling for asynchronous message passing"
    - "paris probabilistic alignment of relations instances and schema"
    - "believe it or not adding belief annotations to databases"

Connected through hyperedge HE-3 (induced by source paper "prioritized repairing and consistent query answering in relational databases"):
  with members:
    - "defining relative likelihood in partially ordered preferential structures"
    - "consistent query answers in the presence of universal constraints"
    - "preferred answer sets for ordered logic programs"
    - "minimal change integrity maintenance using tuple deletions"

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)