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: "random khatri rao product codes for numerically stable distributed matrix multiplication"
  Abstract: We propose a class of codes called random Khatri-Rao-Product (RKRP) codes for distributed matrix multiplication in the presence of stragglers. The main advantage of the proposed codes is that decoding of RKRP codes is highly numerically stable in comparison to decoding of Polynomial codes and decoding of the recently proposed OrthoPoly codes. We show that RKRP codes are maximum distance separable with probability 1. The communication cost and encoding complexity for RKRP codes are identical to that of OrthoPoly codes and Polynomial codes and the average decoding complexity of RKRP codes is lower than that of OrthoPoly codes. Numerical results show that the average relative $L_2$-norm of the reconstruction error for RKRP codes is substantially better than that of OrthoPoly codes.

Connected through hyperedge HE-1 (induced by source paper "straggler resistant distributed matrix computation via coding theory"):
  with members:
    - "numerically stable polynomially coded computing"
    - "distributed matrix vector multiplication a convolutional coding approach"
    - "random convolutional coding for robust and straggler resilient distributed matrix computation"
    - "numerically stable coded matrix computations via circulant and rotation matrix embeddings"
    - "universally decodable matrices for distributed matrix vector multiplication"
    - "speeding up distributed machine learning using codes"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "on the optimal recovery threshold of coded matrix multiplication"

Connected through hyperedge HE-2 (induced by source paper "private and secure distributed matrix multiplication with flexible communication load"):
  with members:
    - "numerically stable polynomially coded computing"
    - "private sequential function computation"
    - "distributed and private coded matrix computation with flexible communication load"
    - "private information retrieval with private coded side information the multi server case"
    - "random convolutional coding for robust and straggler resilient distributed matrix computation"
    - "secure coded multi party computation for massive matrix operations"
    - "on the capacity of secure distributed matrix multiplication"
    - "private secure coded computation"

Connected through hyperedge HE-3 (induced by source paper "numerically stable coded matrix computations via circulant and rotation matrix embeddings"):
  with members:
    - "numerically stable polynomially coded computing"
    - "distributed matrix vector multiplication a convolutional coding approach"
    - "random convolutional coding for robust and straggler resilient distributed matrix computation"
    - "universally decodable matrices for distributed matrix vector multiplication"
    - "speeding up distributed machine learning using codes"
    - "c 3 les codes for coded computation that leverage stragglers"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "on the optimal recovery threshold of coded matrix multiplication"

Connected through hyperedge HE-4 (induced by source paper "factored lt and factored raptor codes for large scale distributed matrix multiplication"):
  with members:
    - "numerically stable polynomially coded computing"
    - "speeding up distributed machine learning using codes"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "coded sparse matrix multiplication"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"

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)