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 "semantic security on wiretap channels using universal hashing with fading applications"):
  Abstract: We furnish a procedure based on universal hash families (UHFs) that can convert an error correcting coding scheme (ECC) of rate $R$ into a semantically secure wiretap coding scheme of rate $R - \xi$ where $\xi$ is a parameter derived from the eavesdropper's point-to-point channel. This conversion is shown to be polynomial time efficient with block length and is applicable to any channel. When an ECC is chosen, our procedure induces a wiretap coding scheme that is concrete and efficient as long as the ECC is also such. To prove this induced wiretap coding scheme is semantically secure, we have constructed bounds on the information leaked to the eavesdropper. Our construction is an upgrade of bounds from recent literature: the novelty here being that our leakage bounds hold for any message distribution. Indeed, our wiretap procedure using UHFs and our characterization of its semantic leakage is the first main contribution of this work. The other main contribution of this work is as follows. We apply the aforementioned procedure to a variety of wiretap channels in order to show the procedure's efficacy, and as a result of such applications, our results establish new achievable semantically secure rates.

Includes members:
  Member "a capacity achieving coding scheme for the awgn channel with polynomial encoding and decoding complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a lattice coding scheme for secret key generation from gaussian markov tree sources")
  Member "finite blocklength bounds for wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "almost universal codes for fading wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "achieving secrecy capacity of the gaussian wiretap channel with polar lattices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "universal hashing for information theoretic security":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "a cryptographic treatment of the wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "key and message semantic security over state dependent channels")
  Member "polynomial time semantically secure encryption achieving the secrecy capacity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs")

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)