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: "deciding entailments in inductive separation logic with tree automata"
  Abstract: Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. For practical purposes, we leverage from recent advances in automata theory, such as inclusion checking for non-deterministic TA avoiding explicit determinization. We implemented our method and present promising preliminary experimental results.

Connected through hyperedge HE-1 (induced by source paper "strong separation logic"):
  with members:
    - "the effects of adding reachability predicates in propositional separation logic"
    - "a decision procedure for separation logic in smt"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-2 (induced by source paper "local reasoning for global graph properties"):
  with members:
    - "modular verification of heap reachability properties in separation logic"
    - "automatic verification of iterated separating conjunctions using symbolic execution"

Connected through hyperedge HE-3 (induced by source paper "decidability for entailments of symbolic heaps with arrays"):
  with members:
    - "decision procedure for entailment of symbolic heaps with arrays"
    - "biabduction and related problems in array separation logic"

Connected through hyperedge HE-4 (induced by source paper "automated lemma synthesis in symbolic heap separation logic"):
  with members:
    - "automated mutual explicit induction proof in separation logic"
    - "on automated lemma generation for separation logic with inductive definitions"
    - "separation logic modulo theories"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-5 (induced by source paper "decision procedure for entailment of symbolic heaps with arrays"):
  with members:
    - "biabduction and related problems in array separation logic"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-6 (induced by source paper "unified reasoning about robustness properties of symbolic heap separation logic"):
  with members:
    - "separation logic modulo theories"
    - "inference of field sensitive reachability and cyclicity"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-7 (induced by source paper "automated mutual explicit induction proof in separation logic"):
  with members:
    - "on automated lemma generation for separation logic with inductive definitions"
    - "separation logic modulo theories"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-8 (induced by source paper "on automated lemma generation for separation logic with inductive definitions"):
  with members:
    - "automating proofs of data structure properties in imperative programs"
    - "the tree width of separation logic with recursive definitions"

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)