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: "incarnation in ludics and maximal cliques of paths"
  Abstract: Ludics is a reconstruction of logic with interaction as a primitive notion,#N#in the sense that the primary logical concepts are no more formulas and proofs#N#but cut-elimination interpreted as an interaction between objects called#N#designs. When the interaction between two designs goes well, such two designs#N#are said to be orthogonal. A behaviour is a set of designs closed under#N#bi-orthogonality. Logical formulas are then denoted by behaviours. Finally#N#proofs are interpreted as designs satisfying particular properties. In that#N#way, designs are more general than proofs and we may notice in particular that#N#they are not typed objects. Incarnation is introduced by Girard in Ludics as a#N#characterization of "useful" designs in a behaviour. The incarnation of a#N#design is defined as its subdesign that is the smallest one in the behaviour#N#ordered by inclusion. It is useful in particular because being "incarnated" is#N#one of the conditions for a design to denote a proof of a formula. The#N#computation of incarnation is important also as it gives a minimal denotation#N#for a formula, and more generally for a behaviour. We give here a constructive#N#way to capture the incarnation of the behaviour of a set of designs, without#N#computing the behaviour itself. The method we follow uses an alternative#N#definition of designs: rather than defining them as sets of chronicles, we#N#consider them as sets of paths, a concept very close to that of play in game#N#semantics that allows an easier handling of the interaction: the unfolding of#N#interaction is a path common to two interacting designs.

Connected through hyperedge HE-1 (induced by source paper "a proof theoretic study of abstract termination principles"):
  with members:
    - "a unified ordering for termination proving"
    - "polynomial path orders"

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)