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: "reconstructing extended perfect binary one error correcting codes from their minimum distance graphs"
  Abstract: The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect binary one-error-correcting code from its minimum distance graph is presented. Consequently, inequivalent such codes have nonisomorphic minimum distance graphs. Moreover, it is shown that the automorphism group of a minimum distance graph is isomorphic to that of the corresponding code.

Connected through hyperedge HE-1 (induced by source paper "computational complexity of reconstruction and isomorphism testing for designs and line graphs"):
  with members:
    - "authentication and secrecy codes for equiprobable source probability distributions"

Connected through hyperedge HE-2 (induced by source paper "the perfect binary one error correcting codes of length 15 part ii properties"):
  with members:
    - "the perfect binary one error correcting codes of length 15 part i classification"
    - "two optimal one error correcting codes of length 13 that are not doubly shortened perfect codes"

Connected through hyperedge HE-3 (induced by source paper "the perfect binary one error correcting codes of length 15 part i classification"):
  with members:
    - "the perfect binary one error correcting codes of length 15 part ii properties"

Connected through hyperedge HE-4 (induced by source paper "on the minimum distance graph of an extended preparata code"):
  with members:
    - "the perfect binary one error correcting codes of length 15 part i classification"

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)