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: "automated mutual explicit induction proof in separation logic"
  Abstract: We present a sequent-based deductive system for automatically proving entailments in separation logic by using mathematical induction. Our technique, called mutual explicit induction proof, is an instance of Noetherian induction. Specifically, we propose a novel induction principle on a well-founded relation of separation logic model and follow the explicit induction methods to implement this principle as inference rules, so that it can be easily integrated into a deductive system. We also support mutual induction, a natural feature of implicit induction, where the goal entailment and other entailments derived during the proof search can be used as hypotheses to prove each other. We have implemented a prototype prover and evaluated it on a benchmark of handcrafted entailments as well as benchmarks from a separation logic competition.

Connected through hyperedge HE-1 (induced by source paper "sling using dynamic analysis to infer program invariants in separation logic"):
  with members:
    - "syminfer inferring program invariants using symbolic states"
    - "automated lemma synthesis in symbolic heap separation logic"
    - "using dynamic analysis to generate disjunctive invariants"

Connected through hyperedge HE-2 (induced by source paper "a first order logic with frames"):
  with members:
    - "coming to terms with quantified reasoning"
    - "the relationship between separation logic and implicit dynamic frames"

Connected through hyperedge HE-3 (induced by source paper "reasoning about block based cloud storage systems"):
  with members:
    - "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:
    - "on automated lemma generation for separation logic with inductive definitions"
    - "deciding entailments in inductive separation logic with tree automata"
    - "separation logic modulo theories"
    - "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)