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: "linear abadi and plotkin logic"
  Abstract: We present a formalization of a version of Abadi and#N#  Plotkin's logic for parametricity for a polymorphic dual#N#intuitionistic/linear type theory with fixed points, and show, following#N#Plotkin's suggestions, that it can be used to define a wide collection of#N#types, including existential types, inductive types, coinductive types and#N#general recursive types. We show that the recursive types satisfy a universal#N#property called dinaturality, and we develop reasoning principles for the#N#constructed types. In the case of recursive types, the reasoning principle is a#N#mixed induction/coinduction principle, with the curious property that#N#coinduction holds for general relations, but induction only for a limited#N#collection of ``admissible'' relations. A similar property was observed in#N#Pitts' 1995 analysis of recursive types in domain theory. In a future paper we#N#will develop a category theoretic notion of models of the logic presented here,#N#and show how the results developed in the logic can be transferred to the#N#models.

Connected through hyperedge HE-1 (induced by source paper "logical step indexed logical relations"):
  with members:
    - "linear encodings of bounded ltl model checking"

Connected through hyperedge HE-2 (induced by source paper "relational parametricity for computational effects"):
  with members:
    - "logical relations for monadic types"
    - "relational parametricity and control"

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.LO(Logic in Computer Science)