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: "polar codes with higher order memory"
  Abstract: We introduce the design of a set of code sequences tC n : n ě 1,m ě 1u, with memory order m and code-length N “ Opφq, where φ P p1, 2s is the largest real root of the polynomial equation F pm, ρq “ ρm ρm 1 1 and φ is decreasing in m. tC n u is based on the channel polarization idea, where tC n u coincides with the polar codes presented by Arikan in [1] and can be encoded and decoded with complexity OpN logNq. tC n u achieves the symmetric capacity, IpW q, of an arbitrary binary-input, discrete-output memoryless channel, W , for any fixed m and its encoding and decoding complexities decrease with growing m. We obtain an achievable bound on the probability of block-decoding error, Pe, of tC n u and showed that Pe “ Op2 N β q is achievable for β ă φ 1 1`mpφ 1q .

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)