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: "batch and pir codes and their connections to locally repairable codes"
  Abstract: Two related families of codes are studied: batch codes and codes for private information retrieval. These two families can be viewed as natural generalizations of locally repairable codes, which were extensively studied in the context of coding for fault tolerance in distributed data storage systems. Bounds on the parameters of the codes, as well as basic constructions, are presented. Connections between different code families are discussed.

Connected through hyperedge HE-1 (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"):
  with members:
    - "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "analyzing the download time of availability codes"
    - "service rate region of content access from erasure coded storage"
    - "simplex queues for hot data download"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"
    - "on storage allocation for maximum service rate in distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "pir codes with short block length"):
  with members:
    - "determining the generalized hamming weight hierarchy of the binary projective reed muller code"
    - "lengthening and extending binary private information retrieval codes"
    - "t private information retrieval schemes using transitive codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "pir with low storage overhead coding instead of replication"
    - "achieving arbitrary locality and availability in binary codes"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-3 (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"
    - "nearly optimal constructions of pir and batch 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-4 (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"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "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-5 (induced by source paper "lifted multiplicity codes and the disjoint repair group property"):
  with members:
    - "nearly optimal constructions of pir and batch 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-6 (induced by source paper "lifted multiplicity codes"):
  with members:
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "some remarks on multiplicity codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-7 (induced by source paper "locality via partially lifted codes"):
  with members:
    - "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"
    - "repairable fountain codes"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "batch codes through dense graphs without short cycles"

Connected through hyperedge HE-8 (induced by source paper "explicit constructions and bounds for batch codes with restricted size of reconstruction sets"):
  with members:
    - "pir with low storage overhead coding instead of replication"
    - "achieving arbitrary locality and availability in binary codes"
    - "bounds for batch codes with restricted query size"
    - "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)