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: "pure type systems without explicit contexts"
  Abstract: We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free and bound variables even in pseudo-terms. #R##N#Specifically we give the rules of the "Pure Type System" class of type theories in this style. We prove that the typing judgments of these systems correspond in a natural way with those of Pure Type Systems as traditionally formulated. I.e., our systems have exactly the same well-typed terms as traditional presentations of type theory. #R##N#Our system can be seen as a type theory in which all type judgments share an identical, infinite, typing context that has infinitely many variables for each possible type. For this reason we call our system "Gamma_infinity". This name means to suggest that our type judgment "A : B" should be read as "Gamma_infinity |- A : B", with a fixed infinite type context called "Gamma_infinity".

Connected through hyperedge HE-1 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms"):
  with members:
    - "realizability in the unitary sphere"
    - "the vectorial λ calculus"
    - "typing quantum superpositions and measurement"
    - "proof normalisation in a logic identifying isomorphic propositions"
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"

Connected through hyperedge HE-2 (induced by source paper "proof normalisation in a logic identifying isomorphic propositions"):
  with members:
    - "the vectorial λ calculus"
    - "typing quantum superpositions and measurement"
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "models and theories of lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "simply typed lambda calculus modulo type isomorphisms"):
  with members:
    - "call by value non determinism in a linear logic type discipline"
    - "non determinism through type isomorphism"
    - "the probability of non confluent systems"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "models and theories of lambda calculus"

Connected through hyperedge HE-4 (induced by source paper "the probability of non confluent systems"):
  with members:
    - "the vectorial λ calculus"
    - "call by value non determinism in a linear logic type discipline"
    - "normalisation of a non deterministic type isomorphic lambda calculus"
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "probabilistic operational semantics for the lambda calculus"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"

Connected through hyperedge HE-5 (induced by source paper "normalisation of a non deterministic type isomorphic lambda calculus"):
  with members:
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "models and theories of lambda calculus"

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)