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 "generalized interlinked cycle cover for index coding"):
  Abstract: A source coding problem over a noiseless broadcast channel where the source is preinformed about the contents of the cache of all receivers, is an index coding problem. Furthermore, if each message is requested by one receiver, then we call this an index coding problem with a unicast message setting. This problem can be represented by a directed graph. In this paper, we first define a structure (we call generalized interlinked cycle (GIC)) in directed graphs. A GIC consists of cycles which are interlinked in some manner (i.e., not disjoint), and it turns out that the GIC is a generalization of cliques and cycles. We then propose a simple scalar linear encoding scheme with linear time encoding complexity. This scheme exploits GICs in the digraph. We prove that our scheme is optimal for a class of digraphs with message packets of any length. Moreover, we show that our scheme can outperform existing techniques, e.g., partial clique cover, local chromatic number, composite-coding, and interlinked cycle cover.

Includes members:
  Member "a new index coding scheme exploiting interlinked cycles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear programming approximations for index coding")
  Member "linear codes are optimal for index coding instances with five or fewer receivers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interlinked cycles for index coding generalizing cycles and cliques")
  Member "on the capacity region for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "local graph coloring and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "embedded index coding")
  Member "dynamic index coding for wireless broadcast networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embedded index coding")
  Member "linear index coding via semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the generalized orthogonality dimension of generalized kneser graphs bounds and applications")
  Member "index coding via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)