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: "on the minimum decoding delay of balanced complex orthogonal designs"
  Abstract: A complex orthogonal design (COD) with parameter [p, n, k] is a combinatorial design used in space-time block codes (STBCs). For STBCs, n is the number of antennas, k/p is the rate, and p is the decoding delay. A class of rate 1/2 CODs called balanced complex orthogonal designs (BCODs) has been proposed by Adams et al., who constructed BCODs with rate k/p = 1/2 and decoding delay p = 2#N# m#N# for n = 2m. Furthermore, they proved that the constructions have optimal decoding delay when m is congruent to 1, 2, or 3 modulo 4. They conjectured that for the case m ≡ 0 (mod 4), 2#N# m#N# is also a lower bound on p. In this paper, we prove this conjecture.

Connected through hyperedge HE-1 (induced by source paper "a simple receive diversity technique for distributed beamforming"):
  with members:
    - "massive mimo for next generation wireless systems"
    - "opportunistic collaborative beamforming with one bit feedback"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-2 (induced by source paper "enhancing cellular performance through device to device distributed mimo"):
  with members:
    - "optimal resource allocation for power efficient mc noma with imperfect channel state information"
    - "joint millimeter wave fronthaul and ofdma resource allocation in ultra dense cran"
    - "energy efficient 5g outdoor to indoor communication sudas over licensed and unlicensed spectrum"
    - "what will 5g be"
    - "sparse beamforming and user centric clustering for downlink cloud radio access network"
    - "efficiency resource allocation for device to device underlay communication systems a reverse iterative combinatorial auction based approach"
    - "complex orthogonal designs with forbidden 2 times 2 submatrices"

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)