human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "typed realizability for first order classical analysis"):
  Abstract: We describe a realizability framework for classical first-order logic in#N#which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows#N#a direct interpretation of classical proofs, avoiding the usual negative#N#translation to intuitionistic logic. We prove that the usual terms of G\"odel's#N#system T realize the axioms of Peano arithmetic, and that under some#N#assumptions on the computational model, the bar recursion operator realizes the#N#axiom of dependent choice. We also perform a proper analysis of relativization,#N#which allows for less technical proofs of adequacy. Extraction of algorithms#N#from proofs of {\Pi}02 formulas relies on a novel implementation of Friedman's#N#trick exploiting the control possibilities of the language. This allows to have#N#extracted programs with simpler types than in the case of negative translation#N#followed by intuitionistic realizability.

Includes members:
  Member "existential witness extraction in classical realizability and via a negative translation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a constructive proof of dependent choice in classical arithmetic via memoization")
  Member "bistable biorders a sequential domain theory":
    also connected through other hyperedges:
      (none)

Question: Please tell me which class the source paper 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)