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: "solving integer linear programs with a small number of global variables and constraints"
  Abstract: Integer Linear Programming (ILP) has a broad range of applications in various areas of artificial intelligence. Yet in spite of recent advances, we still lack a thorough understanding of which structural restrictions make ILP tractable. Here we study ILP instances consisting of a small number of "global" variables and/or constraints such that the remaining part of the instance consists of small and otherwise independent components; this is captured in terms of a structural measure we call fracture backdoors which generalizes, for instance, the well-studied class of N -fold ILP instances. #R##N#Our main contributions can be divided into three parts. First, we formally develop fracture backdoors and obtain exact and approximation algorithms for computing these. Second, we exploit these backdoors to develop several new parameterized algorithms for ILP; the performance of these algorithms will naturally scale based on the number of global variables or constraints in the instance. Finally, we complement the developed algorithms with matching lower bounds. Altogether, our results paint a near-complete complexity landscape of ILP with respect to fracture backdoors.

Connected through hyperedge HE-1 (induced by source paper "parameterized algorithms for milps with small treedepth"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "empowering the configuration ip new ptas results for scheduling with setups times"
    - "experimental evaluation of parameterized algorithms for graph separation problems half integral relaxations and matroid based kernelization"
    - "scheduling meets n fold integer programming"
    - "the complexity landscape of decompositional parameters for ilp"
    - "combinatorial n fold integer programming and applications"
    - "0 1 all csps half integral a path packing and linear time fpt algorithms"
    - "voting and bribing in single exponential time"

Connected through hyperedge HE-2 (induced by source paper "a row invariant parameterized algorithm for integer programming"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "the complexity landscape of decompositional parameters for ilp"
    - "voting and bribing in single exponential time"
    - "on the optimality of pseudo polynomial algorithms for integer programming"

Connected through hyperedge HE-3 (induced by source paper "parameterized complexity of safe set"):
  with members:
    - "linear kernels for separating a graph into components of bounded size"
    - "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"
    - "partitioning a graph into small pieces with applications to path transversal"
    - "on the computational complexity of vertex integrity and component order connectivity"

Connected through hyperedge HE-4 (induced by source paper "a parameterized strongly polynomial algorithm for block structured integer programs"):
  with members:
    - "empowering the configuration ip new ptas results for scheduling with setups times"
    - "the complexity landscape of decompositional parameters for ilp"
    - "combinatorial n fold integer programming and applications"
    - "a structural approach to kernels for ilps treewidth and total unimodularity"
    - "a faster parameterized algorithm for treedepth"

Connected through hyperedge HE-5 (induced by source paper "mixed integer programming with convex concave constraints fixed parameter tractability and applications to multicovering and voting"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "fair knapsack"
    - "scheduling meets n fold integer programming"
    - "evaluating and tuning n fold integer programming"
    - "combinatorial n fold integer programming and applications"
    - "integer programming in parameterized complexity three miniatures"
    - "voting and bribing in single exponential time"

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.DM(Discrete Mathematics)