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: "on the limitations of provenance for queries with difference"
  Abstract: The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive query languages. The provenance semirings is a particular approach that was proven effective for these languages, and it was shown that when propagating provenance with semirings, the expected equivalence axioms of the corresponding query languages are satisfied. There have been several attempts to extend the framework to account for relational algebra queries with difference. We show here that these suggestions fail to satisfy some expected equivalence axioms (that in particular hold for queries on "standard" set and bag databases). Interestingly, we show that this is not a pitfall of these particular attempts, but rather every such attempt is bound to fail in satisfying these axioms, for some semirings. Finally, we show particular semirings for which an extension for supporting difference is (im)possible.

Connected through hyperedge HE-1 (induced by source paper "explaining wrong queries using small examples"):
  with members:
    - "smoke fine grained lineage at interactive speed"
    - "semi supervised verified feedback generation"
    - "data generation for testing and grading sql queries"
    - "provenance for aggregate queries"
    - "faster query answering in probabilistic databases using read once functions"

Connected through hyperedge HE-2 (induced by source paper "provenance analysis for logic and games"):
  with members:
    - "semiring provenance for first order model checking"
    - "provenance for aggregate queries"

Connected through hyperedge HE-3 (induced by source paper "snapshot semantics for temporal multiset relations extended version"):
  with members:
    - "provenance for aggregate queries"

Connected through hyperedge HE-4 (induced by source paper "generalized absorptive polynomials and provenance semantics for fixed point logic"):
  with members:
    - "semiring provenance for first order model checking"

Connected through hyperedge HE-5 (induced by source paper "provenance circuits for trees and treelike instances extended version"):
  with members:
    - "transducers with origin information"
    - "faster query answering in probabilistic databases using read once functions"

Connected through hyperedge HE-6 (induced by source paper "first order provenance games"):
  with members:
    - "win move is coordination free sometimes"
    - "provenance for aggregate queries"

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)