{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:G75EKUGGXUELILE67SBV3AK526","short_pith_number":"pith:G75EKUGG","canonical_record":{"source":{"id":"1411.6328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T02:28:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2ea57cfffcde61df2face5147daa33145d5c0911cc04999df64a668e4137964c","abstract_canon_sha256":"e50d5f1eacb04c068ab1119c7b82b9441ba3746008f3b1f3fbfa0dd5a07892e9"},"schema_version":"1.0"},"canonical_sha256":"37fa4550c6bd08b42c9efc835d815dd79b8f23b1815ba1c3cbcd2290f61faf03","source":{"kind":"arxiv","id":"1411.6328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6328","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6328v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6328","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"G75EKUGGXUEL","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G75EKUGGXUELILE6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G75EKUGG","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:G75EKUGGXUELILE67SBV3AK526","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T02:28:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2ea57cfffcde61df2face5147daa33145d5c0911cc04999df64a668e4137964c","abstract_canon_sha256":"e50d5f1eacb04c068ab1119c7b82b9441ba3746008f3b1f3fbfa0dd5a07892e9"},"schema_version":"1.0"},"canonical_sha256":"37fa4550c6bd08b42c9efc835d815dd79b8f23b1815ba1c3cbcd2290f61faf03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.266995Z","signature_b64":"AeKu1qHFb5Vn6m4XNGuznoywATX5JAK1TPjT4Pq5h5UB3vokSHCyB3vly4BsGOPkupcqgKtuX3RJqCrfx3OrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37fa4550c6bd08b42c9efc835d815dd79b8f23b1815ba1c3cbcd2290f61faf03","last_reissued_at":"2026-05-18T02:33:00.266663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.266663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6328","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMB/cSzAxAjJr9rSa89Y6mN8eSbPH+0ZzIq0c667/3MpNOHc//gYS3sTnQj5MeRQ7CABvICvc1bqjrv8IqXbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:29:15.000577Z"},"content_sha256":"f8abb1669ebcfe32c34dee9c457736ef85d3372f500e150d069669dcc15dc8e5","schema_version":"1.0","event_id":"sha256:f8abb1669ebcfe32c34dee9c457736ef85d3372f500e150d069669dcc15dc8e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:G75EKUGGXUELILE67SBV3AK526","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit MDS Codes for Optimal Repair Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2014-11-24T02:28:06Z","abstract_excerpt":"MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has $r$ parities and no more than $r$ erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of $1/r$ of the information needs to be transmitted. This fraction is called the repair bandwidth (fraction). Explicit code constructions were given in previous works. If we view each symbol in the code a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6328","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLpItC4WYCcqxO8+zCtYEi1G/RVAzyfiRxx/ILAS6G7WMI0/x6ZS/rbKiCYzD+JarezUFs1hahb4bxlvDy8KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:29:15.001032Z"},"content_sha256":"f69350d4926f13f745257a73b685f3cb73c6c9f7149435370d9541f987bb5adf","schema_version":"1.0","event_id":"sha256:f69350d4926f13f745257a73b685f3cb73c6c9f7149435370d9541f987bb5adf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/bundle.json","state_url":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G75EKUGGXUELILE67SBV3AK526/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-06-22T15:29:15Z","links":{"resolver":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526","bundle":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/bundle.json","state":"https://pith.science/pith/G75EKUGGXUELILE67SBV3AK526/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G75EKUGGXUELILE67SBV3AK526/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G75EKUGGXUELILE67SBV3AK526","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":"e50d5f1eacb04c068ab1119c7b82b9441ba3746008f3b1f3fbfa0dd5a07892e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T02:28:06Z","title_canon_sha256":"2ea57cfffcde61df2face5147daa33145d5c0911cc04999df64a668e4137964c"},"schema_version":"1.0","source":{"id":"1411.6328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6328","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6328v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6328","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"G75EKUGGXUEL","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G75EKUGGXUELILE6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G75EKUGG","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:f69350d4926f13f745257a73b685f3cb73c6c9f7149435370d9541f987bb5adf","target":"graph","created_at":"2026-05-18T02:33:00Z","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":"MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has $r$ parities and no more than $r$ erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of $1/r$ of the information needs to be transmitted. This fraction is called the repair bandwidth (fraction). Explicit code constructions were given in previous works. If we view each symbol in the code a","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T02:28:06Z","title":"Explicit MDS Codes for Optimal Repair Bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6328","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:f8abb1669ebcfe32c34dee9c457736ef85d3372f500e150d069669dcc15dc8e5","target":"record","created_at":"2026-05-18T02:33:00Z","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":"e50d5f1eacb04c068ab1119c7b82b9441ba3746008f3b1f3fbfa0dd5a07892e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T02:28:06Z","title_canon_sha256":"2ea57cfffcde61df2face5147daa33145d5c0911cc04999df64a668e4137964c"},"schema_version":"1.0","source":{"id":"1411.6328","kind":"arxiv","version":1}},"canonical_sha256":"37fa4550c6bd08b42c9efc835d815dd79b8f23b1815ba1c3cbcd2290f61faf03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37fa4550c6bd08b42c9efc835d815dd79b8f23b1815ba1c3cbcd2290f61faf03","first_computed_at":"2026-05-18T02:33:00.266663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:00.266663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AeKu1qHFb5Vn6m4XNGuznoywATX5JAK1TPjT4Pq5h5UB3vokSHCyB3vly4BsGOPkupcqgKtuX3RJqCrfx3OrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:00.266995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8abb1669ebcfe32c34dee9c457736ef85d3372f500e150d069669dcc15dc8e5","sha256:f69350d4926f13f745257a73b685f3cb73c6c9f7149435370d9541f987bb5adf"],"state_sha256":"9d015e6d36b4d2086ce117f0fcc00397e823836a8e3dad5ecd48052e83e2bfec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5X3lhZZiftCtJkcAVxG116oKn33qxyIe3PWOiBi/h1qQd0aAe++llk01vc7+eykcBS26vrapTmy3UrWBghkWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T15:29:15.003429Z","bundle_sha256":"78496f7d6d9f7dd0c756d62bafc7d1b9ebc52aca22184f76e12a4e80828d2eab"}}