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: "secure symmetric private information retrieval from colluding databases with adversaries"
  Abstract: The problem of symmetric private information retrieval (SPIR) from replicated databases with colluding servers and adversaries is studied. Specifically, the database comprises $K$ files, which are replicatively stored among $N$ servers. A user wants to retrieve one file from the database by communicating with the $N$ servers, without revealing the identity of the desired file to any server. Furthermore, the user shall learn nothing about the other $K-1$ files. Any $T$ out of $N$ servers may collude, that is, they may communicate their interactions with the user to guess the identity of the requested file. An adversary in the system can tap in on or even try to corrupt the communication. Three types of adversaries are considered: a Byzantine adversary who can overwrite the transmission of any $B$ servers to the user; a passive eavesdropper who can tap in on the incoming and outgoing transmissions of any $E$ servers; and a combination of both -- an adversary who can tap in on a set of any $E$ nodes, and overwrite the transmission of a set of any $B$ nodes. The problems of SPIR with colluding servers and the three types of adversaries are named T-BSPIR, T-ESPIR and T-BESPIR respectively. The capacity of the problem is defined as the maximum number of information bits of the desired file retrieved per downloaded bit. We show that the information-theoretical capacity of T-BSPIR equals $1-\frac{2B+T}{N}$, if the servers share common randomness (unavailable at the user) with amount at least $\frac{2B+T}{N-2B-T}$ times the file size. Otherwise, the capacity equals zero. The capacity of T-ESPIR is proved to equal $1-\frac{\max(T,E)}{N}$, with common randomness at least $\frac{\max(T,E)}{N-\max(T,E)}$ times the file size. Finally, the capacity of T-BESPIR is proved to be $1-\frac{2B+\max(T,E)}{N}$, with common randomness at least $\frac{2B+\max(T,E)}{N-2B-\max(T,E)}$ times the file size.

Connected through hyperedge HE-1 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication"):
  with members:
    - "codedprivateml a fast and privacy preserving framework for distributed machine learning"
    - "x secure t private information retrieval from mds coded storage with byzantine and unresponsive servers"
    - "distributed and private coded matrix computation with flexible communication load"
    - "secure coded multi party computation for massive matrix operations"
    - "on the asymptotic capacity of x secure t private information retrieval with graph based replicated storage"
    - "private secure coded computation"
    - "coded matrix multiplication on a group based model"
    - "cross subspace alignment codes for coded distributed batch computation"

Connected through hyperedge HE-2 (induced by source paper "towards the capacity of private information retrieval from coded and colluding servers"):
  with members:
    - "on the capacity of private information retrieval from coded colluding and adversarial servers"
    - "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"
    - "t private information retrieval schemes using transitive codes"

Connected through hyperedge HE-3 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "on the storage cost of private information retrieval"
    - "on the information leakage in private information retrieval systems"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "improved storage for efficient private information retrieval"
    - "staircase pir universally robust private information retrieval"
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"

Connected through hyperedge HE-4 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases"):
  with members:
    - "staircase pir universally robust private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from a cellular network with caching at the edge"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "converse for multi server single message pir with side information"

Connected through hyperedge HE-5 (induced by source paper "private sequential function computation"):
  with members:
    - "private inner product retrieval for distributed machine learning"
    - "on the capacity of computation broadcast"
    - "private information retrieval with private coded side information the multi server case"
    - "on the asymptotic capacity of x secure t private information retrieval with graph based replicated storage"
    - "private polynomial computation for noncolluding coded databases"
    - "on the upload versus download cost for secure and private matrix multiplication"
    - "private proximity retrieval codes"
    - "achievable rate of private function retrieval from mds coded databases"

Connected through hyperedge HE-6 (induced by source paper "on the asymptotic capacity of x secure t private information retrieval with graph based replicated storage"):
  with members:
    - "achievable rate of private function retrieval from mds coded databases"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval with eavesdroppers"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "private information retrieval in graph based replication systems"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"

Connected through hyperedge HE-7 (induced by source paper "private information retrieval over random linear networks"):
  with members:
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "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 information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "t private information retrieval schemes using transitive codes"
    - "sub quadratic decoding of gabidulin codes"

Connected through hyperedge HE-8 (induced by source paper "on the capacity of private information retrieval from coded colluding and adversarial servers"):
  with members:
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "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"
    - "t private information retrieval schemes using transitive codes"
    - "linear symmetric private information retrieval for mds coded distributed storage 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)