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: "joint wyner ziv dirty paper coding by modulo lattice modulation"
  Abstract: The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel'fand-Pinsker problem) can be optimally solved using the separation principle. In this work we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the optimal performance by a applying modulo-lattice modulation to the analog source. Thus it saves the complexity of quantization and channel decoding, and remains with the task of "shaping" only. Furthermore, for high signal-to-noise ratio (SNR), the scheme approaches the optimal performance using an SNR-independent encoder, thus it is robust to unknown SNR at the encoder.

Connected through hyperedge HE-1 (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"
    - "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"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "interference decoding for deterministic channels"

Connected through hyperedge HE-2 (induced by source paper "multi rate control over awgn channels via analog joint source channel coding"):
  with members:
    - "almost practical tree codes"
    - "rate cost tradeoffs in control"
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "on zero delay source channel coding"
    - "error correcting codes for distributed control"
    - "analog matching of colored sources to colored channels"

Connected through hyperedge HE-3 (induced by source paper "interactive schemes for the awgn channel with noisy feedback"):
  with members:
    - "the gaussian channel with noisy feedback improving reliability via interaction"
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "gaussian channel with noisy feedback and peak energy constraint"
    - "variations on a theme by schalkwijk and kailath"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "optimal feedback communication via posterior matching"
    - "concatenated coding for the awgn channel with noisy feedback"

Connected through hyperedge HE-4 (induced by source paper "the awgn bc with mac feedback a reduction to noiseless feedback via interaction"):
  with members:
    - "the gaussian channel with noisy feedback improving reliability via interaction"
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "mimo mac bc duality with linear feedback coding schemes"
    - "an achievable rate region for the broadcast channel with feedback"
    - "lqg control approach to gaussian broadcast channels with feedback"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"

Connected through hyperedge HE-5 (induced by source paper "the gaussian channel with noisy feedback improving reliability via interaction"):
  with members:
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-6 (induced by source paper "integer forcing source coding"):
  with members:
    - "optimized backhaul compression for uplink cloud radio access network"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "a technique for deriving one shot achievability results in network information theory"
    - "an algebraic approach to physical layer network coding"
    - "coding and system design for quantize map and forward relaying"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"

Connected through hyperedge HE-7 (induced by source paper "analog matching of colored sources to colored channels"):
  with members:
    - "compute and forward harnessing interference through structured codes"
    - "robust joint source channel coding for delay limited applications"
    - "joint source channel coding with side information using hybrid digital analog codes"
    - "achieving the gaussian rate distortion function by prediction"
    - "shannon meets wiener ii on mmse estimation in successive decoding schemes"

Connected through hyperedge HE-8 (induced by source paper "compute and forward harnessing interference through structured codes"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "an algebraic approach to physical layer network coding"
    - "wireless network information flow a deterministic approach"
    - "reliable physical layer network coding"
    - "the degrees of freedom of compute and forward"
    - "nested lattice codes for gaussian relay networks with interference"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"

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)