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: "broadcast repair for wireless distributed storage systems"
  Abstract: In wireless distributed storage systems, storage nodes are connected by wireless channels, which are broadcast in nature. This paper exploits this unique feature to design an efficient repair mechanism, called broadcast repair, for wireless distributed storage systems with multiple-node failures. Since wireless channels are typically bandwidth limited, we advocate a new measure on repair performance called repair-transmission bandwidth, which measures the average number of packets transmitted by helper nodes per failed node. The fundamental tradeoff between storage amount and repair-transmission bandwidth is obtained. It is shown that broadcast repair outperforms cooperative repair, which is the basic repair method for wired distributed storage systems with multiple-node failures, in terms of storage efficiency and repair-transmission bandwidth, thus yielding a better tradeoff curve.

Connected through hyperedge HE-1 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes"):
  with members:
    - "functional repair codes a view from projective geometry"
    - "centralized multi node repair regenerating codes"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "characterizations and construction methods for linear functional repair storage codes"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"
    - "cooperative regenerating codes"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-2 (induced by source paper "storage repair bandwidth trade off for wireless caching with partial failure and broadcast repair"):
  with members:
    - "coded caching in a multi server system with random topology"
    - "mobility and popularity aware coded small cell caching"
    - "wireless content caching for small cell and d2d networks"
    - "femtocaching and device to device collaboration a new architecture for wireless video distribution"
    - "cooperative regenerating codes"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-3 (induced by source paper "centralized multi node repair regenerating codes"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "optimal mds codes for cooperative repair"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "repairing reed solomon codes with two erasures"
    - "repairing multiple failures for scalar mds codes"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-4 (induced by source paper "capacity of wireless distributed storage systems with broadcast repair"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "centralized multi node repair regenerating codes"
    - "wireless device to device caching networks basic principles and system performance"
    - "distributed storage in mobile wireless networks with device to device communication"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "space time storage codes for wireless distributed storage systems"
    - "network coding for energy efficient distributed storage system in wireless sensor networks"

Connected through hyperedge HE-5 (induced by source paper "centralized repair of multiple node failures with applications to communication efficient secret sharing"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "security concerns in minimum storage cooperative regenerating codes"
    - "optimal rebuilding of multiple erasures in mds codes"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "cooperative local repair in distributed storage"

Connected through hyperedge HE-6 (induced by source paper "optimal rebuilding of multiple erasures in mds codes"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"
    - "constructions of high rate msr codes over small fields"

Connected through hyperedge HE-7 (induced by source paper "repairing reed solomon codes with multiple erasures"):
  with members:
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "cooperative repair of multiple node failures in distributed storage systems"
    - "repairing reed solomon codes"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact scalar minimum storage coordinated regenerating codes"
    - "locally repairable codes"
    - "cooperative regenerating codes"
    - "mds array codes with optimal rebuilding"

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)