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: "algebraic distributed differential space time codes with low decoding complexity"
  Abstract: The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For such codebooks to be usable in the Jing-Hassibi protocol for cooperative diversity, the conditions involving the relay matrices and the codebook that need to be satisfied are identified. Using the algebraic framework of extended Clifford algebras, a new class of Distributed Differential Space-Time Codes satisfying these conditions for power of two number of relays and also achieving full cooperative diversity with a low complexity sub-optimal receiver is proposed. Simulation results indicate that the proposed codes outperform both the cyclic codes as well as the circulant codes. Furthermore, these codes can also be applied as Differential Space-Time codes for non-coherent communication in classical point to point multiple antenna systems.

Connected through hyperedge HE-1 (induced by source paper "a belief propagation based framework for soft multiple symbol differential detection"):
  with members:
    - "joint multiple symbol differential detection and channel decoding for noncoherent uwb impulse radio by belief propagation"
    - "fifty years of mimo detection the road to large scale mimos"
    - "approximate bayesian probabilistic data association aided iterative detection for mimo systems using arbitrary m ary modulation"
    - "ber analysis of decision feedback multiple symbol detection in noncoherent mimo ultra wideband systems"

Connected through hyperedge HE-2 (induced by source paper "maximum rate of 3 and 4 real symbol ml decodable unitary weight stbcs"):
  with members:
    - "maximum rate of unitary weight single symbol decodable stbcs"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "high rate multi symbol decodable stbcs from clifford algebras"

Connected through hyperedge HE-3 (induced by source paper "low ml decoding complexity stbcs via codes over gf 4"):
  with members:
    - "asymptotically optimal fast decodable full diversity stbcs"
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "on the search for high rate quasi orthogonal space time block code"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-4 (induced by source paper "ofdm based distributed space time coding for asynchronous relay networks"):
  with members:
    - "multi group ml decodable collocated and distributed space time block codes"

Connected through hyperedge HE-5 (induced by source paper "multi group ml decodable collocated and distributed space time block codes"):
  with members:
    - "four group decodable space time block codes"
    - "high rate single symbol decodable precoded dstbcs for cooperative networks"
    - "high rate multi symbol decodable stbcs from clifford algebras"
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"

Connected through hyperedge HE-6 (induced by source paper "distributed space time codes with low decoding complexity for asynchronous relay networks"):
  with members:
    - "algebraic distributed space time codes with low ml decoding complexity"
    - "a non orthogonal distributed space time coded protocol part ii code construction and dm g tradeoff"

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)