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: "minimal linear codes arising from blocking sets"
  Abstract: Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient condition for a linear code to be minimal, which has been applied in the construction of many minimal linear codes. In this paper, we generalize some recent constructions of minimal linear codes which are not based on Ashikhmin-Barg's condition. More combinatorial and geometric methods are involved in our proofs. In particular, we present a family of codes arising from particular blocking sets, which are well-studied combinatorial objects. In this context, we will need to define cutting blocking sets and to prove some of their relations with other notions in blocking sets' theory. At the end of the paper, we provide one explicit family of cutting blocking sets and related minimal linear codes, showing that infinitely many of its members do not satisfy the Ashikhmin-Barg's condition.

Connected through hyperedge HE-1 (induced by source paper "a geometric characterization of minimal codes and their asymptotic performance"):
  with members:
    - "an inductive construction of minimal codes"
    - "full characterization of minimal linear codes as cutting blocking sets"
    - "group codes over fields are asymptotically good"
    - "several classes of minimal linear codes with few weights from weakly regular plateaued functions"
    - "minimal linear codes over finite fields"
    - "long quasi polycyclic t cis codes"
    - "on self dual double circulant codes"
    - "linear codes from some 2 designs"

Connected through hyperedge HE-2 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets"):
  with members:
    - "an inductive construction of minimal codes"
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "a new class of three weight linear codes from weakly regular plateaued functions"
    - "it is indeed a fundamental construction of all linear codes"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-3 (induced by source paper "minimal linear codes from characteristic functions"):
  with members:
    - "minimal linear codes over finite fields"
    - "euclidean and hermitian lcd mds codes"
    - "complementary dual algebraic geometry codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "towards secure two party computation from the wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "an inductive construction of minimal codes"):
  with members:
    - "minimal linear codes over finite fields"
    - "linear codes from some 2 designs"
    - "towards secure two party computation from the wire tap channel"
    - "secret sharing with a class of minimal linear 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)