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: "index coding via linear programming"
  Abstract: Index Coding has received considerable attention recently motivated in part by real-world applications and in part by its connection to Network Coding. The basic setting of Index Coding encodes the problem input as an undirected graph and the fundamental parameter is the broadcast rate $\beta$, the average communication cost per bit for sufficiently long messages (i.e. the non-linear vector capacity). Recent nontrivial bounds on $\beta$ were derived from the study of other Index Coding capacities (e.g. the scalar capacity $\beta_1$) by Bar-Yossef et al (2006), Lubetzky and Stav (2007) and Alon et al (2008). However, these indirect bounds shed little light on the behavior of $\beta$: there was no known polynomial-time algorithm for approximating $\beta$ in a general network to within a nontrivial (i.e. $o(n)$) factor, and the exact value of $\beta$ remained unknown for any graph where Index Coding is nontrivial. #R##N#Our main contribution is a direct information-theoretic analysis of the broadcast rate $\beta$ using linear programs, in contrast to previous approaches that compared $\beta$ with graph-theoretic parameters. This allows us to resolve the aforementioned two open questions. We provide a polynomial-time algorithm with a nontrivial approximation ratio for computing $\beta$ in a general network along with a polynomial-time decision procedure for recognizing instances with $\beta=2$. In addition, we pinpoint $\beta$ precisely for various classes of graphs (e.g. for various Cayley graphs of cyclic groups) thereby simultaneously improving the previously known upper and lower bounds for these graphs. Via this approach we construct graphs where the difference between $\beta$ and its trivial lower bound is linear in the number of vertices and ones where $\beta$ is uniformly bounded while its upper bound derived from the naive encoding scheme is polynomially worse.

Connected through hyperedge HE-1 (induced by source paper "embedded index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on locally decodable index codes"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-2 (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"
    - "capacity of some index coding problems with symmetric neighboring interference"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "a tutorial on clique problems in communications and signal processing"):
  with members:
    - "eptas for max clique on disks and unit balls"
    - "enhanced uplink resource allocation in non orthogonal multiple access systems"
    - "discovering patterns of interest in ip traffic using cliques in bipartite link streams"
    - "delivery time reduction for order constrained applications using binary network codes"
    - "data dissemination using instantly decodable binary codes in fog radio access networks"
    - "on multiaspect graphs"
    - "distributed hybrid scheduling in multi cloud networks using conflict graphs"
    - "resilient backhaul network design using hybrid radio free space optical technology"

Connected through hyperedge HE-4 (induced by source paper "on locally decodable index codes"):
  with members:
    - "reduced complexity index codes and improved upperbound on broadcast rate for neighboring interference problems"
    - "privacy in index coding k limited access schemes"
    - "speeding up distributed machine learning using codes"
    - "preserving privacy while broadcasting k limited access schemes"
    - "local partial clique covers for index coding"
    - "on a duality between recoverable distributed storage and index coding"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"

Connected through hyperedge HE-5 (induced by source paper "linear codes for broadcasting with noisy side information"):
  with members:
    - "uniprior index coding"
    - "index coding with erroneous side information"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "error correction for index coding with coded side information"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "blind index coding"
    - "local graph coloring and index coding"

Connected through hyperedge HE-6 (induced by source paper "linear programming approximations for index coding"):
  with members:
    - "the optimality of partial clique covering for index coding"
    - "approximate capacity of index coding for some classes of graphs"
    - "storage capacity of repairable networks"
    - "generalized interlinked cycle cover for index coding"
    - "a new index coding scheme exploiting interlinked cycles"
    - "graph theory versus minimum rank for index coding"
    - "local graph coloring and index coding"
    - "lexicographic products and the power of non linear network coding"

Connected through hyperedge HE-7 (induced by source paper "dynamic edge caching with popularity drifting"):
  with members:
    - "self sustaining caching stations toward cost effective 5g enabled vehicular networks"
    - "optimal geographic caching in cellular networks"
    - "fundamental limits of caching in wireless d2d networks"
    - "online coded caching"
    - "fundamental limits of caching"

Connected through hyperedge HE-8 (induced by source paper "the optimality of partial clique covering for index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "local partial clique covers for index coding"
    - "approximate capacity of index coding for some classes of graphs"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "structural properties of index coding capacity using fractional graph theory"
    - "storage capacity of repairable 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)