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: "raptor codes based distributed storage algorithms for wireless sensor networks"
  Abstract: We consider a distributed storage problem in a large-scale wireless sensor network with n nodes among which k acquire (sense) independent data. The goal is to disseminate the acquired information throughout the network so that each of the n sensors stores one possibly coded packet and the original k data packets can be recovered later in a computationally simple way from any (1 + isin)k of nodes for some small isin Gt 0. We propose two Raptor codes based distributed storage algorithms for solving this problem. In the first algorithm, all the sensors have the knowledge of n and k. In the second one, we assume that no sensor has such global information.

Connected through hyperedge HE-1 (induced by source paper "capacity bounds for distributed storage"):
  with members:
    - "maximally recoverable codes for grid like topologies"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "repairable fountain codes"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (induced by source paper "on the latency of erasure coded cloud storage systems"):
  with members:
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "when do redundant requests reduce latency"
    - "tofec achieving optimal throughput delay trade off of cloud storage using erasure codes"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "explicit codes minimizing repair bandwidth for distributed storage"

Connected through hyperedge HE-3 (induced by source paper "distributed raptor coding for erasure channels partially and fully coded cooperation"):
  with members:
    - "distributed rateless codes with uep property"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-4 (induced by source paper "data dissemination and collection algorithms for collaborative sensor networks using dynamic cluster heads"):
  with members:
    - "a distributed data collection algorithm for wireless sensor networks with persistent storage nodes"
    - "doped fountain coding for minimum delay data collection in circular networks"
    - "decentralized coding algorithms for distributed storage in wireless sensor networks"

Connected through hyperedge HE-5 (induced by source paper "a distributed data collection algorithm for wireless sensor networks with persistent storage nodes"):
  with members:
    - "decentralized coding algorithms for distributed storage in wireless sensor networks"
    - "fountain codes based distributed storage algorithms for large scale wireless sensor networks"
    - "decentralized erasure codes for distributed networked storage"

Connected through hyperedge HE-6 (induced by source paper "distributed flooding based storage algorithms for large scale sensor networks"):
  with members:
    - "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)