{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4EOKVY75FEWSZMHDY2BCTQ35QV","short_pith_number":"pith:4EOKVY75","canonical_record":{"source":{"id":"1305.3498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3bb8b39159417d05aaaca1df0b5c3c5304304e012dd18e73a157516d2e9b1d6","abstract_canon_sha256":"040978f52d739dfb996ac6a794761f0ac69960d3e82f53c07ddc935528e26357"},"schema_version":"1.0"},"canonical_sha256":"e11caae3fd292d2cb0e3c68229c37d8576164d2fcaa5b7df79a5b5730570ee7b","source":{"kind":"arxiv","id":"1305.3498","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3498","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3498v1","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3498","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"4EOKVY75FEWS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4EOKVY75FEWSZMHD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4EOKVY75","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4EOKVY75FEWSZMHDY2BCTQ35QV","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3bb8b39159417d05aaaca1df0b5c3c5304304e012dd18e73a157516d2e9b1d6","abstract_canon_sha256":"040978f52d739dfb996ac6a794761f0ac69960d3e82f53c07ddc935528e26357"},"schema_version":"1.0"},"canonical_sha256":"e11caae3fd292d2cb0e3c68229c37d8576164d2fcaa5b7df79a5b5730570ee7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:35.653500Z","signature_b64":"t6/bAcCYNY7Ta2qYfi3NC1fG9dtgvI/CBUU9M4Pfk4bRZy89gsONNUSOQUZ6usr9bgh/EQxNVeUUO09NPc9yDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e11caae3fd292d2cb0e3c68229c37d8576164d2fcaa5b7df79a5b5730570ee7b","last_reissued_at":"2026-05-18T03:25:35.652876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:35.652876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3498","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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NRJsfnZGUPREjkWFYq3m63KUJBupGL3C7JFKRsdNpPboCJN6FY1IsPyNjWANWkCu3IkDAfotVqO1dfAv8jkPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:07:01.743377Z"},"content_sha256":"88dd6b2a90175ff13e27a0ad295a32ec4cf91e32feb6bd8a94bc27cbead7aecb","schema_version":"1.0","event_id":"sha256:88dd6b2a90175ff13e27a0ad295a32ec4cf91e32feb6bd8a94bc27cbead7aecb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4EOKVY75FEWSZMHDY2BCTQ35QV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Robert Calderbank, Sreechakra Goparaju","submitted_at":"2013-05-15T14:40:37Z","abstract_excerpt":"Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an $(n, k)$ MDS code stores $k$ symbols in $n$ disks such that the overall system is tolerant to a failure of up to $n-k$ disks. However, access to at least $k$ disks is still required to repair a single erasure. To reduce repair bandwidth, array codes are used where the stored symbols or packets are vectors of length $\\ell$. MDS array codes have the potential to repair a single erasure using a fraction $1/(n-k)$ of data stored in the remaining disks. We introduce new methods of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3498","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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TNZRneS4u4IwRc9msdLLKVAuxz1jkqUsd/IrF29Eqdjn9xCrybT6csNnFi5qlxiGYJm1KO6sD/ZbElR38yoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:07:01.744100Z"},"content_sha256":"b216e27b0e9fa78fef88dc2272d730986e31acf38017caef7fa35e97d0de69a9","schema_version":"1.0","event_id":"sha256:b216e27b0e9fa78fef88dc2272d730986e31acf38017caef7fa35e97d0de69a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EOKVY75FEWSZMHDY2BCTQ35QV/bundle.json","state_url":"https://pith.science/pith/4EOKVY75FEWSZMHDY2BCTQ35QV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EOKVY75FEWSZMHDY2BCTQ35QV/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-08T17:07:01Z","links":{"resolver":"https://pith.science/pith/4EOKVY75FEWSZMHDY2BCTQ35QV","bundle":"https://pith.science/pith/4EOKVY75FEWSZMHDY2BCTQ35QV/bundle.json","state":"https://pith.science/pith/4EOKVY75FEWSZMHDY2BCTQ35QV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EOKVY75FEWSZMHDY2BCTQ35QV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4EOKVY75FEWSZMHDY2BCTQ35QV","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":"040978f52d739dfb996ac6a794761f0ac69960d3e82f53c07ddc935528e26357","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","title_canon_sha256":"e3bb8b39159417d05aaaca1df0b5c3c5304304e012dd18e73a157516d2e9b1d6"},"schema_version":"1.0","source":{"id":"1305.3498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3498","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3498v1","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3498","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"4EOKVY75FEWS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4EOKVY75FEWSZMHD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4EOKVY75","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:b216e27b0e9fa78fef88dc2272d730986e31acf38017caef7fa35e97d0de69a9","target":"graph","created_at":"2026-05-18T03:25: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":"Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an $(n, k)$ MDS code stores $k$ symbols in $n$ disks such that the overall system is tolerant to a failure of up to $n-k$ disks. However, access to at least $k$ disks is still required to repair a single erasure. To reduce repair bandwidth, array codes are used where the stored symbols or packets are vectors of length $\\ell$. MDS array codes have the potential to repair a single erasure using a fraction $1/(n-k)$ of data stored in the remaining disks. We introduce new methods of a","authors_text":"Itzhak Tamo, Robert Calderbank, Sreechakra Goparaju","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","title":"An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3498","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:88dd6b2a90175ff13e27a0ad295a32ec4cf91e32feb6bd8a94bc27cbead7aecb","target":"record","created_at":"2026-05-18T03:25: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":"040978f52d739dfb996ac6a794761f0ac69960d3e82f53c07ddc935528e26357","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","title_canon_sha256":"e3bb8b39159417d05aaaca1df0b5c3c5304304e012dd18e73a157516d2e9b1d6"},"schema_version":"1.0","source":{"id":"1305.3498","kind":"arxiv","version":1}},"canonical_sha256":"e11caae3fd292d2cb0e3c68229c37d8576164d2fcaa5b7df79a5b5730570ee7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e11caae3fd292d2cb0e3c68229c37d8576164d2fcaa5b7df79a5b5730570ee7b","first_computed_at":"2026-05-18T03:25:35.652876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:35.652876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t6/bAcCYNY7Ta2qYfi3NC1fG9dtgvI/CBUU9M4Pfk4bRZy89gsONNUSOQUZ6usr9bgh/EQxNVeUUO09NPc9yDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:35.653500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88dd6b2a90175ff13e27a0ad295a32ec4cf91e32feb6bd8a94bc27cbead7aecb","sha256:b216e27b0e9fa78fef88dc2272d730986e31acf38017caef7fa35e97d0de69a9"],"state_sha256":"ad83cc4e254f8fb325aea740730acdd98697bb3593f10bd02182fe5faaabeb25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFTOXJd1+iveIdOIoaJ86Z+ipx9rd1QRbnZOEMdiZMBkWPsRic7QWr/ZOLkkoWiyUyjI5LcTFvf4xJYapCqNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:07:01.748435Z","bundle_sha256":"fe907540f9b027b17ba11e09fb42355d52b01cffb6803dfef5e34ec518e62ad2"}}