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: "an efficient coded multicasting scheme preserving the multiplicative caching gain"
  Abstract: Coded multicasting has been shown to be a promis- ing approach to significantly improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, achievable schemes proposed to date have been shown to achieve the proved order-optimal performance only in the asymptotic regime in which the number of packets per requested item goes to infinity. In this paper, we first extend the asymptotic analysis of the achievable scheme in [1], [2] to the case of heterogeneous cache sizes and demand distributions, providing the best known upper bound on the fundamental limiting performance when the number of packets goes to infinity. We then show that the scheme achieving this upper bound quickly loses its multiplicative caching gain for finite content packetization. To overcome this limitation, we design a novel polynomial-time algorithm based on random greedy graph- coloring that, while keeping the same finite content packetization, recovers a significant part of the multiplicative caching gain. Our results show that the order-optimal coded multicasting schemes proposed to date, while useful in quantifying the fundamental limiting performance, must be properly designed for practical regimes of finite packetization.

Connected through hyperedge HE-1 (induced by source paper "decentralized coded caching without file splitting"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "wireless caching technical misconceptions and business barriers"
    - "big data caching for networking moving from cloud to edge"
    - "finite length analysis of caching aided coded multicasting"
    - "effect of number of users in multi level coded caching"
    - "coded caching for delay sensitive content"

Connected through hyperedge HE-2 (induced by source paper "from centralized to decentralized coded caching"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "wireless caching technical misconceptions and business barriers"

Connected through hyperedge HE-3 (induced by source paper "spatially correlated content caching for device to device communications"):
  with members:
    - "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks"
    - "optimal geographic caching in cellular networks with linear content coding"
    - "fundamentals of modeling finite wireless networks using binomial point process"
    - "optimizing content caching to maximize the density of successful receptions in device to device networking"
    - "spatial multi lru caching for wireless networks with coverage overlaps"
    - "placing dynamic content in caches with small population"
    - "modeling and performance analysis of clustered device to device networks"
    - "optimizing the spatial content caching distribution for device to device communications"

Connected through hyperedge HE-4 (induced by source paper "speeding up future video distribution via channel aware caching aided coded multicast"):
  with members:
    - "joint cache channel coding over erasure broadcast channels"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"
    - "on the capacity of broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "distortion memory tradeoffs in cache aided wireless video delivery"
    - "a unified scheme for two receiver broadcast channels with receiver message side information"
    - "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "an efficient multiple groupcast coded multicasting scheme for finite fractional caching"

Connected through hyperedge HE-5 (induced by source paper "on caching with more users than files"):
  with members:
    - "on the optimality of uncoded cache placement"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "k users caching two files an improved achievable rate"
    - "caching and coded multicasting multiple groupcast index coding"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-6 (induced by source paper "caching aided coded multicasting with multiple random requests"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"
    - "an efficient multiple groupcast coded multicasting scheme for finite fractional caching"
    - "caching and coded multicasting multiple groupcast index coding"
    - "on the average performance of caching and coded multicasting with random demands"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-7 (induced by source paper "distortion memory tradeoffs in cache aided wireless video delivery"):
  with members:
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"
    - "an efficient multiple groupcast coded multicasting scheme for finite fractional caching"
    - "caching and coded multicasting multiple groupcast index coding"
    - "on the average performance of caching and coded multicasting with random demands"
    - "caching eliminates the wireless bottleneck in video aware wireless networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-8 (induced by source paper "coded caching for multi level popularity and access"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "wireless caching technical misconceptions and business barriers"
    - "caching in wireless multihop device to device networks"
    - "content caching and delivery over heterogeneous wireless networks"
    - "caching aided coded multicasting with multiple random requests"
    - "finite length analysis of caching aided coded multicasting"
    - "effect of number of users in multi level coded caching"
    - "improved lower bounds for coded caching"

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)