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: "duality codes and the integrality gap bound for index coding"
  Abstract: This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side information, and requests another subset of the packets. This problem is known as the index coding problem and can be represented by a bipartite digraph. An integer linear program is developed that provides a lower bound on the minimum number of transmissions required for any coding algorithm. Conversely, its linear programming relaxation is shown to provide an upper bound that is achievable by a simple form of vector linear coding. Thus, the information theoretic optimum is bounded by the integrality gap between the integer program and its linear relaxation. In the special case when the digraph has a planar structure, the integrality gap is shown to be zero, so that exact optimality is achieved. Finally, for non-planar problems, an enhanced integer program is constructed that provides a smaller integrality gap. The dual of this problem corresponds to a more sophisticated partial clique coding strategy that time-shares between Reed-Solomon erasure codes. This work illuminates the relationship between index coding, duality, and integrality gaps between integer programs and their linear relaxations.

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 "on index coding for complementary graphs with focus on circular perfect graphs"):
  with members:
    - "structural properties of index coding capacity"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-3 (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-4 (induced by source paper "interlinked cycles for index coding generalizing cycles and cliques"):
  with members:
    - "on critical index coding problems"
    - "structural properties of index coding capacity using fractional graph theory"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"
    - "local graph coloring and index coding"

Connected through hyperedge HE-5 (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 rate distortion approach to index coding"
    - "a new class of index coding instances where linear coding is optimal"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-6 (induced by source paper "secure index coding existence and construction"):
  with members:
    - "limited magnitude error correcting gray codes for rank modulation"
    - "perfectly secure index coding"
    - "snake in the box codes for rank modulation under kendall s tau metric"
    - "on the capacity region for index coding"
    - "systematic error correcting codes for rank modulation"
    - "constructions of snake in the box codes for rank modulation"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-7 (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension"):
  with members:
    - "structural properties of index coding capacity using fractional graph theory"
    - "a new index coding scheme exploiting interlinked cycles"
    - "on index coding and graph homomorphism"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "a new class of index coding instances where linear coding is optimal"
    - "on the capacity region for index coding"
    - "fundamental limits of distributed caching in d2d wireless networks"

Connected through hyperedge HE-8 (induced by source paper "caching and coded multicasting multiple groupcast index coding"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "on the average performance of caching and coded multicasting with random demands"
    - "caching eliminates the wireless bottleneck in video aware wireless networks"
    - "the throughput outage tradeoff of wireless one hop caching networks"
    - "fundamental limits of distributed caching in d2d wireless networks"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "local graph coloring and index coding"

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)