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: "on the service capacity region of accessing erasure coded content"
  Abstract: Cloud storage systems generally add redundancy in storing content files such that $K$ files are replicated or erasure coded and stored on $N > K$ nodes. In addition to providing reliability against failures, the redundant copies can be used to serve a larger volume of content access requests. A request for one of the files can be either be sent to a systematic node, or one of the repair groups. In this paper, we seek to maximize the service capacity region, that is, the set of request arrival rates for the $K$ files that can be supported by a coded storage system. We explore two aspects of this problem: 1) for a given erasure code, how to optimally split incoming requests between systematic nodes and repair groups, and 2) choosing an underlying erasure code that maximizes the achievable service capacity region. In particular, we consider MDS and Simplex codes. Our analysis demonstrates that erasure coding makes the system more robust to skews in file popularity than simply replicating a file at multiple servers, and that coding and replication together can make the capacity region larger than either alone.

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 storage allocation for maximum service rate in distributed storage systems"

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 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"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "analyzing the download time of availability codes"):
  with members:
    - "straggler mitigation at scale"
    - "simplex queues for hot data download"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "provably delay efficient data retrieving in storage clouds"
    - "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-4 (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"
    - "optimal combinatorial batch codes based on block designs"
    - "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-5 (induced by source paper "simplex queues for hot data download"):
  with members:
    - "analyzing the download time of availability codes"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "xoring elephants novel erasure codes for big data"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-6 (induced by source paper "on distributed storage allocations of large files for maximum service rate"):
  with members:
    - "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"
    - "memory allocation in distributed storage 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)