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: "bounds on list decoding of rank metric codes"
  Abstract: So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed-Solomon codes. In this paper, we provide bounds on the list size of rank-metric codes in order to understand whether polynomial-time list decoding is possible or whether it works only with exponential time complexity. Three bounds on the list size are proven. The first one is a lower exponential bound for Gabidulin codes and shows that for these codes no polynomial-time list decoding beyond the Johnson radius exists. Second, an exponential upper bound is derived, which holds for any rank-metric code of length n and minimum rank distance d. The third bound proves that there exists a rank-metric code over \BBFqm of length n ≤ m such that the list size is exponential in the length for any radius greater than half the minimum rank distance. This implies that there cannot exist a polynomial upper bound depending only on n and d similar to the Johnson bound in Hamming metric. All three rank-metric bounds reveal significant differences to bounds for codes in Hamming metric.

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"
    - "sub quadratic decoding of gabidulin codes"
    - "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"
    - "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 "randomized decoding of gabidulin codes beyond the unique decoding radius"):
  with members:
    - "on the list decodability of rank metric codes"
    - "ramesses a rank metric encryption scheme with short keys"
    - "an algebraic attack on rank metric code based cryptosystems"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "on the complexity of the rank syndrome decoding problem"
    - "a basis for all solutions of the key equation for gabidulin codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-3 (induced by source paper "on the list decodability of rank metric codes"):
  with members:
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "automorphism groups of gabidulin like codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

Connected through hyperedge HE-4 (induced by source paper "improved list decodability of random linear binary codes"):
  with members:
    - "on the list decodability of random linear rank metric codes"
    - "linear time list recovery of high rate expander codes"
    - "it ll probably work out improved list decoding through random operations"
    - "optimal locally repairable codes via rank metric codes"
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "on the list decodability of random linear codes with large error rates"
    - "error resilience in distributed storage via rank metric codes"
    - "folded codes from function field towers and improved optimal rate list decoding"

Connected through hyperedge HE-5 (induced by source paper "on a rank metric code based cryptosystem with small key size"):
  with members:
    - "sub quadratic decoding of gabidulin codes"
    - "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"
    - "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-6 (induced by source paper "on the list decodability of self orthogonal rank metric codes"):
  with members:
    - "on the list decodability of random linear rank metric codes"
    - "on the list decodability of random self orthogonal codes"
    - "on self dual mrd codes"
    - "bounds on list decoding gabidulin codes"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"

Connected through hyperedge HE-7 (induced by source paper "repairing the faure loidreau public key cryptosystem"):
  with members:
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "on the complexity of the rank syndrome decoding problem"
    - "key reduction of mceliece s cryptosystem using list decoding"

Connected through hyperedge HE-8 (induced by source paper "constructions of cyclic constant dimension codes"):
  with members:
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "subspace polynomials and cyclic subspace codes"
    - "cyclic orbit codes and stabilizer subfields"
    - "cyclic orbit codes"
    - "a rank metric approach to error control in random network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "coding for errors and erasures in random network coding"
    - "johnson type bounds on constant dimension codes"

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)