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: "an operational foundation for delimited continuations in the cps hierarchy"
  Abstract: We present an abstract machine and a reduction semantics for the#N#lambda-calculus extended with control operators that give access to delimited#N#continuations in the CPS hierarchy. The abstract machine is derived from an#N#evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a#N#small-step operational semantics with an explicit representation of evaluation#N#contexts) is constructed from the abstract machine; and the control operators#N#are the shift and reset family. We also present new applications of delimited#N#continuations in the CPS hierarchy: finding list prefixes and normalization by#N#evaluation for a hierarchical language of units and products.

Connected through hyperedge HE-1 (induced by source paper "bisimulations for delimited control operators"):
  with members:
    - "proving soundness of extensional normal form bisimilarities"
    - "environmental bisimulations for delimited control operators with dynamic prompt generation"
    - "proving termination of evaluation for system f with control operators"
    - "environmental bisimulations for delimited control operators"
    - "normal form bisimulations for delimited control operators"
    - "applicative bisimulations for delimited control operators"
    - "delimited continuations in natural language quantification and polarity sensitivity"

Connected through hyperedge HE-2 (induced by source paper "proving soundness of extensional normal form bisimilarities"):
  with members:
    - "environmental bisimulations for delimited control operators with dynamic prompt generation"
    - "normal form bisimulations for delimited control operators"

Connected through hyperedge HE-3 (induced by source paper "logical relations for coherence of effect subtyping"):
  with members:
    - "logical step indexed logical relations"

Connected through hyperedge HE-4 (induced by source paper "environmental bisimulations for delimited control operators with dynamic prompt generation"):
  with members:
    - "environmental bisimulations for delimited control operators"
    - "applicative bisimulations for delimited control operators"

Connected through hyperedge HE-5 (induced by source paper "a modular structural operational semantics for delimited continuations"):
  with members:
    - "split 2 bisimilarity has a finite axiomatization over ccs with hennessy s merge"

Connected through hyperedge HE-6 (induced by source paper "environmental bisimulations for delimited control operators"):
  with members:
    - "normal form bisimulations for delimited control operators"
    - "applicative bisimulations for delimited control operators"
    - "split 2 bisimilarity has a finite axiomatization over ccs with hennessy s merge"

Connected through hyperedge HE-7 (induced by source paper "normal form bisimulations for delimited control operators"):
  with members:
    - "applicative bisimulations for delimited control operators"
    - "split 2 bisimilarity has a finite axiomatization over ccs with hennessy s merge"

Connected through hyperedge HE-8 (induced by source paper "applicative bisimulations for delimited control operators"):
  with members:
    - "split 2 bisimilarity has a finite axiomatization over ccs with hennessy s merge"

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)