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 "semantically secure lattice codes for compound mimo channels"):
  Abstract: We consider code construction for compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Using the flatness factor for MIMO channels, we propose lattice codes universally achieving the secrecy capacity of compound MIMO wiretap channels up to a constant gap (measured in nats) that is equal to the number of transmit antennas. The proposed approach improves upon existing works on secrecy coding for MIMO wiretap channels from an error probability perspective, and establishes information theoretic security (in fact semantic security). We also give an algebraic construction to reduce the code design complexity, as well as the decoding complexity of the legitimate receiver. Thanks to the algebraic structures of number fields and division algebras, our code construction for compound MIMO wiretap channels can be reduced to that for Gaussian wiretap channels, up to some additional gap to secrecy capacity.

Includes members:
  Member "random ensembles of lattices from generalized reductions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "universal lattice codes for mimo channels")
  Member "optimal signaling for secure communications over gaussian mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a rotation based method for precoding in gaussian mimome channels")
  Member "universal lattice codes for mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ring compute and forward over block fading channels")
  Member "a general formula for compound channel capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "feedback does not increase the capacity of compound channels with additive noise")
  Member "the secrecy capacity of compound gaussian mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver")
  Member "the mimo wiretap channel decomposed":
    also connected through other hyperedges:
      (none)
  Member "construction a of lattices over number fields and block fading wiretap coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "probability estimates for fading and wiretap channels from ideal class zeta functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on secrecy metrics for physical layer security over quasi static fading channels")

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)