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: "information theoretic bounds for low rank matrix completion"
  Abstract: This paper studies the low-rank matrix completion problem from an information theoretic perspective. The completion problem is rephrased as a communication problem of an (uncoded) low-rank matrix source over an erasure channel. The paper then uses achievability and converse arguments to present order-wise optimal bounds for the completion problem.

Connected through hyperedge HE-1 (induced by source paper "haplotype assembly an information theoretic view"):
  with members:
    - "distributed user profiling via spectral methods"
    - "low rank matrix recovery from errors and erasures"
    - "the power of convex relaxation near optimal matrix completion"
    - "a simpler approach to matrix completion"
    - "robust principal component analysis"

Connected through hyperedge HE-2 (induced by source paper "rank minimization over finite fields fundamental limits and coding theoretic interpretations"):
  with members:
    - "information theoretic bounds for tensor rank minimization over finite fields"
    - "capacity achieving linear codes with random binary sparse generating matrices"
    - "capacity achieving random sparse linear codes"
    - "distributed storage codes meet multiple access wiretap channels"
    - "communication over finite field matrix channels"
    - "the power of convex relaxation near optimal matrix completion"
    - "lp decoding meets lp decoding a connection between channel coding and compressed sensing"
    - "guaranteed rank minimization via singular value projection"

Connected through hyperedge HE-3 (induced by source paper "information theoretic bounds for tensor rank minimization over finite fields"):
  with members:
    - "exact matrix completion via convex optimization"
    - "properties of codes in rank metric"

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)