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: "coding and system design for quantize map and forward relaying"
  Abstract: In this paper we develop a low-complexity coding scheme and system design framework for the half duplex relay channel based on the Quantize-Map-and-Forward (QMF) relaying scheme. The proposed framework allows linear complexity operations at all network terminals. We propose the use of binary LDPC codes for encoding at the source and LDGM codes for mapping at the relay. We express joint decoding at the destination as a belief propagation algorithm over a factor graph. This graph has the LDPC and LDGM codes as subgraphs connected via probabilistic constraints that model the QMF relay operations. We show that this coding framework extends naturally to the high SNR regime using bit interleaved coded modulation (BICM). We develop density evolution analysis tools for this factor graph and demonstrate the design of practical codes for the half-duplex relay channel that perform within 1dB of information theoretic QMF threshold.

Connected through hyperedge HE-1 (induced by source paper "a novel cooperative strategy for wireless multihop backhaul networks"):
  with members:
    - "capacity approximations for gaussian relay networks"
    - "an algebraic approach to physical layer network coding"
    - "multihop backhaul compression for the uplink of cloud radio access networks"
    - "two birds and one stone gaussian interference channel with a shared out of band relay of limited rate"
    - "short message noisy network coding with a decode forward option"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "wireless network information flow a deterministic approach"
    - "integer forcing linear receivers"

Connected through hyperedge HE-2 (induced by source paper "harq buffer management an information theoretic view"):
  with members:
    - "millimeter wave cellular wireless networks potentials and challenges"
    - "llr compression for bicm systems using large constellations"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "fixed length lossy compression in the finite blocklength regime"
    - "distortion minimization in gaussian layered broadcast coding with successive refinement"

Connected through hyperedge HE-3 (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"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-4 (induced by source paper "regenerative and adaptive schemes based on network coding for wireless relay network"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "quantized compute and forward a low complexity architecture for distributed antenna systems"

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)