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 "data invariants on trust in data driven systems"):
  Abstract: The reliability and proper function of data-driven applications hinge on the data's continued conformance to the applications' initial design. When data deviates from this initial profile, system behavior becomes unpredictable. Data profiling techniques such as functional dependencies and denial constraints encode patterns in the data that can be used to detect deviations. But traditional methods typically focus on exact constraints and categorical attributes, and are ill-suited for tasks such as determining whether the prediction of a machine learning system can be trusted or for quantifying data drift. In this paper, we introduce data invariants, a new data-profiling primitive that models arithmetic relationships involving multiple numerical attributes within a (noisy) dataset and which complements the existing data-profiling techniques. We propose a quantitative semantics to measure the degree of violation of a data invariant, and establish that strong data invariants can be constructed from observations with low variance on the given dataset. A concrete instance of this principle gives the surprising result that low-variance components of a principal component analysis (PCA), which are usually discarded, generate better invariants than the high-variance components. We demonstrate the value of data invariants on two applications: trusted machine learning and data drift. We empirically show that data invariants can (1) reliably detect tuples on which the prediction of a machine-learned model should not be trusted, and (2) quantify data drift more accurately than the state-of-the-art methods. Additionally, we show four case studies where an intervention-centric explanation tool uses data invariants to explain causes for tuple non-conformance.

Includes members:
  Member "tutorial safe and reliable machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "diagnostic curves for black box models")
  Member "example driven query intent discovery abductive reasoning using semantic similarity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "duoquest a dual specification system for expressive sql queries")
  Member "data sanity check for deep learning systems via learnt assertions":
    also connected through other hyperedges:
      (none)
  Member "improving reconstruction autoencoder out of distribution detection with mahalanobis distance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "anomalous instance detection in deep learning a survey")
  Member "on calibration of modern neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatiotemporal relationship reasoning for pedestrian intent prediction")
  Member "learning representations and generative models for 3d point clouds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pt2pc learning to generate 3d point cloud shapes from part tree conditions")
  Member "on the safety of machine learning cyber physical systems decision sciences and data products":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "training adversarial agents to exploit weaknesses in deep control policies")
  Member "effective and complete discovery of order dependencies via set based axiomatization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "abc of order dependencies")

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)