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: "on error correction for physical unclonable functions"
  Abstract: Physical Unclonable Functions evaluate manufacturing variations to generate secure cryptographic keys for embedded systems without secure key storage. It is explained how methods from coding theory are applied in order to ensure reliable key reproduction. We show how better results can be obtained using code classes and decoding principles not used for this scenario before. These methods are exemplified by specific code constructions which improve existing codes with respect to error probability, decoding complexity and codeword length.

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"
    - "high rate error correction schemes for sram pufs based on polar codes"

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"
    - "high rate error correction schemes for sram pufs based on polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "secure and reliable key agreement with physical unclonable functions"):
  with members:
    - "privacy secrecy and storage with noisy identifiers"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"

Connected through hyperedge HE-5 (induced by source paper "high rate error correction schemes for sram pufs based on polar codes"):
  with members:
    - "polar coding for secret key generation"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "using convolutional codes for key extraction in physical unclonable functions"):
  with members:
    - "a new error correction scheme for physical unclonable functions"
    - "error correction for physical unclonable functions using generalized concatenated codes"

Connected through hyperedge HE-7 (induced by source paper "a new error correction scheme for physical unclonable functions"):
  with members:
    - "error correction for physical unclonable functions using generalized concatenated codes"

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)