human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a signal constellation for pilotless communications over wiener phase noise channels"):
  Abstract: Many satellite communication systems operating today employ low cost upconverters or downconverters which create phase noise. This noise can severely limit the information rate of the system and pose a serious challenge for the detection systems. Moreover, simple solutions for phase noise tracking such as PLL either require low phase noise or otherwise require many pilot symbols which reduce the effective data rate. In order to increase the effective information rate, we propose a signal constellation which does not require pilots, at all, in order to converge in the decoding process. In this contribution, we will present a signal constellation which does not require pilot sequences, but we require a signal that does not present rotational symmetry. For example a simple MPSK cannot be used.Moreover, we will provide a method to analyze the proposed constellations and provide a figure of merit for their performance when iterative decoding algorithms are used.

Includes members:
  Member "constellation design for channels affected by phase noise":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constellation optimization in the presence of strong phase noise")
  Member "multiple hypotheses iterative decoding of ldpc in the presence of strong phase noise":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "message passing algorithms for phase noise tracking using tikhonov mixtures")

Question: Please tell me which class the source paper 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)