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 underdetermined systems with error correcting codes"):
  Abstract: In an underdetermined system of equations $Ax=y$, where $A$ is an $m\times n$ matrix, only $u$ of the entries of $y$ with $u < m$ are known. Thus $E_jw$, called `measurements', are known for certain $j\in J \subset \{0,1,\ldots,m-1\}$ where $\{E_i, i=0,1,\ldots, m-1\}$ are the rows of $A$ and $|J|=u$. It is required, if possible, to solve the system uniquely when $x$ has at most $t$ non-zero entries with $u\geq 2t$. #R##N#Here such systems are considered from an error-correcting coding point of view. The unknown $x$ can be shown to be the error vector of a code subject to certain conditions on the rows of the matrix $A$. This reduces the problem to finding a suitable decoding algorithm which then finds $x$. #R##N#Decoding workable algorithms are shown to exist, from which the unknown $x$ may be determined, in cases where the known $2t$ values are evenly spaced (that is, when the elements of $J$ are in arithmetic progression) for classes of matrices satisfying certain row properties. These cases include Fourier $n\times n $ matrices where the arithmetic difference $k$ satisfies $\gcd(n,k)=1$, and classes of Vandermonde matrices $V(x_1,x_2,\ldots,x_n)$ (with $x_i\neq 0$) with arithmetic difference $k$ where the ratios $x_i/x_j$ for $i\neq j$ are not $k^{th}$ roots of unity. The decoding algorithm has complexity $O(nt)$ and in some cases, including the Fourier matrix cases, the complexity is $O(t^2)$. #R##N#Matrices which have the property that the determinant of any square submatrix is non-zero are of particular interest. Randomly choosing rows of such matrices can then give $t$ error-correcting pairs to generate a `measuring' code $C^\perp=\{E_j | j\in J\}$ with a decoding algorithm which finds $x$. #R##N#This has applications to signal processing and compressed sensing.

Includes members:
  Member "systems of mds codes from units and idempotents":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum distance separable codes to order")
  Member "codes from zero divisors and units in group rings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximum distance separable codes to order")

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.IT(Information Theory)