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: "lexicographic products and the power of non linear network coding"
  Abstract: We introduce a technique for establishing and amplifying gaps between parameters of network coding and index coding. The technique uses linear programs to establish separations between combinatorial and coding-theoretic parameters and applies hypergraph lexicographic products to amplify these separations. This entails combining the dual solutions of the lexicographic multiplicands and proving that they are a valid dual of the product. Our result is general enough to apply to a large family of linear programs. This blend of linear programs and lexicographic products gives a recipe for constructing hard instances in which the gap between combinatorial or coding-theoretic parameters is polynomially large. We find polynomial gaps in cases in which the largest previously known gaps were only small constant factors or entirely unknown. Most notably, we show a polynomial separation between linear and non-linear network coding rates. This involves exploiting a connection between matroids and index coding to establish a previously unknown separation between linear and non-linear index coding rates. We also construct index coding problems with a polynomial gap between the broadcast rate and the trivial lower bound for which no gap was previously known.

Connected through hyperedge HE-1 (induced by source paper "an index coding approach to caching with uncoded cache placement"):
  with members:
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "on the capacity for distributed index coding"
    - "coded caching for a large number of users"

Connected through hyperedge HE-2 (induced by source paper "privacy utility tradeoff in a guessing framework inspired by index coding"):
  with members:
    - "an operational approach to information leakage"
    - "from the information bottleneck to the privacy funnel"
    - "broadcasting with side information"

Connected through hyperedge HE-3 (induced by source paper "network coding gaps for completion times of multiple unicasts"):
  with members:
    - "flow cut gaps and face covers in planar graphs"
    - "new distributed algorithms in almost mixing time via transformations from parallel algorithms"
    - "faster distributed shortest path approximations via shortcuts"
    - "lower bounds for external memory integer sorting via network coding"
    - "low congestion shortcuts without embedding"
    - "cops robbers and threatening skeletons padded decomposition for minor free graphs"
    - "simple fast and deterministic gossip and rumor spreading"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-4 (induced by source paper "generalized alignment chain improved converse results for index coding"):
  with members:
    - "cooperative multi sender index coding"
    - "on the capacity region for secure index coding"
    - "capacity theorems for distributed index coding"
    - "on the capacity for distributed index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "a local perspective on the edge removal problem"):
  with members:
    - "a class of non linearly solvable networks"
    - "on the impact of a single edge on the network coding capacity"
    - "network coding capacity regions via entropy functions"
    - "network coding is zero error always possible"
    - "dualities between entropy functions and network codes"

Connected through hyperedge HE-6 (induced by source paper "characteristic dependent linear rank inequalities via complementary vector spaces"):
  with members:
    - "characteristic dependent linear rank inequalities with applications to network coding"
    - "achievable rate regions for network coding"
    - "graph theoretical constructions for graph entropy and network coding based communications"
    - "linear rank inequalities on five or more variables"
    - "broadcasting with side information"

Connected through hyperedge HE-7 (induced by source paper "how to find new characteristic dependent linear rank inequalities using binary matrices as a guide"):
  with members:
    - "characteristic dependent linear rank inequalities via complementary vector spaces"
    - "characteristic dependent linear rank inequalities with applications to network coding"
    - "achievable rate regions for network coding"
    - "linear rank inequalities on five or more variables"

Connected through hyperedge HE-8 (induced by source paper "capacity theorems for distributed index coding"):
  with members:
    - "cooperative multi sender index coding"
    - "on the capacity for distributed index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed 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"

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)