human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "capacity of some index coding problems with symmetric neighboring interference"
  Abstract: A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equal number of $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having the side-information $\mathcal{K}_{k}=(\mathcal{I}_{k} \cup x_{k})^c,$ where ${I}_k= \{x_{k-U},\dots,x_{k-2},x_{k-1}\}\cup\{x_{k+1}, x_{k+2},\dots,x_{k+D}\}$ is the interference with $D$ messages after and $U$ messages before its desired message. Maleki, Cadambe and Jafar obtained the capacity of this symmetric neighboring interference single unicast index coding problem (SNI-SUICP) with $(K)$ tending to infinity and Blasiak, Kleinberg and Lubetzky for the special case of $(D=U=1)$ with $K$ being finite. In this work, for any finite $K$ and arbitrary $D$ we obtain the capacity for the case $U=gcd(K,D+1)-1.$ Our proof is constructive, i.e., we give an explicit construction of a linear index code achieving the capacity.

Connected through hyperedge HE-1 (induced by source paper "an approximation algorithm for optimal clique cover delivery in coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "decentralized coded caching with distinct cache capacities"
    - "novel delivery schemes for decentralized coded caching in the finite file size regime"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"
    - "an efficient multiple groupcast coded multicasting scheme for finite fractional caching"

Connected through hyperedge HE-2 (induced by source paper "reduced complexity index codes and improved upperbound on broadcast rate for neighboring interference problems"):
  with members:
    - "near optimal vector linear index codes for single unicast index coding problems with symmetric neighboring interference"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver side information"

Connected through hyperedge HE-3 (induced by source paper "a new upperbound on the broadcast rate of index coding problems with symmetric neighboring interference"):
  with members:
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver side information"

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