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: "deciding quantifier free presburger formulas using parameterized solution bounds"
  Abstract: Given a formula in quantifier-free Presburger arithmetic, if it has a#N#satisfying solution, there is one whose size, measured in bits, is polynomially#N#bounded in the size of the formula. In this paper, we consider a special class#N#of quantifier-free Presburger formulas in which most linear constraints are#N#difference (separation) constraints, and the non-difference constraints are#N#sparse. This class has been observed to commonly occur in software#N#verification. We derive a new solution bound in terms of parameters#N#characterizing the sparseness of linear constraints and the number of#N#non-difference constraints, in addition to traditional measures of formula#N#size. In particular, we show that the number of bits needed per integer#N#variable is linear in the number of non-difference constraints and logarithmic#N#in the number and size of non-zero coefficients in them, but is otherwise#N#independent of the total number of linear constraints in the formula. The#N#derived bound can be used in a decision procedure based on instantiating#N#integer variables over a finite domain and translating the input#N#quantifier-free Presburger formula to an equi-satisfiable Boolean formula,#N#which is then checked using a Boolean satisfiability solver. In addition to our#N#main theoretical result, we discuss several optimizations for deriving tighter#N#bounds in practice. Empirical evidence indicates that our decision procedure#N#can greatly outperform other decision procedures.

Connected through hyperedge HE-1 (induced by source paper "ilp modulo theories"):
  with members:
    - "optimization in smt with la q cost functions"

Connected through hyperedge HE-2 (induced by source paper "the first order theory of sets with cardinality constraints is decidable"):
  with members:
    - "on role logic"
    - "on the theory of structural subtyping"

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)