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: "constructions of coded caching schemes with flexible memory size"
  Abstract: Coded caching scheme recently has become quite popular in the wireless network due to its effectively reducing the transmission amount (denote such an amount by $R$) during peak traffic times. However to realize a coded caching scheme, each file must be divided into $F$ packets which usually increases the computation complexity of a coded caching scheme. So we prefer to construct a caching scheme that decreases the order of $F$ for practical implementations. #R##N#In this paper, we construct four classes of new schemes where two classes can significantly reduce the value of $F$ by increasing a little $R$ comparing with the well known scheme proposed by Maddah-Ali and Niesen, and $F$ in the other two classes grows sub-exponentially with $K$ by sacrificing more $R$. It is worth noting that a tradeoff between $R$ and $F$, which is a hot topic in the field of caching scheme, is proposed by our constructions. In addition, our constructions include all the results constructed by Yan et al., (IEEE Trans. Inf. Theory 63, 5821-5833, 2017) and some main results obtained by Shangguan et al., (arXiv preprint arXiv:1608.03989v1) as the special cases.

Connected through hyperedge HE-1 (induced by source paper "some new constructions of coded caching schemes with reduced subpacketization"):
  with members:
    - "coded caching based on combinatorial designs"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching via line graphs of bipartite graphs"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "caching and delivery via interference elimination"

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)