{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AGYG5P74ZTV5ZVHVGAZBBZQ243","short_pith_number":"pith:AGYG5P74","schema_version":"1.0","canonical_sha256":"01b06ebffcccebdcd4f5303210e61ae6f7ea1d962f08819aa7803d394354b43a","source":{"kind":"arxiv","id":"1204.5028","version":3},"attestation_state":"computed","paper":{"title":"Regenerating Codes: A System Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Alexandre van Kempen, Anne-Marie Kermarrec, Gilles Straub, Nicolas Le Scouarnec, Steve Jiekak","submitted_at":"2012-04-23T11:17:15Z","abstract_excerpt":"The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between storage and availability. Regenerating codes are good candidates for they also offer low repair costs in term of network bandwidth. While they have been proven optimal, they are difficult to understand and parameterize. In this paper we provide an analysis of regenerating codes for practitioners to grasp the various trade-offs. More specifically we make two co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1204.5028","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-23T11:17:15Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"50d8d62d3f063a530951504cc04ffea9926a75b6d2e6c527b67ab35cc9cf669d","abstract_canon_sha256":"cb8b05168c1ff2a35c212c9926d9a8ed53ac443d876490d03f91f115af1e030a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.515910Z","signature_b64":"OmKvuPgNHBsJgWkIYkb0TThZaSTrb6qFvT4Zc5xVJHU3f3It8r6xkoW9/cmYDLfWqd+hcu2PCDe6AfQJ84fGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b06ebffcccebdcd4f5303210e61ae6f7ea1d962f08819aa7803d394354b43a","last_reissued_at":"2026-05-18T00:48:43.515348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.515348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regenerating Codes: A System Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Alexandre van Kempen, Anne-Marie Kermarrec, Gilles Straub, Nicolas Le Scouarnec, Steve Jiekak","submitted_at":"2012-04-23T11:17:15Z","abstract_excerpt":"The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between storage and availability. Regenerating codes are good candidates for they also offer low repair costs in term of network bandwidth. While they have been proven optimal, they are difficult to understand and parameterize. In this paper we provide an analysis of regenerating codes for practitioners to grasp the various trade-offs. More specifically we make two co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5028","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.5028","created_at":"2026-05-18T00:48:43.515431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5028v3","created_at":"2026-05-18T00:48:43.515431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5028","created_at":"2026-05-18T00:48:43.515431+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGYG5P74ZTV5","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGYG5P74ZTV5ZVHV","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGYG5P74","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243","json":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243.json","graph_json":"https://pith.science/api/pith-number/AGYG5P74ZTV5ZVHVGAZBBZQ243/graph.json","events_json":"https://pith.science/api/pith-number/AGYG5P74ZTV5ZVHVGAZBBZQ243/events.json","paper":"https://pith.science/paper/AGYG5P74"},"agent_actions":{"view_html":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243","download_json":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243.json","view_paper":"https://pith.science/paper/AGYG5P74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5028&json=true","fetch_graph":"https://pith.science/api/pith-number/AGYG5P74ZTV5ZVHVGAZBBZQ243/graph.json","fetch_events":"https://pith.science/api/pith-number/AGYG5P74ZTV5ZVHVGAZBBZQ243/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243/action/storage_attestation","attest_author":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243/action/author_attestation","sign_citation":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243/action/citation_signature","submit_replication":"https://pith.science/pith/AGYG5P74ZTV5ZVHVGAZBBZQ243/action/replication_record"}},"created_at":"2026-05-18T00:48:43.515431+00:00","updated_at":"2026-05-18T00:48:43.515431+00:00"}