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: "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
  Abstract: For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at least three, we show using density evolution analysis that the expected bit-error probability of these ensembles, when passed through a binary erasure channel with erasure probability ϵ, decays as O(exp(-(c1)n(c2))) with the block-length n for positive constants c1 and c2, as long as ϵ is less than the erasure threshold ϵth of the DDP. This guarantees that the coset coding scheme using the dual sequence provides strong secrecy over the binary erasure wiretap channel for erasure probabilities greater than 1-ϵth.

Connected through hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "empirical and strong coordination via soft covering with polar codes"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "an information theoretic approach to secret sharing"

Connected through hyperedge HE-2 (induced by source paper "multilevel ldpc lattices with efficient encoding and decoding and a generalization of construction d"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "construction of capacity achieving lattice codes polar lattices"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "connections between construction d and related constructions of lattices"
    - "on the performance of 1 level ldpc lattices"
    - "integer forcing linear receivers"

Connected through hyperedge HE-3 (induced by source paper "multi message authentication over noisy channel with secure channel codes"):
  with members:
    - "on the error region for channel estimation based physical layer authentication over rayleigh fading"
    - "on the optimality of keyless authentication in a noisy model"
    - "message authentication code over a wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "cooperative secret key generation from phase estimation in narrowband fading channels"
    - "strong secrecy for erasure wiretap channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "almost universal codes for fading wiretap channels"):
  with members:
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "on secrecy capacity of fast fading mimome wiretap channels with statistical csit"
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "an error probability approach to mimo wiretap channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-5 (induced by source paper "information theoretic physical layer security for satellite channels"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "joint power control in wiretap interference channels"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure satellite communication systems design with individual secrecy rate constraints"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "construction of near capacity protograph ldpc code sequences with block error thresholds"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "protograph based raptor like ldpc codes"
    - "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-7 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "semantic security capacity for wiretap channels of type ii"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "secrecy results for compound wiretap channels"
    - "polar coding for secret key generation"

Connected through hyperedge HE-8 (induced by source paper "analysis of short blocklength codes for secrecy"):
  with members:
    - "quantifying equivocation for finite blocklength wiretap codes"
    - "performance assessment and design of finite length ldpc codes for the gaussian wiretap channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar 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)