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: "a row invariant parameterized algorithm for integer programming"
  Abstract: A long line of research on fixed parameter tractability of integer programming culminated with showing that integer programs with n variables and a constraint matrix with tree-depth d and largest entry D are solvable in in time g(d,D)poly(n) for some function g, i.e., fixed parameter tractable when parameterized by tree-depth d and D. However, the tree-depth of a constraint matrix depends on the positions of its non-zero entries and thus does not reflect its geometric nature, in particular, is not invariant under row operations. We consider a parameterization of the constraint matrix by a matroid parameter called branch-depth, which is invariant under row operations. Our main result asserts that integer programs whose matrix has branch-depth d and largest entry D are solvable in time f(d,D)poly(n). Since every constraint matrix with small tree-depth has small branch-depth, our result extends the result above. The parameterization by branch-depth cannot be replaced by the more permissive notion of branch-width.

Connected through hyperedge HE-1 (induced by source paper "tight complexity lower bounds for integer linear programming with few constraints"):
  with members:
    - "about the complexity of two stage stochastic ips"
    - "scheduling meets n fold integer programming"
    - "seth based lower bounds for subset sum and bicriteria path"
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"

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.DS(Data Structures and Algorithms)