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: "private broadcasting an index coding approach"
  Abstract: Using a broadcast channel to transmit clients' data requests may impose privacy risks. In this paper, we tackle such privacy concerns in the index coding framework. We show how a curious client can infer some information about the requests and side information of other clients by learning the encoding matrix used by the server. We propose an information-theoretic metric to measure the level of privacy and show how encoding matrices can be designed to achieve specific privacy guarantees. We then consider a special scenario for which we design a transmission scheme and derive the achieved levels of privacy in closed-form. We also derive upper bounds and we compare them to the levels of privacy achieved by our scheme, highlighting that an inherent trade-off exists between protecting privacy of the request and of the side information of the clients.

Connected through hyperedge HE-1 (induced by source paper "subpacketization in coded caching with demand privacy"):
  with members:
    - "on coded caching with private demands"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "centralized coded caching schemes a hypergraph theoretical approach"

Connected through hyperedge HE-2 (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"
    - "a polynomial time algorithm for pliable index coding"
    - "the capacity of private information retrieval"
    - "content type coding"
    - "topological interference management through index coding"
    - "on the security of index coding with side information"

Connected through hyperedge HE-3 (induced by source paper "on the capacity region for secure index coding"):
  with members:
    - "privacy in index coding improved bounds and coding schemes"
    - "on the capacity for distributed index coding"
    - "secure index coding existence and construction"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "on the capacity region for index coding"
    - "an equivalence between network coding and index coding"
    - "achievability proof via output statistics of random binning"
    - "on the security of index coding with side information"

Connected through hyperedge HE-4 (induced by source paper "privacy in index coding improved bounds and coding schemes"):
  with members:
    - "preserving privacy while broadcasting k limited access schemes"
    - "the capacity of private information retrieval from coded databases"
    - "the oblivious transfer capacity of the wiretapped binary erasure channel"
    - "on the security of index coding with side information"

Connected through hyperedge HE-5 (induced by source paper "the capacity of private information retrieval with partially known private side information"):
  with members:
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "multi file private information retrieval from mds coded databases with colluding servers"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "preserving privacy while broadcasting k limited access schemes"
    - "the capacity of cache aided private information retrieval"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

Connected through hyperedge HE-6 (induced by source paper "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "multi file private information retrieval from mds coded databases with colluding servers"
    - "the capacity of cache aided private information retrieval"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "private information retrieval schemes for coded data with arbitrary collusion patterns"

Connected through hyperedge HE-7 (induced by source paper "private information retrieval with side information"):
  with members:
    - "pir array codes with optimal virtual server rate"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"
    - "blind index coding"

Connected through hyperedge HE-8 (induced by source paper "preserving privacy while broadcasting k limited access schemes"):
  with members:
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval from coded databases"
    - "index coding and network coding via rank minimization"
    - "the oblivious transfer capacity of the wiretapped binary erasure channel"
    - "a matrix completion approach to linear index coding problem"
    - "on the security of index coding with side information"

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)