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: "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.

Connected through hyperedge HE-1 (induced by source paper "a survey on hardware based security mechanisms for internet of things"):
  with members:
    - "a solution for dynamic spectrum management in mission critical uav networks"
    - "a proof of concept sram based physically unclonable function puf key generation mechanism for iot devices"
    - "ring oscillator and its application as physical unclonable function puf for password management"
    - "overview of blakley s secret sharing scheme"
    - "internet of things survey on security"
    - "distributed cooperative spectrum sharing in uav networks using multi agent reinforcement learning"
    - "a reputation based stackelberg game model to enhance secrecy rate in spectrum leasing to selfish iot devices"
    - "a secret key generation scheme for internet of things using ternary states reram based physical unclonable functions"

Connected through hyperedge HE-2 (induced by source paper "a proof of concept sram based physically unclonable function puf key generation mechanism for iot devices"):
  with members:
    - "a secret key generation scheme for internet of things using ternary states reram based physical unclonable functions"
    - "on error correction for physical unclonable functions"

Connected through hyperedge HE-3 (induced by source paper "a secret key generation scheme for internet of things using ternary states reram based physical unclonable functions"):
  with members:
    - "a reram physically unclonable function reram puf based approach to enhance authentication security in software defined wireless networks"
    - "on error correction for physical unclonable functions"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)