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: "church scott ptime an application of resource sensitive realizability"
  Abstract: We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed by a standard non-linear type ‘Church,’ while the Scott encodings (purely linear rep resentations of words) are by a linear type ‘Scott.’ We give a characterization of polynomial time func tions, which is derived from (Leivant and Marion 93): a function is computable in polynomial time if and only if it can be represented by a term of type Church ) Scott. To prove soundness, we employ a resource sensitive realizability technique developed by Hofmann and Dal Lago.

Connected through hyperedge HE-1 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem"):
  with members:
    - "a simple differentiable programming language"
    - "confusion of tagged perturbations in forward automatic differentiation of higher order functions"
    - "efficient differentiable programming in a functional array processing language"
    - "the simple essence of automatic differentiation"
    - "automatic differentiation in machine learning a survey"
    - "step indexed logical relations for probability"
    - "abstract effects and proof relevant logical relations"
    - "logical relations for monadic types"

Connected through hyperedge HE-2 (induced by source paper "quantitative classical realizability"):
  with members:
    - "realizability algebras a program to well order r"
    - "bounded linear logic revisited"
    - "soft lambda calculus a language for polynomial time computation"

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)