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 information retrieval schemes for coded data with arbitrary collusion patterns"
  Abstract: In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid to the case of the database being encoded across several servers, subsets of which can collude to attempt to deduce the requested file. With the goal of studying the achievable PIR rates in realistic scenarios, we generalize results for coded data from the case of all subsets of servers of size $t$ colluding, to arbitrary subsets of the servers. We investigate the effectiveness of previous strategies in this new scenario, and present new results in the case where the servers are partitioned into disjoint colluding groups.

Connected through hyperedge HE-1 (induced by source paper "noisy private information retrieval on separability of channel coding and information retrieval"):
  with members:
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "the capacity of private information retrieval with private side information under storage constraints"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "the asymptotic capacity of private search"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"

Connected through hyperedge HE-2 (induced by source paper "the capacity of private information retrieval with private side information under storage constraints"):
  with members:
    - "lifting private information retrieval from two to any number of messages"
    - "the capacity of private information retrieval with eavesdroppers"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "the asymptotic capacity of private search"
    - "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 private information retrieval with partially known private side information"

Connected through hyperedge HE-3 (induced by source paper "private information retrieval through wiretap channel ii privacy meets security"):
  with members:
    - "building capacity achieving pir schemes with optimal sub packetization over small fields"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "private computation of systematically encoded data with colluding servers"
    - "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 private information retrieval with partially known private side information"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"

Connected through hyperedge HE-4 (induced by source paper "asymmetry hurts private information retrieval under asymmetric traffic constraints"):
  with members:
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "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 private information retrieval with partially known private side information"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"
    - "the capacity of private information retrieval from byzantine and colluding databases"

Connected through hyperedge HE-5 (induced by source paper "converse for multi server single message pir with side information"):
  with members:
    - "private information retrieval with private coded side information the multi server case"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "multi message private information retrieval with private side information"
    - "single server multi message private information retrieval with side information"
    - "on the capacity of single server multi message private information retrieval with side information"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"

Connected through hyperedge HE-6 (induced by source paper "single server multi message private information retrieval with side information"):
  with members:
    - "multi message private information retrieval with private side information"
    - "on the capacity of single server multi message private information retrieval with side information"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private information retrieval with side information"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"

Connected through hyperedge HE-7 (induced by source paper "capacity of single server single message private information retrieval with coded side information"):
  with members:
    - "multi message private information retrieval with private side information"
    - "single server multi message private information retrieval with side information"
    - "on the capacity of single server multi message private information retrieval with side information"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"
    - "cache aided private information retrieval with partially known uncoded prefetching fundamental limits"
    - "private information retrieval with side information"

Connected through hyperedge HE-8 (induced by source paper "private computation of systematically encoded data with colluding servers"):
  with members:
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private function retrieval"
    - "t private information retrieval schemes using transitive codes"
    - "the capacity of private computation"
    - "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"

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)