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 self dual double circulant codes"
  Abstract: Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with relative distance satisfying a modified Gilbert-Varshamov bound.

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"
    - "minimal linear codes arising from blocking sets"
    - "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"
    - "linear codes from some 2 designs"

Connected through hyperedge HE-2 (induced by source paper "asymptotic performance of metacyclic codes"):
  with members:
    - "on checkable codes in group algebras"
    - "group codes over fields are asymptotically good"

Connected through hyperedge HE-3 (induced by source paper "asymptotically good additive cyclic codes exist"):
  with members:
    - "good cyclic codes and the uncertainty principle"
    - "on self dual four circulant codes"
    - "long quasi polycyclic t cis codes"

Connected through hyperedge HE-4 (induced by source paper "on self dual four circulant codes"):
  with members:
    - "on linear complementary dual multinegacirculant 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)