{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TI3KGN45ZPB5AMQFE6MZ7W6STP","short_pith_number":"pith:TI3KGN45","canonical_record":{"source":{"id":"1707.05944","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-19T06:11:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f77fab9afa4707867e5d08f047b59097d3387f3d08a1e92f526f1354147bff5a","abstract_canon_sha256":"ae91bf91c2403e91c5d41177cefe886b131469d5eb93749282c2a87e1e5329de"},"schema_version":"1.0"},"canonical_sha256":"9a36a3379dcbc3d0320527999fdbd29bfcab9e1dfdf3f6da269671ccaa2e7398","source":{"kind":"arxiv","id":"1707.05944","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05944","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05944v3","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05944","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"TI3KGN45ZPB5","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TI3KGN45ZPB5AMQF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TI3KGN45","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TI3KGN45ZPB5AMQFE6MZ7W6STP","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05944","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-19T06:11:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f77fab9afa4707867e5d08f047b59097d3387f3d08a1e92f526f1354147bff5a","abstract_canon_sha256":"ae91bf91c2403e91c5d41177cefe886b131469d5eb93749282c2a87e1e5329de"},"schema_version":"1.0"},"canonical_sha256":"9a36a3379dcbc3d0320527999fdbd29bfcab9e1dfdf3f6da269671ccaa2e7398","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:03.810780Z","signature_b64":"fCQtHsnTpA8qfl9sSQAO7TEDlk7v7pN8e/lMkaV6wzHACQixUP9/romu3VFcYdkD/9gBf4SpgpGzdpMOYGwVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a36a3379dcbc3d0320527999fdbd29bfcab9e1dfdf3f6da269671ccaa2e7398","last_reissued_at":"2026-05-17T23:47:03.810249Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:03.810249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05944","source_version":3,"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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RvfLlMTgaTRMTr7X70YVC0TncyRMWnAjShkjrKQHqTixt9M4q1n3tQ6+LoyBKEDJI7vMAM3sCRec3Cqhj6kkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:51:11.141383Z"},"content_sha256":"ec8ba040e108e0f5ab6102f0349011b55172c296ab8246445f4bf77e8cfdd416","schema_version":"1.0","event_id":"sha256:ec8ba040e108e0f5ab6102f0349011b55172c296ab8246445f4bf77e8cfdd416"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TI3KGN45ZPB5AMQFE6MZ7W6STP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codes with Locality in the Rank and Subspace Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Iwan Duursma, Salim El Rouayheb, Swanand Kadhe","submitted_at":"2017-07-19T06:11:19Z","abstract_excerpt":"We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with locality constraints in the rank metric. Our motivation for constructing such codes stems from designing codes for efficient data recovery from correlated and/or mixed (i.e., complete and partial) failures in distributed storage systems. Specifically, the proposed local rank-metric codes can recover locally from 'crisscross errors and erasures', which affect a limited number of rows and/or columns of the storage system. We also derive a Si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05944","kind":"arxiv","version":3},"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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hX4q4KfmvuYIJb42OMmrMXH2A4cQAB/DT+UUOI2SMSBnVBDHLEe15ELcjhudXxqEsoLRBCDakFbzdhaNPnFgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:51:11.141735Z"},"content_sha256":"d583d29cf63eae4294141bc84042842b49aaca1987fe94499025905cf96402af","schema_version":"1.0","event_id":"sha256:d583d29cf63eae4294141bc84042842b49aaca1987fe94499025905cf96402af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TI3KGN45ZPB5AMQFE6MZ7W6STP/bundle.json","state_url":"https://pith.science/pith/TI3KGN45ZPB5AMQFE6MZ7W6STP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TI3KGN45ZPB5AMQFE6MZ7W6STP/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-21T11:51:11Z","links":{"resolver":"https://pith.science/pith/TI3KGN45ZPB5AMQFE6MZ7W6STP","bundle":"https://pith.science/pith/TI3KGN45ZPB5AMQFE6MZ7W6STP/bundle.json","state":"https://pith.science/pith/TI3KGN45ZPB5AMQFE6MZ7W6STP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TI3KGN45ZPB5AMQFE6MZ7W6STP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TI3KGN45ZPB5AMQFE6MZ7W6STP","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":"ae91bf91c2403e91c5d41177cefe886b131469d5eb93749282c2a87e1e5329de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-19T06:11:19Z","title_canon_sha256":"f77fab9afa4707867e5d08f047b59097d3387f3d08a1e92f526f1354147bff5a"},"schema_version":"1.0","source":{"id":"1707.05944","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05944","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05944v3","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05944","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"TI3KGN45ZPB5","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TI3KGN45ZPB5AMQF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TI3KGN45","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:d583d29cf63eae4294141bc84042842b49aaca1987fe94499025905cf96402af","target":"graph","created_at":"2026-05-17T23:47:03Z","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":"We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with locality constraints in the rank metric. Our motivation for constructing such codes stems from designing codes for efficient data recovery from correlated and/or mixed (i.e., complete and partial) failures in distributed storage systems. Specifically, the proposed local rank-metric codes can recover locally from 'crisscross errors and erasures', which affect a limited number of rows and/or columns of the storage system. We also derive a Si","authors_text":"Alex Sprintson, Iwan Duursma, Salim El Rouayheb, Swanand Kadhe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-19T06:11:19Z","title":"Codes with Locality in the Rank and Subspace Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05944","kind":"arxiv","version":3},"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:ec8ba040e108e0f5ab6102f0349011b55172c296ab8246445f4bf77e8cfdd416","target":"record","created_at":"2026-05-17T23:47:03Z","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":"ae91bf91c2403e91c5d41177cefe886b131469d5eb93749282c2a87e1e5329de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-19T06:11:19Z","title_canon_sha256":"f77fab9afa4707867e5d08f047b59097d3387f3d08a1e92f526f1354147bff5a"},"schema_version":"1.0","source":{"id":"1707.05944","kind":"arxiv","version":3}},"canonical_sha256":"9a36a3379dcbc3d0320527999fdbd29bfcab9e1dfdf3f6da269671ccaa2e7398","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a36a3379dcbc3d0320527999fdbd29bfcab9e1dfdf3f6da269671ccaa2e7398","first_computed_at":"2026-05-17T23:47:03.810249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:03.810249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fCQtHsnTpA8qfl9sSQAO7TEDlk7v7pN8e/lMkaV6wzHACQixUP9/romu3VFcYdkD/9gBf4SpgpGzdpMOYGwVCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:03.810780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05944","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec8ba040e108e0f5ab6102f0349011b55172c296ab8246445f4bf77e8cfdd416","sha256:d583d29cf63eae4294141bc84042842b49aaca1987fe94499025905cf96402af"],"state_sha256":"e4aca745a18268ab8efbb4d3dfa970b89773cebc80119629ee8b9d747fb58c56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmWg1bZu6rfWKUr20MQ2VS3I6oeLQvPU47LDsGd7K0tWIO29KDzLSnjuwu+yOa+FjDpwl5pdEcGDFBVDoYt8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T11:51:11.143651Z","bundle_sha256":"5832ea49dbf0c2e526a2e75c2e2e8c572adbbeccc6ece33a260fdfcc219b0eff"}}