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: "full abstraction for the resource lambda calculus with tests through taylor expansion"
  Abstract: We study the semantics of a resource-sensitive extension of the lambda calcu- lus in a canonical reexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus. This calculus is related to Boudol's re- source calculus and is derived from Ehrhard and Regnier's dierential extension of Linear Logic and of the lambda calculus. We extend it with new constructions, to be under- stood as implementing a very simple exception mechanism, and with a \must" parallel composition. These new operations allow to associate a context of this calculus with any point of the model and to prove full abstraction for the nite sub-calculus where ordinary lambda calculus application is not allowed. The result is then extended to the full calculus by means of a Taylor Expansion formula. As an intermediate result we prove that the exception mechanism is not essential in the nite sub-calculus.

Connected through hyperedge HE-1 (induced by source paper "call by value call by name and the vectorial behaviour of the algebraic λ calculus"):
  with members:
    - "the vectorial λ calculus"
    - "a finiteness structure on resource terms"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "a computational definition of the notion of vectorial space"
    - "algebraic totality towards completeness"

Connected through hyperedge HE-2 (induced by source paper "on the discriminating power of tests in resource lambda calculus"):
  with members:
    - "the relational model is injective for multiplicative exponential linear logic without weakenings"

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)