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: "call by value and call by name dual calculi with inductive and coinductive types"
  Abstract: This paper extends the dual calculus with inductive types and coinductive#N#types. The paper first introduces a non-deterministic dual calculus with#N#inductive and coinductive types. Besides the same duality of the original dual#N#calculus, it has the duality of inductive and coinductive types, that is, the#N#duality of terms and coterms for inductive and coinductive types, and the#N#duality of their reduction rules. Its strong normalization is also proved,#N#which is shown by translating it into a second-order dual calculus. The strong#N#normalization of the second-order dual calculus is proved by translating it#N#into the second-order symmetric lambda calculus. This paper then introduces a#N#call-by-value system and a call-by-name system of the dual calculus with#N#inductive and coinductive types, and shows the duality of call-by-value and#N#call-by-name, their Church-Rosser properties, and their strong normalization.#N#Their strong normalization is proved by translating them into the#N#non-deterministic dual calculus with inductive and coinductive types.

Connected through hyperedge HE-1 (induced by source paper "induction by coinduction and control operators in call by name"):
  with members:
    - "graph logics with rational relations"
    - "resource usage analysis for the pi calculus"
    - "relational parametricity and control"

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)