{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XBMPCMEOKDQ64BAZCQTX66ZT56","short_pith_number":"pith:XBMPCMEO","canonical_record":{"source":{"id":"1608.00191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-31T06:30:54Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"cd034cdcbcce9f8932987a0b86e85aec6b4890d55fd05be19961b6bc74e85be2","abstract_canon_sha256":"d22f239ee40bab37afe2ff0530a85a0c74dbded0fdf1c9d16182c371c36b3707"},"schema_version":"1.0"},"canonical_sha256":"b858f1308e50e1ee041914277f7b33ef8e581579c56afa717a5a8c588c878d81","source":{"kind":"arxiv","id":"1608.00191","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00191","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00191v1","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00191","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"XBMPCMEOKDQ6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XBMPCMEOKDQ64BAZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XBMPCMEO","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XBMPCMEOKDQ64BAZCQTX66ZT56","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-31T06:30:54Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"cd034cdcbcce9f8932987a0b86e85aec6b4890d55fd05be19961b6bc74e85be2","abstract_canon_sha256":"d22f239ee40bab37afe2ff0530a85a0c74dbded0fdf1c9d16182c371c36b3707"},"schema_version":"1.0"},"canonical_sha256":"b858f1308e50e1ee041914277f7b33ef8e581579c56afa717a5a8c588c878d81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:12.279227Z","signature_b64":"ab0sc5qcJgc5Kyv25L6OrlVfKrIbVqa1hoKTrpjuMeXH1nI+C5dXISfLE9XU54pNyRy1f2U2sVaxV//xThIhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b858f1308e50e1ee041914277f7b33ef8e581579c56afa717a5a8c588c878d81","last_reissued_at":"2026-05-18T01:10:12.278761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:12.278761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00191","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-18T01:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q9ULsGCevhLnXye6ZftAOa/MaWQm3MW2JKVvDgkRcNddLN8Bc4CmwwH4NdOKw6LwfWLjnkROKMaVKE33h6KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:35:05.708176Z"},"content_sha256":"4e156fd8bf9a61e46fb35a01ef01e686ab2437de32bd00281a79eb9045d99230","schema_version":"1.0","event_id":"sha256:4e156fd8bf9a61e46fb35a01ef01e686ab2437de32bd00281a79eb9045d99230"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XBMPCMEOKDQ64BAZCQTX66ZT56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New MDS codes with small sub-packetization and near-optimal repair bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, Venkatesan Guruswami","submitted_at":"2016-07-31T06:30:54Z","abstract_excerpt":"An $(n, M)$ vector code $\\mathcal{C} \\subseteq \\mathbb{F}^n$ is a collection of $M$ codewords where $n$ elements (from the field $\\mathbb{F}$) in each of the codewords are referred to as code blocks. Assuming that $\\mathbb{F} \\cong \\mathbb{B}^{\\ell}$, the code blocks are treated as $\\ell$-length vectors over the base field $\\mathbb{B}$. Equivalently, the code is said to have the sub-packetization level $\\ell$. This paper addresses the problem of constructing MDS vector codes which enable exact reconstruction of each code block by downloading small amount of information from the remaining code "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00191","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-18T01:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ruFfkj8/+BFl2xq2nAQdAjnM5n/kWvsStUQTrQUtQKRF8cEw5dWTa7jaqDd0dORYfk6z1YKi6rSIProuJnvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:35:05.708740Z"},"content_sha256":"4d92381347459419b0b035ec9bef50f8326f1ff7fd6e77237933593c85b0d593","schema_version":"1.0","event_id":"sha256:4d92381347459419b0b035ec9bef50f8326f1ff7fd6e77237933593c85b0d593"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBMPCMEOKDQ64BAZCQTX66ZT56/bundle.json","state_url":"https://pith.science/pith/XBMPCMEOKDQ64BAZCQTX66ZT56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBMPCMEOKDQ64BAZCQTX66ZT56/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-30T06:35:05Z","links":{"resolver":"https://pith.science/pith/XBMPCMEOKDQ64BAZCQTX66ZT56","bundle":"https://pith.science/pith/XBMPCMEOKDQ64BAZCQTX66ZT56/bundle.json","state":"https://pith.science/pith/XBMPCMEOKDQ64BAZCQTX66ZT56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBMPCMEOKDQ64BAZCQTX66ZT56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XBMPCMEOKDQ64BAZCQTX66ZT56","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":"d22f239ee40bab37afe2ff0530a85a0c74dbded0fdf1c9d16182c371c36b3707","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-31T06:30:54Z","title_canon_sha256":"cd034cdcbcce9f8932987a0b86e85aec6b4890d55fd05be19961b6bc74e85be2"},"schema_version":"1.0","source":{"id":"1608.00191","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00191","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00191v1","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00191","created_at":"2026-05-18T01:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"XBMPCMEOKDQ6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XBMPCMEOKDQ64BAZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XBMPCMEO","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:4d92381347459419b0b035ec9bef50f8326f1ff7fd6e77237933593c85b0d593","target":"graph","created_at":"2026-05-18T01:10:12Z","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, M)$ vector code $\\mathcal{C} \\subseteq \\mathbb{F}^n$ is a collection of $M$ codewords where $n$ elements (from the field $\\mathbb{F}$) in each of the codewords are referred to as code blocks. Assuming that $\\mathbb{F} \\cong \\mathbb{B}^{\\ell}$, the code blocks are treated as $\\ell$-length vectors over the base field $\\mathbb{B}$. Equivalently, the code is said to have the sub-packetization level $\\ell$. This paper addresses the problem of constructing MDS vector codes which enable exact reconstruction of each code block by downloading small amount of information from the remaining code ","authors_text":"Ankit Singh Rawat, Venkatesan Guruswami","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-31T06:30:54Z","title":"New MDS codes with small sub-packetization and near-optimal repair bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00191","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:4e156fd8bf9a61e46fb35a01ef01e686ab2437de32bd00281a79eb9045d99230","target":"record","created_at":"2026-05-18T01:10:12Z","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":"d22f239ee40bab37afe2ff0530a85a0c74dbded0fdf1c9d16182c371c36b3707","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-31T06:30:54Z","title_canon_sha256":"cd034cdcbcce9f8932987a0b86e85aec6b4890d55fd05be19961b6bc74e85be2"},"schema_version":"1.0","source":{"id":"1608.00191","kind":"arxiv","version":1}},"canonical_sha256":"b858f1308e50e1ee041914277f7b33ef8e581579c56afa717a5a8c588c878d81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b858f1308e50e1ee041914277f7b33ef8e581579c56afa717a5a8c588c878d81","first_computed_at":"2026-05-18T01:10:12.278761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:12.278761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ab0sc5qcJgc5Kyv25L6OrlVfKrIbVqa1hoKTrpjuMeXH1nI+C5dXISfLE9XU54pNyRy1f2U2sVaxV//xThIhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:12.279227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00191","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e156fd8bf9a61e46fb35a01ef01e686ab2437de32bd00281a79eb9045d99230","sha256:4d92381347459419b0b035ec9bef50f8326f1ff7fd6e77237933593c85b0d593"],"state_sha256":"c2fd7f896a4afe39b184058181bfa8857e802effcee1f2a8104cb736227380df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6cb7gZqKQKkbABsgYzs4A+3xgooiRwXyJBW0IDWmOe/L2Vy/BExPElt73l2haauLszMm5Zr1AmVcoGzZ+WyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:35:05.712990Z","bundle_sha256":"114e57db52c840c678784788b712fa17558b743e7975a2adce5f8b527d1187cf"}}