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: "optimal combinatorial batch codes based on block designs"
  Abstract: Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an $n$-element data set on $m$ servers in such a way that any batch of $k$ data items can be retrieved by reading at most one (or more generally, $t$) items from each server, while keeping the total storage over $m$ servers equal to $N$. This paper considers a class of batch codes (for $t=1$), called combinatorial batch codes (CBC), where each server stores a subset of a database. A CBC is called optimal if the total storage $N$ is minimal for given $n,m$, and $k$. A $c$-uniform CBC is a combinatorial batch code where each item is stored in exactly $c$ servers. A $c$-uniform CBC is called optimal if its parameter $n$ has maximum value for given $m$ and $k$. Optimal $c$-uniform CBCs have been known only for $c\in \{2,k-1,k-2\}$. #R##N#In this paper we present new constructions of optimal CBCs in both the uniform and general settings, for values of the parameters where tight bounds have not been established previously. In the uniform setting, we provide constructions of two new families of optimal uniform codes with $c\sim \sqrt{k}$. Our constructions are based on affine planes and transversal designs.

Connected through hyperedge HE-1 (induced by source paper "constructions of batch codes via finite geometry"):
  with members:
    - "bounds on the length of functional pir and batch codes"
    - "nearly optimal constructions of 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"

Connected through hyperedge HE-2 (induced by source paper "load balancing performance in distributed storage with regular balanced redundancy"):
  with members:
    - "redundancy scheduling in systems with bi modal job service time distribution"
    - "service rate region of content access from erasure coded storage"
    - "on the service capacity region of accessing erasure coded content"
    - "interactive analytical processing in big data systems a cross industry study of mapreduce workloads"
    - "memory allocation in distributed storage networks"
    - "balanced allocation on graphs"

Connected through hyperedge HE-3 (induced by source paper "access balancing in storage systems by labeling partial steiner systems"):
  with members:
    - "optimal fractional repetition codes based on graphs and designs"
    - "fractional repetition codes for repair in distributed storage systems"

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 "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"
    - "linear batch codes"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "multiset combinatorial batch codes"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "fractional repetition and erasure batch codes"
    - "locality and availability in distributed storage"
    - "on an extremal hypergraph problem related to combinatorial batch codes"
    - "combinatorial batch codes a lower bound and optimal constructions"

Connected through hyperedge HE-7 (induced by source paper "batch codes from hamming and reed m uller codes"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "explicit constructions and bounds for batch codes with restricted size of reconstruction sets"
    - "binary linear locally repairable codes"
    - "combinatorial batch codes a lower bound and optimal constructions"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-8 (induced by source paper "bounds for batch codes with restricted query size"):
  with members:
    - "cooperative local repair in distributed storage"
    - "pir with low storage overhead coding instead of replication"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "linear batch codes"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "batch codes through dense graphs without short cycles"

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.DM(Discrete Mathematics)