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 unified framework for constructing centralized coded caching schemes"
  Abstract: In caching system, we prefer to design a coded caching scheme with the rate $R$ and the packet number $F$ as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of $R$ and the realizing complexity increases with the increasing of $F$. In this paper, we first introduce a framework for constructing coded caching schemes, which can represent almost all of the previously known schemes. Based on this framework, we obtain a new scheme, which generalizes the schemes constructed by Shangguan et al. (IEEE Trans. Inf. Theory, 64, 5755-5766, 2018) and Yan et al. ( IEEE Commun. Lett., 22, 236-239, 2018) and has better performance compared with these two schemes since it has advantages on the user number, the coded gains and the flexible memory size. Then the relationships between a coded caching scheme and orthogonal array, covering array are derived respectively. Consequently a tight lower bound on the packet number $F$ is derived since the packet number of the schemes constructed by Yan et al. (IEEE Trans. Inf. Theory 63, 5821-5833, 2017) gets this lower bound. Finally based on orthogonal array, we construct a new scheme which has the same user number, memory size and transmission rate as the scheme constructed by Shangguan et al. (IEEE Trans. Inf. Theory, 64, 5755-5766, 2018) but has smaller packet number. Based on MDS codes, more classes of schemes are obtained using our framework, in which the distribution of the coded gain is equivalent to solving a linear system of equations.

Connected through hyperedge HE-1 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry"):
  with members:
    - "some new constructions of coded caching schemes with reduced subpacketization"
    - "a multi antenna coded caching scheme with linear subpacketization"
    - "decentralized coded caching without file splitting"
    - "subpacketization rate trade off in multi antenna coded caching"
    - "coded caching based on combinatorial designs"
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "coded caching via projective geometry a new low subpacketization scheme"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"

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)