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 "optimal finite length and asymptotic index codes for five or fewer receivers"):
  Abstract: Index coding models broadcast networks in which a sender sends different messages to different receivers simultaneously, where each receiver may know some of the messages a priori. The aim is to find the minimum (normalized) index codelength that the sender sends. This paper considers unicast index coding, where each receiver requests exactly one message, and each message is requested by exactly one receiver. Each unicast index-coding instances can be fully described by a directed graph and vice versa, where each vertex corresponds to one receiver. For any directed graph representing a unicast index-coding instance, we show that if a maximum acyclic induced subgraph (MAIS) is obtained by removing two or fewer vertices from the graph, then the minimum index codelength equals the number of vertices in the MAIS, and linear codes are optimal for the corresponding index-coding instance. Using this result, we solved all unicast index-coding instances with up to five receivers, which correspond to all graphs with up to five vertices. For 9818 non-isomorphic graphs among all graphs up to five vertices, we obtained the minimum index codelength for all message alphabet sizes; for the remaining 28 graphs, we obtained the minimum index codelength if the message alphabet size is    $k^{2}$    for any positive integer    $k$   . This work complements the result by Arbabjolfaei  et al.  (ISIT 2013), who solved all unicast index-coding instances with up to five receivers in the asymptotic regime, where the message alphabet size tends to infinity.

Includes members:
  Member "interlinked cycles for index coding generalizing cycles and cliques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "the single uniprior index coding problem the single sender case and the multi sender extension":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure decentralized pliable index coding")
  Member "a rate distortion approach to index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative multi sender index coding")
  Member "a new class of index coding instances where linear coding is optimal":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal index codes via a duality between index coding and network coding")
  Member "critical graphs in index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embedded index coding")
  Member "on the capacity region for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "cooperative multi sender index coding")
  Member "local graph coloring and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "embedded 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)