{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2ZXOFWILL43D6UFROPT62B4CRN","short_pith_number":"pith:2ZXOFWIL","canonical_record":{"source":{"id":"1604.06567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T08:25:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"caf293e1cc710c51d5b4eb5bed2e74e2a91b7e5df66cd3dfd1a8671a8f6702c8","abstract_canon_sha256":"60fb84a0acb1992e26497d0a8d739c41bd2ec21920f74962a97ed3f8643f92f3"},"schema_version":"1.0"},"canonical_sha256":"d66ee2d90b5f363f50b173e7ed07828b780d6c7809d6343e91f074cb87ef53ac","source":{"kind":"arxiv","id":"1604.06567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06567","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06567v1","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06567","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"2ZXOFWILL43D","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZXOFWILL43D6UFR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZXOFWIL","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2ZXOFWILL43D6UFROPT62B4CRN","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T08:25:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"caf293e1cc710c51d5b4eb5bed2e74e2a91b7e5df66cd3dfd1a8671a8f6702c8","abstract_canon_sha256":"60fb84a0acb1992e26497d0a8d739c41bd2ec21920f74962a97ed3f8643f92f3"},"schema_version":"1.0"},"canonical_sha256":"d66ee2d90b5f363f50b173e7ed07828b780d6c7809d6343e91f074cb87ef53ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.759498Z","signature_b64":"Ripy24i3lRDC51S7xlZhx+U+tX5A4nGwNbjnpjYgpIyyPwyM+LHIjy5VaSWwP1QMzqdcfpDQN+RkEZLX67vPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d66ee2d90b5f363f50b173e7ed07828b780d6c7809d6343e91f074cb87ef53ac","last_reissued_at":"2026-05-18T01:16:28.758882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.758882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06567","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-05-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/56VWzrWT8sLGhTnAkNoxoibE/kDuBg6330N2VTPE9s26xlHg2hZJXcpnsqArnPl0qwc0j7uM5EcbTnEdi2lAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:46.500198Z"},"content_sha256":"2aff23c012a04b339ed0d05219b123617215eb4e1ce8eb9dc7709e9fff64a946","schema_version":"1.0","event_id":"sha256:2aff23c012a04b339ed0d05219b123617215eb4e1ce8eb9dc7709e9fff64a946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2ZXOFWILL43D6UFROPT62B4CRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concurrent Regenerating Codes and Scalable Application in Network Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanxu Hou, Huayu Zhang, Hui Li, K. W. Shum, ShuoYen Robert Li","submitted_at":"2016-04-22T08:25:00Z","abstract_excerpt":"To recover simultaneous multiple failures in erasure coded storage systems, Patrick Lee et al introduce concurrent repair based minimal storage regenerating codes to reduce repair traffic. The architecture of this approach is simpler and more practical than that of the cooperative mechanism in non-fully distributed environment, hence this paper unifies such class of regenerating codes as concurrent regenerating codes and further studies its characteristics by analyzing cut-based information flow graph in the multiple-node recovery model. We present a general storage-bandwidth tradeoff and give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06567","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":""},"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-05-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHKQ03ILAi87UpZhsQkKifwPs2AMyxRlMVlLVDceXlhMevzB2tDZMgq/29ubFn0z7PtdGqu/6CBFnYZr+/BCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:46.500769Z"},"content_sha256":"553e53dd58bb832654290e1e63c3bf0d4ac7d2fcd74c0b03587afb92dd13f134","schema_version":"1.0","event_id":"sha256:553e53dd58bb832654290e1e63c3bf0d4ac7d2fcd74c0b03587afb92dd13f134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZXOFWILL43D6UFROPT62B4CRN/bundle.json","state_url":"https://pith.science/pith/2ZXOFWILL43D6UFROPT62B4CRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZXOFWILL43D6UFROPT62B4CRN/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-05-26T14:12:46Z","links":{"resolver":"https://pith.science/pith/2ZXOFWILL43D6UFROPT62B4CRN","bundle":"https://pith.science/pith/2ZXOFWILL43D6UFROPT62B4CRN/bundle.json","state":"https://pith.science/pith/2ZXOFWILL43D6UFROPT62B4CRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZXOFWILL43D6UFROPT62B4CRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2ZXOFWILL43D6UFROPT62B4CRN","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":"60fb84a0acb1992e26497d0a8d739c41bd2ec21920f74962a97ed3f8643f92f3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T08:25:00Z","title_canon_sha256":"caf293e1cc710c51d5b4eb5bed2e74e2a91b7e5df66cd3dfd1a8671a8f6702c8"},"schema_version":"1.0","source":{"id":"1604.06567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06567","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06567v1","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06567","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"2ZXOFWILL43D","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZXOFWILL43D6UFR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZXOFWIL","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:553e53dd58bb832654290e1e63c3bf0d4ac7d2fcd74c0b03587afb92dd13f134","target":"graph","created_at":"2026-05-18T01:16:28Z","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"},"paper":{"abstract_excerpt":"To recover simultaneous multiple failures in erasure coded storage systems, Patrick Lee et al introduce concurrent repair based minimal storage regenerating codes to reduce repair traffic. The architecture of this approach is simpler and more practical than that of the cooperative mechanism in non-fully distributed environment, hence this paper unifies such class of regenerating codes as concurrent regenerating codes and further studies its characteristics by analyzing cut-based information flow graph in the multiple-node recovery model. We present a general storage-bandwidth tradeoff and give","authors_text":"Hanxu Hou, Huayu Zhang, Hui Li, K. W. Shum, ShuoYen Robert Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T08:25:00Z","title":"Concurrent Regenerating Codes and Scalable Application in Network Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06567","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:2aff23c012a04b339ed0d05219b123617215eb4e1ce8eb9dc7709e9fff64a946","target":"record","created_at":"2026-05-18T01:16:28Z","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":"60fb84a0acb1992e26497d0a8d739c41bd2ec21920f74962a97ed3f8643f92f3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T08:25:00Z","title_canon_sha256":"caf293e1cc710c51d5b4eb5bed2e74e2a91b7e5df66cd3dfd1a8671a8f6702c8"},"schema_version":"1.0","source":{"id":"1604.06567","kind":"arxiv","version":1}},"canonical_sha256":"d66ee2d90b5f363f50b173e7ed07828b780d6c7809d6343e91f074cb87ef53ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d66ee2d90b5f363f50b173e7ed07828b780d6c7809d6343e91f074cb87ef53ac","first_computed_at":"2026-05-18T01:16:28.758882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:28.758882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ripy24i3lRDC51S7xlZhx+U+tX5A4nGwNbjnpjYgpIyyPwyM+LHIjy5VaSWwP1QMzqdcfpDQN+RkEZLX67vPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:28.759498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aff23c012a04b339ed0d05219b123617215eb4e1ce8eb9dc7709e9fff64a946","sha256:553e53dd58bb832654290e1e63c3bf0d4ac7d2fcd74c0b03587afb92dd13f134"],"state_sha256":"46e20ad7846d441165b436e6a859f8c4ad9bc3962fc06e5300edec3045fb59af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFJ/WiCZaDOfNSbnWcuingkeyl0GnFYAiGNS4ZVjp4/6Yfm4Skd66QPubpqX/WIi7r9M/RbFvkl6KWlY6+5QAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:12:46.503961Z","bundle_sha256":"06af29a682943c96ae2d0228cd393481db5bcbca11b7c699512647083480a169"}}