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: "linear dependent types and relative completeness"
  Abstract: A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely capture the functional behaviour of PCF programs (i.e. how the output relates to the input) but also some of their intensional properties, namely the complexity of evaluating them with Krivine's Machine. dlPCF is designed around dependent types and linear logic and is parametrized on the underlying language of index terms, which can be tuned so as to sacrifice completeness for tractability.

Connected through hyperedge HE-1 (induced by source paper "session types with arithmetic refinements and their application to work analysis"):
  with members:
    - "resource guided program synthesis"
    - "resource aware session types for digital contracts"
    - "a message passing interpretation of adjoint logic"
    - "circular proofs as session typed processes a local validity condition"
    - "label dependent session types"
    - "relational cost analysis for functional imperative programs"
    - "parallel complexity analysis with temporal session types"
    - "dependent session types"

Connected through hyperedge HE-2 (induced by source paper "exponential automatic amortized resource analysis"):
  with members:
    - "analysis of logarithmic amortised complexity"
    - "verifying and synthesizing constant resource implementations with types"
    - "bounded expectations resource analysis for probabilistic programs"
    - "work analysis with resource aware session types"
    - "non polynomial worst case analysis of recursive programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"

Connected through hyperedge HE-3 (induced by source paper "resource guided program synthesis"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "towards automatic resource bound analysis for ocaml"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "synthesis of recursive adt transformations from reusable templates"
    - "program synthesis from polymorphic refinement types"
    - "denotational cost semantics for functional languages with inductive types"

Connected through hyperedge HE-4 (induced by source paper "label dependent session types"):
  with members:
    - "depending on session typed processes"
    - "dependent session types"
    - "recalling a witness foundations and applications of monotonic state"
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "set theoretic types for polymorphic variants"
    - "sessions as propositions"
    - "complete and easy bidirectional typechecking for higher rank polymorphism"
    - "irrelevance heterogeneous equality and call by value dependent type systems"

Connected through hyperedge HE-5 (induced by source paper "resource aware session types for digital contracts"):
  with members:
    - "scilla a smart contract intermediate level language"
    - "towards automatic resource bound analysis for ocaml"
    - "linear types can change the blockchain"

Connected through hyperedge HE-6 (induced by source paper "types for parallel complexity in the pi calculus"):
  with members:
    - "parallel complexity analysis with temporal session types"
    - "work analysis with resource aware session types"
    - "light logics and higher order processes"

Connected through hyperedge HE-7 (induced by source paper "relational cost analysis for functional imperative programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "bidirectional type checking for relational properties"
    - "automating induction for solving horn clauses"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "effect dependent transformations for concurrent programs"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "abstract effects and proof relevant logical relations"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-8 (induced by source paper "parallel complexity analysis with temporal session types"):
  with members:
    - "work analysis with resource aware session types"
    - "non blocking concurrent imperative programming with session types"
    - "the complexity of interaction"
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "timed runtime monitoring for multiparty conversations"

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)