human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension"):
  Abstract: Index coding studies multiterminal source-coding problems where a set of receivers are required to decode multiple (possibly different) messages from a common broadcast, and they each know some messages  a priori . In this paper, at the receiver end, we consider a special setting where each receiver knows only one message  a priori , and each message is known to only one receiver. At the broadcasting end, we consider a generalized setting where there could be multiple senders, and each sender knows a subset of the messages. The senders collaborate to transmit an index code. This paper looks at minimizing the number of total coded bits the senders are required to transmit. When there is only one sender, we propose a pruning algorithm to find a lower bound on the optimal (i.e., the shortest) index codelength, and show that it is achievable by linear index codes. When there are two or more senders, we propose an appending technique to be used in conjunction with the pruning technique to give a lower bound on the optimal index codelength; we also derive an upper bound based on cyclic codes. While the two bounds do not match in general, for the special case where no two distinct senders know any message in common, the bounds match, giving the optimal index codelength. The results are expressed in terms of strongly connected components in directed graphs that represent the index-coding problems.

Includes members:
  Member "structural properties of index coding capacity using fractional graph theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cooperative multi sender index coding")
  Member "a new index coding scheme exploiting interlinked cycles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear programming approximations for index coding")
  Member "on index coding and graph homomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "index coding rank invariant extensions")
  Member "bounding multiple unicasts through index coding and locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "embedded index coding")
  Member "linear codes are optimal for index coding instances with five or fewer receivers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interlinked cycles for index coding generalizing cycles and cliques")
  Member "a new class of index coding instances where linear coding is optimal":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal finite length and asymptotic index codes for five or fewer receivers")
  Member "on the capacity region for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "duality codes and the integrality gap bound for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cooperative multi sender index coding")

Question: Please tell me which class the source paper 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)