{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4RN4INFQ3YMUJYNKSD3UQORHZ4","short_pith_number":"pith:4RN4INFQ","canonical_record":{"source":{"id":"1409.7286","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-25T15:12:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5b04a439a057f48e6a5e123cd30483243aa32733810f54641e364f4db1c90a90","abstract_canon_sha256":"38fe933b3da0a15de384b0c26ca2e58b7c921ec98b81b8383dc322173721d2b3"},"schema_version":"1.0"},"canonical_sha256":"e45bc434b0de1944e1aa90f7483a27cf3ca45b12b677ab197840ad2feccd6ab0","source":{"kind":"arxiv","id":"1409.7286","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7286","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7286v4","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7286","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"4RN4INFQ3YMU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4RN4INFQ3YMUJYNK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4RN4INFQ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4RN4INFQ3YMUJYNKSD3UQORHZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7286","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-25T15:12:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5b04a439a057f48e6a5e123cd30483243aa32733810f54641e364f4db1c90a90","abstract_canon_sha256":"38fe933b3da0a15de384b0c26ca2e58b7c921ec98b81b8383dc322173721d2b3"},"schema_version":"1.0"},"canonical_sha256":"e45bc434b0de1944e1aa90f7483a27cf3ca45b12b677ab197840ad2feccd6ab0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.441785Z","signature_b64":"PmPee8Zhp7o0OuR/YqcyL1YBEHwwekJDmZDm5731zHqmIHqMRxQ5qSfwIx/hAHhl+tbMyms31qd2rHjC28vvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e45bc434b0de1944e1aa90f7483a27cf3ca45b12b677ab197840ad2feccd6ab0","last_reissued_at":"2026-05-18T00:57:51.441063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.441063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7286","source_version":4,"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-18T00:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FF2wMgs3l/zAqxfOhwtpFJBtl/Yj6s3XlS9Ama6/gvyRGQNRJ11AAkY6iQv9agv5MYxswxJ7Jv+cScv4m5qFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:18:27.330945Z"},"content_sha256":"8fdd69056adddc154c2672ccd6f13754b1797ec91139a9123f67d5889be6a144","schema_version":"1.0","event_id":"sha256:8fdd69056adddc154c2672ccd6f13754b1797ec91139a9123f67d5889be6a144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4RN4INFQ3YMUJYNKSD3UQORHZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliability of Erasure Coded Storage Systems: A Geometric Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Antonio Campello, Vinay A. Vaishampayan","submitted_at":"2014-09-25T15:12:15Z","abstract_excerpt":"We consider the probability of data loss, or equivalently, the reliability function for an erasure coded distributed data storage system under worst case conditions. Data loss in an erasure coded system depends on probability distributions for the disk repair duration and the disk failure duration. In previous works, the data loss probability of such systems has been studied under the assumption of exponentially distributed disk failure and disk repair durations, using well-known analytic methods from the theory of Markov processes. These methods lead to an estimate of the integral of the reli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7286","kind":"arxiv","version":4},"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-18T00:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SSIxoZwBmP09tHlD/MelwEwHOV7u5cNalDybm96Ehg/Mzl5N3J4kB539J2xjAWswi56DtnS/gtyXKMYuqzvSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:18:27.331273Z"},"content_sha256":"df369403e7a6e21c6ec355d935891504ed0902d0ff0ccbc0893991b309b6f449","schema_version":"1.0","event_id":"sha256:df369403e7a6e21c6ec355d935891504ed0902d0ff0ccbc0893991b309b6f449"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RN4INFQ3YMUJYNKSD3UQORHZ4/bundle.json","state_url":"https://pith.science/pith/4RN4INFQ3YMUJYNKSD3UQORHZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RN4INFQ3YMUJYNKSD3UQORHZ4/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-20T19:18:27Z","links":{"resolver":"https://pith.science/pith/4RN4INFQ3YMUJYNKSD3UQORHZ4","bundle":"https://pith.science/pith/4RN4INFQ3YMUJYNKSD3UQORHZ4/bundle.json","state":"https://pith.science/pith/4RN4INFQ3YMUJYNKSD3UQORHZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RN4INFQ3YMUJYNKSD3UQORHZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4RN4INFQ3YMUJYNKSD3UQORHZ4","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":"38fe933b3da0a15de384b0c26ca2e58b7c921ec98b81b8383dc322173721d2b3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-25T15:12:15Z","title_canon_sha256":"5b04a439a057f48e6a5e123cd30483243aa32733810f54641e364f4db1c90a90"},"schema_version":"1.0","source":{"id":"1409.7286","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7286","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7286v4","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7286","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"4RN4INFQ3YMU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4RN4INFQ3YMUJYNK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4RN4INFQ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:df369403e7a6e21c6ec355d935891504ed0902d0ff0ccbc0893991b309b6f449","target":"graph","created_at":"2026-05-18T00:57:51Z","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":"We consider the probability of data loss, or equivalently, the reliability function for an erasure coded distributed data storage system under worst case conditions. Data loss in an erasure coded system depends on probability distributions for the disk repair duration and the disk failure duration. In previous works, the data loss probability of such systems has been studied under the assumption of exponentially distributed disk failure and disk repair durations, using well-known analytic methods from the theory of Markov processes. These methods lead to an estimate of the integral of the reli","authors_text":"Antonio Campello, Vinay A. Vaishampayan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-25T15:12:15Z","title":"Reliability of Erasure Coded Storage Systems: A Geometric Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7286","kind":"arxiv","version":4},"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:8fdd69056adddc154c2672ccd6f13754b1797ec91139a9123f67d5889be6a144","target":"record","created_at":"2026-05-18T00:57:51Z","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":"38fe933b3da0a15de384b0c26ca2e58b7c921ec98b81b8383dc322173721d2b3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-25T15:12:15Z","title_canon_sha256":"5b04a439a057f48e6a5e123cd30483243aa32733810f54641e364f4db1c90a90"},"schema_version":"1.0","source":{"id":"1409.7286","kind":"arxiv","version":4}},"canonical_sha256":"e45bc434b0de1944e1aa90f7483a27cf3ca45b12b677ab197840ad2feccd6ab0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e45bc434b0de1944e1aa90f7483a27cf3ca45b12b677ab197840ad2feccd6ab0","first_computed_at":"2026-05-18T00:57:51.441063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.441063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PmPee8Zhp7o0OuR/YqcyL1YBEHwwekJDmZDm5731zHqmIHqMRxQ5qSfwIx/hAHhl+tbMyms31qd2rHjC28vvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.441785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7286","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fdd69056adddc154c2672ccd6f13754b1797ec91139a9123f67d5889be6a144","sha256:df369403e7a6e21c6ec355d935891504ed0902d0ff0ccbc0893991b309b6f449"],"state_sha256":"19fa71d70f578f41cfe38f62774f1c37958001ffb92c3aa2ad2d3ee4ec198e28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJmARN2UKaQ045zNUhtpM69J5Dc1ORk0BL4Q84w9WQ2xyudBhyA11ERAb8rWnssB7hqUvq3vVk7vdR9Gy2rJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:18:27.333152Z","bundle_sha256":"03d4cba200403a2472fc631378278f646cbac6028a5204fd96c937f069c63ee7"}}