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: "bistable biorders a sequential domain theory"
  Abstract: We give a simple order-theoretic construction of a Cartesian closed category#N#of sequential functions. It is based on bistable biorders, which are sets with#N#a partial order -- the extensional order -- and a bistable coherence, which#N#captures equivalence of program behaviour, up to permutation of top (error) and#N#bottom (divergence). We show that monotone and bistable functions (which are#N#required to preserve bistably bounded meets and joins) are strongly sequential,#N#and use this fact to prove universality results for the bistable biorder#N#semantics of the simply-typed lambda-calculus (with atomic constants), and an#N#extension with arithmetic and recursion.#N#  We also construct a bistable model of SPCF, a higher-order functional#N#programming language with non-local control. We use our universality result for#N#the lambda-calculus to show that the semantics of SPCF is fully abstract. We#N#then establish a direct correspondence between bistable functions and#N#sequential algorithms by showing that sequential data structures give rise to#N#bistable biorders, and that each bistable function between such biorders is#N#computed by a sequential algorithm.

Connected through hyperedge HE-1 (induced by source paper "typed realizability for first order classical analysis"):
  with members:
    - "existential witness extraction in classical realizability and via a negative translation"

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.PL(Programming Languages)