{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:D7WHX4L6GV4AO3IVAU52RH55EQ","short_pith_number":"pith:D7WHX4L6","canonical_record":{"source":{"id":"1106.2275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-12T04:13:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"befec93e80fec0984ff85bb514304af68d3f57f503749f6fc4a287d190baae3b","abstract_canon_sha256":"51d1c530fbc63525f784a613f8e98fcaa8a78eb678f8b476203f5b20513db777"},"schema_version":"1.0"},"canonical_sha256":"1fec7bf17e3578076d15053ba89fbd2403aac4beaf7353dbb41eeb68fa863dce","source":{"kind":"arxiv","id":"1106.2275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2275","created_at":"2026-05-18T04:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2275v1","created_at":"2026-05-18T04:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2275","created_at":"2026-05-18T04:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"D7WHX4L6GV4A","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D7WHX4L6GV4AO3IV","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D7WHX4L6","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:D7WHX4L6GV4AO3IVAU52RH55EQ","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-12T04:13:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"befec93e80fec0984ff85bb514304af68d3f57f503749f6fc4a287d190baae3b","abstract_canon_sha256":"51d1c530fbc63525f784a613f8e98fcaa8a78eb678f8b476203f5b20513db777"},"schema_version":"1.0"},"canonical_sha256":"1fec7bf17e3578076d15053ba89fbd2403aac4beaf7353dbb41eeb68fa863dce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:06.118728Z","signature_b64":"gLJzdmWu1CG/EW10IoaN59So84fdq2tu5W14AHky8wF8KtsUEEY5B3CbpwrOpLElgPRXlEwuIH+OaiG13tX8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fec7bf17e3578076d15053ba89fbd2403aac4beaf7353dbb41eeb68fa863dce","last_reissued_at":"2026-05-18T04:20:06.118276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:06.118276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2275","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-18T04:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+sVYoiL6g9KA0kroeaCNGDy9DsMCrBnitNsGq9x+AiZHZCR7c1eQYTKAMsndFmHP675FB+U3gfEx9fyDpjDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:54.460138Z"},"content_sha256":"37e7d54364e2e7372f6b5450678e7bfa4f6f02f53535cd1a0b4ae2e32125b4c9","schema_version":"1.0","event_id":"sha256:37e7d54364e2e7372f6b5450678e7bfa4f6f02f53535cd1a0b4ae2e32125b4c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:D7WHX4L6GV4AO3IVAU52RH55EQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Byzantine Fault Tolerance of Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Fr\\'ed\\'erique Oggier","submitted_at":"2011-06-12T04:13:57Z","abstract_excerpt":"Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied among these new age storage centric codes. A lot of effort has been invested in understanding the fundamental achievable trade-offs of storage and bandwidth usage to maintain redundancy in presence of different models of failures, showcasing the efficacy of regenerating codes with respect to traditional erasure coding techniques. For practical usability in open and adversarial environments, as is typical in peer-to-p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2275","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-18T04:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPokmQSpIMKh2W2FgricKAHNwIujsDU/rvZ1vOExg4OXq/EdcS3RmkL0iXZYZEk/4xSg+ZDnMZmBggwvYShpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:54.460811Z"},"content_sha256":"e04aaeaf2513f2dd3e99732eed5495d474b8656d15fc93d1bf9f8eebdfc913d7","schema_version":"1.0","event_id":"sha256:e04aaeaf2513f2dd3e99732eed5495d474b8656d15fc93d1bf9f8eebdfc913d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7WHX4L6GV4AO3IVAU52RH55EQ/bundle.json","state_url":"https://pith.science/pith/D7WHX4L6GV4AO3IVAU52RH55EQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7WHX4L6GV4AO3IVAU52RH55EQ/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-27T16:35:54Z","links":{"resolver":"https://pith.science/pith/D7WHX4L6GV4AO3IVAU52RH55EQ","bundle":"https://pith.science/pith/D7WHX4L6GV4AO3IVAU52RH55EQ/bundle.json","state":"https://pith.science/pith/D7WHX4L6GV4AO3IVAU52RH55EQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7WHX4L6GV4AO3IVAU52RH55EQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:D7WHX4L6GV4AO3IVAU52RH55EQ","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":"51d1c530fbc63525f784a613f8e98fcaa8a78eb678f8b476203f5b20513db777","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-12T04:13:57Z","title_canon_sha256":"befec93e80fec0984ff85bb514304af68d3f57f503749f6fc4a287d190baae3b"},"schema_version":"1.0","source":{"id":"1106.2275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2275","created_at":"2026-05-18T04:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2275v1","created_at":"2026-05-18T04:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2275","created_at":"2026-05-18T04:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"D7WHX4L6GV4A","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D7WHX4L6GV4AO3IV","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D7WHX4L6","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:e04aaeaf2513f2dd3e99732eed5495d474b8656d15fc93d1bf9f8eebdfc913d7","target":"graph","created_at":"2026-05-18T04:20:06Z","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":"Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied among these new age storage centric codes. A lot of effort has been invested in understanding the fundamental achievable trade-offs of storage and bandwidth usage to maintain redundancy in presence of different models of failures, showcasing the efficacy of regenerating codes with respect to traditional erasure coding techniques. For practical usability in open and adversarial environments, as is typical in peer-to-p","authors_text":"Anwitaman Datta, Fr\\'ed\\'erique Oggier","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-12T04:13:57Z","title":"Byzantine Fault Tolerance of Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2275","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:37e7d54364e2e7372f6b5450678e7bfa4f6f02f53535cd1a0b4ae2e32125b4c9","target":"record","created_at":"2026-05-18T04:20:06Z","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":"51d1c530fbc63525f784a613f8e98fcaa8a78eb678f8b476203f5b20513db777","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-12T04:13:57Z","title_canon_sha256":"befec93e80fec0984ff85bb514304af68d3f57f503749f6fc4a287d190baae3b"},"schema_version":"1.0","source":{"id":"1106.2275","kind":"arxiv","version":1}},"canonical_sha256":"1fec7bf17e3578076d15053ba89fbd2403aac4beaf7353dbb41eeb68fa863dce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fec7bf17e3578076d15053ba89fbd2403aac4beaf7353dbb41eeb68fa863dce","first_computed_at":"2026-05-18T04:20:06.118276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:06.118276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLJzdmWu1CG/EW10IoaN59So84fdq2tu5W14AHky8wF8KtsUEEY5B3CbpwrOpLElgPRXlEwuIH+OaiG13tX8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:06.118728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37e7d54364e2e7372f6b5450678e7bfa4f6f02f53535cd1a0b4ae2e32125b4c9","sha256:e04aaeaf2513f2dd3e99732eed5495d474b8656d15fc93d1bf9f8eebdfc913d7"],"state_sha256":"55fa0b239bf3645540abf28b38a2342914bc7853c44630d9913554b28575179a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QawTKfaUAPLoik/id+MHjI+GvFAPBIvh5+AQYkkLwGPDJUpgB+iSh7rjBVT+1XAXv0ZpuYgKkjrOxWR4tN0mAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:35:54.464474Z","bundle_sha256":"0e0ebd7030632dc4384c34bcc5aa9dff09436ba45d03f0e84d92c1fe51a8aa36"}}