human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "a parameterized strongly polynomial algorithm for block structured integer programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "n fold integer programming via lp rounding")
  Member "scheduling meets n fold integer programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "n fold integer programming via lp rounding")
  Member "the complexity landscape of decompositional parameters for ilp":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "backdoors into heterogeneous classes of sat and csp":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discovering archipelagos of tractability for constraint satisfaction and counting")
  Member "voting and bribing in single exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "n fold integer programming via lp rounding")
  Member "a structural approach to kernels for ilps treewidth and total unimodularity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "on the computational complexity of vertex integrity and component order connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subgraph isomorphism on graph classes that exclude a substructure")
  Member "backdoors to satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hunting for tractable languages for judgment aggregation")

Question: Please tell me which class the source paper 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)