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: "rate equivocation optimal spatially coupled ldpc codes for the bec wiretap channel"
  Abstract: We consider transmission over a wiretap channel where both the main channel and the wiretapper's channel are Binary Erasure Channels (BEC). We use convolutional LDPC ensembles based on the coset encoding scheme. More precisely, we consider regular two edge type convolutional LDPC ensembles. We show that such a construction achieves the whole rate-equivocation region of the BEC wiretap channel. #R##N#Convolutional LDPC ensemble were introduced by Felstr\"om and Zigangirov and are known to have excellent thresholds. Recently, Kudekar, Richardson, and Urbanke proved that the phenomenon of "Spatial Coupling" converts MAP threshold into BP threshold for transmission over the BEC. #R##N#The phenomenon of spatial coupling has been observed to hold for general binary memoryless symmetric channels. Hence, we conjecture that our construction is a universal rate-equivocation achieving construction when the main channel and wiretapper's channel are binary memoryless symmetric channels, and the wiretapper's channel is degraded with respect to the main channel.

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 "spatially coupled ldpc codes constructed from protographs"):
  with members:
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "lossy source coding via spatially coupled ldgm ensembles"
    - "spatially coupled random access on graphs"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation on channels with memory via spatial coupling"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"

Connected through hyperedge HE-3 (induced by source paper "performance improvement of iterative multiuser detection for large sparsely spread cdma systems by spatial coupling"):
  with members:
    - "iterative multiuser detection and decoding with spatially coupled interleaving"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "chains of mean field models"
    - "a phenomenological study on threshold improvement via spatial coupling"
    - "wave like solutions of general one dimensional spatially coupled systems"
    - "threshold saturation on channels with memory via spatial coupling"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"

Connected through hyperedge HE-4 (induced by source paper "a simple proof of maxwell saturation for coupled scalar recursions"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "spatial coupling as a proof technique"
    - "a simple proof of threshold saturation for coupled scalar recursions"

Connected through hyperedge HE-5 (induced by source paper "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"):
  with members:
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "spatial coupling as a proof technique"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "chains of mean field models"
    - "a phenomenological study on threshold improvement via spatial coupling"

Connected through hyperedge HE-6 (induced by source paper "polar coding for the broadcast channel with confidential messages and constrained randomization"):
  with members:
    - "polar codes for broadcast channels"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the general wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for secret key generation"
    - "on secure communication with constrained randomization"

Connected through hyperedge HE-7 (induced by source paper "polar coding for the broadcast channel with confidential messages a random binning analogy"):
  with members:
    - "polar codes for broadcast channels"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar coding for secret key generation"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "on secure communication with constrained randomization"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-8 (induced by source paper "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "a phenomenological study on threshold improvement via spatial coupling"
    - "threshold saturation on channels with memory via spatial coupling"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

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)