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 scalar linear index codes for symmetric and neighboring side information problems"):
  Abstract: A single unicast index coding problem (SUICP) is called symmetric neighboring and consecutive (SNC) side-information problem if it has $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having the side-information $D$ messages immediately after $x_k$ and $U$ ($D\geq U$) messages immediately before $x_k$. Maleki, Cadambe and Jafar obtained the capacity of this SUICP(SNC) and proposed $(U+1)$-dimensional optimal length vector linear index codes by using Vandermonde matrices. However, for a $b$-dimensional vector linear index code, the transmitter needs to wait for $b$ realizations of each message and hence the latency introduced at the transmitter is proportional to $b$. For any given single unicast index coding problem (SUICP) with the side-information graph $G$, MAIS($G$) is used to give a lowerbound on the broadcast rate of the ICP. In this paper, we derive MAIS($G$) of SUICP(SNC) with side-information graph $G$. We construct scalar linear index codes for SUICP(SNC) with length $\left \lceil \frac{K}{U+1} \right \rceil - \left \lfloor \frac{D-U}{U+1} \right \rfloor$. We derive the minrank($G$) of SUICP(SNC) with side-information graph $G$ and show that the constructed scalar linear index codes are of optimal length for SUICP(SNC) with some combinations of $K,D$ and $U$. For SUICP(SNC) with arbitrary $K,D$ and $U$, we show that the length of constructed scalar linear index codes are atmost two index code symbols per message symbol more than the broadcast rate. The given results for SUICP(SNC) are of practical importance due to its relation with topological interference management problem in wireless communication networks.

Includes members:
  Member "reduced dimensional optimal vector linear index codes for index coding problems with symmetric neighboring and consecutive side information":
    also connected through other hyperedges:
      (none)
  Member "low complexity decoding for symmetric neighboring and consecutive side information index coding problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reduced complexity index codes and improved upperbound on broadcast rate for neighboring interference problems")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "optimal index codes for a class of multicast networks with receiver side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperative multi sender index coding")
  Member "error correction for index coding with side information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches")

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)