{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B5UGLZAJ7KXH6BUQ4UO6YJY2FC","short_pith_number":"pith:B5UGLZAJ","canonical_record":{"source":{"id":"1709.08216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-24T16:21:50Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"2c05bb8d6d58be2ba9e753895943276791606118ef74b10216e3fa2411ff24d4","abstract_canon_sha256":"aa702bd66fa7cfebc636eda6015f6bbcaa5d66c5a8a97d994d6d82c28b0785fd"},"schema_version":"1.0"},"canonical_sha256":"0f6865e409faae7f0690e51dec271a28bcc823263668b917e84a658ecc0297ba","source":{"kind":"arxiv","id":"1709.08216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08216","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08216v1","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08216","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"B5UGLZAJ7KXH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5UGLZAJ7KXH6BUQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5UGLZAJ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B5UGLZAJ7KXH6BUQ4UO6YJY2FC","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-24T16:21:50Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"2c05bb8d6d58be2ba9e753895943276791606118ef74b10216e3fa2411ff24d4","abstract_canon_sha256":"aa702bd66fa7cfebc636eda6015f6bbcaa5d66c5a8a97d994d6d82c28b0785fd"},"schema_version":"1.0"},"canonical_sha256":"0f6865e409faae7f0690e51dec271a28bcc823263668b917e84a658ecc0297ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:26.090792Z","signature_b64":"/0R8SQmJ3jBDITOBzCY1ZMgAnYGt8bbq9PSBAHdUN+GQRsO3v3Zik8bWSr4hlyr9pwweGCi68Bpn0diRmQ8TDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f6865e409faae7f0690e51dec271a28bcc823263668b917e84a658ecc0297ba","last_reissued_at":"2026-05-18T00:34:26.090228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:26.090228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08216","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:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVIrg0MZ1XeMQZRkWFhY6hWph/uKVy02YY14uxJITJBEKTgIrqvYPjyiqW5JF1hPvOmq+z6xMfpuHXPpZ2GnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:20:02.305888Z"},"content_sha256":"eb2578ccf41e660704d135c75947b43da0d93f15bbc2e5d45a2caa26bf2a31cd","schema_version":"1.0","event_id":"sha256:eb2578ccf41e660704d135c75947b43da0d93f15bbc2e5d45a2caa26bf2a31cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B5UGLZAJ7KXH6BUQ4UO6YJY2FC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, Itzhak Tamo, Klim Efremenko, Venkatesan Guruswami","submitted_at":"2017-09-24T16:21:50Z","abstract_excerpt":"This paper addresses the problem of constructing MDS codes that enable exact repair of each code block with small repair bandwidth, which refers to the total amount of information flow from the remaining code blocks during the repair process. This problem naturally arises in the context of distributed storage systems as the node repair problem [7]. The constructions of exact-repairable MDS codes with optimal repair-bandwidth require working with large sub-packetization levels, which restricts their employment in practice.\n  This paper presents constructions for MDS codes that simultaneously pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08216","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:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GpTPdM5EKli6RLx9dP4+/v34CerTCS0MuBIW5JVMH5e2WaggRYqiNgyzrbv1t+LLA+zN1EFluqueOlBbA339Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:20:02.306567Z"},"content_sha256":"fddfa6f3b163f847ffd1f9cbb8861ac7c17d0296dd6356c20d13c1747a5b634e","schema_version":"1.0","event_id":"sha256:fddfa6f3b163f847ffd1f9cbb8861ac7c17d0296dd6356c20d13c1747a5b634e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5UGLZAJ7KXH6BUQ4UO6YJY2FC/bundle.json","state_url":"https://pith.science/pith/B5UGLZAJ7KXH6BUQ4UO6YJY2FC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5UGLZAJ7KXH6BUQ4UO6YJY2FC/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-30T12:20:02Z","links":{"resolver":"https://pith.science/pith/B5UGLZAJ7KXH6BUQ4UO6YJY2FC","bundle":"https://pith.science/pith/B5UGLZAJ7KXH6BUQ4UO6YJY2FC/bundle.json","state":"https://pith.science/pith/B5UGLZAJ7KXH6BUQ4UO6YJY2FC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5UGLZAJ7KXH6BUQ4UO6YJY2FC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B5UGLZAJ7KXH6BUQ4UO6YJY2FC","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":"aa702bd66fa7cfebc636eda6015f6bbcaa5d66c5a8a97d994d6d82c28b0785fd","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-24T16:21:50Z","title_canon_sha256":"2c05bb8d6d58be2ba9e753895943276791606118ef74b10216e3fa2411ff24d4"},"schema_version":"1.0","source":{"id":"1709.08216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08216","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08216v1","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08216","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"B5UGLZAJ7KXH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5UGLZAJ7KXH6BUQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5UGLZAJ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:fddfa6f3b163f847ffd1f9cbb8861ac7c17d0296dd6356c20d13c1747a5b634e","target":"graph","created_at":"2026-05-18T00:34:26Z","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":"This paper addresses the problem of constructing MDS codes that enable exact repair of each code block with small repair bandwidth, which refers to the total amount of information flow from the remaining code blocks during the repair process. This problem naturally arises in the context of distributed storage systems as the node repair problem [7]. The constructions of exact-repairable MDS codes with optimal repair-bandwidth require working with large sub-packetization levels, which restricts their employment in practice.\n  This paper presents constructions for MDS codes that simultaneously pr","authors_text":"Ankit Singh Rawat, Itzhak Tamo, Klim Efremenko, Venkatesan Guruswami","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-24T16:21:50Z","title":"MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08216","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:eb2578ccf41e660704d135c75947b43da0d93f15bbc2e5d45a2caa26bf2a31cd","target":"record","created_at":"2026-05-18T00:34:26Z","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":"aa702bd66fa7cfebc636eda6015f6bbcaa5d66c5a8a97d994d6d82c28b0785fd","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-24T16:21:50Z","title_canon_sha256":"2c05bb8d6d58be2ba9e753895943276791606118ef74b10216e3fa2411ff24d4"},"schema_version":"1.0","source":{"id":"1709.08216","kind":"arxiv","version":1}},"canonical_sha256":"0f6865e409faae7f0690e51dec271a28bcc823263668b917e84a658ecc0297ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f6865e409faae7f0690e51dec271a28bcc823263668b917e84a658ecc0297ba","first_computed_at":"2026-05-18T00:34:26.090228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:26.090228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/0R8SQmJ3jBDITOBzCY1ZMgAnYGt8bbq9PSBAHdUN+GQRsO3v3Zik8bWSr4hlyr9pwweGCi68Bpn0diRmQ8TDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:26.090792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb2578ccf41e660704d135c75947b43da0d93f15bbc2e5d45a2caa26bf2a31cd","sha256:fddfa6f3b163f847ffd1f9cbb8861ac7c17d0296dd6356c20d13c1747a5b634e"],"state_sha256":"d940417b0e326abcbc8daff2631969386a9ea404f07ca5f8d397299d814ba9e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Qprhura4Hpvsj3Q2F91/4WsMlJ01ZFZNae3YJcvf16/fg1oplP2cyLD3Jf9zaf1YBS5aJk8mA1fh7bMDjQiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:20:02.309336Z","bundle_sha256":"b6fd94146aa41b16758b8e328988ac42e0b510673820d8831c45d520e596a009"}}