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: "hypercollecting semantics and its application to static analysis of information flow"
  Abstract: We show how static analysis for secure information flow can be expressed and proved correct entirely within the framework of abstract interpretation. The key idea is to define a Galois connection that directly approximates the hyperproperty of interest. To enable use of such Galois connections, we introduce a fixpoint characterisation of hypercollecting semantics, i.e. a â  set of sets" transformer. This makes it possible to systematically derive static analyses for hyperproperties entirely within the calculational framework of abstract interpretation. We evaluate this technique by deriving example static analyses. For qualitative information flow, we derive a dependence analysis similar to the logic of Amtoft and Banerjee (SASâ  04) and the type system of Hunt and Sands (POPLâ  06). For quantitative information flow, we derive a novel cardinality analysis that bounds the leakage conveyed by a program instead of simply deciding whether it exists. This encompasses problems that are hypersafety but not k-safety. We put the framework to use and introduce variations that achieve precision rivalling the most recent and precise static analyses for information flow.

Connected through hyperedge HE-1 (induced by source paper "whither programs as specifications"):
  with members:
    - "towards patterns for heaps and imperative lambdas"
    - "on the expressive power of kleene algebra with domain"
    - "a temporal logic for hyperproperties"
    - "epistemic temporal logic for information flow security"

Connected through hyperedge HE-2 (induced by source paper "a monadic framework for relational verification applied to information security program equivalence and optimizations"):
  with members:
    - "proof relevant logical relations for name generation"
    - "lightdp towards automating differential privacy proofs"
    - "language integrated provenance"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "the foundational cryptography framework"
    - "abstract effects and proof relevant logical relations"
    - "quantitative information flow as safety and liveness hyperproperties"
    - "logical step indexed logical relations"

Connected through hyperedge HE-3 (induced by source paper "relational symbolic execution"):
  with members:
    - "synthesizing coupling proofs of differential privacy"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

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)