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 security of index coding with side information"
  Abstract: Security aspects of the Index Coding with Side Information (ICSI) problem are investigated. Building on the results of Bar-Yossef et al. (2006), the properties of linear index codes are further explored. The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network coding, is generalized to block security. It is shown that the linear index code based on a matrix $L$, whose column space code $C(L)$ has length $n$, minimum distance $d$ and dual distance $d^\perp$, is $(d-1-t)$-block secure (and hence also weakly secure) if the adversary knows in advance $t \leq d-2$ messages, and is completely insecure if the adversary knows in advance more than $n - d$ messages. Strong security is examined under the conditions that the adversary: (i) possesses $t$ messages in advance; (ii) eavesdrops at most $\mu$ transmissions; (iii) corrupts at most $\delta$ transmissions. We prove that for sufficiently large $q$, an optimal linear index code which is strongly secure against such an adversary has length $\kappa_q+\mu+2\delta$. Here $\kappa_q$ is a generalization of the min-rank over $F_q$ of the side information graph for the ICSI problem in its original formulation in the work of Bar- Yossef et al.

Connected through hyperedge HE-1 (induced by source paper "secure decentralized pliable index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "embedded index coding"
    - "private pliable index coding"
    - "on pliable index coding"
    - "improved lower bounds for pliable index coding using absent receivers"
    - "decentralized pliable index coding"
    - "optimal rate characterisation for pliable index coding using absent receivers"
    - "tight information theoretic converse results for some pliable index coding problems"

Connected through hyperedge HE-2 (induced by source paper "linear index coding with multiple senders and extension to a cellular network"):
  with members:
    - "cooperative multi sender index coding"
    - "index coding with erroneous side information"
    - "structural characteristics of two sender index coding"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "optimal weakly secure linear codes for some classes of the two sender index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "on the capacity region for secure index coding"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "coded caching with distributed storage"
    - "secure index coding existence and construction"

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 index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (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 index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-6 (induced by source paper "private pliable index coding"):
  with members:
    - "on pliable index coding"
    - "tight information theoretic converse results for some pliable index coding problems"
    - "private broadcasting an index coding approach"
    - "a polynomial time algorithm for pliable index coding"
    - "the capacity of private information retrieval"
    - "content type coding"
    - "topological interference management through index coding"

Connected through hyperedge HE-7 (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-8 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "coded caching with distributed storage"

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)