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: "effects of storage heterogeneity in distributed cache systems"
  Abstract: In this work, we focus on distributed cache systems with non-uniform storage capacity across caches. We compare the performance of our system with the performance of a system with the same cumulative storage distributed evenly across the caches. We characterize the extent to which the performance of the distributed cache system deteriorates due to storage heterogeneity. The key takeaway from this work is that the effects of heterogeneity in the storage capabilities depend heavily on the popularity profile of the contents being cached and delivered. We analytically show that compared to the case where contents popularity is comparable across contents, lopsided popularity profiles are more tolerant to heterogeneity in storage capabilities. We validate our theoretical results via simulations.

Connected through hyperedge HE-1 (induced by source paper "storage solutions for big data systems a qualitative study and comparison"):
  with members:
    - "a billion updates per second using 30 000 hierarchical in memory d4m databases"
    - "foundationdb record layer a multi tenant structured datastore"
    - "hadoop perfect file a fast access container for small files with direct in disc metadata access"
    - "decentralized search on decentralized web"
    - "database as a service current issues and its future"
    - "chain of trust can trusted hardware help scaling blockchains"
    - "towards scaling blockchain systems via sharding"
    - "a stitch in time saves nine sparql querying of property graphs using gremlin traversals"

Connected through hyperedge HE-2 (induced by source paper "bivariate cluster and suitability analysis of nosql solutions for different application areas"):
  with members:
    - "a billion updates per second using 30 000 hierarchical in memory d4m databases"
    - "foundationdb record layer a multi tenant structured datastore"
    - "database as a service current issues and its future"
    - "polypus a big data self deployable architecture for microblogging text extraction and real time sentiment analysis"
    - "a stitch in time saves nine sparql querying of property graphs using gremlin traversals"
    - "blocktag design and applications of a tagging system for blockchain analysis"
    - "g core a core for future graph query languages"
    - "an introduction to graph data management"

Connected through hyperedge HE-3 (induced by source paper "resource pooling in large scale content delivery systems"):
  with members:
    - "content replication in large distributed caches"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "coded caching for multi level popularity and access"
    - "serving content with unknown demand the high dimensional regime"
    - "multi level coded caching"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

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)