human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "full characterization of minimal linear codes as cutting blocking sets"):
  Abstract: In this paper, we first study more in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by #R##N#Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking sets. #R##N#As a direct result, minimal projective codes of dimension $3$ and #R##N#$t$-fold blocking sets with $t\ge 2$ in projective planes are identical objects. Some bounds on the parameters of minimal codes are derived from this characterization. Using this new link between minimal codes and blocking sets, we also present new general primary and secondary constructions of minimal linear codes. #R##N#Resultantly, infinite families of minimal linear codes not satisfying the Aschikhmin-Barg's condition are obtained. #R##N#In addition, the weight distributions of two subfamilies of the proposed minimal linear codes are established. #R##N#Open problems are also presented.

Includes members:
  Member "an inductive construction of minimal codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a geometric characterization of minimal codes and their asymptotic performance")
  Member "minimal linear codes arising from blocking sets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a geometric characterization of minimal codes and their asymptotic performance")
  Member "the parameters of minimal linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimal linear codes constructed from functions")
  Member "minimal linear codes from characteristic functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimal linear codes constructed from functions")
  Member "minimal linear codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimal linear codes constructed from functions")
  Member "a new class of three weight linear codes from weakly regular plateaued functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strongly regular graphs from weakly regular plateaued functions")
  Member "it is indeed a fundamental construction of all linear codes":
    also connected through other hyperedges:
      (none)
  Member "linear codes with two or three weights from weakly regular bent functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimal linear codes constructed from functions")

Question: Please tell me which class the source paper 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)