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: "linear depth increase of lambda terms in leftmost outermost beta reduction rewrite sequences"
  Abstract: Accattoli and Dal Lago have recently proved that the number of steps in a leftmost-outermost $\beta$-reduction rewrite sequence to normal form provides an invariant cost model for the Lambda Calculus. They sketch how to implement leftmost-outermost $\beta$-reduction rewrite sequences on a reasonable machine, with a polynomial overhead, by using simulating rewrite sequences in the linear explicit substitution calculus. #R##N#I am interested in an implementation that demonstrates this result, but uses graph reduction techniques similar to those that are employed by runtime evaluators of functional programs. As a crucial stepping stone I prove here the following property of leftmost-outermost $\beta$-reduction rewrite sequences in the Lambda Calculus: For every lambda-term $t$ with depth $d$ it holds that in every step of a leftmost-outermost $\beta$-reduction rewrite sequence starting on $t$ the term depth increases by at most $d$, and hence that the depth of the $n$-th reduct of $t$ in such a rewrite sequence is bounded by $d\cdot (n+1)$.

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)