{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZZPQJGTGKT67KITJCOLYDI5XBY","short_pith_number":"pith:ZZPQJGTG","canonical_record":{"source":{"id":"1202.0800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T19:11:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b19d37b57494ba9da544b62122db2c9c8d57bdb6ea15245c13231e9ea16dcb97","abstract_canon_sha256":"a0eb35315fa43280de0a05ebea3e6f88f608285588f07253a3761944219da48c"},"schema_version":"1.0"},"canonical_sha256":"ce5f049a6654fdf52269139781a3b70e088ec3ee7335a4660dbfbf5f8dbccf3b","source":{"kind":"arxiv","id":"1202.0800","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0800","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0800v2","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0800","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZZPQJGTGKT67","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZZPQJGTGKT67KITJ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZZPQJGTG","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZZPQJGTGKT67KITJCOLYDI5XBY","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T19:11:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b19d37b57494ba9da544b62122db2c9c8d57bdb6ea15245c13231e9ea16dcb97","abstract_canon_sha256":"a0eb35315fa43280de0a05ebea3e6f88f608285588f07253a3761944219da48c"},"schema_version":"1.0"},"canonical_sha256":"ce5f049a6654fdf52269139781a3b70e088ec3ee7335a4660dbfbf5f8dbccf3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:01.990767Z","signature_b64":"e9PaBLBOHSJKEyfFGAHBLiDtsxd8NE+DO06FbJ5w62dXUhtbLTXs6liTbcto82dw/ih6g5b0mlsV+9xv2hHXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce5f049a6654fdf52269139781a3b70e088ec3ee7335a4660dbfbf5f8dbccf3b","last_reissued_at":"2026-05-18T03:51:01.990069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:01.990069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0800","source_version":2,"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:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VO3wdsHg3AvslXLpFc2dlnp7nPCpq/DYtcwDyivNQ4x6FzgL0P0o75n6z7pO0X6zo4wGJSzWOjvVsr9t59uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:58:04.603529Z"},"content_sha256":"92b274bdd8e18ec643e48619ba2827d5fced37f631051cd4aa859d44b124e494","schema_version":"1.0","event_id":"sha256:92b274bdd8e18ec643e48619ba2827d5fced37f631051cd4aa859d44b124e494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZZPQJGTGKT67KITJCOLYDI5XBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Resilience in Distributed Storage via Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, Natalia Silberstein, Sriram Vishwanath","submitted_at":"2012-02-03T19:11:10Z","abstract_excerpt":"This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the system during a node repair process. This paper presents a concatenated coding scheme which is based on two types of codes: maximum rank distance (MRD) code as an outer code and optimal repair maximal distance separable (MDS) array code as an inner code. Given this, two different types of adversarial errors are considered: the first type considers an adversary th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0800","kind":"arxiv","version":2},"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:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5bdXdaP+qCywaKArTqMkVGFSMXsKai9QATpQJV6N7T6P6nVKf7bM7LkhOP5ziTiB9SOQ4yAo5qAm612EK6XACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:58:04.604234Z"},"content_sha256":"5d1cab1e6146d4a67099a38bb8954a5dbcf2443066d32b9b0baad01a3e567971","schema_version":"1.0","event_id":"sha256:5d1cab1e6146d4a67099a38bb8954a5dbcf2443066d32b9b0baad01a3e567971"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZPQJGTGKT67KITJCOLYDI5XBY/bundle.json","state_url":"https://pith.science/pith/ZZPQJGTGKT67KITJCOLYDI5XBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZPQJGTGKT67KITJCOLYDI5XBY/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-30T03:58:04Z","links":{"resolver":"https://pith.science/pith/ZZPQJGTGKT67KITJCOLYDI5XBY","bundle":"https://pith.science/pith/ZZPQJGTGKT67KITJCOLYDI5XBY/bundle.json","state":"https://pith.science/pith/ZZPQJGTGKT67KITJCOLYDI5XBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZPQJGTGKT67KITJCOLYDI5XBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZZPQJGTGKT67KITJCOLYDI5XBY","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":"a0eb35315fa43280de0a05ebea3e6f88f608285588f07253a3761944219da48c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T19:11:10Z","title_canon_sha256":"b19d37b57494ba9da544b62122db2c9c8d57bdb6ea15245c13231e9ea16dcb97"},"schema_version":"1.0","source":{"id":"1202.0800","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0800","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0800v2","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0800","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZZPQJGTGKT67","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZZPQJGTGKT67KITJ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZZPQJGTG","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:5d1cab1e6146d4a67099a38bb8954a5dbcf2443066d32b9b0baad01a3e567971","target":"graph","created_at":"2026-05-18T03:51:01Z","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":"This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the system during a node repair process. This paper presents a concatenated coding scheme which is based on two types of codes: maximum rank distance (MRD) code as an outer code and optimal repair maximal distance separable (MDS) array code as an inner code. Given this, two different types of adversarial errors are considered: the first type considers an adversary th","authors_text":"Ankit Singh Rawat, Natalia Silberstein, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T19:11:10Z","title":"Error Resilience in Distributed Storage via Rank-Metric Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0800","kind":"arxiv","version":2},"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:92b274bdd8e18ec643e48619ba2827d5fced37f631051cd4aa859d44b124e494","target":"record","created_at":"2026-05-18T03:51:01Z","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":"a0eb35315fa43280de0a05ebea3e6f88f608285588f07253a3761944219da48c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T19:11:10Z","title_canon_sha256":"b19d37b57494ba9da544b62122db2c9c8d57bdb6ea15245c13231e9ea16dcb97"},"schema_version":"1.0","source":{"id":"1202.0800","kind":"arxiv","version":2}},"canonical_sha256":"ce5f049a6654fdf52269139781a3b70e088ec3ee7335a4660dbfbf5f8dbccf3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce5f049a6654fdf52269139781a3b70e088ec3ee7335a4660dbfbf5f8dbccf3b","first_computed_at":"2026-05-18T03:51:01.990069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:01.990069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e9PaBLBOHSJKEyfFGAHBLiDtsxd8NE+DO06FbJ5w62dXUhtbLTXs6liTbcto82dw/ih6g5b0mlsV+9xv2hHXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:01.990767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0800","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92b274bdd8e18ec643e48619ba2827d5fced37f631051cd4aa859d44b124e494","sha256:5d1cab1e6146d4a67099a38bb8954a5dbcf2443066d32b9b0baad01a3e567971"],"state_sha256":"9201b79bf284b0e1dc504d0c81b0cd4b790aac9bc20f7ff1007a268f26cb4c12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9tRn0OPzN9XRWeqQx0d81Ob94FdNfS//K3+695x5av/v5XGuXCFWHq/gorxtcw6QT5p8A/T+iY3X0e395ufCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:58:04.608058Z","bundle_sha256":"c7933fdf40493f8314802bcfee317763fb308a1367be3cb9cf83923757b45ee1"}}