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: "single symbol decodable differential space time modulation based on qo stbc"
  Abstract: We present a novel differential space-time modulation (DSTM) scheme that is single-symbol decodable and can provide full transmit diversity. It is the first known single-symbol-decodable DSTM scheme not based on orthogonal STBC (O-STBC), and it is constructed based on the recently proposed minimum-decoding-complexity quasi-orthogonal space-time block code (MDC-QOSTBC). We derive the code design criteria and present systematic methodology to find the solution sets. The proposed DSTM scheme can provide higher code rate than DSTM schemes based on O-STBC. Its decoding complexity is also considerably lower than DSTM schemes based on Sp(2) and double-symbol-decodable QO-STBC, with negligible or slight trade-off in decoding error probability performance

Connected through hyperedge HE-1 (induced by source paper "noncoherent low decoding complexity space time codes for wireless relay networks"):
  with members:
    - "algebraic distributed space time codes with low ml decoding complexity"
    - "signal set design for full diversity low decoding complexity differential scaled unitary stbcs"
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"

Connected through hyperedge HE-2 (induced by source paper "algebraic distributed differential space time codes with low decoding complexity"):
  with members:
    - "algebraic distributed space time codes with low ml decoding complexity"
    - "noncoherent low decoding complexity space time codes for wireless relay networks"
    - "signal set design for full diversity low decoding complexity differential scaled unitary stbcs"

Connected through hyperedge HE-3 (induced by source paper "signal set design for full diversity low decoding complexity differential scaled unitary stbcs"):
  with members:
    - "multigroup decodable stbcs from clifford algebras"

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)