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: "programming interfaces and basic topology"
  Abstract: A pattern of interaction that arises again and again in programming is a "handshake", in which two agents exchange data. The exchange is thought of as provision of a service. Each interaction is initiated by a specific agent--the client or Angel--and concluded by the other--the server or Demon. We present a category in which the objects--called interaction structures in the paper--serve as descriptions of services provided across such handshaken interfaces. The morphisms--called (general) simulations--model components that provide one such service, relying on another. The morphisms are relations between the underlying sets of the interaction structures. The proof that a relation is a simulation can serve (in principle) as an executable program, whose specification is that it provides the service described by its domain, given an implementation of the service described by its codomain. This category is then shown to coincide with the subcategory of "generated" basic topologies in Sambin's terminology, where a basic topology is given by a closure operator whose induced sup-lattice structure need not be distributive; and moreover, this operator is inductively generated from a basic cover relation. This coincidence provides topologists with a natural source of examples for non-distributive formal topology. It raises a number of questions of interest both for formal topology and programming. The extra structure needed to make such a basic topology into a real formal topology is then interpreted in the context of interaction structures.

Connected through hyperedge HE-1 (induced by source paper "infinite types infinite data infinite interaction"):
  with members:
    - "bisimulation as path type for guarded recursive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "non wellfounded trees in homotopy type theory"
    - "a linear category of polynomial functors extensional part"
    - "a linear category of polynomial diagrams"
    - "relating coalgebraic notions of bisimulation"
    - "representations of stream processors using nested fixed points"

Connected through hyperedge HE-2 (induced by source paper "interaction laws of monads and comonads"):
  with members:
    - "runners in action"
    - "notions of computation as monoids"
    - "linear usage of state"
    - "free applicative functors"
    - "handling algebraic effects"
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-3 (induced by source paper "do be do be do"):
  with members:
    - "on the expressive power of user defined effects effect handlers monadic reflection delimited control"
    - "programming with algebraic effects and handlers"
    - "inferring algebraic effects"
    - "koka programming with row polymorphic effect types"
    - "an effect system for algebraic effects and handlers"
    - "handling algebraic effects"

Connected through hyperedge HE-4 (induced by source paper "a linear category of polynomial functors extensional part"):
  with members:
    - "a linear category of polynomial diagrams"
    - "predicate transformers and linear logic yet another denotational model"

Connected through hyperedge HE-5 (induced by source paper "abstract interpretation as anti refinement"):
  with members:
    - "formal verification of a c value analysis based on abstract interpretation"

Connected through hyperedge HE-6 (induced by source paper "indexed induction and coinduction fibrationally"):
  with members:
    - "generic fibrational induction"

Connected through hyperedge HE-7 (induced by source paper "a linear category of polynomial diagrams"):
  with members:
    - "a linear category of polynomial functors extensional part"

Connected through hyperedge HE-8 (induced by source paper "a categorical treatment of ornaments"):
  with members:
    - "transporting functions across ornaments"
    - "refining inductive types"

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)