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: "on the index coding problem and its relation to network coding and matroid theory"
  Abstract: The \emph{index coding} problem has recently attracted a significant attention from the research community due to its theoretical significance and applications in wireless ad-hoc networks. An instance of the index coding problem includes a sender that holds a set of information messages $X=\{x_1,...,x_k\}$ and a set of receivers $R$. Each receiver $\rho=(x,H)\in R$ needs to obtain a message $x\in X$ and has prior \emph{side information} comprising a subset $H$ of $X$. The sender uses a noiseless communication channel to broadcast encoding of messages in $X$ to all clients. The objective is to find an encoding scheme that minimizes the number of transmissions required to satisfy the receivers' demands with \emph{zero error}. #R##N#In this paper, we analyze the relation between the index coding problem, the more general network coding problem and the problem of finding a linear representation of a matroid. In particular, we show that any instance of the network coding and matroid representation problems can be efficiently reduced to an instance of the index coding problem. Our reduction implies that many important properties of the network coding and matroid representation problems carry over to the index coding problem. Specifically, we show that \emph{vector linear codes} outperform scalar linear codes and that vector linear codes are insufficient for achieving the optimum number of transmissions.

Connected through hyperedge HE-1 (induced by source paper "efficient 3d road map data exchange for intelligent vehicles in vehicular fog networks"):
  with members:
    - "fog computing a taxonomy survey and future directions"
    - "fog computing for sustainable smart cities a survey"
    - "a comprehensive survey on fog computing state of the art and research challenges"

Connected through hyperedge HE-2 (induced by source paper "cooperative multi sender index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "optimal finite length and asymptotic index codes for five or fewer receivers"
    - "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"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "structural properties of index coding capacity using fractional graph theory"

Connected through hyperedge HE-3 (induced by source paper "index codes with minimum locality for three receiver unicast problems"):
  with members:
    - "locality in index coding for large min rank"
    - "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"
    - "on locally decodable index codes"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "on a duality between recoverable distributed storage and index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"

Connected through hyperedge HE-4 (induced by source paper "locality in index coding for large min rank"):
  with members:
    - "privacy in index coding k limited access schemes"
    - "on locally decodable index codes"
    - "on a duality between recoverable distributed storage and index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"
    - "on linear index coding for random graphs"
    - "on the security of index coding with side information"

Connected through hyperedge HE-5 (induced by source paper "faster matroid intersection"):
  with members:
    - "a note on cunningham s algorithm for matroid intersection"
    - "a faster cutting plane method and its implications for combinatorial and convex optimization"
    - "online matroid intersection beating half for random arrival"
    - "approximate undirected maximum flows in o m polylog n time"
    - "an almost linear time algorithm for approximate max flow in undirected graphs and its multicommodity generalizations"
    - "navigating central path with electrical flows from flows to matchings and back"
    - "nearly maximum flows in nearly linear time"
    - "electrical flows laplacian systems and faster approximation of maximum flow in undirected graphs"

Connected through hyperedge HE-6 (induced by source paper "optimal rate characterisation for pliable index coding using absent receivers"):
  with members:
    - "an information theoretic converse for the consecutive complete s picod problem"
    - "secure index coding existence and construction"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "a polynomial time algorithm for pliable index coding"
    - "an equivalence between secure network and index coding"
    - "an equivalence between network coding and index coding"
    - "dynamic index coding for wireless broadcast networks"
    - "on the security of index coding with side information"

Connected through hyperedge HE-7 (induced by source paper "unicast uniprior index coding problems minrank and criticality"):
  with members:
    - "on the number of optimal index codes"
    - "on critical index coding problems"
    - "topological interference management through index coding"
    - "critical graphs in 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-8 (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"

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)