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 relation between the index coding and the network coding problems"
  Abstract: In this paper we show that the Index Coding problem captures several important properties of the more general Network Coding problem. An instance of the Index Coding problem includes a server that holds a set of information messages $X=\{x_1,...,x_k\}$ and a set of receivers $R$. Each receiver has some side information, known to the server, represented by a subset of $X$ and demands another subset of $X$. The server uses a noiseless communication channel to broadcast encodings of messages in $X$ to satisfy the receivers' demands. The goal of the server is to find an encoding scheme that requires the minimum number of transmissions. #R##N#We show that any instance of the Network Coding problem can be efficiently reduced to an instance of the Index Coding problem. Our reduction shows that several important properties of the Network Coding problem carry over to the Index Coding problem. In particular, we prove that both scalar linear and vector linear codes are insufficient for achieving the minimal number of transmissions.

Connected through hyperedge HE-1 (induced by source paper "embedded index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on locally decodable index codes"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-2 (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"
    - "a rate distortion approach to 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"

Connected through hyperedge HE-3 (induced by source paper "index coding and network coding via rank minimization"):
  with members:
    - "on a duality between recoverable distributed storage and index coding"
    - "quasi linear network coding"
    - "a matrix completion approach to linear index coding problem"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "on the capacity region for index coding"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "understanding alternating minimization for matrix completion"

Connected through hyperedge HE-4 (induced by source paper "index arq protocol for reliable contents distribution over broadcast channels"):
  with members:
    - "fundamental limits of caching"

Connected through hyperedge HE-5 (induced by source paper "critical graphs in index coding"):
  with members:
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"
    - "on the capacity region for index coding"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"
    - "index coding an interference alignment perspective"
    - "dynamic index coding for wireless broadcast networks"

Connected through hyperedge HE-6 (induced by source paper "graph theoretic characterization of the feasibility of the precoding based 3 unicast interference alignment scheme"):
  with members:
    - "on the feasibility of precoding based network alignment for three unicast sessions"

Connected through hyperedge HE-7 (induced by source paper "completion delay minimization for instantly decodable network codes"):
  with members:
    - "on the complexity of solving markov decision problems"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "coding opportunity densification strategies for instantly decodable network coding"
    - "capacity of 1 to k broadcast packet erasure channels with channel output feedback"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "effective delay control in online network coding"
    - "feedback based online network coding"
    - "informed network coding for minimum decoding delay"

Connected through hyperedge HE-8 (induced by source paper "an equivalence between network coding and index coding"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "network coding is zero error always possible"
    - "lexicographic products and the power of non linear network coding"
    - "broadcasting with side information"
    - "non linear index coding outperforming the linear optimum"
    - "dualities between entropy functions and network codes"

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)