{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JCX3JZS5UN6N5UDHTOHDN37YB2","short_pith_number":"pith:JCX3JZS5","schema_version":"1.0","canonical_sha256":"48afb4e65da37cded0679b8e36eff80e96549a39872cae24b7d988eff86c2132","source":{"kind":"arxiv","id":"1701.04909","version":3},"attestation_state":"computed","paper":{"title":"The Storage vs Repair-Bandwidth Trade-off for Clustered Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, N. Prakash, Vitaly Abdrashitov","submitted_at":"2017-01-18T00:52:00Z","abstract_excerpt":"We study a generalization of the setting of regenerating codes, motivated by applications to storage systems consisting of clusters of storage nodes. There are $n$ clusters in total, with $m$ nodes per cluster. A data file is coded and stored across the $mn$ nodes, with each node storing $\\alpha$ symbols. For availability of data, we require that the file be retrievable by downloading the entire content from any subset of $k$ clusters. Nodes represent entities that can fail. We distinguish between intra-cluster and inter-cluster bandwidth (BW) costs during node repair. Node-repair in a cluster"},"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":"1701.04909","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T00:52:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1dabf7d9039a8cf6c053c348eae95ef554a6ecfcadc4b4547494d81c187a0119","abstract_canon_sha256":"8383d8eaf55e4794856e0f4876fa436b6171005f9657f2945585a52353afe6b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:55.521385Z","signature_b64":"lPM0sdgsY6FmU97/doDdK0tL3Rp24bj7lZtibVVG6tY6lronE1iNlUBx4fOTeoRRKCyCtFuMBVOkLGWj5wYGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48afb4e65da37cded0679b8e36eff80e96549a39872cae24b7d988eff86c2132","last_reissued_at":"2026-05-18T00:08:55.520864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:55.520864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Storage vs Repair-Bandwidth Trade-off for Clustered Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, N. Prakash, Vitaly Abdrashitov","submitted_at":"2017-01-18T00:52:00Z","abstract_excerpt":"We study a generalization of the setting of regenerating codes, motivated by applications to storage systems consisting of clusters of storage nodes. There are $n$ clusters in total, with $m$ nodes per cluster. A data file is coded and stored across the $mn$ nodes, with each node storing $\\alpha$ symbols. For availability of data, we require that the file be retrievable by downloading the entire content from any subset of $k$ clusters. Nodes represent entities that can fail. We distinguish between intra-cluster and inter-cluster bandwidth (BW) costs during node repair. Node-repair in a cluster"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04909","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":"1701.04909","created_at":"2026-05-18T00:08:55.520946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04909v3","created_at":"2026-05-18T00:08:55.520946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04909","created_at":"2026-05-18T00:08:55.520946+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCX3JZS5UN6N","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCX3JZS5UN6N5UDH","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCX3JZS5","created_at":"2026-05-18T12:31:21.493067+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/JCX3JZS5UN6N5UDHTOHDN37YB2","json":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2.json","graph_json":"https://pith.science/api/pith-number/JCX3JZS5UN6N5UDHTOHDN37YB2/graph.json","events_json":"https://pith.science/api/pith-number/JCX3JZS5UN6N5UDHTOHDN37YB2/events.json","paper":"https://pith.science/paper/JCX3JZS5"},"agent_actions":{"view_html":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2","download_json":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2.json","view_paper":"https://pith.science/paper/JCX3JZS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04909&json=true","fetch_graph":"https://pith.science/api/pith-number/JCX3JZS5UN6N5UDHTOHDN37YB2/graph.json","fetch_events":"https://pith.science/api/pith-number/JCX3JZS5UN6N5UDHTOHDN37YB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/action/storage_attestation","attest_author":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/action/author_attestation","sign_citation":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/action/citation_signature","submit_replication":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/action/replication_record"}},"created_at":"2026-05-18T00:08:55.520946+00:00","updated_at":"2026-05-18T00:08:55.520946+00:00"}