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: "logical reasoning for higher order functions with local state"
  Abstract: We introduce an extension of Hoare logic for call-by-value higher-order#N#functions with ML-like local reference generation. Local references may be#N#generated dynamically and exported outside their scope, may store higher-order#N#functions and may be used to construct complex mutable data structures. This#N#primitive is captured logically using a predicate asserting reachability of a#N#reference name from a possibly higher-order datum and quantifiers over hidden#N#references. We explore the logic's descriptive and reasoning power with#N#non-trivial programming examples combining higher-order procedures and#N#dynamically generated local state. Axioms for reachability and local invariant#N#play a central role for reasoning about the examples.

Connected through hyperedge HE-1 (induced by source paper "program equivalence for algebraic effects via modalities"):
  with members:
    - "behavioural equivalence via modalities for algebraic effects"
    - "effectful applicative bisimilarity monads relators and howe s method long version"

Connected through hyperedge HE-2 (induced by source paper "program logics for homogeneous generative run time meta programming"):
  with members:
    - "a logical foundation for environment classifiers"

Connected through hyperedge HE-3 (induced by source paper "nested hoare triples and frame rules for higher order store"):
  with members:
    - "representations of stream processors using nested fixed points"
    - "relational parametricity and separation logic"
    - "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)