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 "a new class of rank metric codes and their list decoding beyond the unique decoding radius"):
  Abstract: Compared with classical block codes, efficient list decoding of rank-metric codes seems more difficult. Although the list decodability of random rank-metric codes and limits to list decodability have been completely determined, little work on efficient list decoding rank-metric codes has been done. The only known efficient list decoding of rank-metric codes $\mC$ gives decoding radius up to the Singleton bound $1-R-\Ge$ with positive rate $R$ when $\rho(\mC)$ is extremely small, i.e., $\Theta(\Ge^2)$ , where $\rho(\mC)$ denotes the ratio of the number of rows over the number of columns of $\mC$ \cite[STOC2013]{Guru2013}. It is commonly believed that list decoding of rank-metric codes $\mC$ with not small constant ratio $\rho(\mC)$ is hard. #R##N#The main purpose of the present paper is to explicitly construct a class of rank-metric codes $\mC$ with not small constant ratio $\rho(\mC)$ and efficiently list decode these codes with decoding radius beyond $(1-R)/2$. Our key idea is to employ two-variable polynomials $f(x,y)$, where $f$ is linearized in variable $x$ and the variable $y$ is used to "fold" the code. In other words, rows are used to correct rank errors and columns are used to "fold" the code to enlarge decoding radius. Apart from the above algebraic technique, we have to prune down the list. The algebraic idea enables us to pin down the messages into a structured subspace of dimension linear in the number $n$ of columns. This "periodic" structure allows us to pre-encoding the messages to prune down the list. More precisely, we use subspace design introduced in \cite[STOC2013]{Guru2013} to get a deterministic algorithm with a larger constant list size and employ hierarchical subspace-evasive sets introduced in \cite[STOC2012]{Guru2012} to obtain a randomized algorithm with a smaller constant list size.

Includes members:
  Member "some gabidulin codes cannot be list decoded efficiently at any radius":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "randomized decoding of gabidulin codes beyond the unique decoding radius")
  Member "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "bounds on list decoding of rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "list decoding subspace codes from insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analog subspace coding a new approach to coding for non coherent wireless networks")
  Member "list decoding of subspace codes and rank metric codes up to singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "folded codes from function field towers and improved optimal rate list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "linear time erasure list decoding of expander codes")
  Member "on identity testing of tensors low rank recovery and compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lower bounds for matrix factorization")
  Member "subspace evasive sets":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")

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)