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: "bounded linear logic revisited"
  Abstract: We present QBAL, an extension of Girard, Scedrov and Scott's bounded linear#N#logic. The main novelty of the system is the possibility of quantifying over#N#resource variables. This generalization makes bounded linear logic considerably#N#more flexible, while preserving soundness and completeness for polynomial time.#N#In particular, we provide compositional embeddings of Leivant's RRW and#N#Hofmann's LFPL into QBAL.

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"
    - "verification of ptime reducibility for system f terms type inference in dual light affine logic"
    - "context semantics linear logic and computational complexity"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "characterizing co nl by a group action"):
  with members:
    - "interaction graphs multiplicatives"
    - "sublogarithmic uniform boolean proof nets"
    - "interaction graphs additives"
    - "orthomodular lattices foulis semigroups and dagger kernel categories"

Connected through hyperedge HE-3 (induced by source paper "logic programming and logarithmic space"):
  with members:
    - "characterizing co nl by a group action"
    - "unification and logarithmic space"
    - "interaction graphs multiplicatives"
    - "two way finite automata old and recent results"
    - "linear logic by levels and bounded time complexity"
    - "an implicit characterization of pspace"
    - "multi head finite automata characterizations concepts and open problems"

Connected through hyperedge HE-4 (induced by source paper "unification and logarithmic space"):
  with members:
    - "linear logic by levels and bounded time complexity"
    - "an implicit characterization of pspace"

Connected through hyperedge HE-5 (induced by source paper "from bounded affine types to automatic timing analysis"):
  with members:
    - "abstract machines for game semantics revisited"
    - "linear dependent types and relative completeness"

Connected through hyperedge HE-6 (induced by source paper "complexity analysis in presence of control operators and higher order functions long version"):
  with members:
    - "linear logic by levels and bounded time complexity"
    - "light logics and optimal reduction completeness and complexity"

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

Connected through hyperedge HE-8 (induced by source paper "quantitative classical realizability"):
  with members:
    - "realizability algebras a program to well order r"
    - "church scott ptime an application of resource sensitive realizability"
    - "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)