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 private information retrieval from colluding databases with eavesdroppers"
  Abstract: The problem of private information retrieval (PIR) is to retrieve one message out of $K$ messages replicated at $N$ databases, without revealing the identity of the desired message to the databases. We consider the problem of PIR with colluding servers and eavesdroppers, named T-EPIR. Specifically, any $T$ out of $N$ databases may collude, i.e. they may communicate their interactions with the user to guess the identity of the requested message. An eavesdropper is curious to know the database and can tap in on the incoming and outgoing transmissions of any $E$ databases. The databases share some common randomness unknown to the eavesdropper and the user, and use the common randomness to generate the answers, such that the eavesdropper can learn no information about the $K$ messages. Define $R^*$ as the optimal ratio of the number of the desired message information bits to the number of total downloaded bits, and $\rho^*$ to be the optimal ratio of the information bits of the shared common randomness to the information bits of the desired file. In our previous work, we found that when $E \geq T$, the optimal ratio that can be achieved equals $1-\frac{E}{N}$. In this work, we focus on the case when $E \leq T$. We derive an outer bound $R^* \leq (1-\frac{T}{N}) \frac{1-\frac{E}{N} \cdot (\frac{T}{N})^{K-1}}{1-(\frac{T}{N})^K}$. We also obtain a lower bound of $\rho^* \geq \frac{\frac{E}{N}(1-(\frac{T}{N})^K)}{(1-\frac{T}{N})(1-\frac{E}{N} \cdot (\frac{T}{N})^{K-1})}$. For the achievability, we propose a scheme which achieves the rate (inner bound) $R=\frac{1-\frac{T}{N}}{1-(\frac{T}{N})^K}-\frac{E}{KN}$. The amount of shared common randomness used in the achievable scheme is $\frac{\frac{E}{N}(1-(\frac{T}{N})^K)}{1-\frac{T}{N}-\frac{E}{KN}(1-(\frac{T}{N})^K)}$ times the file size. The gap between the derived inner and outer bounds vanishes as the number of messages $K$ tends to infinity.

Connected through hyperedge HE-1 (induced by source paper "latent variable private information retrieval"):
  with members:
    - "x secure t private information retrieval from mds coded storage with byzantine and unresponsive servers"
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "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"

Connected through hyperedge HE-2 (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-3 (induced by source paper "the capacity of multi round private information retrieval from byzantine databases"):
  with members:
    - "staircase pir universally robust private information retrieval"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "asymmetry helps improved private information retrieval protocols for distributed storage"
    - "private information retrieval from a cellular network with caching at the edge"
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "lifting private information retrieval from two to any number of messages"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"

Connected through hyperedge HE-4 (induced by source paper "the capacity of private information retrieval from decentralized uncoded caching databases"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "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"
    - "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"

Connected through hyperedge HE-5 (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-6 (induced by source paper "capacity achieving private information retrieval codes with optimal message size and upload cost"):
  with members:
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "linear network coding over rings part i scalar codes and commutative alphabets"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of cache aided private information retrieval"
    - "on the placement delivery array design for centralized coded caching scheme"

Connected through hyperedge HE-7 (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-8 (induced by source paper "the capacity of private information retrieval with eavesdroppers"):
  with members:
    - "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"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "the epsilon error capacity of symmetric pir with byzantine adversaries"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "multiround private information retrieval capacity and storage overhead"

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)