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 "on the number of circuits in regular matroids with connections to lattices and codes"):
  Abstract: We show that for any regular matroid on $m$ elements and any $\alpha \geq 1$, the number of $\alpha$-minimum circuits, or circuits whose size is at most an $\alpha$-multiple of the minimum size of a circuit in the matroid is bounded by $m^{O(\alpha^2)}$. This generalizes a result of Karger for the number of $\alpha$-minimum cuts in a graph. As a consequence, we obtain similar bounds on the number of $\alpha$-shortest vectors in "totally unimodular" lattices and on the number of $\alpha$-minimum weight codewords in "regular" codes.

Includes members:
  Member "on the weight distribution of random binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "list decoding random euclidean codes and infinite constellations")
  Member "isolating a vertex via lattices polytopes with totally unimodular faces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "matching is as easy as the decision problem in the nc model")
  Member "extended formulations for independence polytopes of regular matroids":
    also connected through other hyperedges:
      (none)
  Member "a polynomial time algorithm for estimating the partition function of the ferromagnetic ising model on a regular matroid":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covering vectors by spaces regular matroids")
  Member "matroid secretary for regular and decomposable matroids":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")
  Member "a decomposition theory for binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph")

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