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: "index coding and network coding via rank minimization"
  Abstract: Index codes reduce the number of bits broadcast by a wireless transmitter to a number of receivers with different demands and with side information. It is known that the problem of finding optimal linear index codes is NP-hard. We investigate the performance of different heuristics based on rank minimization and matrix completion methods, such as alternating projections and alternating minimization, for constructing linear index codes over the reals. As a summary of our results, the alternating projections method gives the best results in terms of minimizing the number of broadcast bits and convergence rate and leads to up to 13% savings in average communication cost compared to graph coloring algorithms studied in the literature. Moreover, we describe how the proposed methods can be used to construct linear network codes for non-multicast networks. Our computer code is available online.

Connected through hyperedge HE-1 (induced by source paper "subspace aware index codes"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "a sparse and low rank optimization framework for index coding via riemannian optimization"
    - "index coding with coded side information"
    - "caching and coded multicasting multiple groupcast index coding"
    - "quasi linear network coding"
    - "rank minimization over finite fields fundamental limits and coding theoretic interpretations"
    - "an equivalence between network coding and index coding"
    - "sparse subspace clustering algorithm theory and applications"

Connected through hyperedge HE-2 (induced by source paper "preserving privacy while broadcasting k limited access schemes"):
  with members:
    - "private broadcasting an index coding approach"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval from coded databases"
    - "the oblivious transfer capacity of the wiretapped binary erasure channel"
    - "a matrix completion approach to linear index coding problem"
    - "on the security of index coding with side information"

Connected through hyperedge HE-3 (induced by source paper "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"):
  with members:
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "structural properties of index coding capacity using fractional graph theory"
    - "on a duality between recoverable distributed storage and index coding"
    - "a rate distortion approach to index coding"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"

Connected through hyperedge HE-4 (induced by source paper "error correction for index coding with coded side information"):
  with members:
    - "bounding the optimal rate of the icsi and iccsi problem"
    - "on the optimality of uncoded cache placement"
    - "structural properties of index coding capacity using fractional graph theory"
    - "graph theory versus minimum rank for index coding"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"
    - "index coding an interference alignment perspective"

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)