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: "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
  Abstract: We consider constructing capacity-achieving linear codes with minimum message size for private information retrieval (PIR) from $N$ non-colluding databases, where each message is coded using maximum distance separable (MDS) codes, such that it can be recovered from accessing the contents of any $T$ databases. It is shown that the minimum message size (sometimes also referred to as the sub-packetization factor) is significantly, in fact exponentially, lower than previously believed. More precisely, when $K>T/\textbf{gcd}(N,T)$ where $K$ is the total number of messages in the system and $\textbf{gcd}(\cdot,\cdot)$ means the greatest common divisor, we establish, by providing both novel code constructions and a matching converse, the minimum message size as $\textbf{lcm}(N-T,T)$, where $\textbf{lcm}(\cdot,\cdot)$ means the least common multiple. On the other hand, when $K$ is small, we show that it is in fact possible to design codes with a message size even smaller than $\textbf{lcm}(N-T,T)$.

Connected through hyperedge HE-1 (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"
    - "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"
    - "private information retrieval from a cellular network with caching at the edge"

Connected through hyperedge HE-2 (induced by source paper "on the information leakage in private information retrieval systems"):
  with members:
    - "weakly private information retrieval"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval with eavesdroppers"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "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-3 (induced by source paper "private information retrieval from mds array codes with near optimal repair bandwidth"):
  with members:
    - "a new capacity achieving private information retrieval scheme with almost optimal file length for coded servers"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "on sub packetization and access number of capacity achieving pir schemes for mds coded non colluding servers"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "t private information retrieval schemes using transitive codes"

Connected through hyperedge HE-4 (induced by source paper "on the storage cost of private information retrieval"):
  with members:
    - "how to use undiscovered information inequalities direct applications of the copy lemma"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"
    - "improved storage for efficient private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "on the capacity of locally decodable codes"
    - "the capacity of private information retrieval with partially known private side information"

Connected through hyperedge HE-5 (induced by source paper "breaking the mds pir capacity barrier via joint storage coding"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "an optimal iterative placement algorithm for pir from heterogeneous storage constrained databases"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on the fundamental limit of private information retrieval for coded distributed storage"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "on sub packetization and access number of capacity achieving pir schemes for mds coded non colluding servers"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

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