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: "a rate distortion approach to index coding"
  Abstract: We approach index coding as a special case of rate-distortion with multiple receivers, each with some side information about the source. Specifically, using techniques developed for the rate-distortion problem, we provide two upper bounds and one lower bound on the optimal index coding rate. The upper bounds involve specific choices of the auxiliary random variables in the best existing scheme for the rate-distortion problem. The lower bound is based on a new lower bound for the general rate-distortion problem. The bounds are shown to coincide for a number of (groupcast) index coding instances, including all instances for which the number of decoders does not exceed three.

Connected through hyperedge HE-1 (induced by source paper "cooperative multi sender index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "optimal finite length and asymptotic index codes for five or fewer receivers"
    - "on the capacity for distributed index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "structural properties of index coding capacity using fractional graph theory"

Connected through hyperedge HE-2 (induced by source paper "the optimality of partial clique covering for index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "local partial clique covers for index coding"
    - "approximate capacity of index coding for some classes of graphs"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "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"
    - "storage capacity of repairable networks"

Connected through hyperedge HE-3 (induced by source paper "a novel index coding scheme and its application to coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the capacity for distributed index coding"
    - "information theoretic caching the multi user case"
    - "local partial clique covers for index coding"
    - "a rate distortion approach to caching"
    - "on caching with more users than files"
    - "on the optimality of uncoded cache placement"
    - "topological interference management through index coding"

Connected through hyperedge HE-4 (induced by source paper "optimal finite length and asymptotic index codes for five or fewer receivers"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "a new class of index coding instances where linear coding is optimal"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"

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

Connected through hyperedge HE-6 (induced by source paper "approximate capacity of index coding for some classes of 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"
    - "graph theory versus minimum rank for index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "on the capacity region for index coding"
    - "the multi sender multicast index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-7 (induced by source paper "an equivalence between secure network and index coding"):
  with members:
    - "secure index coding existence and construction"
    - "perfectly secure index coding"
    - "an equivalence between network coding and index coding"
    - "on secure network coding with uniform wiretap sets"
    - "on the security of index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-8 (induced by source paper "lp bounds for rate distortion with variable side information"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "source coding problems with conditionally less noisy side information"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "index coding via linear programming"

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)