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: "achievable rates in two user interference channels with finite inputs and very strong interference"
  Abstract: For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all. To achieve this capacity, the channel inputs need to be Gaussian distributed. However, Gaussian signals are continuous and unbounded. Thus, they are not well suited for practical applications. In this paper, we investigate the achievable rates if the channel inputs are restricted to finite constellations. Moreover, we will show by numerical simulations that rotating one of these input alphabets in the complex plane can increase the achievable rate region. Finally, we show that the threshold at which the single-user rates are achieved also depends on this rotation.

Connected through hyperedge HE-1 (induced by source paper "a novel power allocation scheme for two user gmac with finite input constellations"):
  with members:
    - "linear precoding for relay networks with finite alphabet constraints"
    - "bounds on the achievable rate for the fading relay channel with finite input constellations"
    - "secrecy capacity of the gaussian wire tap channel with finite complex constellation input"

Connected through hyperedge HE-2 (induced by source paper "on precoding for constant k user mimo gaussian interference channel with finite constellation inputs"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "linear precoder design for mimo interference channels with finite alphabet signaling"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "two user gaussian interference channel with finite constellation input and fdma"
    - "interference alignment for the k user mimo interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "linear transceiver design for interference alignment complexity and computation"
    - "mimo precoding with x and y codes"

Connected through hyperedge HE-3 (induced by source paper "capacity region of k user discrete memoryless interference channels with a mixed strong very strong interference"):
  with members:
    - "two user gaussian interference channel with finite constellation input and fdma"
    - "lecture notes on network information theory"
    - "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "secrecy capacity of the gaussian wire tap channel with finite complex constellation input"):
  with members:
    - "secrecy gain a wiretap lattice code design"
    - "secure nested codes for type ii wiretap channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "two user gaussian interference channel with finite constellation input and fdma"):
  with members:
    - "lecture notes on network information theory"
    - "gaussian interference channel capacity to within one bit"

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)