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: "memory allocation in distributed storage networks"
  Abstract: We consider the problem of distributing a file in a network of storage nodes whose storage budget is limited but at least equals to the size file. We first generate $T$ encoded symbols (from the file) which are then distributed among the nodes. We investigate the optimal allocation of $T$ encoded packets to the storage nodes such that the probability of reconstructing the file by using any $r$ out of $n$ nodes is maximized. Since the optimal allocation of encoded packets is difficult to find in general, we find another objective function which well approximates the original problem and yet is easier to optimize. We find the optimal symmetric allocation for all coding redundancy constraints using the equivalent approximate problem. We also investigate the optimal allocation in random graphs. Finally, we provide simulations to verify the theoretical results.

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 "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"):
  with members:
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "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"
    - "many to many matching games for proactive social caching in wireless small cell networks"
    - "distributed storage allocations"

Connected through hyperedge HE-3 (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"
    - "optimal combinatorial batch codes based on block designs"
    - "interactive analytical processing in big data systems a cross industry study of mapreduce workloads"
    - "balanced allocation on graphs"

Connected through hyperedge HE-4 (induced by source paper "on distributed storage allocations of large files for maximum service rate"):
  with members:
    - "on the service capacity region of accessing erasure coded content"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "distributed storage allocations"
    - "coding for fast content download"
    - "distributed storage allocations for optimal delay"

Connected through hyperedge HE-5 (induced by source paper "storage allocation for multi class distributed data storage systems"):
  with members:
    - "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "on distributed storage allocations for memory limited systems"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "distributed storage allocations"
    - "allocations for heterogenous distributed storage"
    - "minimization of storage cost in distributed storage systems with repair consideration"
    - "distributed storage allocations for optimal delay"

Connected through hyperedge HE-6 (induced by source paper "on storage allocation for maximum service rate in distributed storage systems"):
  with members:
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "distributed storage allocations"
    - "coding for fast content download"
    - "distributed storage allocations for optimal delay"

Connected through hyperedge HE-7 (induced by source paper "a polynomial time approximation scheme for fault tolerant distributed storage"):
  with members:
    - "stochastic combinatorial optimization via poisson approximation"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "maximizing expected utility for stochastic combinatorial optimization problems"
    - "symmetric allocations for distributed storage"
    - "improved approximation of linear threshold functions"
    - "bounded independence fools halfspaces"
    - "pseudorandom generators for polynomial threshold functions"

Connected through hyperedge HE-8 (induced by source paper "distributed storage allocations"):
  with members:
    - "symmetric allocations for distributed storage"
    - "fountain codes based distributed storage algorithms for large scale wireless sensor networks"

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)