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: "adventures in time and space"
  Abstract: This paper investigates what is essentially a call-by-value version of PCF#N#under a complexity-theoretically motivated type system. The programming#N#formalism, ATR, has its first-order programs characterize the polynomial-time#N#computable functions, and its second-order programs characterize the type-2#N#basic feasible functionals of Mehlhorn and of Cook and Urquhart. (The ATR-types#N#are confined to levels 0, 1, and 2.) The type system comes in two parts, one#N#that primarily restricts the sizes of values of expressions and a second that#N#primarily restricts the time required to evaluate expressions. The#N#size-restricted part is motivated by Bellantoni and Cook's and Leivant's#N#implicit characterizations of polynomial-time. The time-restricting part is an#N#affine version of Barber and Plotkin's DILL. Two semantics are constructed for#N#ATR. The first is a pruning of the naive denotational semantics for ATR. This#N#pruning removes certain functions that cause otherwise feasible forms of#N#recursion to go wrong. The second semantics is a model for ATR's time#N#complexity relative to a certain abstract machine. This model provides a#N#setting for complexity recurrences arising from ATR recursions, the solutions#N#of which yield second-order polynomial time bounds. The time-complexity#N#semantics is also shown to be sound relative to the costs of interpretation on#N#the abstract machine.

Connected through hyperedge HE-1 (induced by source paper "denotational semantics as a foundation for cost recurrence extraction for functional languages"):
  with members:
    - "recurrence extraction for functional programs through call by push value"
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "a static cost analysis for a higher order language"
    - "improvements for free"

Connected through hyperedge HE-2 (induced by source paper "recurrence extraction for functional programs through call by push value"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "a static cost analysis for a higher order language"

Connected through hyperedge HE-3 (induced by source paper "type two polynomial time and restricted lookahead"):
  with members:
    - "type two iteration with bounded query revision"
    - "polynomial running times for polynomial time oracle machines"
    - "complexity theory for operators in analysis"
    - "some applications of logic to feasibility in higher types"

Connected through hyperedge HE-4 (induced by source paper "distance constraint satisfaction problems"):
  with members:
    - "on the scope of the universal algebraic approach to constraint satisfaction"
    - "constraint satisfaction tractability from semi lattice operations on infinite sets"
    - "schaefer s theorem for graphs"
    - "linear logic based analysis of constraint handling rules with disjunction"
    - "cores of countably categorical structures"

Connected through hyperedge HE-5 (induced by source paper "axiomatizing resource bounds for measure"):
  with members:
    - "resource bounded measure"

Connected through hyperedge HE-6 (induced by source paper "an implicit characterization of pspace"):
  with members:
    - "light logics and the call by value lambda calculus"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "two algorithms in search of a type system"):
  with members:
    - "some applications of logic to feasibility in higher types"
    - "a syntactical analysis of non size increasing polynomial time computation"

Connected through hyperedge HE-8 (induced by source paper "time complexity semantics for feasible affine recursions extended abstract"):
  with members:
    - "a syntactical analysis of non size increasing 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)