{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VJMSXNGNAVI7EA4KHCZ7UAZBBV","short_pith_number":"pith:VJMSXNGN","schema_version":"1.0","canonical_sha256":"aa592bb4cd0551f2038a38b3fa03210d6b5d49784748a020bae2158f3ef11b49","source":{"kind":"arxiv","id":"1801.02014","version":1},"attestation_state":"computed","paper":{"title":"A Class of MSR Codes for Clustered Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Beongjun Choi, Jaekyun Moon, Jy-yong Sohn","submitted_at":"2018-01-06T13:31:21Z","abstract_excerpt":"Clustered distributed storage models real data centers where intra- and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: $\\epsilon=0$ and $\\epsilon=1/(n-k)$, where $\\epsilon$ is the ratio of the available cross- and intra-cluster repair bandwidths, $n$ is the total number of distributed nodes and $k$ is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, w"},"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":"1801.02014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-06T13:31:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2ba5927987f63722e07ace1a721bbe8b52bf6ca32041ae4c20a5e964bb05393","abstract_canon_sha256":"9fcbf523827da09da0477db177bd43536c0379afb5f952650ec0815ca80c7a4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:35.191638Z","signature_b64":"qtb603BYmE787ZqpmuG3rOOcGJCOpAuR8ucxWeyVj3rZqN1Y0DnEjb0EOyUEKYUhvdI4WZ0mi1MGlG53nyWDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa592bb4cd0551f2038a38b3fa03210d6b5d49784748a020bae2158f3ef11b49","last_reissued_at":"2026-05-18T00:26:35.190980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:35.190980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Class of MSR Codes for Clustered Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Beongjun Choi, Jaekyun Moon, Jy-yong Sohn","submitted_at":"2018-01-06T13:31:21Z","abstract_excerpt":"Clustered distributed storage models real data centers where intra- and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: $\\epsilon=0$ and $\\epsilon=1/(n-k)$, where $\\epsilon$ is the ratio of the available cross- and intra-cluster repair bandwidths, $n$ is the total number of distributed nodes and $k$ is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02014","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":"1801.02014","created_at":"2026-05-18T00:26:35.191070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02014v1","created_at":"2026-05-18T00:26:35.191070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02014","created_at":"2026-05-18T00:26:35.191070+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJMSXNGNAVI7","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJMSXNGNAVI7EA4K","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJMSXNGN","created_at":"2026-05-18T12:32:59.047623+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/VJMSXNGNAVI7EA4KHCZ7UAZBBV","json":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV.json","graph_json":"https://pith.science/api/pith-number/VJMSXNGNAVI7EA4KHCZ7UAZBBV/graph.json","events_json":"https://pith.science/api/pith-number/VJMSXNGNAVI7EA4KHCZ7UAZBBV/events.json","paper":"https://pith.science/paper/VJMSXNGN"},"agent_actions":{"view_html":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV","download_json":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV.json","view_paper":"https://pith.science/paper/VJMSXNGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02014&json=true","fetch_graph":"https://pith.science/api/pith-number/VJMSXNGNAVI7EA4KHCZ7UAZBBV/graph.json","fetch_events":"https://pith.science/api/pith-number/VJMSXNGNAVI7EA4KHCZ7UAZBBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/action/storage_attestation","attest_author":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/action/author_attestation","sign_citation":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/action/citation_signature","submit_replication":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/action/replication_record"}},"created_at":"2026-05-18T00:26:35.191070+00:00","updated_at":"2026-05-18T00:26:35.191070+00:00"}