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: "list decoding gabidulin codes via interpolation and the euclidean algorithm"
  Abstract: We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric.

Connected through hyperedge HE-1 (induced by source paper "gabidulin decoding via minimal bases of linearized polynomial modules"):
  with members:
    - "grobner bases for linearized polynomials"
    - "iterative list decoding of gabidulin codes via gr obner based interpolation"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "bounds on list decoding of rank metric codes"
    - "error resilience in distributed storage via rank metric codes"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"
    - "a parametric approach to list decoding of reed solomon codes using interpolation"

Connected through hyperedge HE-2 (induced by source paper "iterative list decoding of gabidulin codes via gr obner based interpolation"):
  with members:
    - "error resilience in distributed storage via rank metric codes"
    - "general linearized polynomial interpolation and its applications"
    - "a parametric approach to list decoding of reed solomon codes using interpolation"
    - "fast encoding and decoding of gabidulin codes"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (induced by source paper "grobner bases for linearized polynomials"):
  with members:
    - "iterative list decoding of gabidulin codes via gr obner based interpolation"
    - "coding for errors and erasures in random network coding"

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