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: "lattice strategies for the dirty multiple access channel"
  Abstract: A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's strategies (i.e. by a random binning scheme induced by Costa's auxiliary random variables) vanish in the limit when the interference signals are strong. In contrast, it is shown that lattice strategies ("lattice precoding") can achieve positive rates independent of the interferences, and in fact in some cases - which depend on the noise variance and power constraints - they are optimal. In particular, lattice strategies are optimal in the limit of high SNR. It is also shown that the gap between the achievable rate region and the capacity region is at most 0.167 bit. Thus, the dirty MAC is another instance of a network setup, like the Korner-Marton modulo-two sum problem, where linear coding is potentially better than random binning. Lattice transmission schemes and conditions for optimality for the asymmetric case, where there is only one interference which is known to one of the users (who serves as a "helper" to the other user), and for the "common interference" case are also derived. In the former case the gap between the helper achievable rate and its capacity is at most 0.085 bit.

Connected through hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding"):
  with members:
    - "homologous codes for multiple access channels"
    - "gaussian multiple access via compute and forward"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "distributed decode forward for relay networks"

Connected through hyperedge HE-2 (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"
    - "quasi linear codes application to point to point and multi terminal source coding"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "gaussian multiple access via compute and forward"):
  with members:
    - "a joint typicality approach to algebraic network information theory"
    - "asymmetric compute and forward with csit"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "state dependent gaussian multiple access channels new outer bounds and capacity results"):
  with members:
    - "the dirty mimo multiple access channel"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "multiple access channels with states causally known at transmitters"
    - "multiaccess channels with state known to one encoder another case of degraded message sets"
    - "multiaccess channels with state known to some encoders and independent messages"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-5 (induced by source paper "distributed structure joint expurgation for the multiple access channel"):
  with members:
    - "error exponent for multiple access channels lower bounds"
    - "a new upper bound on the average error exponent for multiple access channels"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"

Connected through hyperedge HE-6 (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-7 (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"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-8 (induced by source paper "a joint typicality approach to algebraic network information theory"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "secure compute and forward in a bidirectional relay"
    - "asymmetric compute and forward with csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "renyi divergence and kullback leibler divergence"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

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)