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: "relational parametricity and separation logic"
  Abstract: Separation logic is a recent extension of Hoare logic for reasoning about#N#programs with references to shared mutable data structures. In this paper, we#N#provide a new interpretation of the logic for a programming language with#N#higher types. Our interpretation is based on Reynolds's relational#N#parametricity, and it provides a formal connection between separation logic and#N#data abstraction.

Connected through hyperedge HE-1 (induced by source paper "data abstraction and relational program logic"):
  with members:
    - "a general framework for relational parametricity"
    - "journey beyond full abstraction exploring robust property preservation for secure compilation"
    - "two for the price of one lifting separation logic assertions"
    - "ownership confinement ensures representation independence for object oriented programs"

Connected through hyperedge HE-2 (induced by source paper "a program logic for first order encapsulated webassembly"):
  with members:
    - "taintassembly taint based information flow control tracking for webassembly"
    - "wasabi a framework for dynamically analyzing webassembly"

Connected through hyperedge HE-3 (induced by source paper "two for the price of one lifting separation logic assertions"):
  with members:
    - "ownership confinement ensures representation independence for object oriented programs"

Connected through hyperedge HE-4 (induced by source paper "nested hoare triples and frame rules for higher order store"):
  with members:
    - "representations of stream processors using nested fixed points"
    - "logical reasoning for higher order functions with local state"
    - "context sensitive languages rational graphs and determinism"
    - "semantics of separation logic typing and higher order frame rules for algol like languages"

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)