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: "a storage efficient and robust private information retrieval scheme allowing few servers"
  Abstract: Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000 [11], it is well-known that information theoretically secure private information retrieval schemes can be built using locally decodable codes [15]. In this paper, we construct a Byzantine robust PIR scheme using the multiplicity codes introduced by Kopparty et al. [12]. Our main contributions are on the one hand to avoid full replication of the database on each server; this significantly reduces the global redundancy. On the other hand, to have a much lower locality in the PIR context than in the LDC context. This shows that there exists two different notions: LDC-locality and PIR-locality. This is made possible by exploiting geometric properties of multiplicity codes.

Connected through hyperedge HE-1 (induced by source paper "weighted lifted codes local correctabilities and application to robust private information retrieval"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"
    - "private information retrieval from coded databases with colluding servers"
    - "high rate locally correctable codes via lifting"
    - "new affine invariant codes from lifting"
    - "weighted reed muller codes revisited"

Connected through hyperedge HE-2 (induced by source paper "batch and pir codes and their connections to locally repairable codes"):
  with members:
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "cooperative local repair in distributed storage"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"

Connected through hyperedge HE-3 (induced by source paper "private information retrieval from mds coded data in distributed storage systems"):
  with members:
    - "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"
    - "robust private information retrieval on coded data"
    - "pir array codes with optimal virtual server rate"
    - "blind interference alignment for private information retrieval"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"

Connected through hyperedge HE-4 (induced by source paper "robust private information retrieval from coded systems with byzantine and colluding servers"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "robust private information retrieval on coded data"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "fast hermite interpolation and evaluation over finite fields of characteristic two"):
  with members:
    - "fast transforms over finite fields of characteristic two"
    - "faster integer and polynomial multiplication using cyclotomic coefficient rings"
    - "fast systematic encoding of multiplicity codes"
    - "faster multiplication for long binary polynomials"
    - "some remarks on multiplicity codes"
    - "novel polynomial basis and its application to reed solomon erasure codes"
    - "faster polynomial multiplication over finite fields"
    - "an in place truncated fourier transform and applications to polynomial multiplication"

Connected through hyperedge HE-6 (induced by source paper "multi file private information retrieval from mds coded databases with colluding servers"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for 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"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

Connected through hyperedge HE-7 (induced by source paper "a general private information retrieval scheme for mds coded databases with colluding servers"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "nearly optimal constructions of pir and batch codes"
    - "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"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "pir array codes with optimal virtual server rate"
    - "multiround private information retrieval capacity and storage overhead"

Connected through hyperedge HE-8 (induced by source paper "robust private information retrieval on coded data"):
  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"
    - "private information retrieval for coded storage"
    - "2 server pir with sub polynomial communication"

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.CR(Cryptography and Security)