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: "characterizing the rate memory tradeoff in cache networks within a factor of 2"
  Abstract: We consider a basic caching system, where a single server with a database of $N$ files (e.g. movies) is connected to a set of $K$ users through a shared bottleneck link. Each user has a local cache memory with a size of $M$ files. The system operates in two phases: a placement phase, where each cache memory is populated up to its size from the database, and a following delivery phase, where each user requests a file from the database, and the server is responsible for delivering the requested contents. The objective is to design the two phases to minimize the load (peak or average) of the bottleneck link. We characterize the rate-memory tradeoff of the above caching system within a factor of $2.00884$ for both the peak rate and the average rate (under uniform file popularity), improving state of the arts that are within a factor of $4$ and $4.7$ respectively. Moreover, in a practically important case where the number of files ($N$) is large, we exactly characterize the tradeoff for systems with no more than $5$ users, and characterize the tradeoff within a factor of $2$ otherwise. To establish these results, we develop two new converse bounds that improve over the state of the art.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic"):
  with members:
    - "fundamental limits of wireless caching under uneven capacity channels"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "cache aided communications with multiple antennas at finite snr"
    - "centralized and decentralized cache aided interference management in heterogeneous parallel channels"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"

Connected through hyperedge HE-2 (induced by source paper "an index coding approach to caching with uncoded cache placement"):
  with members:
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "improved converses and gap results for coded caching"
    - "on the capacity for distributed index coding"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"

Connected through hyperedge HE-3 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval"):
  with members:
    - "codedprivateml a fast and privacy preserving framework for distributed machine learning"
    - "on coded caching with private demands"
    - "device to device private caching with trusted server"
    - "private and secure distributed matrix multiplication with flexible communication load"
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the fundamental limits of coded data shuffling for distributed learning systems"
    - "near optimal coded data shuffling for distributed learning"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under uneven capacity channels"):
  with members:
    - "subpacketization rate trade off in multi antenna coded caching"
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "a new design framework on device to device coded caching with optimal rate and significantly less subpacketizations"
    - "a low complexity cache aided multi antenna content delivery scheme"
    - "full coded caching gains for cache less users"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "centralized caching with unequal cache sizes"
    - "cache aided communications with multiple antennas at finite snr"

Connected through hyperedge HE-5 (induced by source paper "on coded caching with private demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "device to device secure coded caching"
    - "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"

Connected through hyperedge HE-6 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "speeding up distributed machine learning using codes"
    - "wireless mapreduce distributed computing"
    - "a pliable index coding approach to data shuffling"
    - "coded computation over heterogeneous clusters"
    - "coded caching in partially cooperative d2d communication networks"
    - "how to optimally allocate resources for coded distributed computing"
    - "minimizing latency for secure distributed computing"

Connected through hyperedge HE-7 (induced by source paper "fundamental limits of device to device private caching with trusted server"):
  with members:
    - "on coded caching with private demands"
    - "subpacketization in coded caching with demand privacy"
    - "embedded index coding"
    - "private pliable index coding"
    - "demand private coded caching and the exact trade off for n k 2"
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"

Connected through hyperedge HE-8 (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "fundamental limits of caching in heterogeneous networks with uncoded prefetching"
    - "novel decentralized coded caching through coded prefetching"
    - "improved converses and gap results for coded caching"
    - "uncoded placement optimization for coded delivery"
    - "a novel index coding scheme and its application to coded caching"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"

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)