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 optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
  Abstract: The problem of two-sender unicast index coding consists of two senders and a set of receivers. Each receiver demands a unique message and possesses some of the messages demanded by other receivers as its side-information. Every demanded message is present with at least one of the senders. Senders avail the knowledge of the side-information at the receivers to reduce the number of broadcast transmissions. Solution to this problem consists of finding the optimal number of coded transmissions from the two senders. One important class of the two-sender problem consists of the messages at the senders and the side-information at the receivers satisfying \emph{fully-participated interactions}. This paper provides the optimal broadcast rates, for all the unsolved cases of the two-sender problem with fully-participated interactions when the associated \emph{interaction digraphs} contain cycles. The optimal broadcast rates are provided in terms of those of the three independent single-sender problems associated with the two-sender problem. This paper also provides an achievable broadcast rate with $t$-bit messages for any finite $t$ and any two-sender problem with fully-participated interactions belonging to $(i)$ any one of the six instances (classes) of the two-sender problem when the associated interaction digraph does not contain any cycle, and $(ii)$ one of the classes of the two-sender problem when the associated interaction digraph contains cycles. The achievable broadcast rates are obtained by exploiting the symmetries of the confusion graph to color the same according to the two-sender graph coloring.

Connected through hyperedge HE-1 (induced by source paper "optimal weakly secure linear codes for some classes of the two sender index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "on the capacity region for secure index coding"
    - "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-2 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "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-3 (induced by source paper "structural characteristics of two sender index coding"):
  with members:
    - "cooperative multi sender index coding"
    - "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "fundamental limits of decentralized data shuffling"
    - "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"

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)