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: "bounds for batch codes with restricted query size"
  Abstract: We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for codes with locality. By employing additional ideas, we obtain further improvements, which are specific for batch codes.

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"
    - "nearly optimal constructions of pir and batch 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"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-2 (induced by source paper "batch and pir codes and their connections to locally repairable codes"):
  with members:
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "cooperative local repair in distributed storage"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"
    - "applications of polymatroid theory to distributed storage systems"
    - "repair locality with multiple erasure tolerance"

Connected through hyperedge HE-3 (induced by source paper "matroid theory and storage codes bounds and constructions"):
  with members:
    - "locally recoverable codes from algebraic curves and surfaces"
    - "improved singleton type bounds for locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "codes with hierarchical locality"
    - "optimal binary locally repairable codes via anticodes"
    - "pir with low storage overhead coding instead of replication"
    - "applications of polymatroid theory to distributed storage systems"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "asynchronous batch and pir codes from hypergraphs"):
  with members:
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "pir with low storage overhead coding instead of replication"
    - "linear batch codes"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-5 (induced by source paper "nearly optimal constructions of pir and batch codes"):
  with members:
    - "lengthening and extending binary private information retrieval codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "pir with low storage overhead coding instead of replication"
    - "locality and availability in distributed storage"
    - "linear batch codes"
    - "a family of optimal locally recoverable codes"
    - "optimal combinatorial batch codes based on block designs"

Connected through hyperedge HE-6 (induced by source paper "explicit constructions and bounds for batch codes with restricted size of reconstruction sets"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "pir with low storage overhead coding instead of replication"
    - "achieving arbitrary locality and availability in binary codes"
    - "linear batch codes"
    - "batch codes through dense graphs without short cycles"
    - "combinatorial batch codes a lower bound and optimal constructions"

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)