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: "rank error correcting pairs"
  Abstract: Error-correcting pairs were introduced independently by Pellikaan and K\"otter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known families of codes. In this paper, we define new types of vector products, extending the coordinatewise product, some of which preserve symbolic products of linearized polynomials after evaluation and some of which coincide with usual products of matrices. Then we define rank error-correcting pairs for codes that are linear over the extension field and for codes that are linear over the base field, and relate both types. Bounds on the minimum rank distance of codes and MRD conditions are given. Finally we show that some well-known families of rank-metric codes admit rank error-correcting pairs, and show that the given algorithm generalizes the classical algorithm using error-correcting pairs for the Hamming metric.

Connected through hyperedge HE-1 (induced by source paper "private information retrieval from locally repairable databases with colluding servers"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "one shot pir refinement and lifting"
    - "private information retrieval over networks"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "bounds and constructions of codes with multiple localities"

Connected through hyperedge HE-2 (induced by source paper "theory of supports for linear codes endowed with the sum rank metric"):
  with members:
    - "private information retrieval from locally repairable databases with colluding servers"
    - "on defining generalized rank weights"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "private information retrieval from coded databases with colluding servers"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "convolutional codes in rank metric with application to 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)