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: "a novel asymmetric coded placement in combination networks with end user caches"
  Abstract: The tradeoff between the user's memory size and the worst-case download time in the $(H,r,M,N)$ combination network is studied, where a central server communicates with $K$ users through $H$ immediate relays, and each user has local cache of size $M$ files and is connected to a different subset of $r$ relays. The main contribution of this paper is the design of a coded caching scheme with asymmetric coded placement by leveraging coordination among the relays, which was not exploited in past work. Mathematical analysis and numerical results show that the proposed schemes outperform existing schemes.

Connected through hyperedge HE-1 (induced by source paper "improved constructions of coded caching schemes for combination networks"):
  with members:
    - "caching in combination networks a novel delivery by leveraging the network topology"
    - "placement delivery array design for combination networks with edge caching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on combination networks with cache aided relays and users"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "combination networks with or without secrecy constraints the impact of caching relays"

Connected through hyperedge HE-2 (induced by source paper "placement delivery array design for combination networks with edge caching"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on combination networks with cache aided relays and users"
    - "low subpacketization schemes for coded caching"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "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)