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: "a core calculus for provenance"
  Abstract: Provenance is an increasing concern due to the ongoing revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer systems will need to become provenance-aware in order to provide satisfactory accountability, reproducibility, and trust for scientific or other high-value data. To date, there is not a consensus concerning appropriate formal models or security properties for provenance. In previous work, we introduced a formal framework for provenance security and proposed formal definitions of properties called disclosure and obfuscation. #R##N#In this article, we study refined notions of positive and negative disclosure and obfuscation in a concrete setting, that of a general-purpose programing language. Previous models of provenance have focused on special-purpose languages such as workflows and database queries. We consider a higher-order, functional language with sums, products, and recursive types and functions, and equip it with a tracing semantics in which traces themselves can be replayed as computations. We present an annotation-propagation framework that supports many provenance views over traces, including standard forms of provenance studied previously. We investigate some relationships among provenance views and develop some partial solutions to the disclosure and obfuscation problems, including correct algorithms for disclosure and positive obfuscation based on trace slicing.

Connected through hyperedge HE-1 (induced by source paper "language integrated provenance by trace analysis"):
  with members:
    - "language integrated provenance in haskell"
    - "you say what i hear where and why mis interpreting sql to derive fine grained provenance"
    - "imperative functional programs that explain their work"
    - "language integrated provenance"
    - "database queries that explain their work"

Connected through hyperedge HE-2 (induced by source paper "sketch n sketch output directed programming for svg"):
  with members:
    - "bidirectional evaluation with directmanipulation"
    - "learning to infer graphics programs from hand drawn images"
    - "programmatic and direct manipulation together at last"
    - "semi automated svg programming via direct manipulation"

Connected through hyperedge HE-3 (induced by source paper "imperative functional programs that explain their work"):
  with members:
    - "dynamic witnesses for static type errors or ill typed programs usually go wrong"
    - "causally consistent dynamic slicing"
    - "hazelnut a bidirectionally typed structure editor calculus"
    - "constructive galois connections taming the galois connection framework for mechanized metatheory"
    - "database queries that explain their work"

Connected through hyperedge HE-4 (induced by source paper "query by provenance"):
  with members:
    - "aggregation in probabilistic databases via knowledge compilation"

Connected through hyperedge HE-5 (induced by source paper "database queries that explain their work"):
  with members:
    - "putting lipstick on pig enabling database style workflow provenance"
    - "provenance for aggregate queries"
    - "provenance as dependency analysis"

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.PL(Programming Languages)