{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FZRY4PHVBE3YRKMQRSV2F7Y5SW","short_pith_number":"pith:FZRY4PHV","canonical_record":{"source":{"id":"1602.04496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-14T19:52:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"287f88441b239da5c0d0eb85990f9f4de80e85f39f44309f5764664879cdd9f1","abstract_canon_sha256":"3b6591632f1175ac741f05c1482d2f74a29a30a0b2d7fbfc52dd0d7564993892"},"schema_version":"1.0"},"canonical_sha256":"2e638e3cf5093788a9908caba2ff1d95b4aaf90d374efb1f2b316e8f0485ad0a","source":{"kind":"arxiv","id":"1602.04496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04496","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04496v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04496","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"FZRY4PHVBE3Y","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZRY4PHVBE3YRKMQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZRY4PHV","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FZRY4PHVBE3YRKMQRSV2F7Y5SW","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-14T19:52:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"287f88441b239da5c0d0eb85990f9f4de80e85f39f44309f5764664879cdd9f1","abstract_canon_sha256":"3b6591632f1175ac741f05c1482d2f74a29a30a0b2d7fbfc52dd0d7564993892"},"schema_version":"1.0"},"canonical_sha256":"2e638e3cf5093788a9908caba2ff1d95b4aaf90d374efb1f2b316e8f0485ad0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:49.798421Z","signature_b64":"rzcZTqPzYKo55YI2aesGWQPx0VzkX0np8frEFPQZBQmR7fwiTaAbXVjDhDe9FOWkM8dGHTnx9a0l/Pxyj1CECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e638e3cf5093788a9908caba2ff1d95b4aaf90d374efb1f2b316e8f0485ad0a","last_reissued_at":"2026-05-18T01:20:49.797947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:49.797947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04496","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nkedU7aC9bMgLwlmonEvPWHI/QanCaLzzV/E53VpeooT/sgCUWw+JbvWiwOxJjhV2TwrC2m5ZX/6bLZmPs3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:40:31.692123Z"},"content_sha256":"1b18f1a4628362d25f8905f74ff5f28db8fb95b2b0f9c58ca0181ba716e20035","schema_version":"1.0","event_id":"sha256:1b18f1a4628362d25f8905f74ff5f28db8fb95b2b0f9c58ca0181ba716e20035"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FZRY4PHVBE3YRKMQRSV2F7Y5SW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Storage Regenerating Codes For All Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Arman Fazeli, Sreechakra Goparaju","submitted_at":"2016-02-14T19:52:34Z","abstract_excerpt":"Regenerating codes for distributed storage have attracted much research interest in the past decade. Such codes trade the bandwidth needed to repair a failed node with the overall amount of data stored in the network. Minimum storage regenerating (MSR) codes are an important class of optimal regenerating codes that minimize (first) the amount of data stored per node and (then) the repair bandwidth. Specifically, an $[n,k,d]$-$(\\alpha)$ MSR code $\\mathbb{C}$ over $\\mathbb{F}_q$ is defined as follows. Using such a code $\\mathbb{C}$, a file $\\cal{F}$ consisting of $\\alpha k$ symbols over $\\mathbb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04496","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1Lpn63HFrp+3IxuVzbG8hSCVU+z4Y5l2kPo4aX83R99uPdTeZrQRqbl9CBNtD6yno0jf7gfZ/1qRUiP7zABBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:40:31.692577Z"},"content_sha256":"71e9d02d40f290f255790d8a361b664be7b10138a3999ff9ebc50c5bdae57508","schema_version":"1.0","event_id":"sha256:71e9d02d40f290f255790d8a361b664be7b10138a3999ff9ebc50c5bdae57508"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZRY4PHVBE3YRKMQRSV2F7Y5SW/bundle.json","state_url":"https://pith.science/pith/FZRY4PHVBE3YRKMQRSV2F7Y5SW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZRY4PHVBE3YRKMQRSV2F7Y5SW/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-27T19:40:31Z","links":{"resolver":"https://pith.science/pith/FZRY4PHVBE3YRKMQRSV2F7Y5SW","bundle":"https://pith.science/pith/FZRY4PHVBE3YRKMQRSV2F7Y5SW/bundle.json","state":"https://pith.science/pith/FZRY4PHVBE3YRKMQRSV2F7Y5SW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZRY4PHVBE3YRKMQRSV2F7Y5SW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FZRY4PHVBE3YRKMQRSV2F7Y5SW","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":"3b6591632f1175ac741f05c1482d2f74a29a30a0b2d7fbfc52dd0d7564993892","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-14T19:52:34Z","title_canon_sha256":"287f88441b239da5c0d0eb85990f9f4de80e85f39f44309f5764664879cdd9f1"},"schema_version":"1.0","source":{"id":"1602.04496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04496","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04496v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04496","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"FZRY4PHVBE3Y","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZRY4PHVBE3YRKMQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZRY4PHV","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:71e9d02d40f290f255790d8a361b664be7b10138a3999ff9ebc50c5bdae57508","target":"graph","created_at":"2026-05-18T01:20:49Z","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":"Regenerating codes for distributed storage have attracted much research interest in the past decade. Such codes trade the bandwidth needed to repair a failed node with the overall amount of data stored in the network. Minimum storage regenerating (MSR) codes are an important class of optimal regenerating codes that minimize (first) the amount of data stored per node and (then) the repair bandwidth. Specifically, an $[n,k,d]$-$(\\alpha)$ MSR code $\\mathbb{C}$ over $\\mathbb{F}_q$ is defined as follows. Using such a code $\\mathbb{C}$, a file $\\cal{F}$ consisting of $\\alpha k$ symbols over $\\mathbb","authors_text":"Alexander Vardy, Arman Fazeli, Sreechakra Goparaju","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-14T19:52:34Z","title":"Minimum Storage Regenerating Codes For All Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04496","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:1b18f1a4628362d25f8905f74ff5f28db8fb95b2b0f9c58ca0181ba716e20035","target":"record","created_at":"2026-05-18T01:20:49Z","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":"3b6591632f1175ac741f05c1482d2f74a29a30a0b2d7fbfc52dd0d7564993892","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-14T19:52:34Z","title_canon_sha256":"287f88441b239da5c0d0eb85990f9f4de80e85f39f44309f5764664879cdd9f1"},"schema_version":"1.0","source":{"id":"1602.04496","kind":"arxiv","version":1}},"canonical_sha256":"2e638e3cf5093788a9908caba2ff1d95b4aaf90d374efb1f2b316e8f0485ad0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e638e3cf5093788a9908caba2ff1d95b4aaf90d374efb1f2b316e8f0485ad0a","first_computed_at":"2026-05-18T01:20:49.797947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:49.797947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rzcZTqPzYKo55YI2aesGWQPx0VzkX0np8frEFPQZBQmR7fwiTaAbXVjDhDe9FOWkM8dGHTnx9a0l/Pxyj1CECA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:49.798421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b18f1a4628362d25f8905f74ff5f28db8fb95b2b0f9c58ca0181ba716e20035","sha256:71e9d02d40f290f255790d8a361b664be7b10138a3999ff9ebc50c5bdae57508"],"state_sha256":"e543cb6429e8634275f8ec0ba5428bbaaac94e1574353a20b66f9763cdabbb1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmpIpnMcJgTrsULk0TA3AWT3T+hmX817c0z+NoGj2V3qkkDrykTMrLXS7mCXJcSdsvMpgpZak5VsZT0jSf5GCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:40:31.695606Z","bundle_sha256":"3274b1b1816946b552fda3f18af912233e3183ad822bce585df3afd68da5a9e8"}}