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 "structural properties of index coding capacity"):
  Abstract: The index coding capacity is investigated through its structural properties. First, the capacity is characterized in three new multiletter expressions involving the clique number, Shannon capacity, and Lov\'asz theta function of the confusion graph, the latter notion introduced by Alon, Hassidim, Lubetzky, Stav, and Weinstein. The main idea is that every confusion graph can be decomposed into a small number of perfect graphs. The clique-number characterization is then utilized to show that the capacity is multiplicative under the lexicographic product of side information graphs, establishing the converse to an earlier result by Blasiak, Kleinberg, and Lubetzky. Second, sufficient and necessary conditions on the criticality of an index coding instance, namely, whether side information can be removed without reducing the capacity, are established based on the notion of unicycle, providing a partial answer to the question first raised by Tahmasbi, Shahrasbi, and Gohari. The necessary condition, along with other existing conditions, can be used to eliminate noncritical instances that do not need to be investigated. As an application of the established multiplicativity and criticality, only 10,634 (0.69%) out of 1,540,944 nonisomorphic six-message index coding instances are identified for further investigation, among which the capacity is still unknown for 119 instances.

Includes members:
  Member "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "embedded index coding")
  Member "on approximating the sum rate for multiple unicasts":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a bound on the shannon capacity via a linear programming variation")
  Member "on a duality between recoverable distributed storage and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "embedded index coding")
  Member "a rate distortion approach to index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative multi sender index coding")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "fundamental limits of caching in wireless d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "bounding multiple unicasts through index coding and locally repairable codes":
    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)