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: "asynchronous coded caching"
  Abstract: Coded caching is a technique that promises huge reductions in network traffic in content-delivery networks. However, the original formulation and several subsequent contributions in the area, assume that the file requests from the users are synchronized, i.e., they arrive at the server at the same time. In this work we formulate and study the coded caching problem when the file requests from the users arrive at different times. We assume that each user also has a prescribed deadline by which they want their request to be completed. In the offline case, we assume that the server knows the arrival times before starting transmission and in the online case, the user requests are revealed to the server over time. We present a linear programming formulation for the offline case that minimizes the overall rate subject to constraint that each user meets his/her deadline. While the online case is much harder, we introduce a novel heuristic for the online case and show that under certain conditions, with high probability the request of each user can be satisfied with her/his deadline. Our simulation results indicate that in the presence of mild asynchronism, much of the benefit of coded caching can still be leveraged.

Connected through hyperedge HE-1 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks"):
  with members:
    - "user preference learning based edge caching for fog radio access network"
    - "decentralized asynchronous coded caching in fog ran"
    - "proactive edge computing in latency constrained fog networks"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "an online secretary framework for fog network formation with minimal latency"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "caching and delivery via interference elimination"

Connected through hyperedge HE-2 (induced by source paper "audience retention rate aware caching and coded video delivery with asynchronous demands"):
  with members:
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "coded caching for a large number of users"
    - "wireless content caching for small cell and d2d networks"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "adapting caching to audience retention rate which video chunk to store"
    - "coded caching for delay sensitive content"

Connected through hyperedge HE-3 (induced by source paper "decentralized asynchronous coded caching in fog ran"):
  with members:
    - "order optimal rate of caching and coded multicasting with random demands"
    - "living on the edge the role of proactive caching in 5g wireless networks"
    - "multi level coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-4 (induced by source paper "coded caching schemes with reduced subpacketization from linear block codes"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "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 for networks with the resolvability property"
    - "sum networks from incidence structures construction and capacity analysis"
    - "capacity of sum networks for different message alphabets"
    - "finite length analysis of caching aided coded multicasting"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-5 (induced by source paper "improved lower bounds for coded caching"):
  with members:
    - "low subpacketization schemes for coded caching"
    - "coded caching with low subpacketization levels"
    - "critical database size for effective caching"
    - "fundamental limits of caching with secure delivery"
    - "a note on the fundamental limits of coded caching"
    - "coded caching for delay sensitive content"
    - "hierarchical coded caching"
    - "multi level 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)