{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3CJJWWHHJUEFAVOFIJIHP6OZQT","short_pith_number":"pith:3CJJWWHH","canonical_record":{"source":{"id":"1605.08630","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-27T13:28:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b84d832bb54a9f882968d874c9af9a26b05486c310274a4cf12cfcb75a8cbc7b","abstract_canon_sha256":"6ac89a92f01733246dd87d103e50d8231ba55e2ba0d94538eed7d0a78cec96cd"},"schema_version":"1.0"},"canonical_sha256":"d8929b58e74d085055c5425077f9d984f5bc5209632b71bec36aae5cd03e891f","source":{"kind":"arxiv","id":"1605.08630","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08630","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08630v4","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08630","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"3CJJWWHHJUEF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3CJJWWHHJUEFAVOF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3CJJWWHH","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3CJJWWHHJUEFAVOFIJIHP6OZQT","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08630","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-27T13:28:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b84d832bb54a9f882968d874c9af9a26b05486c310274a4cf12cfcb75a8cbc7b","abstract_canon_sha256":"6ac89a92f01733246dd87d103e50d8231ba55e2ba0d94538eed7d0a78cec96cd"},"schema_version":"1.0"},"canonical_sha256":"d8929b58e74d085055c5425077f9d984f5bc5209632b71bec36aae5cd03e891f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.358575Z","signature_b64":"tj4Pqekl+X3/DGdgxNMhhP4EzLbLH1R1xkEy1qPrfRfOkJ9KyLYTaQE537QQfB2J2qEJwY+YkHgBhTp1oszRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8929b58e74d085055c5425077f9d984f5bc5209632b71bec36aae5cd03e891f","last_reissued_at":"2026-05-18T00:39:18.357941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.357941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08630","source_version":4,"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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpSr8jta3lKu2lnL7IyJNL2Q/0bT8F6zAfRghjCCy0wQVC+OGdaOufE2uC7HzQl448+ngnjMb8gMm7LZzAsEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:06:18.233782Z"},"content_sha256":"07d08be5b610923636dfff2c8c0c507be9ec45fec655a90a7652387bd67127cd","schema_version":"1.0","event_id":"sha256:07d08be5b610923636dfff2c8c0c507be9ec45fec655a90a7652387bd67127cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3CJJWWHHJUEFAVOFIJIHP6OZQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2016-05-27T13:28:05Z","abstract_excerpt":"An $(n,k,l)$ MDS array code of length $n,$ dimension $k=n-r$ and sub-packetization $l$ is formed of $l\\times n$ matrices over a finite field $F,$ with every column of the matrix stored on a separate node in a distributed storage system and viewed as a coordinate of the codeword. Repair of a failed node can be performed by accessing a set of $d\\le n-1$ helper nodes. The code is said to have the optimal access property if the amount of data accessed at each of the helper nodes meets a lower bound on this quantity. For optimal-access MDS codes with $d=n-1,$ the sub-packetization $l$ satisfies the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08630","kind":"arxiv","version":4},"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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9Li+vsMrpkqUexR/mJlWT9IioQgxGsaddbAVDzBBhGQi5d5BY/Apbo33NpVg75JpmnnbsH/YQIbttbWdmETBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:06:18.234518Z"},"content_sha256":"36ad548cd0661c658e1ace96194035f7c4833d09ea4be068ef8dfebc5112772c","schema_version":"1.0","event_id":"sha256:36ad548cd0661c658e1ace96194035f7c4833d09ea4be068ef8dfebc5112772c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/bundle.json","state_url":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/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-08T02:06:18Z","links":{"resolver":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT","bundle":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/bundle.json","state":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3CJJWWHHJUEFAVOFIJIHP6OZQT","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":"6ac89a92f01733246dd87d103e50d8231ba55e2ba0d94538eed7d0a78cec96cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-27T13:28:05Z","title_canon_sha256":"b84d832bb54a9f882968d874c9af9a26b05486c310274a4cf12cfcb75a8cbc7b"},"schema_version":"1.0","source":{"id":"1605.08630","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08630","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08630v4","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08630","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"3CJJWWHHJUEF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3CJJWWHHJUEFAVOF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3CJJWWHH","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:36ad548cd0661c658e1ace96194035f7c4833d09ea4be068ef8dfebc5112772c","target":"graph","created_at":"2026-05-18T00:39:18Z","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":"An $(n,k,l)$ MDS array code of length $n,$ dimension $k=n-r$ and sub-packetization $l$ is formed of $l\\times n$ matrices over a finite field $F,$ with every column of the matrix stored on a separate node in a distributed storage system and viewed as a coordinate of the codeword. Repair of a failed node can be performed by accessing a set of $d\\le n-1$ helper nodes. The code is said to have the optimal access property if the amount of data accessed at each of the helper nodes meets a lower bound on this quantity. For optimal-access MDS codes with $d=n-1,$ the sub-packetization $l$ satisfies the","authors_text":"Alexander Barg, Min Ye","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-27T13:28:05Z","title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08630","kind":"arxiv","version":4},"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:07d08be5b610923636dfff2c8c0c507be9ec45fec655a90a7652387bd67127cd","target":"record","created_at":"2026-05-18T00:39:18Z","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":"6ac89a92f01733246dd87d103e50d8231ba55e2ba0d94538eed7d0a78cec96cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-27T13:28:05Z","title_canon_sha256":"b84d832bb54a9f882968d874c9af9a26b05486c310274a4cf12cfcb75a8cbc7b"},"schema_version":"1.0","source":{"id":"1605.08630","kind":"arxiv","version":4}},"canonical_sha256":"d8929b58e74d085055c5425077f9d984f5bc5209632b71bec36aae5cd03e891f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8929b58e74d085055c5425077f9d984f5bc5209632b71bec36aae5cd03e891f","first_computed_at":"2026-05-18T00:39:18.357941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:18.357941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tj4Pqekl+X3/DGdgxNMhhP4EzLbLH1R1xkEy1qPrfRfOkJ9KyLYTaQE537QQfB2J2qEJwY+YkHgBhTp1oszRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:18.358575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08630","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07d08be5b610923636dfff2c8c0c507be9ec45fec655a90a7652387bd67127cd","sha256:36ad548cd0661c658e1ace96194035f7c4833d09ea4be068ef8dfebc5112772c"],"state_sha256":"e5b1084428f04f2ed0d8e6c5c2d61464d36640d100f9e18aecd149a53a311af1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WeehDdG8qEtlP5rbtBdyK7N+EdY8QHz9kNxIQE7L97934WmdTnc4VBzK58pIOlScgReyroCKn6824rl86BzXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:06:18.238205Z","bundle_sha256":"043cfdbe8c64e2566f0733004dc49b01f28e5abc9973f5f1a01a8e25e0c2f211"}}