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 the minimum stopping distance of array low density parity check codes"
  Abstract: In this paper, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m q. In the literature, the minimum/stopping distance of these codes (denoted by d(q, m) and h(q, m), respectively) has been thoroughly studied for m 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m = 6, the best known minimum distance upper bound, derived by Mittelholzer, is d(q, 6) 32. In this paper, we derive an improved upper bound of d(q, 6) 20 and a new upper bound d(q, 7) 24 by using the concept of a template support matrix of a codeword/stopping set. The bounds are tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum/stopping distance results for m 7 and low-to-moderate values of q ≤79.

Connected through hyperedge HE-1 (induced by source paper "failure analysis of the interval passing algorithm for compressed sensing"):
  with members:
    - "asymptotic analysis and spatial coupling of counter braids"
    - "verification based interval passing algorithm for compressed sensing"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "a simple message passing algorithm for compressed sensing"
    - "message passing algorithms for compressed sensing"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-2 (induced by source paper "characterization and efficient search of non elementary trapping sets of ldpc codes with applications to stopping sets"):
  with members:
    - "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"
    - "characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular ldpc codes"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "achieving maximum distance separable private information retrieval capacity with linear codes"):
  with members:
    - "lifting private information retrieval from two to any number of messages"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "t private information retrieval schemes using transitive codes"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"

Connected through hyperedge HE-4 (induced by source paper "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"):
  with members:
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "multi file private information retrieval from mds coded databases with colluding servers"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of symmetric private information retrieval"

Connected through hyperedge HE-5 (induced by source paper "from cages to trapping sets and codewords a technique to derive tight upper bounds on the minimum size of trapping sets and minimum distance of ldpc codes"):
  with members:
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "practical graph isomorphism ii"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "shortened array codes of large girth"

Connected through hyperedge HE-6 (induced by source paper "asymptotic average multiplicity of structures within different categories of trapping sets absorbing sets and stopping sets in random regular and irregular ldpc code ensembles"):
  with members:
    - "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"
    - "hardness results on finding leafless elementary trapping sets and elementary absorbing sets of ldpc codes"
    - "thresholds of absorbing sets in low density parity check codes"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "error floor approximation for ldpc codes in the awgn channel"

Connected through hyperedge HE-7 (induced by source paper "private information retrieval in distributed storage systems using an arbitrary linear code"):
  with members:
    - "private information retrieval from coded databases with colluding servers"
    - "private information retrieval for coded storage"
    - "xoring elephants novel erasure codes for big data"

Connected through hyperedge HE-8 (induced by source paper "on the minimum distance of array based spatially coupled low density parity check codes"):
  with members:
    - "array convolutional low density parity check codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "deriving good ldpc convolutional codes from ldpc block 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)