{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WXU6QKKS53UYRYNJ47JCH3HAK4","short_pith_number":"pith:WXU6QKKS","schema_version":"1.0","canonical_sha256":"b5e9e82952eee988e1a9e7d223ece05730cff64eed2bfd1b080ce4c2183c2081","source":{"kind":"arxiv","id":"1209.6152","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.6152","created_at":"2026-05-18T03:30:53.643813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.6152v2","created_at":"2026-05-18T03:30:53.643813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6152","created_at":"2026-05-18T03:30:53.643813+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXU6QKKS53UY","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXU6QKKS53UYRYNJ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXU6QKKS","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4","json":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4.json","graph_json":"https://pith.science/api/pith-number/WXU6QKKS53UYRYNJ47JCH3HAK4/graph.json","events_json":"https://pith.science/api/pith-number/WXU6QKKS53UYRYNJ47JCH3HAK4/events.json","paper":"https://pith.science/paper/WXU6QKKS"},"agent_actions":{"view_html":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4","download_json":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4.json","view_paper":"https://pith.science/paper/WXU6QKKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.6152&json=true","fetch_graph":"https://pith.science/api/pith-number/WXU6QKKS53UYRYNJ47JCH3HAK4/graph.json","fetch_events":"https://pith.science/api/pith-number/WXU6QKKS53UYRYNJ47JCH3HAK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/action/storage_attestation","attest_author":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/action/author_attestation","sign_citation":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/action/citation_signature","submit_replication":"https://pith.science/pith/WXU6QKKS53UYRYNJ47JCH3HAK4/action/replication_record"}},"created_at":"2026-05-18T03:30:53.643813+00:00","updated_at":"2026-05-18T03:30:53.643813+00:00"}