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: "repair duality with locally repairable and locally regenerating codes"
  Abstract: We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector codes with different vector length $\alpha$ (also called a sub-packetization level) that achieve the optimal repair bandwidth of MSR codes or near-optimal repair bandwidth depending on the sub-packetization level. We applied the technique of parity-splitting code construction. We show that the lower bound on the size of the finite field for the presented explicit code constructions can be lower than the one given in the work of Kamath et al. Finally, we discuss the importance of having two ways for node repair with locally regenerating HashTag codes: repair only with local parity nodes or repair with both local and global parity nodes. To the best of the authors' knowledge, this is the first work where this duality in repair process is discussed. We give a practical example and experimental results in Hadoop where we show the benefits of having this repair duality.

Connected through hyperedge HE-1 (induced by source paper "sok of used cryptography in blockchain"):
  with members:
    - "sef a secure fountain architecture for slashing storage costs in blockchains"
    - "dfinity technology overview series consensus system"
    - "celer network bring internet scale to every blockchain"
    - "raziel private and verifiable smart contracts on blockchains"
    - "blendcac a blockchain enabled decentralized capability based access control for iots"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "a survey on security and privacy issues of bitcoin"
    - "privacy preserving and efficient aggregation based on blockchain for power grid communications in smart communities"

Connected through hyperedge HE-2 (induced by source paper "network traffic driven storage repair"):
  with members:
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"
    - "codes with unequal locality"
    - "minimum storage regenerating codes for all parameters"
    - "general sub packetized access optimal regenerating codes"
    - "hashtag erasure codes from theory to practice"
    - "balanced locally repairable codes"

Connected through hyperedge HE-3 (induced by source paper "hashtag erasure codes from theory to practice"):
  with members:
    - "locally repairable and locally regenerating codes obtained by parity splitting of hashtag codes"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a new piggybacking design for systematic mds storage codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "zigzag codes mds array codes with optimal rebuilding"

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)