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: "pairwise check decoding for ldpc coded two way relay block fading channels"
  Abstract: Partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC). In this paper, we propose a new solution for joint network coding and channel decoding at the relay, called pairwise check decoding (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error probability. Moreover, we propose the minimum correlation optimization (MCO) for selecting the better check-relation-tabs. Simulation results confirm that the proposed TS-CNC-PCD offers a sizable gain over the conventional XOR with belief propagation (BP) in fading channels.

Connected through hyperedge HE-1 (induced by source paper "joint physical network coding and ldpc decoding for two way wireless relaying"):
  with members:
    - "joint network and ldpc coding for bi directional relaying"
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "physical network coding in two way wireless relay channels"
    - "physical layer network coding"

Connected through hyperedge HE-2 (induced by source paper "mapping and coding design for channel coded physical layer network coding"):
  with members:
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "capacity of the gaussian two way relay channel to within 1 2 bit"

Connected through hyperedge HE-3 (induced by source paper "cross layer optimization of two way relaying for statistical qos guarantees"):
  with members:
    - "joint source and relay precoding designs for mimo two way relaying based on mse criterion"
    - "queue aware distributive resource control for delay sensitive two hop mimo cooperative systems"
    - "transmission strategies in multiple access fading channels with statistical qos constraints"
    - "optimization framework and graph based approach for relay assisted bidirectional ofdma cellular networks"
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "physical network coding in two way wireless relay channels"
    - "physical layer network coding"

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)