{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XJITICO2GMHVWOGK3PSDOAZQPS","short_pith_number":"pith:XJITICO2","canonical_record":{"source":{"id":"1302.1256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T03:56:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4cb516f9d5182fe472015fe68bceaa8e8d9c87dd7461074a64f922cf565b519","abstract_canon_sha256":"e17ad1192d943577ce7a10bce065c84bca11f6f4973ee908eb8330a52d46c16b"},"schema_version":"1.0"},"canonical_sha256":"ba513409da330f5b38cadbe43703307c903c041fb163af2f3fb89dec2441da76","source":{"kind":"arxiv","id":"1302.1256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1256","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1256v2","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1256","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"pith_short_12","alias_value":"XJITICO2GMHV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XJITICO2GMHVWOGK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XJITICO2","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XJITICO2GMHVWOGK3PSDOAZQPS","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T03:56:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4cb516f9d5182fe472015fe68bceaa8e8d9c87dd7461074a64f922cf565b519","abstract_canon_sha256":"e17ad1192d943577ce7a10bce065c84bca11f6f4973ee908eb8330a52d46c16b"},"schema_version":"1.0"},"canonical_sha256":"ba513409da330f5b38cadbe43703307c903c041fb163af2f3fb89dec2441da76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:45.977550Z","signature_b64":"ZBV6t10hI48N3erudePFXPDVCYzP0WzemqZPghdVEZCMMbm6wbs+QJAFaszJkaQ9rNrTvYgAk6WIqnUo0yEdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba513409da330f5b38cadbe43703307c903c041fb163af2f3fb89dec2441da76","last_reissued_at":"2026-05-18T03:25:45.976493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:45.976493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1256","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:25:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7M6eOnuia9XJu6Yo79Wgh3wqaaHXoGi7br08T+YCNFpH8+fAkaVn/8OlB17cuLWG1e0YNshzVzxC9Ng0kbG+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:54.604500Z"},"content_sha256":"c6ae8c5a5fc107337d413f0fe8eb4f5568624f921ec9473a4187f63538f28f91","schema_version":"1.0","event_id":"sha256:c6ae8c5a5fc107337d413f0fe8eb4f5568624f921ec9473a4187f63538f28f91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XJITICO2GMHVWOGK3PSDOAZQPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junyu Chen, Kenneth W. Shum","submitted_at":"2013-02-06T03:56:04Z","abstract_excerpt":"Using the idea of interference alignment, Suh and Ramchandran constructed a class of minimum-storage regenerating codes which can repair one systematic or one parity-check node with optimal repair bandwidth. With the same code structure, we show that in addition to single node failure, double node failures can be repaired collaboratively with optimal repair bandwidth as well. We give an example of how to repair double failures in the Suh-Ramchandran regenerating code with six nodes, and give the proof for the general case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1256","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:25:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74NuEX6OVQFnoIqaD7YeaL/jOrorR2nFOUWGYzoOVjuW8MNu/hEo2j2aHTX93FuwkjAmCzm0hirPLIjyNhbhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:54.604903Z"},"content_sha256":"f19565036ed775f5a316586ced633567e139068bcd5d9657392c0e053171ef2d","schema_version":"1.0","event_id":"sha256:f19565036ed775f5a316586ced633567e139068bcd5d9657392c0e053171ef2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJITICO2GMHVWOGK3PSDOAZQPS/bundle.json","state_url":"https://pith.science/pith/XJITICO2GMHVWOGK3PSDOAZQPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJITICO2GMHVWOGK3PSDOAZQPS/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-27T11:51:54Z","links":{"resolver":"https://pith.science/pith/XJITICO2GMHVWOGK3PSDOAZQPS","bundle":"https://pith.science/pith/XJITICO2GMHVWOGK3PSDOAZQPS/bundle.json","state":"https://pith.science/pith/XJITICO2GMHVWOGK3PSDOAZQPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJITICO2GMHVWOGK3PSDOAZQPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XJITICO2GMHVWOGK3PSDOAZQPS","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":"e17ad1192d943577ce7a10bce065c84bca11f6f4973ee908eb8330a52d46c16b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T03:56:04Z","title_canon_sha256":"d4cb516f9d5182fe472015fe68bceaa8e8d9c87dd7461074a64f922cf565b519"},"schema_version":"1.0","source":{"id":"1302.1256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1256","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1256v2","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1256","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"pith_short_12","alias_value":"XJITICO2GMHV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XJITICO2GMHVWOGK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XJITICO2","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:f19565036ed775f5a316586ced633567e139068bcd5d9657392c0e053171ef2d","target":"graph","created_at":"2026-05-18T03:25:45Z","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":"Using the idea of interference alignment, Suh and Ramchandran constructed a class of minimum-storage regenerating codes which can repair one systematic or one parity-check node with optimal repair bandwidth. With the same code structure, we show that in addition to single node failure, double node failures can be repaired collaboratively with optimal repair bandwidth as well. We give an example of how to repair double failures in the Suh-Ramchandran regenerating code with six nodes, and give the proof for the general case.","authors_text":"Junyu Chen, Kenneth W. Shum","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T03:56:04Z","title":"Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1256","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:c6ae8c5a5fc107337d413f0fe8eb4f5568624f921ec9473a4187f63538f28f91","target":"record","created_at":"2026-05-18T03:25:45Z","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":"e17ad1192d943577ce7a10bce065c84bca11f6f4973ee908eb8330a52d46c16b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T03:56:04Z","title_canon_sha256":"d4cb516f9d5182fe472015fe68bceaa8e8d9c87dd7461074a64f922cf565b519"},"schema_version":"1.0","source":{"id":"1302.1256","kind":"arxiv","version":2}},"canonical_sha256":"ba513409da330f5b38cadbe43703307c903c041fb163af2f3fb89dec2441da76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba513409da330f5b38cadbe43703307c903c041fb163af2f3fb89dec2441da76","first_computed_at":"2026-05-18T03:25:45.976493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:45.976493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZBV6t10hI48N3erudePFXPDVCYzP0WzemqZPghdVEZCMMbm6wbs+QJAFaszJkaQ9rNrTvYgAk6WIqnUo0yEdBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:45.977550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6ae8c5a5fc107337d413f0fe8eb4f5568624f921ec9473a4187f63538f28f91","sha256:f19565036ed775f5a316586ced633567e139068bcd5d9657392c0e053171ef2d"],"state_sha256":"3c900a6f231f2deb682409bbeabd6d1b566be234a9d70ddd363ed8d20b5b4cd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"az+A2Cw69sanijjEiJA8R8oWZheWe54K6oFpp6koGFswIwV/SKzFfxlAfGC1l68QAY2MZ7Sn9iUDVwE9x1mDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:51:54.607090Z","bundle_sha256":"3cabcf0224f4bfece8cd76e020835c6cffdc79e2334067ee944030f7068fe616"}}