human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "array codes for functional pir and batch codes"):
  Abstract: A functional PIR array code is a coding scheme which encodes some $s$ information bits into a $t\times m$ array such that every linear combination of the $s$ information bits has $k$ mutually disjoint recovering sets. Every recovering set consists of some of the array's columns while it is allowed to read at most $\ell$ encoded bits from every column in order to receive the requested linear combination of the information bits. Functional batch array codes impose a stronger property where every multiset request of $k$ linear combinations has $k$ mutually disjoint recovering sets. Given the values of $s, k, t, \ell$, the goal of this paper is to study the optimal value of the number of columns $m$ such that these codes exist. Several lower bounds are presented as well as explicit constructions for several of these parameters.

Includes members:
  Member "bounds on the length of functional pir and batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constructions of batch codes via finite geometry")
  Member "construction of parallel random i o codes using coset coding with hamming codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds on the length of functional pir and batch codes")
  Member "nearly optimal constructions of pir and batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lifted reed solomon codes with application to batch codes")
  Member "pir array codes with optimal virtual server rate":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "breaking the mds pir capacity barrier via joint storage coding")
  Member "on private information retrieval array codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the information leakage in private information retrieval systems")
  Member "pir array codes with optimal pir rate":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the role of coded side information in single server private information retrieval")
  Member "pir with low storage overhead coding instead of replication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "bounds for batch codes with restricted query size":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "batch and pir codes and their connections to locally repairable codes")

Question: Please tell me which class the source paper 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)