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: "nearly optimal constructions of pir and batch codes"
  Abstract: In this work we study two families of codes with availability, namely private information retrieval (PIR) codes and batch codes. While the former requires that every information symbol has $k$ mutually disjoint recovering sets, the latter asks this property for every multiset request of $k$ information symbols. The main problem under this paradigm is to minimize the number of redundancy symbols. We denote this value by $r_P(n,k), r_B(n,k)$, for PIR, batch codes, respectively, where $n$ is the number of information symbols. Previous results showed that for any constant $k$, $r_P(n,k) = \Theta(\sqrt{n})$ and $r_B(n,k)=O(\sqrt{n}\log(n)$. In this work we study the asymptotic behavior of these codes for non-constant $k$ and specifically for $k=\Theta(n^\epsilon)$. We also study the largest value of $k$ such that the rate of the codes approaches 1, and show that for all $\epsilon<1$, $r_P(n,n^\epsilon) = o(n)$, while for batch codes, this property holds for all $\epsilon< 0.5$.

Connected through hyperedge HE-1 (induced by source paper "array codes for functional pir and batch codes"):
  with members:
    - "bounds on the length of functional pir and batch codes"
    - "construction of parallel random i o codes using coset coding with hamming codes"
    - "pir array codes with optimal virtual server rate"
    - "on private information retrieval array codes"
    - "pir array codes with optimal pir rate"
    - "pir with low storage overhead coding instead of replication"
    - "bounds for batch codes with restricted query size"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-2 (induced by source paper "lifted reed solomon codes with application to batch codes"):
  with members:
    - "lifted multiplicity codes and the disjoint repair group property"
    - "constructions of batch codes via finite geometry"
    - "batch and pir codes and their connections to locally repairable codes"
    - "lower bound on the redundancy of pir codes"
    - "high rate locally correctable codes via lifting"
    - "new affine invariant codes from lifting"

Connected through hyperedge HE-3 (induced by source paper "lifted multiplicity codes and the disjoint repair group property"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-4 (induced by source paper "constructions of batch codes via finite geometry"):
  with members:
    - "bounds on the length of functional pir and batch codes"
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "pir with low storage overhead coding instead of replication"
    - "achieving arbitrary locality and availability in binary codes"
    - "locality and availability in distributed storage"
    - "optimal combinatorial batch codes based on block designs"

Connected through hyperedge HE-5 (induced by source paper "bounds on the length of functional pir and batch codes"):
  with members:
    - "construction of parallel random i o codes using coset coding with hamming codes"
    - "private information retrieval for coded storage"

Connected through hyperedge HE-6 (induced by source paper "load balanced fractional repetition codes"):
  with members:
    - "fractional repetition and erasure batch codes"
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "codes with locality for two erasures"
    - "batch codes through dense graphs without short cycles"
    - "fractional repetition codes with flexible repair from combinatorial designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "cooperative regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "pir array codes with optimal virtual server rate"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"

Connected through hyperedge HE-8 (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"
    - "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"
    - "on private information retrieval array codes"

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)