{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VRWZX56Y3DCMCZCSAPQ3LZRQEM","short_pith_number":"pith:VRWZX56Y","canonical_record":{"source":{"id":"1206.4175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-19T11:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"677bdbbb32aeeca660f7e4174e0ba8a0c45d40c5cabb707c0b88e18b355b4059","abstract_canon_sha256":"b23d22bc37d497ce27f96fe3424745fbf816afbd22dda52fdf04995abaff0b77"},"schema_version":"1.0"},"canonical_sha256":"ac6d9bf7d8d8c4c1645203e1b5e6302325d71d37eff2e5a457604994c59f7b51","source":{"kind":"arxiv","id":"1206.4175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4175","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4175v1","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4175","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"VRWZX56Y3DCM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VRWZX56Y3DCMCZCS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VRWZX56Y","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VRWZX56Y3DCMCZCSAPQ3LZRQEM","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-19T11:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"677bdbbb32aeeca660f7e4174e0ba8a0c45d40c5cabb707c0b88e18b355b4059","abstract_canon_sha256":"b23d22bc37d497ce27f96fe3424745fbf816afbd22dda52fdf04995abaff0b77"},"schema_version":"1.0"},"canonical_sha256":"ac6d9bf7d8d8c4c1645203e1b5e6302325d71d37eff2e5a457604994c59f7b51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:16.539493Z","signature_b64":"xoa7IKZt6ebKIIvvxGv0j4/VXwY12/S+7yO/uoH569ACkoMNGY4oWt9YMHKv299A+ye7LbmxPxvGMr+4x9ofCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac6d9bf7d8d8c4c1645203e1b5e6302325d71d37eff2e5a457604994c59f7b51","last_reissued_at":"2026-05-18T03:53:16.538820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:16.538820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4175","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:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsuhbu5fgdotlQDUrMtjVYNFwK3bpFCwvkR2YtP94xDuRzoails831kXxNpI1LHhwgprQ8X5gZmitQSeRGhqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:14:53.803454Z"},"content_sha256":"a93f7d522445dd72149f3b410dce0aeef40a35d908236fd6522503fe49e9c78b","schema_version":"1.0","event_id":"sha256:a93f7d522445dd72149f3b410dce0aeef40a35d908236fd6522503fe49e9c78b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VRWZX56Y3DCMCZCSAPQ3LZRQEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustered Network Coding for Maintenance in Practical Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandre van Kempen, Anne-Marie Kermarrec, Erwan Le Merrer, Gilles Straub","submitted_at":"2012-06-19T11:01:42Z","abstract_excerpt":"Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead during the maintenance process. In this paper we propose a novel erasure-coded framework especially tailored for networked storage systems. Our approach relies on the use of random codes coupled with a clustered placement strategy, enabling the maintenance of a failed machine at the granularity of multiple files. Our repair protocol leverages network coding techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4175","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:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nChsGwAnct9HlOngpnVcsBk14sEPkv1v0RnD0GLkB8o3fCW9ip/SuAZ5878T6MtmBF5NAyJgoQp1y5YlC79dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:14:53.803838Z"},"content_sha256":"048d2b40aed448e5cbc5c3c58de9f8ab33f259011931ef997eb14be50c02a79b","schema_version":"1.0","event_id":"sha256:048d2b40aed448e5cbc5c3c58de9f8ab33f259011931ef997eb14be50c02a79b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRWZX56Y3DCMCZCSAPQ3LZRQEM/bundle.json","state_url":"https://pith.science/pith/VRWZX56Y3DCMCZCSAPQ3LZRQEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRWZX56Y3DCMCZCSAPQ3LZRQEM/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-30T20:14:53Z","links":{"resolver":"https://pith.science/pith/VRWZX56Y3DCMCZCSAPQ3LZRQEM","bundle":"https://pith.science/pith/VRWZX56Y3DCMCZCSAPQ3LZRQEM/bundle.json","state":"https://pith.science/pith/VRWZX56Y3DCMCZCSAPQ3LZRQEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRWZX56Y3DCMCZCSAPQ3LZRQEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VRWZX56Y3DCMCZCSAPQ3LZRQEM","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":"b23d22bc37d497ce27f96fe3424745fbf816afbd22dda52fdf04995abaff0b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-19T11:01:42Z","title_canon_sha256":"677bdbbb32aeeca660f7e4174e0ba8a0c45d40c5cabb707c0b88e18b355b4059"},"schema_version":"1.0","source":{"id":"1206.4175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4175","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4175v1","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4175","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"VRWZX56Y3DCM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VRWZX56Y3DCMCZCS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VRWZX56Y","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:048d2b40aed448e5cbc5c3c58de9f8ab33f259011931ef997eb14be50c02a79b","target":"graph","created_at":"2026-05-18T03:53:16Z","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":"Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead during the maintenance process. In this paper we propose a novel erasure-coded framework especially tailored for networked storage systems. Our approach relies on the use of random codes coupled with a clustered placement strategy, enabling the maintenance of a failed machine at the granularity of multiple files. Our repair protocol leverages network coding techn","authors_text":"Alexandre van Kempen, Anne-Marie Kermarrec, Erwan Le Merrer, Gilles Straub","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-19T11:01:42Z","title":"Clustered Network Coding for Maintenance in Practical Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4175","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:a93f7d522445dd72149f3b410dce0aeef40a35d908236fd6522503fe49e9c78b","target":"record","created_at":"2026-05-18T03:53:16Z","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":"b23d22bc37d497ce27f96fe3424745fbf816afbd22dda52fdf04995abaff0b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-19T11:01:42Z","title_canon_sha256":"677bdbbb32aeeca660f7e4174e0ba8a0c45d40c5cabb707c0b88e18b355b4059"},"schema_version":"1.0","source":{"id":"1206.4175","kind":"arxiv","version":1}},"canonical_sha256":"ac6d9bf7d8d8c4c1645203e1b5e6302325d71d37eff2e5a457604994c59f7b51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac6d9bf7d8d8c4c1645203e1b5e6302325d71d37eff2e5a457604994c59f7b51","first_computed_at":"2026-05-18T03:53:16.538820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:16.538820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xoa7IKZt6ebKIIvvxGv0j4/VXwY12/S+7yO/uoH569ACkoMNGY4oWt9YMHKv299A+ye7LbmxPxvGMr+4x9ofCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:16.539493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a93f7d522445dd72149f3b410dce0aeef40a35d908236fd6522503fe49e9c78b","sha256:048d2b40aed448e5cbc5c3c58de9f8ab33f259011931ef997eb14be50c02a79b"],"state_sha256":"6c381f40b410fa2d868169ea6b96c646006f9f8b29bfd61dc3fb486fdb82dd92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZKV7KdihZVveClNAdLpVFmM/d/0z+HS8rmNZlXFgQvVSnLOAqTF/VRDgSmZlrT5IpzaK+qbvs3GBE8dl/SKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:14:53.806470Z","bundle_sha256":"68e7be433a362cb26307bce67d9c03c8f4653db9d672c0b09416733df1ba374a"}}