{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ECK5AVBTCHALLL7KYMSFIXAC6O","short_pith_number":"pith:ECK5AVBT","canonical_record":{"source":{"id":"1207.6744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-29T04:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"c90988ff48d4976f620e208623dd2473e9bb706882cccc3ecdc2a8251ef918ba","abstract_canon_sha256":"d9541737374ae6bf6e0e816248aec282693ccee83d75c4c45d636d508b93c704"},"schema_version":"1.0"},"canonical_sha256":"2095d0543311c0b5afeac324545c02f3bbe4734292baec70be5f4b48c8830114","source":{"kind":"arxiv","id":"1207.6744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6744","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6744v2","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6744","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"ECK5AVBTCHAL","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ECK5AVBTCHALLL7K","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ECK5AVBT","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ECK5AVBTCHALLL7KYMSFIXAC6O","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-29T04:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"c90988ff48d4976f620e208623dd2473e9bb706882cccc3ecdc2a8251ef918ba","abstract_canon_sha256":"d9541737374ae6bf6e0e816248aec282693ccee83d75c4c45d636d508b93c704"},"schema_version":"1.0"},"canonical_sha256":"2095d0543311c0b5afeac324545c02f3bbe4734292baec70be5f4b48c8830114","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:32.267730Z","signature_b64":"CXQCtkupmeEPfeUyUAvK9Pe0x2J/M85cPkDahjawd+3fTn6vYDDp1YxCbO10sTmtbUdemKROnA90Bo6tnpxwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2095d0543311c0b5afeac324545c02f3bbe4734292baec70be5f4b48c8830114","last_reissued_at":"2026-05-18T03:49:32.266736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:32.266736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6744","source_version":2,"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:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6OiBVH0pDRRroqjemgdk1uK41f9ozP07jUwQKznlRL8hNPvyjuPdd/S2zib1JtQm4CZ9FDplISrXtr9OU1fAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:11:29.189271Z"},"content_sha256":"8d8b61174ad0102d9828962faf43ad6cd525e2770489fa3b31adf0a0348638de","schema_version":"1.0","event_id":"sha256:8d8b61174ad0102d9828962faf43ad6cd525e2770489fa3b31adf0a0348638de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ECK5AVBTCHALLL7KYMSFIXAC6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RapidRAID: Pipelined Erasure Codes for Fast Data Archival in Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Frederique Oggier, Lluis Pamies-Juarez","submitted_at":"2012-07-29T04:27:44Z","abstract_excerpt":"To achieve reliability in distributed storage systems, data has usually been replicated across different nodes. However the increasing volume of data to be stored has motivated the introduction of erasure codes, a storage efficient alternative to replication, particularly suited for archival in data centers, where old datasets (rarely accessed) can be erasure encoded, while replicas are maintained only for the latest data. Many recent works consider the design of new storage-centric erasure codes for improved repairability. In contrast, this paper addresses the migration from replication to en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6744","kind":"arxiv","version":2},"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:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QORe5nzcH4w/GA3ueZXWqjMhnnmlg8KQ8C1+AQ1p5ICMD9srJIN/+ukRtuvUKrYOMkxiKow+oFJJbpyCXdFxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:11:29.189885Z"},"content_sha256":"d390446c288eade09e8852dcc03354044c411195ae2ad816ba3038af9a8cbb58","schema_version":"1.0","event_id":"sha256:d390446c288eade09e8852dcc03354044c411195ae2ad816ba3038af9a8cbb58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECK5AVBTCHALLL7KYMSFIXAC6O/bundle.json","state_url":"https://pith.science/pith/ECK5AVBTCHALLL7KYMSFIXAC6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECK5AVBTCHALLL7KYMSFIXAC6O/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-27T12:11:29Z","links":{"resolver":"https://pith.science/pith/ECK5AVBTCHALLL7KYMSFIXAC6O","bundle":"https://pith.science/pith/ECK5AVBTCHALLL7KYMSFIXAC6O/bundle.json","state":"https://pith.science/pith/ECK5AVBTCHALLL7KYMSFIXAC6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECK5AVBTCHALLL7KYMSFIXAC6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ECK5AVBTCHALLL7KYMSFIXAC6O","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":"d9541737374ae6bf6e0e816248aec282693ccee83d75c4c45d636d508b93c704","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-29T04:27:44Z","title_canon_sha256":"c90988ff48d4976f620e208623dd2473e9bb706882cccc3ecdc2a8251ef918ba"},"schema_version":"1.0","source":{"id":"1207.6744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6744","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6744v2","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6744","created_at":"2026-05-18T03:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"ECK5AVBTCHAL","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ECK5AVBTCHALLL7K","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ECK5AVBT","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:d390446c288eade09e8852dcc03354044c411195ae2ad816ba3038af9a8cbb58","target":"graph","created_at":"2026-05-18T03:49:32Z","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 achieve reliability in distributed storage systems, data has usually been replicated across different nodes. However the increasing volume of data to be stored has motivated the introduction of erasure codes, a storage efficient alternative to replication, particularly suited for archival in data centers, where old datasets (rarely accessed) can be erasure encoded, while replicas are maintained only for the latest data. Many recent works consider the design of new storage-centric erasure codes for improved repairability. In contrast, this paper addresses the migration from replication to en","authors_text":"Anwitaman Datta, Frederique Oggier, Lluis Pamies-Juarez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-29T04:27:44Z","title":"RapidRAID: Pipelined Erasure Codes for Fast Data Archival in Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6744","kind":"arxiv","version":2},"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:8d8b61174ad0102d9828962faf43ad6cd525e2770489fa3b31adf0a0348638de","target":"record","created_at":"2026-05-18T03:49:32Z","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":"d9541737374ae6bf6e0e816248aec282693ccee83d75c4c45d636d508b93c704","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-29T04:27:44Z","title_canon_sha256":"c90988ff48d4976f620e208623dd2473e9bb706882cccc3ecdc2a8251ef918ba"},"schema_version":"1.0","source":{"id":"1207.6744","kind":"arxiv","version":2}},"canonical_sha256":"2095d0543311c0b5afeac324545c02f3bbe4734292baec70be5f4b48c8830114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2095d0543311c0b5afeac324545c02f3bbe4734292baec70be5f4b48c8830114","first_computed_at":"2026-05-18T03:49:32.266736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:32.266736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CXQCtkupmeEPfeUyUAvK9Pe0x2J/M85cPkDahjawd+3fTn6vYDDp1YxCbO10sTmtbUdemKROnA90Bo6tnpxwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:32.267730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d8b61174ad0102d9828962faf43ad6cd525e2770489fa3b31adf0a0348638de","sha256:d390446c288eade09e8852dcc03354044c411195ae2ad816ba3038af9a8cbb58"],"state_sha256":"4266ebec55c5504f3f0bb1412d4165fdc4d52187f8912de66176e36b14e83bca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKGrGNn4tF8xrZ0YKqGjjoHwFVCOr6mdnqghFcxxr0LZq+8iRZUqyLaihSGr05kJkmLZqj4DYP4/kl5sJ1LHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:11:29.193399Z","bundle_sha256":"6e8b416b5a9cd7255f79369d44a38f088a215c92cd188366672df82d406e9781"}}