{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RCGHNWOZ7GMNXPEE236GLYBP5Y","short_pith_number":"pith:RCGHNWOZ","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"},"canonical_sha256":"888c76d9d9f998dbbc84d6fc65e02fee1f7e5fe0a96935b0f8ef2400b3504ff9","source":{"kind":"arxiv","id":"1302.5872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5872","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5872v1","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5872","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"RCGHNWOZ7GMN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCGHNWOZ7GMNXPEE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCGHNWOZ","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RCGHNWOZ7GMNXPEE236GLYBP5Y","target":"record","payload":{"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"},"canonical_sha256":"888c76d9d9f998dbbc84d6fc65e02fee1f7e5fe0a96935b0f8ef2400b3504ff9","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"},"source_kind":"arxiv","source_id":"1302.5872","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:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fu5SFTNHJs6uMEo1tw/sDA4Pb559X5IloX0bFW7QSc/LVf97/h0AiVMao53qdA1bAN9ObCP0gilVwedpC0bbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:01:18.464224Z"},"content_sha256":"35cdffdd401850eb327e28a18652484718a654aaad3fe4c7826e33928ba9aeb4","schema_version":"1.0","event_id":"sha256:35cdffdd401850eb327e28a18652484718a654aaad3fe4c7826e33928ba9aeb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RCGHNWOZ7GMNXPEE236GLYBP5Y","target":"graph","payload":{"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"},"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:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3+NzVbqHe3+dfsrY6tCSIRhx/hPb9ZJpnp2ylYjczXqIvde9i0qkEJlDsZHWZByzCbh/0hhlOrHf0c6HC8VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:01:18.464954Z"},"content_sha256":"27bec335f03ea049fa8f21beb13d94e15016ebb353d3bf10563db417f5e44a2a","schema_version":"1.0","event_id":"sha256:27bec335f03ea049fa8f21beb13d94e15016ebb353d3bf10563db417f5e44a2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/bundle.json","state_url":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/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-06-09T09:01:18Z","links":{"resolver":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y","bundle":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/bundle.json","state":"https://pith.science/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCGHNWOZ7GMNXPEE236GLYBP5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RCGHNWOZ7GMNXPEE236GLYBP5Y","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":"d3bbc64ba000271f20baac8637748209e23eac1f18860aa4821b785eacf33955","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-24T05:20:03Z","title_canon_sha256":"bfe6ed30cf1f3628bc0a615930197af8d86a1d46bf99e463da313341c0bf0899"},"schema_version":"1.0","source":{"id":"1302.5872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5872","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5872v1","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5872","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"RCGHNWOZ7GMN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCGHNWOZ7GMNXPEE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCGHNWOZ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:27bec335f03ea049fa8f21beb13d94e15016ebb353d3bf10563db417f5e44a2a","target":"graph","created_at":"2026-05-18T03:32:43Z","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":"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","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah","cross_cats":["cs.DC","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-24T05:20:03Z","title":"A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5872","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:35cdffdd401850eb327e28a18652484718a654aaad3fe4c7826e33928ba9aeb4","target":"record","created_at":"2026-05-18T03:32:43Z","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":"d3bbc64ba000271f20baac8637748209e23eac1f18860aa4821b785eacf33955","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-24T05:20:03Z","title_canon_sha256":"bfe6ed30cf1f3628bc0a615930197af8d86a1d46bf99e463da313341c0bf0899"},"schema_version":"1.0","source":{"id":"1302.5872","kind":"arxiv","version":1}},"canonical_sha256":"888c76d9d9f998dbbc84d6fc65e02fee1f7e5fe0a96935b0f8ef2400b3504ff9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"888c76d9d9f998dbbc84d6fc65e02fee1f7e5fe0a96935b0f8ef2400b3504ff9","first_computed_at":"2026-05-18T03:32:43.343801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:43.343801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y3vPK2Tr9X3XVgmfOGRIF406ZXmSttQJruF5VoHwlvN13hCH8VWtordTbxV2UKIqHSvi4g8uou6Jkb71QKe0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:43.344656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35cdffdd401850eb327e28a18652484718a654aaad3fe4c7826e33928ba9aeb4","sha256:27bec335f03ea049fa8f21beb13d94e15016ebb353d3bf10563db417f5e44a2a"],"state_sha256":"81f4ed7ea9fdb94ffc3810053d4d0cbda02f2bca3ef3d2bd40ee6f5d04c81aa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhN9VoWWCb2Azmam7YCjRxrBruvndRk0u/TUzBDBl5qu49PqVffXECn1Gnkq15XEg/wZmeRG62531V7xUC/lDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:01:18.469419Z","bundle_sha256":"1b3771a15f4b600d44a531bf4b2c229a3914e011251ff6301486ab84aa114ba3"}}