{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VJMSXNGNAVI7EA4KHCZ7UAZBBV","short_pith_number":"pith:VJMSXNGN","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"},"canonical_sha256":"aa592bb4cd0551f2038a38b3fa03210d6b5d49784748a020bae2158f3ef11b49","source":{"kind":"arxiv","id":"1801.02014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02014","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02014v1","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02014","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"pith_short_12","alias_value":"VJMSXNGNAVI7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VJMSXNGNAVI7EA4K","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VJMSXNGN","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VJMSXNGNAVI7EA4KHCZ7UAZBBV","target":"record","payload":{"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"},"canonical_sha256":"aa592bb4cd0551f2038a38b3fa03210d6b5d49784748a020bae2158f3ef11b49","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"},"source_kind":"arxiv","source_id":"1801.02014","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-18T00:26:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZTThDaTqWbVa5+2iebz0l++gDRS+OF0KLDE+SWqi9sx50hWcYQxSzkZT6H+5Y/QNGbUyRKc+byUi+FhQwmjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:59.308027Z"},"content_sha256":"fec22b297a3c599e1000a1bbeca2063ef164b280756df24b24b29f79662493d5","schema_version":"1.0","event_id":"sha256:fec22b297a3c599e1000a1bbeca2063ef164b280756df24b24b29f79662493d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VJMSXNGNAVI7EA4KHCZ7UAZBBV","target":"graph","payload":{"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"},"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:26:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2+IaCqWY7fTkJo+5JzpMtm6qzlsfjyiYQjL25DWfq7ppipDAt4sZutpZIbB9BXNKXm7RjhgKwJPvBSw8ajSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:59.308391Z"},"content_sha256":"20105f935970f2a2551015b140a0f7aacd75b38a0c0f96573dc89ca41bde0372","schema_version":"1.0","event_id":"sha256:20105f935970f2a2551015b140a0f7aacd75b38a0c0f96573dc89ca41bde0372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/bundle.json","state_url":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/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-30T11:12:59Z","links":{"resolver":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV","bundle":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/bundle.json","state":"https://pith.science/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJMSXNGNAVI7EA4KHCZ7UAZBBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VJMSXNGNAVI7EA4KHCZ7UAZBBV","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":"9fcbf523827da09da0477db177bd43536c0379afb5f952650ec0815ca80c7a4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-06T13:31:21Z","title_canon_sha256":"b2ba5927987f63722e07ace1a721bbe8b52bf6ca32041ae4c20a5e964bb05393"},"schema_version":"1.0","source":{"id":"1801.02014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02014","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02014v1","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02014","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"pith_short_12","alias_value":"VJMSXNGNAVI7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VJMSXNGNAVI7EA4K","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VJMSXNGN","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:20105f935970f2a2551015b140a0f7aacd75b38a0c0f96573dc89ca41bde0372","target":"graph","created_at":"2026-05-18T00:26:35Z","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":"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","authors_text":"Beongjun Choi, Jaekyun Moon, Jy-yong Sohn","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-06T13:31:21Z","title":"A Class of MSR Codes for Clustered Distributed Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02014","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:fec22b297a3c599e1000a1bbeca2063ef164b280756df24b24b29f79662493d5","target":"record","created_at":"2026-05-18T00:26:35Z","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":"9fcbf523827da09da0477db177bd43536c0379afb5f952650ec0815ca80c7a4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-06T13:31:21Z","title_canon_sha256":"b2ba5927987f63722e07ace1a721bbe8b52bf6ca32041ae4c20a5e964bb05393"},"schema_version":"1.0","source":{"id":"1801.02014","kind":"arxiv","version":1}},"canonical_sha256":"aa592bb4cd0551f2038a38b3fa03210d6b5d49784748a020bae2158f3ef11b49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa592bb4cd0551f2038a38b3fa03210d6b5d49784748a020bae2158f3ef11b49","first_computed_at":"2026-05-18T00:26:35.190980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:35.190980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtb603BYmE787ZqpmuG3rOOcGJCOpAuR8ucxWeyVj3rZqN1Y0DnEjb0EOyUEKYUhvdI4WZ0mi1MGlG53nyWDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:35.191638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec22b297a3c599e1000a1bbeca2063ef164b280756df24b24b29f79662493d5","sha256:20105f935970f2a2551015b140a0f7aacd75b38a0c0f96573dc89ca41bde0372"],"state_sha256":"8d1e79f28949913d3387a91ca627a0e467843c9167120e5e6fa3611bc9a9bba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcPaPNUb+Xkz7H9YNfHdL9NqGnx5U3IUJWIJM0ZXMW7Sy+jzegPCZ8+IRMTLUl/cByV/Au6dMgBh5wh7trfwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:12:59.311992Z","bundle_sha256":"9bb9c337f87fa008b843ad649a0954c23c0b270d666722a9dcaf966855fd1742"}}