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 capacity of private information retrieval from coded colluding and adversarial servers"
  Abstract: In this work, we first prove the capacity of coded, linear symmetric private information retrieval (SPIR) in the presence of colluding, adversarial, and nonresponsive servers, giving a positive closure to the conjecture stated by Tajeddine et al. It is also shown that, further restricting to strongly-linear PIR schemes with linear interference cancellation, the so-called star product scheme proposed by Freij-Hollanti et al. is optimal. This observation enables to prove the capacity of strongly-linear (non-symmetric) PIR schemes for any number of files. Further, it also provides a positive proof in this practical special case for the conjectures stated in the asymptotic regime by Freij-Hollanti et al. and Tajeddine et al.

Connected through hyperedge HE-1 (induced by source paper "the capacity of single server weakly private information retrieval"):
  with members:
    - "x secure t private information retrieval from mds coded storage with byzantine and unresponsive servers"
    - "on the information leakage in private information retrieval systems"
    - "weakly private information retrieval"
    - "asymmetry helps improved private information retrieval protocols for distributed storage"
    - "lifting private information retrieval from two to any number of messages"
    - "an operational approach to information leakage"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "on the access complexity of pir schemes"

Connected through hyperedge HE-2 (induced by source paper "towards the capacity of private information retrieval from coded and colluding servers"):
  with members:
    - "lifting private information retrieval from two to any number of messages"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "on the capacity of single server multi message private information retrieval with side information"
    - "capacity of single server single message private information retrieval with coded side information"
    - "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"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "t private information retrieval schemes using transitive codes"

Connected through hyperedge HE-3 (induced by source paper "quantum private information retrieval from mds coded 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"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of symmetric private information retrieval"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval from coded databases"
    - "symmetric private information retrieval for mds coded distributed storage"

Connected through hyperedge HE-4 (induced by source paper "private streaming with convolutional codes"):
  with members:
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "t private information retrieval schemes using transitive codes"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"

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)