{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:26SKVIRFCQZFSFITDIXMWZFBWT","short_pith_number":"pith:26SKVIRF","canonical_record":{"source":{"id":"2102.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-02-04T06:36:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d950aef129d75132123a0529ce849f63bb80b5288503c55af1dba935ae7c0286","abstract_canon_sha256":"ee45c1108afe0e256d36d00b312ee0450b604799bd00b2795366da2d4026de59"},"schema_version":"1.0"},"canonical_sha256":"d7a4aaa22514325915131a2ecb64a1b4cf0bb2708acbb1f685de09f3c69de21a","source":{"kind":"arxiv","id":"2102.02436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.02436","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"2102.02436v1","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02436","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"26SKVIRFCQZF","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"pith_short_16","alias_value":"26SKVIRFCQZFSFIT","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"pith_short_8","alias_value":"26SKVIRF","created_at":"2026-07-05T02:12:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:26SKVIRFCQZFSFITDIXMWZFBWT","target":"record","payload":{"canonical_record":{"source":{"id":"2102.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-02-04T06:36:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d950aef129d75132123a0529ce849f63bb80b5288503c55af1dba935ae7c0286","abstract_canon_sha256":"ee45c1108afe0e256d36d00b312ee0450b604799bd00b2795366da2d4026de59"},"schema_version":"1.0"},"canonical_sha256":"d7a4aaa22514325915131a2ecb64a1b4cf0bb2708acbb1f685de09f3c69de21a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:48.677527Z","signature_b64":"Tai5a5JFWRIPrYq5em5Ez9MSEdm8LTYmK5iwn2lqlk5ZaJbX5lKVd6Df09S1wt2Yda3sOD2z29rvce987GwfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7a4aaa22514325915131a2ecb64a1b4cf0bb2708acbb1f685de09f3c69de21a","last_reissued_at":"2026-07-05T02:12:48.677086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:48.677086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.02436","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-07-05T02:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyWkRiDWTrVTw1x8HzCCCsatL/VJNyCjfSt3w0i0D1YNsGIeimRHZ1Va/D+WhwaDpXwyepUxbKPo3ARr6Bt2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:59:50.164100Z"},"content_sha256":"5bc32ce720d68c936ed41d5c0444f8ebf6798ee75cbcb14e97ea353bfb707f1f","schema_version":"1.0","event_id":"sha256:5bc32ce720d68c936ed41d5c0444f8ebf6798ee75cbcb14e97ea353bfb707f1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:26SKVIRFCQZFSFITDIXMWZFBWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Bai, Gong Zhang, Liang Chen, Ting-Yi Wu, Xiang Wu, Yunghsiang S. Han, Zhengrui Li","submitted_at":"2021-02-04T06:36:37Z","abstract_excerpt":"Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is discussed. For the DRF MDS array code with 2 redundant nodes and the sub-packetization level of 2, the lower bound of its access bandwidth is derived."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.02436","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.02436/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieh8fcgUJzzb2gbYnb+Qva8WHaY0TWVtpCwsy3BiFs22P+MibgNlEsvigUzK+ZpgwEClTpZfze+SswkGndxKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:59:50.164757Z"},"content_sha256":"3b45fe0e787bd2edab243f763dfac107e1ec399dade3b573d64bd3f6bba98d10","schema_version":"1.0","event_id":"sha256:3b45fe0e787bd2edab243f763dfac107e1ec399dade3b573d64bd3f6bba98d10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26SKVIRFCQZFSFITDIXMWZFBWT/bundle.json","state_url":"https://pith.science/pith/26SKVIRFCQZFSFITDIXMWZFBWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26SKVIRFCQZFSFITDIXMWZFBWT/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-07-05T14:59:50Z","links":{"resolver":"https://pith.science/pith/26SKVIRFCQZFSFITDIXMWZFBWT","bundle":"https://pith.science/pith/26SKVIRFCQZFSFITDIXMWZFBWT/bundle.json","state":"https://pith.science/pith/26SKVIRFCQZFSFITDIXMWZFBWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26SKVIRFCQZFSFITDIXMWZFBWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:26SKVIRFCQZFSFITDIXMWZFBWT","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":"ee45c1108afe0e256d36d00b312ee0450b604799bd00b2795366da2d4026de59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-02-04T06:36:37Z","title_canon_sha256":"d950aef129d75132123a0529ce849f63bb80b5288503c55af1dba935ae7c0286"},"schema_version":"1.0","source":{"id":"2102.02436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.02436","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"2102.02436v1","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02436","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"26SKVIRFCQZF","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"pith_short_16","alias_value":"26SKVIRFCQZFSFIT","created_at":"2026-07-05T02:12:48Z"},{"alias_kind":"pith_short_8","alias_value":"26SKVIRF","created_at":"2026-07-05T02:12:48Z"}],"graph_snapshots":[{"event_id":"sha256:3b45fe0e787bd2edab243f763dfac107e1ec399dade3b573d64bd3f6bba98d10","target":"graph","created_at":"2026-07-05T02:12:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.02436/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is discussed. For the DRF MDS array code with 2 redundant nodes and the sub-packetization level of 2, the lower bound of its access bandwidth is derived.","authors_text":"Bo Bai, Gong Zhang, Liang Chen, Ting-Yi Wu, Xiang Wu, Yunghsiang S. Han, Zhengrui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-02-04T06:36:37Z","title":"Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.02436","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:5bc32ce720d68c936ed41d5c0444f8ebf6798ee75cbcb14e97ea353bfb707f1f","target":"record","created_at":"2026-07-05T02:12:48Z","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":"ee45c1108afe0e256d36d00b312ee0450b604799bd00b2795366da2d4026de59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-02-04T06:36:37Z","title_canon_sha256":"d950aef129d75132123a0529ce849f63bb80b5288503c55af1dba935ae7c0286"},"schema_version":"1.0","source":{"id":"2102.02436","kind":"arxiv","version":1}},"canonical_sha256":"d7a4aaa22514325915131a2ecb64a1b4cf0bb2708acbb1f685de09f3c69de21a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7a4aaa22514325915131a2ecb64a1b4cf0bb2708acbb1f685de09f3c69de21a","first_computed_at":"2026-07-05T02:12:48.677086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:12:48.677086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tai5a5JFWRIPrYq5em5Ez9MSEdm8LTYmK5iwn2lqlk5ZaJbX5lKVd6Df09S1wt2Yda3sOD2z29rvce987GwfDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:12:48.677527Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.02436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bc32ce720d68c936ed41d5c0444f8ebf6798ee75cbcb14e97ea353bfb707f1f","sha256:3b45fe0e787bd2edab243f763dfac107e1ec399dade3b573d64bd3f6bba98d10"],"state_sha256":"77305078bcde116b09d6b90adc1a56fe2d06c810cf36bd898ec59c6ff81edfe3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3YSb4xfgR/h0TtvTCUIKRQrfsWkkMWb01E9/q6PtP8wrJlpLBNQYtyP8QCUmr7udHrodyxsq8GLjOj/kwqcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:59:50.168346Z","bundle_sha256":"32b79c35248f66486956e0c900130b642b9492063477add416545f886b2fbb46"}}