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: "linear batch codes"
  Abstract: In an application, where a client wants to obtain many elements from a large database, it is often desirable to have some load balancing. Batch codes (introduced by Ishai et al. in STOC 2004) make it possible to do exactly that: the large database is divided between many servers, so that the client has to only make a small number of queries to every server to obtain sufficient information to reconstruct all desired elements. Other important parameters of the batch codes are total storage and the number of servers. Batch codes also have applications in cryptography (namely, in the construction of multi-query computationally-private information retrieval protocols). #R##N#In this work, we initiate the study of linear batch codes. These codes, in particular, are of potential use in distributed storage systems. We show that a generator matrix of a binary linear batch code is also a generator matrix of classical binary linear error-correcting code. This immediately yields that a variety of upper bounds, which were developed for error-correcting codes, are applicable also to binary linear batch codes. We also propose new methods to construct large linear batch codes from the smaller ones.

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"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"

Connected through hyperedge HE-2 (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"
    - "bounds for batch codes with restricted query size"

Connected through hyperedge HE-3 (induced by source paper "pir codes with short block length"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "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"

Connected through hyperedge HE-4 (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"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"

Connected through hyperedge HE-5 (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"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"

Connected through hyperedge HE-6 (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"
    - "bounds for batch codes with restricted query size"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-7 (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"
    - "bounds for batch codes with restricted query size"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "optimal combinatorial batch codes based on block designs"

Connected through hyperedge HE-8 (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"
    - "bounds for batch codes with restricted query size"
    - "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)