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: "cooperative multi sender index coding"
  Abstract: In this paper, we propose a new coding scheme and establish new bounds on the capacity region for the multi-sender unicast index-coding problem. We revisit existing partitioned distributed composite coding (DCC) proposed by Sadeghi  et al.  and identify its limitations in the implementation of multi-sender composite coding and in the strategy of sender partitioning. We then propose two new coding components to overcome these limitations and develop a multi-sender cooperative composite coding (CCC). We show that CCC can strictly improve upon partitioned DCC, and is the key to achieve optimality for a number of index-coding instances. The usefulness of CCC and its special cases is illuminated via non-trivial examples, and the capacity region is established for each example. Comparisons between CCC and other non-cooperative schemes in recent works are also provided to further demonstrate the advantage of CCC.

Connected through hyperedge HE-1 (induced by source paper "embedded index coding"):
  with members:
    - "task based solutions to embedded 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"
    - "on a duality between recoverable distributed storage and index coding"

Connected through hyperedge HE-2 (induced by source paper "linear index coding with multiple senders and extension to a cellular network"):
  with members:
    - "index coding with erroneous side information"
    - "structural characteristics of two sender index coding"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "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"
    - "on critical index coding problems"

Connected through hyperedge HE-3 (induced by source paper "optimal weakly secure linear codes for some classes of the two sender index coding problem"):
  with members:
    - "on the capacity region for secure index coding"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "coded caching with distributed storage"
    - "secure index coding existence and construction"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

Connected through hyperedge HE-4 (induced by source paper "generalized alignment chain improved converse results for index coding"):
  with members:
    - "on the capacity region for secure index coding"
    - "capacity theorems for distributed index coding"
    - "on the capacity for distributed index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "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"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-5 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "leveraging coding techniques for speeding up distributed computing"
    - "coded distributed computing with node cooperation substantially increases speedup factors"
    - "achieving spatial scalability for coded caching over wireless networks"
    - "a new combinatorial design of coded distributed computing"
    - "low subpacketization schemes for coded caching"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"

Connected through hyperedge HE-6 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"):
  with members:
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "coded caching with distributed storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

Connected through hyperedge HE-7 (induced by source paper "capacity theorems for distributed index coding"):
  with members:
    - "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"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"):
  with members:
    - "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"
    - "on the structure of interlinked cycle structures with interlocked outer cycles"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "structural characteristics of two sender index coding"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "coded caching with distributed storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

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)