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: "non linear index coding outperforming the linear optimum"
  Abstract: The following source coding problem was introduced by Birk and Kol: a sender holds a word $x\in\{0,1\}^n$, and wishes to broadcast a codeword to $n$ receivers, $R_1,...,R_n$. The receiver $R_i$ is interested in $x_i$, and has prior \emph{side information} comprising some subset of the $n$ bits. This corresponds to a directed graph $G$ on $n$ vertices, where $i j$ is an edge iff $R_i$ knows the bit $x_j$. An \emph{index code} for $G$ is an encoding scheme which enables each $R_i$ to always reconstruct $x_i$, given his side information. The minimal word length of an index code was studied by Bar-Yossef, Birk, Jayram and Kol (FOCS 2006). They introduced a graph parameter, $\minrk_2(G)$, which completely characterizes the length of an optimal \emph{linear} index code for $G$. The authors of BBJK showed that in various cases linear codes attain the optimal word length, and conjectured that linear index coding is in fact \emph{always} optimal. #R##N#In this work, we disprove the main conjecture of BBJK in the following strong sense: for any $\epsilon > 0$ and sufficiently large $n$, there is an $n$-vertex graph $G$ so that every linear index code for $G$ requires codewords of length at least $n^{1-\epsilon}$, and yet a non-linear index code for $G$ has a word length of $n^\epsilon$. This is achieved by an explicit construction, which extends Alon's variant of the celebrated Ramsey construction of Frankl and Wilson. #R##N#In addition, we study optimal index codes in various, less restricted, natural models, and prove several related properties of the graph parameter $\minrk(G)$.

Connected through hyperedge HE-1 (induced by source paper "the minrank of random graphs"):
  with members:
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "on a duality between recoverable distributed storage and index coding"
    - "an equivalence between network coding and index coding"
    - "on linear index coding for random graphs"
    - "min rank conjecture for log depth circuits"
    - "linear index coding via semidefinite programming"

Connected through hyperedge HE-2 (induced by source paper "index coding and network coding via rank minimization"):
  with members:
    - "on a duality between recoverable distributed storage and index coding"
    - "quasi linear network coding"
    - "a matrix completion approach to linear index coding problem"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "on the capacity region for index coding"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "understanding alternating minimization for matrix completion"

Connected through hyperedge HE-3 (induced by source paper "on the number of optimal linear index codes for unicast index coding problems"):
  with members:
    - "on the number of optimal index codes"
    - "optimal index coding with min max probability of error over fading channels"
    - "optimal index codes for a class of multicast networks with receiver side information"
    - "dynamic index coding for wireless broadcast networks"
    - "error correction for index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-4 (induced by source paper "vector linear error correcting index codes and discrete polymatroids"):
  with members:
    - "error correction for index coding with side information"
    - "on the security of index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "a rate distortion approach to index coding"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "graph theory versus minimum rank for index coding"
    - "on the capacity region for index coding"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "local graph coloring and index coding"
    - "fundamental limits of caching"
    - "source coding problems with conditionally less noisy side information"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-6 (induced by source paper "multi scale local shape analysis and feature selection in machine learning applications"):
  with members:
    - "dimension detection with local homology"
    - "topological and statistical behavior classifiers for tracking applications"
    - "3d terrestrial lidar data classification of complex natural scenes using a multi scale dimensionality criterion applications in geomorphology"

Connected through hyperedge HE-7 (induced by source paper "optimal index coding with min max probability of error over fading channels"):
  with members:
    - "optimal index codes for a class of multicast networks with receiver side information"

Connected through hyperedge HE-8 (induced by source paper "critical graphs in index coding"):
  with members:
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"
    - "on the capacity region for index coding"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "local graph coloring and index coding"
    - "an equivalence between network coding and index coding"
    - "index coding an interference alignment perspective"
    - "dynamic index coding for wireless broadcast networks"

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)