{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V552ZVLGEEL46M5RWEAHH55XLU","short_pith_number":"pith:V552ZVLG","canonical_record":{"source":{"id":"1303.6046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-25T08:20:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67dd52ad5af387113dc326a6005ad47747e29f95f887c8e0f6afe43370432263","abstract_canon_sha256":"9a85db583d8ef557e48fa12f974cafb16cdffbc17082c879ca494c0826d1cc32"},"schema_version":"1.0"},"canonical_sha256":"af7bacd5662117cf33b1b10073f7b75d3844d8be6f24c7c27d4b783828dfac68","source":{"kind":"arxiv","id":"1303.6046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6046","created_at":"2026-05-18T03:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6046v1","created_at":"2026-05-18T03:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6046","created_at":"2026-05-18T03:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"V552ZVLGEEL4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V552ZVLGEEL46M5R","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V552ZVLG","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V552ZVLGEEL46M5RWEAHH55XLU","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-25T08:20:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67dd52ad5af387113dc326a6005ad47747e29f95f887c8e0f6afe43370432263","abstract_canon_sha256":"9a85db583d8ef557e48fa12f974cafb16cdffbc17082c879ca494c0826d1cc32"},"schema_version":"1.0"},"canonical_sha256":"af7bacd5662117cf33b1b10073f7b75d3844d8be6f24c7c27d4b783828dfac68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:52.117826Z","signature_b64":"EEqkziYm45ptsPwC5QB8KJ5Jp+QzbAPP7fSxGWEGFVerRENy9+hnYt4gE+/nsWggWsVfe6z6rjxyrd74MOZZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af7bacd5662117cf33b1b10073f7b75d3844d8be6f24c7c27d4b783828dfac68","last_reissued_at":"2026-05-18T03:29:52.117144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:52.117144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6046","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-18T03:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMB8pj/lwMHnkAXLCCVPIm5+4FBWnW45vF6ylmgBIG6O+PxFF6+aPb+RlUdDh5BwO+aMAI+U2JWdtjVGyv7TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:51:13.823143Z"},"content_sha256":"af519139921ee6e87baf22b6f3b92fde0c8001ba41595cff588429cae00491a8","schema_version":"1.0","event_id":"sha256:af519139921ee6e87baf22b6f3b92fde0c8001ba41595cff588429cae00491a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V552ZVLGEEL46M5RWEAHH55XLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimized-Cost Repair in Multi-hop Distributed Storage Systems with Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dengsheng Lin, Kenneth W. Shum, Majid Gerami, Mikael Skoglund, Ming Xiao","submitted_at":"2013-03-25T08:20:02Z","abstract_excerpt":"In distributed storage systems reliability is achieved through redundancy stored at different nodes in the network. Then a data collector can reconstruct source information even though some nodes fail. To maintain reliability, an autonomous and efficient protocol should be used to repair the failed node. The repair process causes traffic and consequently transmission cost in the network. Recent results found the optimal trafficstorage tradeoff, and proposed regenerating codes to achieve the optimality. We aim at minimizing the transmission cost in the repair process. We consider the network to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6046","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-18T03:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/iyf1X6VXxDt56tnuBLwRQ3Lxem8e8W6PikmOXxAjDakLbP8yOrn8+BWN4OM9+Sus9u7xnGlEcSRVd/Dn67AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:51:13.823901Z"},"content_sha256":"b6d5a84a5a70ad9d92ab85ca69f457ef58cb936191b5d28ac9454ca3a42d994f","schema_version":"1.0","event_id":"sha256:b6d5a84a5a70ad9d92ab85ca69f457ef58cb936191b5d28ac9454ca3a42d994f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V552ZVLGEEL46M5RWEAHH55XLU/bundle.json","state_url":"https://pith.science/pith/V552ZVLGEEL46M5RWEAHH55XLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V552ZVLGEEL46M5RWEAHH55XLU/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-30T17:51:13Z","links":{"resolver":"https://pith.science/pith/V552ZVLGEEL46M5RWEAHH55XLU","bundle":"https://pith.science/pith/V552ZVLGEEL46M5RWEAHH55XLU/bundle.json","state":"https://pith.science/pith/V552ZVLGEEL46M5RWEAHH55XLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V552ZVLGEEL46M5RWEAHH55XLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V552ZVLGEEL46M5RWEAHH55XLU","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":"9a85db583d8ef557e48fa12f974cafb16cdffbc17082c879ca494c0826d1cc32","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-25T08:20:02Z","title_canon_sha256":"67dd52ad5af387113dc326a6005ad47747e29f95f887c8e0f6afe43370432263"},"schema_version":"1.0","source":{"id":"1303.6046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6046","created_at":"2026-05-18T03:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6046v1","created_at":"2026-05-18T03:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6046","created_at":"2026-05-18T03:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"V552ZVLGEEL4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V552ZVLGEEL46M5R","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V552ZVLG","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:b6d5a84a5a70ad9d92ab85ca69f457ef58cb936191b5d28ac9454ca3a42d994f","target":"graph","created_at":"2026-05-18T03:29:52Z","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":"In distributed storage systems reliability is achieved through redundancy stored at different nodes in the network. Then a data collector can reconstruct source information even though some nodes fail. To maintain reliability, an autonomous and efficient protocol should be used to repair the failed node. The repair process causes traffic and consequently transmission cost in the network. Recent results found the optimal trafficstorage tradeoff, and proposed regenerating codes to achieve the optimality. We aim at minimizing the transmission cost in the repair process. We consider the network to","authors_text":"Dengsheng Lin, Kenneth W. Shum, Majid Gerami, Mikael Skoglund, Ming Xiao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-25T08:20:02Z","title":"Optimized-Cost Repair in Multi-hop Distributed Storage Systems with Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6046","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:af519139921ee6e87baf22b6f3b92fde0c8001ba41595cff588429cae00491a8","target":"record","created_at":"2026-05-18T03:29:52Z","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":"9a85db583d8ef557e48fa12f974cafb16cdffbc17082c879ca494c0826d1cc32","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-25T08:20:02Z","title_canon_sha256":"67dd52ad5af387113dc326a6005ad47747e29f95f887c8e0f6afe43370432263"},"schema_version":"1.0","source":{"id":"1303.6046","kind":"arxiv","version":1}},"canonical_sha256":"af7bacd5662117cf33b1b10073f7b75d3844d8be6f24c7c27d4b783828dfac68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af7bacd5662117cf33b1b10073f7b75d3844d8be6f24c7c27d4b783828dfac68","first_computed_at":"2026-05-18T03:29:52.117144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:52.117144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EEqkziYm45ptsPwC5QB8KJ5Jp+QzbAPP7fSxGWEGFVerRENy9+hnYt4gE+/nsWggWsVfe6z6rjxyrd74MOZZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:52.117826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af519139921ee6e87baf22b6f3b92fde0c8001ba41595cff588429cae00491a8","sha256:b6d5a84a5a70ad9d92ab85ca69f457ef58cb936191b5d28ac9454ca3a42d994f"],"state_sha256":"aeb8183ad44d90100a56484317c72616335ab460a49915202d7c164f408df5e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/T6+hDiJO7LzZLqGtQ8STmM9lrG89XtFXByKKcU3zn1txOCIrPGo0KcN5AaTCyIUM4WPIzSr+aNhkxBZnvpjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:51:13.827862Z","bundle_sha256":"0c4ba7eec67fd2fa8666de07f59eb1d39f77dfc4bb66ecdb1153b4630fc3c7eb"}}