{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HGHU7MBUFPE6J2YCHKITNJUFJN","short_pith_number":"pith:HGHU7MBU","canonical_record":{"source":{"id":"1302.4670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T16:55:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28c61689b5e55e270b604fd04efa4bf556b8d54d39c1bd7afe5460ae9d87a977","abstract_canon_sha256":"60cd25cbe5e802e9a0729db473c79d67a8281f78598b5de40a4913bfd1131bcb"},"schema_version":"1.0"},"canonical_sha256":"398f4fb0342bc9e4eb023a9136a6854b79a528b0ea9f88c9b986915cdf55a1fb","source":{"kind":"arxiv","id":"1302.4670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4670","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4670v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4670","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"HGHU7MBUFPE6","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HGHU7MBUFPE6J2YC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HGHU7MBU","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HGHU7MBUFPE6J2YCHKITNJUFJN","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T16:55:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28c61689b5e55e270b604fd04efa4bf556b8d54d39c1bd7afe5460ae9d87a977","abstract_canon_sha256":"60cd25cbe5e802e9a0729db473c79d67a8281f78598b5de40a4913bfd1131bcb"},"schema_version":"1.0"},"canonical_sha256":"398f4fb0342bc9e4eb023a9136a6854b79a528b0ea9f88c9b986915cdf55a1fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:12.501476Z","signature_b64":"cjJPcXPsHScviFVLGRrpBAsDtyzAMl6EkprF8/oGb5kC9ZYzeN+MwQRyGFsEPnCmKWiCv5+yw+NjBKiz7JWZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"398f4fb0342bc9e4eb023a9136a6854b79a528b0ea9f88c9b986915cdf55a1fb","last_reissued_at":"2026-05-18T03:33:12.500758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:12.500758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4670","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WPdyA2qbKVutQS1H9ye0NruPpYjW0pvP1HEU5gnjWWpxC8kjGwEOIpP3e7llDrx4VR7naedWXUmA6M6mNZ5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:46:47.332645Z"},"content_sha256":"7923b4695e62578c1ca21a329498588fc5022778e0c0ce57d7ee2bb6f308b9c5","schema_version":"1.0","event_id":"sha256:7923b4695e62578c1ca21a329498588fc5022778e0c0ce57d7ee2bb6f308b9c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HGHU7MBUFPE6J2YCHKITNJUFJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Vaneet Aggarwal, Vinay A. Vaishampayan","submitted_at":"2013-02-19T16:55:31Z","abstract_excerpt":"A new class of exact-repair regenerating codes is constructed by combining two layers of erasure correction codes together with combinatorial block designs, e.g., Steiner systems, balanced incomplete block designs and t-designs. The proposed codes have the \"uncoded repair\" property where the nodes participating in the repair simply transfer part of the stored data directly, without performing any computation. The layered error correction structure makes the decoding process rather straightforward, and in general the complexity is low. We show that this construction is able to achieve performan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4670","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cxHGlSlGCgZLi1ur+N3sPjXAxYJbQH5nK0XQ4o7ETkJnbYJ03MpzpmMMencG+vK4McmKvn1aJPeazbX6iNvVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:46:47.333421Z"},"content_sha256":"40bb95d874d9321ccae6b9fec68f87960bd47cc86d2060779597859f0eb5237b","schema_version":"1.0","event_id":"sha256:40bb95d874d9321ccae6b9fec68f87960bd47cc86d2060779597859f0eb5237b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGHU7MBUFPE6J2YCHKITNJUFJN/bundle.json","state_url":"https://pith.science/pith/HGHU7MBUFPE6J2YCHKITNJUFJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGHU7MBUFPE6J2YCHKITNJUFJN/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-30T11:46:47Z","links":{"resolver":"https://pith.science/pith/HGHU7MBUFPE6J2YCHKITNJUFJN","bundle":"https://pith.science/pith/HGHU7MBUFPE6J2YCHKITNJUFJN/bundle.json","state":"https://pith.science/pith/HGHU7MBUFPE6J2YCHKITNJUFJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGHU7MBUFPE6J2YCHKITNJUFJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HGHU7MBUFPE6J2YCHKITNJUFJN","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":"60cd25cbe5e802e9a0729db473c79d67a8281f78598b5de40a4913bfd1131bcb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T16:55:31Z","title_canon_sha256":"28c61689b5e55e270b604fd04efa4bf556b8d54d39c1bd7afe5460ae9d87a977"},"schema_version":"1.0","source":{"id":"1302.4670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4670","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4670v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4670","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"HGHU7MBUFPE6","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HGHU7MBUFPE6J2YC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HGHU7MBU","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:40bb95d874d9321ccae6b9fec68f87960bd47cc86d2060779597859f0eb5237b","target":"graph","created_at":"2026-05-18T03:33:12Z","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":"A new class of exact-repair regenerating codes is constructed by combining two layers of erasure correction codes together with combinatorial block designs, e.g., Steiner systems, balanced incomplete block designs and t-designs. The proposed codes have the \"uncoded repair\" property where the nodes participating in the repair simply transfer part of the stored data directly, without performing any computation. The layered error correction structure makes the decoding process rather straightforward, and in general the complexity is low. We show that this construction is able to achieve performan","authors_text":"Chao Tian, Vaneet Aggarwal, Vinay A. Vaishampayan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T16:55:31Z","title":"Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4670","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:7923b4695e62578c1ca21a329498588fc5022778e0c0ce57d7ee2bb6f308b9c5","target":"record","created_at":"2026-05-18T03:33:12Z","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":"60cd25cbe5e802e9a0729db473c79d67a8281f78598b5de40a4913bfd1131bcb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T16:55:31Z","title_canon_sha256":"28c61689b5e55e270b604fd04efa4bf556b8d54d39c1bd7afe5460ae9d87a977"},"schema_version":"1.0","source":{"id":"1302.4670","kind":"arxiv","version":1}},"canonical_sha256":"398f4fb0342bc9e4eb023a9136a6854b79a528b0ea9f88c9b986915cdf55a1fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"398f4fb0342bc9e4eb023a9136a6854b79a528b0ea9f88c9b986915cdf55a1fb","first_computed_at":"2026-05-18T03:33:12.500758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:12.500758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cjJPcXPsHScviFVLGRrpBAsDtyzAMl6EkprF8/oGb5kC9ZYzeN+MwQRyGFsEPnCmKWiCv5+yw+NjBKiz7JWZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:12.501476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7923b4695e62578c1ca21a329498588fc5022778e0c0ce57d7ee2bb6f308b9c5","sha256:40bb95d874d9321ccae6b9fec68f87960bd47cc86d2060779597859f0eb5237b"],"state_sha256":"e73316420a6cdefe33ebb270178e28bf2c1e43d3c97f24db37dee0fc094f62c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bl5QUMMbTP6uERrhrZMtgMZGseVMiHJ0eBP8DlK469yc0bey+tCBKqKmzKhVRjQ24Y4ebQR6sBjMd83OUmxkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:46:47.337136Z","bundle_sha256":"1efe718fb8aad8d1f92b1d487cacb1ccb3db1366049d3273d5499b4a035bfa25"}}