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: "amortised resource analysis with separation logic"
  Abstract: Type-based amortised resource analysis following Hofmann and Jost---where#N#resources are associated with individual elements of data structures and doled#N#out to the programmer under a linear typing discipline---have been successful#N#in providing concrete resource bounds for functional programs, with good#N#support for inference. In this work we translate the idea of amortised resource#N#analysis to imperative pointer-manipulating languages by embedding a logic of#N#resources, based on the affine intuitionistic Logic of Bunched Implications,#N#within Separation Logic. The Separation Logic component allows us to assert the#N#presence and shape of mutable data structures on the heap, while the resource#N#component allows us to state the consumable resources associated with each#N#member of the structure. We present the logic on a small imperative language,#N#based on Java bytecode, with procedures and mutable heap. We have formalised#N#the logic and its soundness property within the Coq proof assistant and#N#extracted a certified verification condition generator. We also describe an#N#proof search procedure that allows generated verification conditions to be#N#discharged while using linear programming to infer consumable resource#N#annotations. We demonstrate the logic on some examples, including proving the#N#termination of in-place list reversal on lists with cyclic tails.

Connected through hyperedge HE-1 (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-2 (induced by source paper "quantitative separation logic a logic for reasoning about probabilistic pointer programs"):
  with members:
    - "an assertion based program logic for probabilistic programs"
    - "quantitative separation logic"
    - "a separation logic for concurrent randomized programs"
    - "bounded expectations resource analysis for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"

Connected through hyperedge HE-3 (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"
    - "linear dependent types and relative completeness"
    - "abstract effects and proof relevant logical relations"

Connected through hyperedge HE-4 (induced by source paper "verifying and synthesizing constant resource implementations with types"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "a combination framework for complexity"
    - "linear dependent types and relative completeness"

Connected through hyperedge HE-5 (induced by source paper "verifying asymptotic time complexity of imperative programs in isabelle"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "efficient verification of imperative programs using auto2"

Connected through hyperedge HE-6 (induced by source paper "bounded expectations resource analysis for probabilistic programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "how long o bayesian network will i sample thee a program analysis perspective on expected sampling times"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "non polynomial worst case analysis of recursive programs"
    - "a program logic for union bounds"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "towards automatic resource bound analysis for ocaml"

Connected through hyperedge HE-7 (induced by source paper "work analysis with resource aware session types"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "design and implementation of concurrent c0"
    - "non blocking concurrent imperative programming with session types"
    - "the complexity of interaction"
    - "towards automatic resource bound analysis for ocaml"

Connected through hyperedge HE-8 (induced by source paper "towards automatic resource bound analysis for ocaml"):
  with members:
    - "denotational cost semantics for functional languages with inductive types"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "a combination framework for complexity"
    - "linear dependent types and relative completeness"
    - "a static cost analysis for a higher order language"

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)