{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RCGHNWOZ7GMNXPEE236GLYBP5Y","short_pith_number":"pith:RCGHNWOZ","schema_version":"1.0","canonical_sha256":"888c76d9d9f998dbbc84d6fc65e02fee1f7e5fe0a96935b0f8ef2400b3504ff9","source":{"kind":"arxiv","id":"1302.5872","version":1},"attestation_state":"computed","paper":{"title":"A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah","submitted_at":"2013-02-24T05:20:03Z","abstract_excerpt":"We present a new 'piggybacking' framework for designing distributed storage codes that are efficient in data-read and download required during node-repair. We illustrate the power of this framework by constructing classes of explicit codes that entail the smallest data-read and download for repair among all existing solutions for three important settings: (a) codes meeting the constraints of being Maximum-Distance-Separable (MDS), high-rate and having a small number of substripes, arising out of practical considerations for implementation in data centers, (b) binary MDS codes for all parameter"},"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":"1302.5872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-24T05:20:03Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"bfe6ed30cf1f3628bc0a615930197af8d86a1d46bf99e463da313341c0bf0899","abstract_canon_sha256":"d3bbc64ba000271f20baac8637748209e23eac1f18860aa4821b785eacf33955"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:43.344656Z","signature_b64":"y3vPK2Tr9X3XVgmfOGRIF406ZXmSttQJruF5VoHwlvN13hCH8VWtordTbxV2UKIqHSvi4g8uou6Jkb71QKe0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888c76d9d9f998dbbc84d6fc65e02fee1f7e5fe0a96935b0f8ef2400b3504ff9","last_reissued_at":"2026-05-18T03:32:43.343801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:43.343801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah","submitted_at":"2013-02-24T05:20:03Z","abstract_excerpt":"We present a new 'piggybacking' framework for designing distributed storage codes that are efficient in data-read and download required during node-repair. We illustrate the power of this framework by constructing classes of explicit codes that entail the smallest data-read and download for repair among all existing solutions for three important settings: (a) codes meeting the constraints of being Maximum-Distance-Separable (MDS), high-rate and having a small number of substripes, arising out of practical considerations for implementation in data centers, (b) binary MDS codes for all parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5872","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.5872","created_at":"2026-05-18T03:32:43.343959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5872v1","created_at":"2026-05-18T03:32:43.343959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5872","created_at":"2026-05-18T03:32:43.343959+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCGHNWOZ7GMN","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCGHNWOZ7GMNXPEE","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCGHNWOZ","created_at":"2026-05-18T12:27:57.521954+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/RCGHNWOZ7GMNXPEE236GLYBP5Y","json":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y.json","graph_json":"https://pith.science/api/pith-number/RCGHNWOZ7GMNXPEE236GLYBP5Y/graph.json","events_json":"https://pith.science/api/pith-number/RCGHNWOZ7GMNXPEE236GLYBP5Y/events.json","paper":"https://pith.science/paper/RCGHNWOZ"},"agent_actions":{"view_html":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y","download_json":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y.json","view_paper":"https://pith.science/paper/RCGHNWOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5872&json=true","fetch_graph":"https://pith.science/api/pith-number/RCGHNWOZ7GMNXPEE236GLYBP5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/RCGHNWOZ7GMNXPEE236GLYBP5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/action/storage_attestation","attest_author":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/action/author_attestation","sign_citation":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/action/citation_signature","submit_replication":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/action/replication_record"}},"created_at":"2026-05-18T03:32:43.343959+00:00","updated_at":"2026-05-18T03:32:43.343959+00:00"}