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: "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
  Abstract: The two-sender groupcast index coding problem (TGICP) consists of a set of receivers, where all the messages demanded by the set of receivers are distributed among the two senders. The senders can possibly have a set of messages in common. Each message can be demanded by more than one receiver. Each receiver has a subset of messages (known as its side information) and demands a message it does not have. The objective is to design scalar linear codes at the senders with the minimum aggregate code length such that all the receivers are able to decode their demands, by leveraging the knowledge of the side information of all the receivers. In this work, optimal scalar linear codes of three sub-problems (considered as single-sender groupcast index coding problems (SGICPs)) of the TGICP are used to construct optimal scalar linear codes for some classes of the TGICP. We introduce the notion of joint extensions of a finite number of SGICPs, which generalizes the notion of extensions of a single SGICP introduced in a prior work. An SGICP $\mathcal{I}_E$ is said to be a joint extension of a finite number of SGICPs if all the SGICPs are disjoint sub-problems of $\mathcal{I}_E$. We identify a class of joint extensions, where optimal scalar linear codes of the joint extensions can be constructed using those of the sub-problems. We then construct scalar linear codes for some classes of the TGICP, when one or more sub-problems of the TGICP belong to the above identified class of joint extensions, and provide some necessary conditions for the optimality of the construction.

Connected through hyperedge HE-1 (induced by source paper "groupcast index coding problem joint extensions"):
  with members:
    - "linear codes for broadcasting with noisy side information"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "index coding rank invariant extensions"
    - "structural properties of index coding capacity"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "generalized lexicographic products and the index coding capacity"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "a lifting construction for scalar linear index codes"

Connected through hyperedge HE-2 (induced by source paper "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"):
  with members:
    - "cooperative multi sender index coding"
    - "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"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"):
  with members:
    - "cooperative multi sender index coding"
    - "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"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"

Connected through hyperedge HE-4 (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"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "coded caching with distributed storage"):
  with members:
    - "reduced transmission in multi server coded caching"
    - "coded caching in a multi server system with random topology"
    - "structural characteristics of two sender index coding"
    - "caching and delivery via interference elimination"
    - "caching aided coded multicasting with multiple random requests"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "effect of number of users in multi level coded caching"
    - "improved lower bounds for coded caching"

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)