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: "geometric random edge"
  Abstract: We show that a variant of the random-edge pivoting rule results in a strongly polynomial time simplex algorithm for linear programs $\max\{c^Tx \colon Ax\leq b\}$, whose constraint matrix $A$ satisfies a geometric property introduced by Brunsch and R\"oglin: The sine of the angle of a row of $A$ to a hyperplane spanned by $n-1$ other rows of $A$ is at least $\delta$. This property is a geometric generalization of $A$ being integral and all sub-determinants of $A$ being bounded by $\Delta$ in absolute value (since $\delta \geq 1/(\Delta^2 n)$). In particular, linear programs defined by totally unimodular matrices are captured in this famework ($\delta \geq 1/ n$) for which Dyer and Frieze previously described a strongly polynomial-time randomized algorithm. #R##N#The number of pivots of the simplex algorithm is polynomial in the dimension and $1/\delta$ and independent of the number of constraints of the linear program. Our main result can be viewed as an algorithmic realization of the proof of small diameter for such polytopes by Bonifas et al., using the ideas of Dyer and Frieze.

Connected through hyperedge HE-1 (induced by source paper "extended formulations for stable set polytopes of graphs without two disjoint odd cycles"):
  with members:
    - "the stable set problem in graphs with bounded genus and bounded odd cycle packing number"
    - "lifting linear extension complexity bounds to the mixed integer setting"

Connected through hyperedge HE-2 (induced by source paper "a friendly smoothed analysis of the simplex method"):
  with members:
    - "smoothed analysis of the successive shortest path algorithm"
    - "on the shadow simplex method for curved polyhedra"
    - "solving totally unimodular lps with the shadow vertex algorithm"
    - "the simplex method is strongly polynomial for deterministic markov decision processes"
    - "beyond hirsch conjecture walks on random polytopes and smoothed complexity of the simplex method"
    - "smoothed analysis of the condition numbers and growth factors of matrices"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time"

Connected through hyperedge HE-3 (induced by source paper "on the shadow simplex method for curved polyhedra"):
  with members:
    - "short paths on the voronoi graph and the closest vector problem with preprocessing"
    - "finding short paths on polytopes by the shadow vertex algorithm"
    - "beyond hirsch conjecture walks on random polytopes and smoothed complexity of the simplex method"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial 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.DS(Data Structures and Algorithms)