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: "achievable rate region based on coset codes for multiple access channel with states"
  Abstract: We prove that the ensemble the nested coset codes built on finite fields achieves the capacity of arbitrary discrete memoryless point-to-point channels. Exploiting it's algebraic structure, we develop a coding technique for communication over general discrete multiple access channel with channel state information distributed at the transmitters. We build an algebraic coding framework for this problem using the ensemble of Abelian group codes and thereby derive a new achievable rate region. We identify non-additive and non-symmteric examples for which the proposed achievable rate region is strictly larger than the one achievable using random unstructured codes.

Connected through hyperedge HE-1 (induced by source paper "homologous codes for multiple access channels"):
  with members:
    - "on general lattice quantization noise"
    - "towards an algebraic network information theory simultaneous joint typicality decoding"
    - "communication versus computation duality for multiple access channels and source coding"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "a joint typicality approach to algebraic network information theory"
    - "optimal achievable rates for interference networks with random codes"
    - "computing sum of sources over an arbitrary multiple access channel"

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"
    - "quasi linear codes application to point to point and multi terminal source coding"
    - "new sufficient conditions for multiple access channel with correlated sources"

Connected through hyperedge HE-3 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "a joint typicality approach to algebraic network information theory"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "lattices over eisenstein integers for compute and forward"
    - "uplink downlink duality for integer forcing"

Connected through hyperedge HE-4 (induced by source paper "how to compute modulo prime power sums"):
  with members:
    - "on the necessity of structured codes for communications over mac with feedback"
    - "a new achievable rate region for multiple access channel with states"
    - "trade off between communication and cooperation in the interference channel"
    - "a joint typicality approach to algebraic network information theory"
    - "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"
    - "polar codes for the two user multiple access channel"

Connected through hyperedge HE-5 (induced by source paper "an achievable rate region for the three user interference channel based on coset codes"):
  with members:
    - "on interference networks over finite fields"
    - "on the capacity of the finite field counterparts of wireless interference networks"
    - "is non unique decoding necessary"
    - "abelian group codes for source coding and channel coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "interference decoding for deterministic channels"
    - "achievable rates for k user gaussian interference channels"

Connected through hyperedge HE-6 (induced by source paper "achievable rate region for three user discrete broadcast channel based on coset codes"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "on interference networks over finite fields"
    - "on the capacity of the finite field counterparts of wireless interference networks"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "on the capacity of abelian group codes over discrete memoryless channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on broadcast channels with binary inputs and symmetric outputs"
    - "interference alignment and a noisy interference regime for many to one interference channels"

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)