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: "biabduction and related problems in array separation logic"
  Abstract: We investigate array separation logic (ASL), a variant of symbolic-heap separation logic in which the data structures are either pointers or arrays, i.e., contiguous blocks of allocated memory. This logic provides a language for compositional memory safety proofs of imperative array programs. #R##N#We focus on the biabduction problem for this logic, which has been established as the key to automatic specification inference at the industrial scale. We present an NP decision procedure for biabduction in ASL that produces solutions of reasonable quality, and we also show that the problem of finding a consistent solution is NP-hard. #R##N#Along the way, we study satisfiability and entailment in our logic, giving decision procedures and complexity bounds for both problems. We show satisfiability to be NP-complete, and entailment to be decidable with high complexity. The somewhat surprising fact that biabduction is much simpler than entailment is explained by the fact that, as we show, the element of choice over biabduction solutions enables us to dramatically reduce the search space.

Connected through hyperedge HE-1 (induced by source paper "reasoning about block based cloud storage systems"):
  with members:
    - "automated mutual explicit induction proof in separation logic"

Connected through hyperedge HE-2 (induced by source paper "permission inference for array programs"):
  with members:
    - "decision procedure for entailment of symbolic heaps with arrays"
    - "automating deductive verification for weak memory programs"
    - "verifying array manipulating programs by tiling"
    - "automatic verification of iterated separating conjunctions using symbolic execution"
    - "definability of accelerated relations in a theory of arrays and its applications"

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"
    - "deciding entailments in inductive separation logic with tree automata"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of pointer arithmetic in separation logic an extended version"):
  with members:
    - "decision procedure for entailment of symbolic heaps with arrays"
    - "subclasses of presburger arithmetic and the weak exp hierarchy"

Connected through hyperedge HE-5 (induced by source paper "decision procedure for entailment of symbolic heaps with arrays"):
  with members:
    - "deciding entailments in inductive separation logic with tree automata"
    - "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)