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: "on the existence of universally decodable matrices"
  Abstract: Universally decodable matrices (UDMs) can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $N$ and a prime power $q$. The main result of this paper is that the simple condition $L \leq q+1$ is both necessary and sufficient for $(L,N,q)$-UDMs to exist. The existence proof is constructive and yields a coding scheme that is equivalent to a class of codes that was proposed by Rosenbloom and Tsfasman. Our work resolves an open problem posed recently in the literature.

Connected through hyperedge HE-1 (induced by source paper "universally decodable matrices for distributed matrix vector multiplication"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "c 3 les codes for coded computation that leverage stragglers"
    - "rateless codes for near perfect load balancing in distributed matrix vector multiplication"
    - "erasure correction of scalar codes in the presence of stragglers"
    - "exploitation of stragglers in coded computation"
    - "coded sparse matrix multiplication"
    - "erasure coding for distributed matrix multiplication for matrices with bounded entries"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"

Connected through hyperedge HE-2 (induced by source paper "hierarchical erasure correction of linear codes"):
  with members:
    - "fractional decoding error correction from partial information"
    - "ldpc codes over the q ary multi bit channel"
    - "on universally decodable matrices for space time coding"

Connected through hyperedge HE-3 (induced by source paper "erasure correction of scalar codes in the presence of stragglers"):
  with members:
    - "fractional decoding error correction from partial information"
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "ldpc codes over the q ary multi bit channel"
    - "repairing multiple failures for scalar mds codes"
    - "repairing reed solomon codes with multiple erasures"
    - "repairing reed solomon codes"

Connected through hyperedge HE-4 (induced by source paper "fourier reflexive partitions and macwilliams identities for additive codes"):
  with members:
    - "macwilliams extension theorems and the local global property for codes over rings"
    - "partitions of frobenius rings induced by the homogeneous weight"
    - "classification of poset block spaces admitting macwilliams type identity"
    - "second order weight distributions"
    - "the partition weight enumerator of mds codes and its applications"

Connected through hyperedge HE-5 (induced by source paper "outage exponent a unified performance metric for parallel fading channels"):
  with members:
    - "diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-6 (induced by source paper "higher genus universally decodable matrices udmg"):
  with members:
    - "on universally decodable matrices for space time coding"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-7 (induced by source paper "an outage exponent region based coded f matching framework for channel allocation in multi carrier multi access channels"):
  with members:
    - "outage exponent a unified performance metric for parallel fading channels"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-8 (induced by source paper "near mds poset codes and distributions"):
  with members:
    - "bounds on ordered codes and orthogonal arrays"

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)