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: "polynomial size analysis of first order shapely functions"
  Abstract: We present a size-aware type system for first-order shapely function#N#definitions. Here, a function definition is called shapely when the size of the#N#result is determined exactly by a polynomial in the sizes of the arguments.#N#Examples of shapely function definitions may be implementations of matrix#N#multiplication and the Cartesian product of two lists. The type system is#N#proved to be sound w.r.t. the operational semantics of the language. The type#N#checking problem is shown to be undecidable in general. We define a natural#N#syntactic restriction such that the type checking becomes decidable, even#N#though size polynomials are not necessarily linear or monotonic. Furthermore,#N#we have shown that the type-inference problem is at least semi-decidable (under#N#this restriction). We have implemented a procedure that combines run-time#N#testing and type-checking to automatically obtain size dependencies. It#N#terminates on total typable function definitions.

Connected through hyperedge HE-1 (induced by source paper "automating sized type inference for complexity analysis technical report"):
  with members:
    - "the complexity of interaction"
    - "denotational cost semantics for functional languages with inductive types"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "synthesis of sup interpretations a survey"
    - "linear dependent types and relative completeness"
    - "decidability of type checking in the calculus of algebraic constructions with size annotations"

Connected through hyperedge HE-2 (induced by source paper "swapping a natural bridge between named and indexed explicit substitution calculi"):
  with members:
    - "a theory of explicit substitutions with safe and full composition"

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)