{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KB54CWKNZR5MCGHDLM2ERIYDQN","short_pith_number":"pith:KB54CWKN","canonical_record":{"source":{"id":"1603.05163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-16T16:11:35Z","cross_cats_sorted":[],"title_canon_sha256":"308c73b1c8eaced27144156a8cadbcee421458590f3ced373be23aa1ab7b9bf2","abstract_canon_sha256":"90bf8f992cdfab5f5e2c4f76eb45e6722186b8878de368d0b604803d0eeb12cd"},"schema_version":"1.0"},"canonical_sha256":"507bc1594dcc7ac118e35b3448a30383627929e642fcbdb3cad42118bb290d22","source":{"kind":"arxiv","id":"1603.05163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05163","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05163v1","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05163","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"KB54CWKNZR5M","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KB54CWKNZR5MCGHD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KB54CWKN","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KB54CWKNZR5MCGHDLM2ERIYDQN","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-16T16:11:35Z","cross_cats_sorted":[],"title_canon_sha256":"308c73b1c8eaced27144156a8cadbcee421458590f3ced373be23aa1ab7b9bf2","abstract_canon_sha256":"90bf8f992cdfab5f5e2c4f76eb45e6722186b8878de368d0b604803d0eeb12cd"},"schema_version":"1.0"},"canonical_sha256":"507bc1594dcc7ac118e35b3448a30383627929e642fcbdb3cad42118bb290d22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:57.940188Z","signature_b64":"wvE8+l7ImyOnNXNh92MPIqDZXODBwAO2yFbYMA/ECNZrvC8lBuvIh0QqUU/b7G5A+lvlUUX52P6zvRKzMnxJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"507bc1594dcc7ac118e35b3448a30383627929e642fcbdb3cad42118bb290d22","last_reissued_at":"2026-05-18T01:18:57.939818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:57.939818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05163","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:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncb/47KE3m55kh0EajNG5EbeAbKVPcmlDcJk3lGyDRe87joV2Wx/k4rz3CIXOQIdn7qrSvVYgjxCGQe7ntlyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:55:28.369198Z"},"content_sha256":"1f97a8e82c1f09b2ad9373aa85a66e717300705f230fef16aa14fe3d57098df4","schema_version":"1.0","event_id":"sha256:1f97a8e82c1f09b2ad9373aa85a66e717300705f230fef16aa14fe3d57098df4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KB54CWKNZR5MCGHDLM2ERIYDQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Data Regeneration for Distributed Storage Systems with Heterogeneous Link Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongsheng Wei, Xin Wang, Xunrui Yin, Yan Wang, Yucheng He","submitted_at":"2016-03-16T16:11:35Z","abstract_excerpt":"Distributed storage systems provide large-scale reliable data storage services by spreading redundancy across a large group of storage nodes. In such a large system, node failures take place on a regular basis. When a storage node breaks down, a replacement node is expected to regenerate the redundant data as soon as possible in order to maintain the same level of redundancy. Previous results have been mainly focused on the minimization of network traffic in regeneration. However, in practical networks, where link capacities vary in a wide range, minimizing network traffic does not always yiel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05163","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:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BIgCZrIx9KlUNwlJSAzY2sb57ClNogQLAHPfaIre9oyUmyWyh737fpsQv/LAJIs4xBnSkJLBDJ9rTw4Ad+Z/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:55:28.370040Z"},"content_sha256":"cc17423569e99ea6ca6a38d3a38c7d1c8cb7c77a715fb79cc82b54b6b65ef007","schema_version":"1.0","event_id":"sha256:cc17423569e99ea6ca6a38d3a38c7d1c8cb7c77a715fb79cc82b54b6b65ef007"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KB54CWKNZR5MCGHDLM2ERIYDQN/bundle.json","state_url":"https://pith.science/pith/KB54CWKNZR5MCGHDLM2ERIYDQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KB54CWKNZR5MCGHDLM2ERIYDQN/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-06-01T00:55:28Z","links":{"resolver":"https://pith.science/pith/KB54CWKNZR5MCGHDLM2ERIYDQN","bundle":"https://pith.science/pith/KB54CWKNZR5MCGHDLM2ERIYDQN/bundle.json","state":"https://pith.science/pith/KB54CWKNZR5MCGHDLM2ERIYDQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KB54CWKNZR5MCGHDLM2ERIYDQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KB54CWKNZR5MCGHDLM2ERIYDQN","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":"90bf8f992cdfab5f5e2c4f76eb45e6722186b8878de368d0b604803d0eeb12cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-16T16:11:35Z","title_canon_sha256":"308c73b1c8eaced27144156a8cadbcee421458590f3ced373be23aa1ab7b9bf2"},"schema_version":"1.0","source":{"id":"1603.05163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05163","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05163v1","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05163","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"KB54CWKNZR5M","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KB54CWKNZR5MCGHD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KB54CWKN","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:cc17423569e99ea6ca6a38d3a38c7d1c8cb7c77a715fb79cc82b54b6b65ef007","target":"graph","created_at":"2026-05-18T01:18:57Z","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":"Distributed storage systems provide large-scale reliable data storage services by spreading redundancy across a large group of storage nodes. In such a large system, node failures take place on a regular basis. When a storage node breaks down, a replacement node is expected to regenerate the redundant data as soon as possible in order to maintain the same level of redundancy. Previous results have been mainly focused on the minimization of network traffic in regeneration. However, in practical networks, where link capacities vary in a wide range, minimizing network traffic does not always yiel","authors_text":"Dongsheng Wei, Xin Wang, Xunrui Yin, Yan Wang, Yucheng He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-16T16:11:35Z","title":"Accelerating Data Regeneration for Distributed Storage Systems with Heterogeneous Link Capacities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05163","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:1f97a8e82c1f09b2ad9373aa85a66e717300705f230fef16aa14fe3d57098df4","target":"record","created_at":"2026-05-18T01:18:57Z","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":"90bf8f992cdfab5f5e2c4f76eb45e6722186b8878de368d0b604803d0eeb12cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-16T16:11:35Z","title_canon_sha256":"308c73b1c8eaced27144156a8cadbcee421458590f3ced373be23aa1ab7b9bf2"},"schema_version":"1.0","source":{"id":"1603.05163","kind":"arxiv","version":1}},"canonical_sha256":"507bc1594dcc7ac118e35b3448a30383627929e642fcbdb3cad42118bb290d22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"507bc1594dcc7ac118e35b3448a30383627929e642fcbdb3cad42118bb290d22","first_computed_at":"2026-05-18T01:18:57.939818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:57.939818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wvE8+l7ImyOnNXNh92MPIqDZXODBwAO2yFbYMA/ECNZrvC8lBuvIh0QqUU/b7G5A+lvlUUX52P6zvRKzMnxJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:57.940188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f97a8e82c1f09b2ad9373aa85a66e717300705f230fef16aa14fe3d57098df4","sha256:cc17423569e99ea6ca6a38d3a38c7d1c8cb7c77a715fb79cc82b54b6b65ef007"],"state_sha256":"2822b8694381781e1237de07b2790919c8fc177beee5e8cae9020f8c1c3eff5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBnAYL1iRbmzqR3W2GCD2Ykr4uLq4rcaPyPMkEiZBhzMUcHjwDWG9tZR+aSYEyjHybTcRaDCBWV6e5cAcwI0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:55:28.374981Z","bundle_sha256":"2912c5a3266b91d19823fc799db793c8b816317cc335792c106da27f2aa7f73d"}}