{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JQQJVR56AZPBLUP5UWFWR4KL2J","short_pith_number":"pith:JQQJVR56","canonical_record":{"source":{"id":"2309.01963","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T05:35:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac8f604e44bda6b5c0da8f2cf4549f0e51c8ee1a8c032f201604ce80b5660fb7","abstract_canon_sha256":"1c1e5be33121d4ba4ba3a4f4667d1fd9e6a06fd6a52d9f7179af53b4a3d69f68"},"schema_version":"1.0"},"canonical_sha256":"4c209ac7be065e15d1fda58b68f14bd2764d959b17b6e84811a1777d7db4953d","source":{"kind":"arxiv","id":"2309.01963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.01963","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"2309.01963v1","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.01963","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"JQQJVR56AZPB","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"pith_short_16","alias_value":"JQQJVR56AZPBLUP5","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"pith_short_8","alias_value":"JQQJVR56","created_at":"2026-07-05T06:47:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JQQJVR56AZPBLUP5UWFWR4KL2J","target":"record","payload":{"canonical_record":{"source":{"id":"2309.01963","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T05:35:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac8f604e44bda6b5c0da8f2cf4549f0e51c8ee1a8c032f201604ce80b5660fb7","abstract_canon_sha256":"1c1e5be33121d4ba4ba3a4f4667d1fd9e6a06fd6a52d9f7179af53b4a3d69f68"},"schema_version":"1.0"},"canonical_sha256":"4c209ac7be065e15d1fda58b68f14bd2764d959b17b6e84811a1777d7db4953d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:45.822111Z","signature_b64":"LvQRJWNRATxCX/vjLVrevlc+v1XvlKp/wlIlW1LMS5L1FbUVEpiJ0lP0cF1Nltv0GbvJXGtFQ9XxjJ931IBZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c209ac7be065e15d1fda58b68f14bd2764d959b17b6e84811a1777d7db4953d","last_reissued_at":"2026-07-05T06:47:45.821727Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:45.821727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.01963","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NUo1RTxPi/CcKdAJtMsFXBKltEuE2JdheTOW1NQpMSKmAIyCWRys05ARfcOkZREsL6mMd5sNO+QZn3wxfLoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:47:17.752167Z"},"content_sha256":"fdeec25ec5edcc046322687802951d478e893a953629b8b3d22f8cb1034f64aa","schema_version":"1.0","event_id":"sha256:fdeec25ec5edcc046322687802951d478e893a953629b8b3d22f8cb1034f64aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JQQJVR56AZPBLUP5UWFWR4KL2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Simple Regenerating Codes: Trading Sub-packetization and Fault Tolerance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Bai, Gong Zhang, Hanxu Hou, Hao Shi, Zhengyi Jiang, Zhongyi Huang","submitted_at":"2023-09-05T05:35:13Z","abstract_excerpt":"Maximum distance separable (MDS) codes have the optimal trade-off between storage efficiency and fault tolerance, which are widely used in distributed storage systems. As typical non-MDS codes, simple regenerating codes (SRCs) can achieve both smaller repair bandwidth and smaller repair locality than traditional MDS codes in repairing single-node erasure.\n  In this paper, we propose {\\em generalized simple regenerating codes} (GSRCs) that can support much more parameters than that of SRCs. We show that there is a trade-off between sub-packetization and fault tolerance in our GSRCs, and SRCs ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.01963","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.01963/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/ks35wl57T17x2bP7vzdtr/Z2gkTOQChtXCjLFsYrOIamy5uW6jz/LSspblSyYkAGhBytPo9jf53uLXzCggBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:47:17.752901Z"},"content_sha256":"f16818264ec6bc2eb6a68ad96e1f9957e247c81836835568160a15ed6a5a914c","schema_version":"1.0","event_id":"sha256:f16818264ec6bc2eb6a68ad96e1f9957e247c81836835568160a15ed6a5a914c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQQJVR56AZPBLUP5UWFWR4KL2J/bundle.json","state_url":"https://pith.science/pith/JQQJVR56AZPBLUP5UWFWR4KL2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQQJVR56AZPBLUP5UWFWR4KL2J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T15:47:17Z","links":{"resolver":"https://pith.science/pith/JQQJVR56AZPBLUP5UWFWR4KL2J","bundle":"https://pith.science/pith/JQQJVR56AZPBLUP5UWFWR4KL2J/bundle.json","state":"https://pith.science/pith/JQQJVR56AZPBLUP5UWFWR4KL2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQQJVR56AZPBLUP5UWFWR4KL2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JQQJVR56AZPBLUP5UWFWR4KL2J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1c1e5be33121d4ba4ba3a4f4667d1fd9e6a06fd6a52d9f7179af53b4a3d69f68","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T05:35:13Z","title_canon_sha256":"ac8f604e44bda6b5c0da8f2cf4549f0e51c8ee1a8c032f201604ce80b5660fb7"},"schema_version":"1.0","source":{"id":"2309.01963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.01963","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"2309.01963v1","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.01963","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"JQQJVR56AZPB","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"pith_short_16","alias_value":"JQQJVR56AZPBLUP5","created_at":"2026-07-05T06:47:45Z"},{"alias_kind":"pith_short_8","alias_value":"JQQJVR56","created_at":"2026-07-05T06:47:45Z"}],"graph_snapshots":[{"event_id":"sha256:f16818264ec6bc2eb6a68ad96e1f9957e247c81836835568160a15ed6a5a914c","target":"graph","created_at":"2026-07-05T06:47:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.01963/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maximum distance separable (MDS) codes have the optimal trade-off between storage efficiency and fault tolerance, which are widely used in distributed storage systems. As typical non-MDS codes, simple regenerating codes (SRCs) can achieve both smaller repair bandwidth and smaller repair locality than traditional MDS codes in repairing single-node erasure.\n  In this paper, we propose {\\em generalized simple regenerating codes} (GSRCs) that can support much more parameters than that of SRCs. We show that there is a trade-off between sub-packetization and fault tolerance in our GSRCs, and SRCs ac","authors_text":"Bo Bai, Gong Zhang, Hanxu Hou, Hao Shi, Zhengyi Jiang, Zhongyi Huang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T05:35:13Z","title":"Generalized Simple Regenerating Codes: Trading Sub-packetization and Fault Tolerance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.01963","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fdeec25ec5edcc046322687802951d478e893a953629b8b3d22f8cb1034f64aa","target":"record","created_at":"2026-07-05T06:47:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1c1e5be33121d4ba4ba3a4f4667d1fd9e6a06fd6a52d9f7179af53b4a3d69f68","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T05:35:13Z","title_canon_sha256":"ac8f604e44bda6b5c0da8f2cf4549f0e51c8ee1a8c032f201604ce80b5660fb7"},"schema_version":"1.0","source":{"id":"2309.01963","kind":"arxiv","version":1}},"canonical_sha256":"4c209ac7be065e15d1fda58b68f14bd2764d959b17b6e84811a1777d7db4953d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c209ac7be065e15d1fda58b68f14bd2764d959b17b6e84811a1777d7db4953d","first_computed_at":"2026-07-05T06:47:45.821727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:47:45.821727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LvQRJWNRATxCX/vjLVrevlc+v1XvlKp/wlIlW1LMS5L1FbUVEpiJ0lP0cF1Nltv0GbvJXGtFQ9XxjJ931IBZCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:47:45.822111Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.01963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdeec25ec5edcc046322687802951d478e893a953629b8b3d22f8cb1034f64aa","sha256:f16818264ec6bc2eb6a68ad96e1f9957e247c81836835568160a15ed6a5a914c"],"state_sha256":"e00bb4df90ffa68bd087ca5ae86da5cf4bc47aa5c6cab73110ae0292a74ccd4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCch601wPcWJP/HdSP+QWyvd3GBH/xU1ku45n+pignfkza2d8h/WXitB5MX1trjQb2I/FaN2upPel5ZmMwGhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:47:17.756709Z","bundle_sha256":"7501d4919ef22a3445033cd8a97096205e6bbb3ebcd6a499a16f97822efceecd"}}