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: "context semantics linear logic and computational complexity"
  Abstract: We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the weight of a proof-net as a measure of its inherent complexity: it is both an upper bound to normalization time (modulo a polynomial overhead, independently on the reduction strategy) and a lower bound to the number of steps to normal form (for certain reduction strategies). Weights are then exploited in proving strong soundness theorems for various subsystems of linear logic, namely elementary linear logic, soft linear logic and light linear logic.

Connected through hyperedge HE-1 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time"):
  with members:
    - "on paths based criteria for polynomial time complexity in proof nets"
    - "linear logic by levels and bounded time complexity"
    - "bounded linear logic revisited"
    - "verification of ptime reducibility for system f terms type inference in dual light affine logic"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "the complexity of interaction"):
  with members:
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-3 (induced by source paper "the geometry of synchronization long version"):
  with members:
    - "abstract machines for game semantics revisited"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-4 (induced by source paper "geometry of resource interaction a minimalist approach"):
  with members:
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-5 (induced by source paper "on paths based criteria for polynomial time complexity in proof nets"):
  with members:
    - "linear dependent types and relative completeness"
    - "linear logic by levels and bounded time complexity"
    - "on the complexity of stratified logics"
    - "light types for polynomial time computation in lambda calculus"
    - "a syntactical analysis of non size increasing polynomial time computation"

Connected through hyperedge HE-6 (induced by source paper "linear dependent types and relative completeness"):
  with members:
    - "bounded linear logic revisited"
    - "execution time of lambda terms via denotational semantics and intersection types"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "the geometry of types long version"):
  with members:
    - "linear dependent types and relative completeness"
    - "certifying and reasoning about cost annotations of functional programs"

Connected through hyperedge HE-8 (induced by source paper "linear dependent types in a call by value scenario long version"):
  with members:
    - "linear dependent types and relative completeness"
    - "light types for polynomial time computation in 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)