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: "quasi linear codes application to point to point and multi terminal source coding"
  Abstract: A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under addition. We argue that these codes provide gains in terms of achievable Rate-Distortions (RD) in different multi-terminal source coding problems. We derive the necessary covering bounds for analyzing the performance of QLC's. We then consider the Multiple-Descriptions (MD) problem, and prove through an example that the application of QLC's gives an improved achievable RD region for this problem. Finally, we derive an inner bound to the achievable RD region for the general MD problem which strictly contains all of the previous known achievable regions.

Connected through hyperedge HE-1 (induced by source paper "structured mappings and conferencing common information for multiple access channels"):
  with members:
    - "a new achievable rate region for multiple access channel with states"
    - "distributed simulation of continuous random variables"
    - "exact common information"
    - "on interference networks over finite fields"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"

Connected through hyperedge HE-2 (induced by source paper "a new achievable rate region for multiple access channel with states"):
  with members:
    - "how to compute modulo prime power sums"
    - "new sufficient conditions for multiple access channel with correlated sources"
    - "achievable rate region based on coset codes for multiple access channel with states"

Connected through hyperedge HE-3 (induced by source paper "on the necessity of structured codes for communications over mac with feedback"):
  with members:
    - "new sufficient conditions for multiple access channel with correlated sources"

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)