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: "deterministic constructions for large girth protograph ldpc codes"
  Abstract: The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes. However, the degree-two bit nodes preclude the possibility of a block-error threshold. Interestingly, LDPC codes constructed using protographs allow the possibility of having both degree-two bit nodes and a block-error threshold. In this paper, we analyze density evolution for protograph LDPC codes over the binary erasure channel and show that their bit-error probability decreases double exponentially with the number of iterations when the erasure probability is below the bit-error threshold and long chain of degree-two variable nodes are avoided in the protograph. We present deterministic constructions of such protograph LDPC codes with girth logarithmic in blocklength, resulting in an exponential fall in bit-error probability below the threshold. We provide optimized protographs, whose block-error thresholds are better than that of the standard ensemble with minimum bit-node degree three. These protograph LDPC codes are theoretically of great interest, and have applications, for instance, in coding with strong secrecy over wiretap channels.

Connected through hyperedge HE-1 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"):
  with members:
    - "on minimum distance of locally repairable codes"
    - "binary codes with locality for multiple erasures having short block length"
    - "binary codes with locality for four erasures"
    - "codes with hierarchical locality"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "an upper bound on the minimum distance of ldpc codes over gf q"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-2 (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"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "design of robust protograph based ldpc codes for rate adaptation via probabilistic shaping"):
  with members:
    - "experimental demonstration of capacity increase and rate adaptation by probabilistically shaped 64 qam"
    - "protograph based ldpc code design for shaped bit metric decoding"
    - "constant composition distribution matching"
    - "achievable rates for shaped bit metric decoding"

Connected through hyperedge HE-4 (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"
    - "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"
    - "spatially coupled quasi cyclic quantum ldpc codes"

Connected through hyperedge HE-5 (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"
    - "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"
    - "coding for cryptographic security enhancement using stopping sets"

Connected through hyperedge HE-6 (induced by source paper "protograph based ldpc code design for shaped bit metric decoding"):
  with members:
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes single and dual channel setup"
    - "protograph based ldpc code design for bit metric decoding"
    - "constant composition distribution matching"
    - "optimized bit mappings for spatially coupled ldpc codes over parallel binary erasure channels"
    - "achievable rates for shaped bit metric decoding"
    - "probabilistic signal shaping for bit metric decoding"

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)