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: "proving noninterference by a fully complete translation to the simply typed lambda calculus"
  Abstract: Tse and Zdancewic have formalized the notion of noninterference for Abadi et#N#al.'s DCC in terms of logical relations and given a proof of noninterference by#N#reduction to parametricity of System F. Unfortunately, their proof contains#N#errors in a key lemma that their translation from DCC to System F preserves the#N#logical relations defined for both calculi. In fact, we have found a#N#counterexample for it. In this article, instead of DCC, we prove#N#noninterference for sealing calculus, a new variant of DCC, by reduction to the#N#basic lemma of a logical relation for the simply typed lambda-calculus, using a#N#fully complete translation to the simply typed lambda-calculus. Full#N#completeness plays an important role in showing preservation of the two logical#N#relations through the translation. Also, we investigate relationship among#N#sealing calculus, DCC, and an extension of DCC by Tse and Zdancewic and show#N#that the first and the last of the three are equivalent.

Connected through hyperedge HE-1 (induced by source paper "typed based relaxed noninterference for free"):
  with members:
    - "types for information flow control labeling granularity and semantic models"
    - "ownership confinement ensures representation independence for object oriented programs"

Connected through hyperedge HE-2 (induced by source paper "modalities cohesion and information flow"):
  with members:
    - "types for information flow control labeling granularity and semantic models"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "dual context calculi for modal logic"

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)