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: "mds coded distributed storage for low delay wireless content delivery"
  Abstract: We address the use of maximum distance separable (MDS) codes for distributed storage (DS) to enable efficient content delivery in wireless networks. Content is stored in a number of the mobile devices and can be retrieved from them using device-to-device communication or, alternatively, from the base station (BS). We derive an analytical expression for the download delay in the hypothesis that the reliability state of the network is periodically restored. Our analysis shows that MDS-coded DS can dramatically reduce the download time with respect to the reference scenario where content is always downloaded from the BS.

Connected through hyperedge HE-1 (induced by source paper "private information retrieval from a cellular network with caching at the edge"):
  with members:
    - "converse for multi server single message pir with side information"
    - "the capacity of private information retrieval from decentralized uncoded caching databases"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "cache aided private information retrieval with partially known uncoded prefetching fundamental limits"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

Connected through hyperedge HE-2 (induced by source paper "caching at the edge with lt codes"):
  with members:
    - "caching at the edge with fountain codes"
    - "inactivation decoding of lt and raptor codes analysis and code design"
    - "mobility and popularity aware coded small cell caching"
    - "optimizing mds codes for caching at the edge"

Connected through hyperedge HE-3 (induced by source paper "caching at the edge with fountain codes"):
  with members:
    - "mobility and popularity aware coded small cell caching"
    - "optimizing mds codes for caching at the edge"
    - "cache aided interference channels"

Connected through hyperedge HE-4 (induced by source paper "optimizing mds coded caching in wireless networks with device to device communication"):
  with members:
    - "mds coded distributed caching for low delay wireless content delivery"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "wireless device to device caching networks basic principles and system performance"
    - "mobility aware caching in d2d networks"
    - "distributed storage in mobile wireless networks with device to device communication"
    - "optimization and analysis of probabilistic caching in n tier heterogeneous networks"
    - "optimizing mds codes for caching at the edge"
    - "repair scheduling in wireless distributed storage with d2d communication"

Connected through hyperedge HE-5 (induced by source paper "mds coded distributed caching for low delay wireless content delivery"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "distributed storage in mobile wireless networks with device to device communication"
    - "optimizing mds codes for caching at the edge"
    - "repair scheduling in wireless distributed storage with d2d communication"
    - "a survey on device to device communication in cellular networks"
    - "fundamental limits of caching in wireless d2d networks"
    - "base station assisted device to device communications for high throughput wireless video networks"
    - "device to device data storage for mobile cellular systems"

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)