human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "preserving privacy while broadcasting k limited access schemes"):
  Abstract: Index coding employs coding across clients within the same broadcast domain. This typically assumes that all clients learn the coding matrix so that they can decode and retrieve their requested data. However, learning the coding matrix can pose privacy concerns: it may enable clients to infer information about the requests and side information of other clients [1]. In this paper, we formalize the intuition that the achieved privacy can increase by decreasing the number of rows of the coding matrix that a client learns. Based on this, we propose the use of k-limited-access schemes: given an index coding scheme that employs T transmissions, we create a fc-limited-access scheme with Tk ≤ T transmissions, and with the property that each client learns at most k rows of the coding matrix to decode its message. We derive upper and lower bounds on T k  for all values of k, and develop deterministic designs for these schemes for which Tk has an order-optimal exponent for some regimes.

Includes members:
  Member "private broadcasting an index coding approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "subpacketization in coded caching with demand privacy")
  Member "private information retrieval from coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval from coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "index coding and network coding via rank minimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subspace aware index codes")
  Member "the oblivious transfer capacity of the wiretapped binary erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy in index coding improved bounds and coding schemes")
  Member "a matrix completion approach to linear index coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a field size independent code construction for groupcast index coding problems")
  Member "on the security of index coding with side information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure decentralized pliable index coding")

Question: Please tell me which class the source paper 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)