{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JCX3JZS5UN6N5UDHTOHDN37YB2","short_pith_number":"pith:JCX3JZS5","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"},"canonical_sha256":"48afb4e65da37cded0679b8e36eff80e96549a39872cae24b7d988eff86c2132","source":{"kind":"arxiv","id":"1701.04909","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04909","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04909v3","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04909","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"JCX3JZS5UN6N","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JCX3JZS5UN6N5UDH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JCX3JZS5","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JCX3JZS5UN6N5UDHTOHDN37YB2","target":"record","payload":{"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"},"canonical_sha256":"48afb4e65da37cded0679b8e36eff80e96549a39872cae24b7d988eff86c2132","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"},"source_kind":"arxiv","source_id":"1701.04909","source_version":3,"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-18T00:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kh3uMQuP+XlPbn2AXOmXx+DatwHtZyVN95uau7Oz8IKpoG5VmmpJAKz2CdXxUmlS+CbP887/+eZUU0SwfXMrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:24:29.981123Z"},"content_sha256":"13309a4de61f6c23590743aaf37df84c1b4144e1a972763ccd4b02b2652f22ac","schema_version":"1.0","event_id":"sha256:13309a4de61f6c23590743aaf37df84c1b4144e1a972763ccd4b02b2652f22ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JCX3JZS5UN6N5UDHTOHDN37YB2","target":"graph","payload":{"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"},"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-18T00:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gv8ZHp0UMu+LYDoJq9cEVFRv734xx2iJC3dRb/ymShC7vcL+rua+DmrDhFkZnKy3mXXveH9qohdCFrUNbqidCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:24:29.981809Z"},"content_sha256":"268777a99c84749ca4de36dd41a9ae544fc59a2e345ff732d43be8971a50bc22","schema_version":"1.0","event_id":"sha256:268777a99c84749ca4de36dd41a9ae544fc59a2e345ff732d43be8971a50bc22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/bundle.json","state_url":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/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-24T20:24:29Z","links":{"resolver":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2","bundle":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/bundle.json","state":"https://pith.science/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCX3JZS5UN6N5UDHTOHDN37YB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JCX3JZS5UN6N5UDHTOHDN37YB2","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":"8383d8eaf55e4794856e0f4876fa436b6171005f9657f2945585a52353afe6b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T00:52:00Z","title_canon_sha256":"1dabf7d9039a8cf6c053c348eae95ef554a6ecfcadc4b4547494d81c187a0119"},"schema_version":"1.0","source":{"id":"1701.04909","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04909","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04909v3","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04909","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"JCX3JZS5UN6N","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JCX3JZS5UN6N5UDH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JCX3JZS5","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:268777a99c84749ca4de36dd41a9ae544fc59a2e345ff732d43be8971a50bc22","target":"graph","created_at":"2026-05-18T00:08:55Z","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 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","authors_text":"Muriel Medard, N. Prakash, Vitaly Abdrashitov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T00:52:00Z","title":"The Storage vs Repair-Bandwidth Trade-off for Clustered Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04909","kind":"arxiv","version":3},"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:13309a4de61f6c23590743aaf37df84c1b4144e1a972763ccd4b02b2652f22ac","target":"record","created_at":"2026-05-18T00:08:55Z","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":"8383d8eaf55e4794856e0f4876fa436b6171005f9657f2945585a52353afe6b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T00:52:00Z","title_canon_sha256":"1dabf7d9039a8cf6c053c348eae95ef554a6ecfcadc4b4547494d81c187a0119"},"schema_version":"1.0","source":{"id":"1701.04909","kind":"arxiv","version":3}},"canonical_sha256":"48afb4e65da37cded0679b8e36eff80e96549a39872cae24b7d988eff86c2132","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48afb4e65da37cded0679b8e36eff80e96549a39872cae24b7d988eff86c2132","first_computed_at":"2026-05-18T00:08:55.520864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:55.520864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lPM0sdgsY6FmU97/doDdK0tL3Rp24bj7lZtibVVG6tY6lronE1iNlUBx4fOTeoRRKCyCtFuMBVOkLGWj5wYGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:55.521385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04909","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13309a4de61f6c23590743aaf37df84c1b4144e1a972763ccd4b02b2652f22ac","sha256:268777a99c84749ca4de36dd41a9ae544fc59a2e345ff732d43be8971a50bc22"],"state_sha256":"82d2aaa48386829722f43207f22f122786898b45a7853bb72c57229f4d604f9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBpsa+e/DoiLGJycM3OZKJUIZVh7l7l2OPVuteb4zfgW7NpP1We4NyjzRfjBF3iCkizHYOPkOw69R6N2WnfiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:24:29.985186Z","bundle_sha256":"f27145d67fca8851b36a7f45eac3261aa3a3e79d7f36d2d873105db177cf070a"}}