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 "high rate error correction schemes for sram pufs based on polar codes"):
  Abstract: Physical unclonable functions (PUFs) can be used to generate cryptographic keys by making use of the intrinsic randomness resulting from manufacturing variations. Error correction codes (ECCs) help to make SRAM-PUFs, which are always effected by noise and environmental changes, suitable for security applications. In this paper, we propose practical error correction schemes for PUF-based secret generation that are based on polar codes. The proposed scheme could generate a 128-bit key using 1024 PUF bits and $896$ helper data bits and achieve a failure probability of 10^{-9} or lower for a practical SRAM-PUFs setting with cross-over probability of 15%. The method is based on successive cancellation in combination with list decoding and hash-based checking, making use of the hash that is already available at the decoder. In addition, an adaptive list decoder for polar codes is investigated. This decoder increases the list size only if needed.

Includes members:
  Member "on error correction for physical unclonable functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on hardware based security mechanisms for internet of things")
  Member "polar coding for secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "how to construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "performance and construction of polar codes on symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")

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)