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: "three schemes for wireless coded broadcast to heterogeneous users"
  Abstract: We study and compare three coded schemes for single-server wireless broadcast of multiple description coded content to heterogeneous users. The users (sink nodes) demand different number of descriptions over links with different packet loss rates. The three coded schemes are based on the LT codes, growth codes, and randomized chunked codes. The schemes are compared on the basis of the total number of transmissions required to deliver the demands of all users, which we refer to as the server (source) delivery time. We design the degree distributions of LT codes by solving suitably defined linear optimization problems, and numerically characterize the achievable delivery time for different coding schemes. We find that including a systematic phase (uncoded transmission) is significantly beneficial for scenarios with low demands, and that coding is necessary for efficiently delivering high demands. Different demand and error rate scenarios may require very different coding schemes. Growth codes and chunked codes do not perform as well as optimized LT codes in the heterogeneous communication scenario.

Connected through hyperedge HE-1 (induced by source paper "wireless device to device caching networks basic principles and system performance"):
  with members:
    - "fundamental limits of caching in wireless d2d networks"
    - "quality aware coding and relaying for 60 ghz real time wireless video broadcasting"
    - "base station assisted device to device communications for high throughput wireless video networks"
    - "optimal throughput outage trade off in wireless one hop caching networks"
    - "fundamental limits of distributed caching in d2d wireless networks"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "wireless device to device communications with distributed caching"

Connected through hyperedge HE-2 (induced by source paper "constant delay and constant feedback moving window network coding for wireless multicast design and asymptotic analysis"):
  with members:
    - "scheduling of multicast and unicast services under limited feedback by using rateless codes"
    - "network control without csi using rateless codes for downlink cellular systems"
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "throughput of rateless codes over broadcast erasure channels"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "network coding meets tcp"
    - "effective delay control in online network coding"

Connected through hyperedge HE-3 (induced by source paper "the throughput outage tradeoff of wireless one hop caching networks"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "adaptive video streaming for wireless networks with multiple users and helpers"
    - "fundamental limits of caching in wireless d2d networks"
    - "base station assisted device to device communications for high throughput wireless video networks"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "wireless device to device communications with distributed caching"
    - "fundamental limits of caching"

Connected through hyperedge HE-4 (induced by source paper "linear network code for erasure broadcast channel with feedback complexity and algorithms"):
  with members:
    - "completion delay minimization for instantly decodable network codes"
    - "optimal deterministic polynomial time data exchange for omniscience"
    - "informed network coding for minimum decoding delay"
    - "online network coding for optimal throughput and delay the three receiver case"

Connected through hyperedge HE-5 (induced by source paper "femtocaching and device to device collaboration a new architecture for wireless video distribution"):
  with members:
    - "peer to peer multimedia sharing based on social norms"
    - "an adaptive multi channel p2p video on demand system using plug and play helpers"
    - "femtocell networks a survey"

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.NI(Networking and Internet Architecture)