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: "sub quadratic decoding of gabidulin codes"
  Abstract: This paper shows how to decode errors and erasures with Gabidulin codes in sub-quadratic time in the code length, improving previous algorithms which had at least quadratic complexity. The complexity reduction is achieved by accelerating operations on linearized polynomials. In particular, we present fast algorithms for division, multi-point evaluation and interpolation of linearized polynomials and show how to efficiently compute minimal subspace polynomials.

Connected through hyperedge HE-1 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes"):
  with members:
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "convolutional codes in rank metric with application to random network coding"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "bounds on list decoding of rank metric codes"
    - "universal secure network coding via rank metric codes"
    - "on partial unit memory codes based on gabidulin codes"

Connected through hyperedge HE-2 (induced by source paper "private information retrieval over random linear networks"):
  with members:
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "t private information retrieval schemes using transitive codes"

Connected through hyperedge HE-3 (induced by source paper "on a rank metric code based cryptosystem with small key size"):
  with members:
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "fast encoding and decoding of gabidulin codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-4 (induced by source paper "fast multiplication for skew polynomials"):
  with members:
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "a diffie hellman like key exchange protocol based on multivariate ore polynomials"
    - "quasi optimal multiplication of linear differential operators"
    - "fast encoding and decoding of gabidulin codes"

Connected through hyperedge HE-5 (induced by source paper "space time codes based on rank metric codes and their decoding"):
  with members:
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "fast operations on linearized polynomials and their applications in coding theory"):
  with members:
    - "fast multiplication for skew polynomials"
    - "error resilience in distributed storage via rank metric codes"
    - "fast encoding and decoding of gabidulin codes"
    - "a rank metric approach to error control 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)