{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U7SGHGZZMV7V4YXXLCSDZD5CDW","short_pith_number":"pith:U7SGHGZZ","canonical_record":{"source":{"id":"1305.1221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T15:30:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"859b48990a3e9ab170313e20117c62fc9fab7bd8431c0ca4a641f1db86d3967e","abstract_canon_sha256":"bbfac78e6656119d1051ee6f7b38938b9b2eb8767f40277120a59e147cdfab95"},"schema_version":"1.0"},"canonical_sha256":"a7e4639b39657f5e62f758a43c8fa21d90fbf975f2c156755d930b3b2bf0cd7f","source":{"kind":"arxiv","id":"1305.1221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1221","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1221v1","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1221","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"U7SGHGZZMV7V","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7SGHGZZMV7V4YXX","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7SGHGZZ","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U7SGHGZZMV7V4YXXLCSDZD5CDW","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T15:30:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"859b48990a3e9ab170313e20117c62fc9fab7bd8431c0ca4a641f1db86d3967e","abstract_canon_sha256":"bbfac78e6656119d1051ee6f7b38938b9b2eb8767f40277120a59e147cdfab95"},"schema_version":"1.0"},"canonical_sha256":"a7e4639b39657f5e62f758a43c8fa21d90fbf975f2c156755d930b3b2bf0cd7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:23.769199Z","signature_b64":"Ysblxc7StTcjjCUow5z15dcpKQT9d2/kzkBhx/InwaVVsMI8zc+0DhyUDRXDwrAew/lZjfJw/GLdv2Mw7hZGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e4639b39657f5e62f758a43c8fa21d90fbf975f2c156755d930b3b2bf0cd7f","last_reissued_at":"2026-05-18T03:26:23.768604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:23.768604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1221","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-18T03:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NugdA5oZ+p/Iwt9mowAZM4bFl0DF84ZoaadM1e6EC5HJQkQXFA2Acrw3FYy5a5rOJOD4NfFhqqeGTVY+3vKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:33:35.036120Z"},"content_sha256":"b3d72d3ef105f2a9f3ad88654325f926376731c1eb3f4faf4073cd482eabd973","schema_version":"1.0","event_id":"sha256:b3d72d3ef105f2a9f3ad88654325f926376731c1eb3f4faf4073cd482eabd973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U7SGHGZZMV7V4YXXLCSDZD5CDW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of two SD Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"James S. Plank, Mario Blaum","submitted_at":"2013-05-06T15:30:31Z","abstract_excerpt":"SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus individual sectors to erasure coding. The code then tolerates combinations of disk and sector errors, rather than solely disk errors. It is been an open problem to construct general codes that have the SD property, and previous work has relied on Monte Carlo searches. In this paper, we present two general constructions that address the cases with one disk and two se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1221","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-18T03:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xc9cnrHV7TzmOl7cH96eS8JGoOpjdEtM/Q6C+fwOQhJ8Bu7zyCLz/bAeZY/CZaFL2yLbm6xpR+e0e52m3//VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:33:35.036527Z"},"content_sha256":"6a1da34cb45977ece06a9661c496da8a030e380033d1db41226a34901b8d1bb4","schema_version":"1.0","event_id":"sha256:6a1da34cb45977ece06a9661c496da8a030e380033d1db41226a34901b8d1bb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7SGHGZZMV7V4YXXLCSDZD5CDW/bundle.json","state_url":"https://pith.science/pith/U7SGHGZZMV7V4YXXLCSDZD5CDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7SGHGZZMV7V4YXXLCSDZD5CDW/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-31T00:33:35Z","links":{"resolver":"https://pith.science/pith/U7SGHGZZMV7V4YXXLCSDZD5CDW","bundle":"https://pith.science/pith/U7SGHGZZMV7V4YXXLCSDZD5CDW/bundle.json","state":"https://pith.science/pith/U7SGHGZZMV7V4YXXLCSDZD5CDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7SGHGZZMV7V4YXXLCSDZD5CDW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U7SGHGZZMV7V4YXXLCSDZD5CDW","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":"bbfac78e6656119d1051ee6f7b38938b9b2eb8767f40277120a59e147cdfab95","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T15:30:31Z","title_canon_sha256":"859b48990a3e9ab170313e20117c62fc9fab7bd8431c0ca4a641f1db86d3967e"},"schema_version":"1.0","source":{"id":"1305.1221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1221","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1221v1","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1221","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"U7SGHGZZMV7V","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7SGHGZZMV7V4YXX","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7SGHGZZ","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:6a1da34cb45977ece06a9661c496da8a030e380033d1db41226a34901b8d1bb4","target":"graph","created_at":"2026-05-18T03:26:23Z","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":"SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus individual sectors to erasure coding. The code then tolerates combinations of disk and sector errors, rather than solely disk errors. It is been an open problem to construct general codes that have the SD property, and previous work has relied on Monte Carlo searches. In this paper, we present two general constructions that address the cases with one disk and two se","authors_text":"James S. Plank, Mario Blaum","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T15:30:31Z","title":"Construction of two SD Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1221","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:b3d72d3ef105f2a9f3ad88654325f926376731c1eb3f4faf4073cd482eabd973","target":"record","created_at":"2026-05-18T03:26:23Z","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":"bbfac78e6656119d1051ee6f7b38938b9b2eb8767f40277120a59e147cdfab95","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T15:30:31Z","title_canon_sha256":"859b48990a3e9ab170313e20117c62fc9fab7bd8431c0ca4a641f1db86d3967e"},"schema_version":"1.0","source":{"id":"1305.1221","kind":"arxiv","version":1}},"canonical_sha256":"a7e4639b39657f5e62f758a43c8fa21d90fbf975f2c156755d930b3b2bf0cd7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7e4639b39657f5e62f758a43c8fa21d90fbf975f2c156755d930b3b2bf0cd7f","first_computed_at":"2026-05-18T03:26:23.768604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:23.768604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ysblxc7StTcjjCUow5z15dcpKQT9d2/kzkBhx/InwaVVsMI8zc+0DhyUDRXDwrAew/lZjfJw/GLdv2Mw7hZGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:23.769199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3d72d3ef105f2a9f3ad88654325f926376731c1eb3f4faf4073cd482eabd973","sha256:6a1da34cb45977ece06a9661c496da8a030e380033d1db41226a34901b8d1bb4"],"state_sha256":"0853c54656b94e4ba29aa3b0a81e32a48d91fc7959161fe895f5e8568c5fdfcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yB5j0jNABFd6JmWXOZDjKz8S/r+fZC3fwhW91USsGmqSwK3iP6YPG8r+EaC6iBsNP4GbvR7u01I4YB43U2QdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:33:35.039664Z","bundle_sha256":"013ecd3c1f42f3256c5db3e53f37cdd99b4c597934c3c0e22a86ebfb4f9cbfad"}}