{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WXU6QKKS53UYRYNJ47JCH3HAK4","short_pith_number":"pith:WXU6QKKS","canonical_record":{"source":{"id":"1209.6152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-27T07:59:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41bb6e9eee7c64b2dd924d68277de68ef4cb64107b0339fd448378758b098c40","abstract_canon_sha256":"19790305d641d3e40a368a422cbd00dfb59fddd297d4ae68f455bc64ae96fa63"},"schema_version":"1.0"},"canonical_sha256":"b5e9e82952eee988e1a9e7d223ece05730cff64eed2bfd1b080ce4c2183c2081","source":{"kind":"arxiv","id":"1209.6152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6152","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6152v2","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6152","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"WXU6QKKS53UY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WXU6QKKS53UYRYNJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WXU6QKKS","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WXU6QKKS53UYRYNJ47JCH3HAK4","target":"record","payload":{"canonical_record":{"source":{"id":"1209.6152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-27T07:59:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41bb6e9eee7c64b2dd924d68277de68ef4cb64107b0339fd448378758b098c40","abstract_canon_sha256":"19790305d641d3e40a368a422cbd00dfb59fddd297d4ae68f455bc64ae96fa63"},"schema_version":"1.0"},"canonical_sha256":"b5e9e82952eee988e1a9e7d223ece05730cff64eed2bfd1b080ce4c2183c2081","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:53.644451Z","signature_b64":"QVLIVwVJhEHtoEdTVpA5k+nmX6yHqG5wN4lNVQZBz+VN1pubKtMI+e8wEZiNQ6eTREzIp02RrbktseZKvvp9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e9e82952eee988e1a9e7d223ece05730cff64eed2bfd1b080ce4c2183c2081","last_reissued_at":"2026-05-18T03:30:53.643687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:53.643687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.6152","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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDOL8RHqQLuEiBD4uY+rkdW+kuJaBL/Hj6zaCzFaY7BYF+d4LiFXd2Cw2yFrsrWnPrj6onkwn0TFhioSBm1uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:10:21.438737Z"},"content_sha256":"6aa864babb6f613bcedea8e46c89d6a17004220be81192c5755844457a881498","schema_version":"1.0","event_id":"sha256:6aa864babb6f613bcedea8e46c89d6a17004220be81192c5755844457a881498"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WXU6QKKS53UYRYNJ47JCH3HAK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parity Declustering for Fault-Tolerant Storage Systems via $t$-designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Jin, Kheong Sann Chan, Son Hoang Dau, Weiya Xi, Yan Jia","submitted_at":"2012-09-27T07:59:15Z","abstract_excerpt":"Parity declustering allows faster reconstruction of a disk array when some disk fails. Moreover, it guarantees uniform reconstruction workload on all surviving disks. It has been shown that parity declustering for one-failure tolerant array codes can be obtained via Balanced Incomplete Block Designs. We extend this technique for array codes that can tolerate an arbitrary number of disk failures via $t$-designs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6152","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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onaJsEEEnLr9hRLYnjKOwWHZr07duXsIrUdpfK42szKXLyJV1rDKH6rxci3aT2Q/5ktZq+nRpHdP9gvcV78PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:10:21.439405Z"},"content_sha256":"250ac776312086a1834bf1cc97bda0a119dc82ddb7624510760a16cd264befc6","schema_version":"1.0","event_id":"sha256:250ac776312086a1834bf1cc97bda0a119dc82ddb7624510760a16cd264befc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/bundle.json","state_url":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/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-06T19:10:21Z","links":{"resolver":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4","bundle":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/bundle.json","state":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WXU6QKKS53UYRYNJ47JCH3HAK4","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":"19790305d641d3e40a368a422cbd00dfb59fddd297d4ae68f455bc64ae96fa63","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-27T07:59:15Z","title_canon_sha256":"41bb6e9eee7c64b2dd924d68277de68ef4cb64107b0339fd448378758b098c40"},"schema_version":"1.0","source":{"id":"1209.6152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6152","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6152v2","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6152","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"WXU6QKKS53UY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WXU6QKKS53UYRYNJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WXU6QKKS","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:250ac776312086a1834bf1cc97bda0a119dc82ddb7624510760a16cd264befc6","target":"graph","created_at":"2026-05-18T03:30:53Z","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":"Parity declustering allows faster reconstruction of a disk array when some disk fails. Moreover, it guarantees uniform reconstruction workload on all surviving disks. It has been shown that parity declustering for one-failure tolerant array codes can be obtained via Balanced Incomplete Block Designs. We extend this technique for array codes that can tolerate an arbitrary number of disk failures via $t$-designs.","authors_text":"Chao Jin, Kheong Sann Chan, Son Hoang Dau, Weiya Xi, Yan Jia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-27T07:59:15Z","title":"Parity Declustering for Fault-Tolerant Storage Systems via $t$-designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6152","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:6aa864babb6f613bcedea8e46c89d6a17004220be81192c5755844457a881498","target":"record","created_at":"2026-05-18T03:30:53Z","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":"19790305d641d3e40a368a422cbd00dfb59fddd297d4ae68f455bc64ae96fa63","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-27T07:59:15Z","title_canon_sha256":"41bb6e9eee7c64b2dd924d68277de68ef4cb64107b0339fd448378758b098c40"},"schema_version":"1.0","source":{"id":"1209.6152","kind":"arxiv","version":2}},"canonical_sha256":"b5e9e82952eee988e1a9e7d223ece05730cff64eed2bfd1b080ce4c2183c2081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5e9e82952eee988e1a9e7d223ece05730cff64eed2bfd1b080ce4c2183c2081","first_computed_at":"2026-05-18T03:30:53.643687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:53.643687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVLIVwVJhEHtoEdTVpA5k+nmX6yHqG5wN4lNVQZBz+VN1pubKtMI+e8wEZiNQ6eTREzIp02RrbktseZKvvp9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:53.644451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aa864babb6f613bcedea8e46c89d6a17004220be81192c5755844457a881498","sha256:250ac776312086a1834bf1cc97bda0a119dc82ddb7624510760a16cd264befc6"],"state_sha256":"a3d5dc2bfca0e15a71d533e8435b7be02e95154bf8b98cdf8542beddea75103f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWo3CfvEFX/vDOY12skCAT/9nZ8HwvnYdWKozLYZMhVTr3qpJu+vS6kvFEUy592zurJA+lS47ISPxWwO0T4WDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:10:21.442472Z","bundle_sha256":"48aadc8405c0a252e0b2508811bd91191ace42caa5428ee17ed4f047dc5e7f96"}}