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: "classification of poset block spaces admitting macwilliams type identity"
  Abstract: In this paper, we prove that a poset-block space admits a MacWilliams-type identity if and only if the poset is hierarchical, and at any level of the poset, all the blocks have the same dimension. When the poset-block admits the MacWilliams-type identity, we explicitly state the relation between the weight enumerators of a code and its dual.

Connected through hyperedge HE-1 (induced by source paper "combinatorial metrics macwilliams type identities isometries and extension property"):
  with members:
    - "metrics based on finite directed graphs and coding invariants"
    - "characterization of metrics induced by hierarchical posets"

Connected through hyperedge HE-2 (induced by source paper "metrics based on finite directed graphs and coding invariants"):
  with members:
    - "characterization of metrics induced by hierarchical posets"

Connected through hyperedge HE-3 (induced by source paper "linear codes on posets with extension property"):
  with members:
    - "the packing radius of a code and partitioning problems the case for poset metrics"
    - "a standard form for generator matrices with respect to the niederreiter rosenbloom tsfasman metric"
    - "bounds on ordered codes and orthogonal arrays"

Connected through hyperedge HE-4 (induced by source paper "fourier reflexive partitions and macwilliams identities for additive codes"):
  with members:
    - "macwilliams extension theorems and the local global property for codes over rings"
    - "partitions of frobenius rings induced by the homogeneous weight"
    - "second order weight distributions"
    - "on the existence of universally decodable matrices"
    - "the partition weight enumerator of mds codes and its applications"

Connected through hyperedge HE-5 (induced by source paper "coding in the presence of semantic value of information unequal error protection using poset decoders"):
  with members:
    - "unequal error protection an information theoretic perspective"
    - "bounds on ordered codes and orthogonal arrays"

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)