{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LUT5RXP2SFQV7XOTQ3JT7NNSCC","short_pith_number":"pith:LUT5RXP2","canonical_record":{"source":{"id":"1504.05999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T22:25:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be6b99b45e2780db71ead030ea5305652bb3738b423804a918b63f01850abf16","abstract_canon_sha256":"ea08ca971deae6ca786193678eb0d596e8d29e37d96414d8b395b3b60645aa28"},"schema_version":"1.0"},"canonical_sha256":"5d27d8ddfa91615fddd386d33fb5b210b4509954114cd560f3a89759ca74d026","source":{"kind":"arxiv","id":"1504.05999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05999","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05999v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05999","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"LUT5RXP2SFQV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LUT5RXP2SFQV7XOT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LUT5RXP2","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LUT5RXP2SFQV7XOTQ3JT7NNSCC","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T22:25:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be6b99b45e2780db71ead030ea5305652bb3738b423804a918b63f01850abf16","abstract_canon_sha256":"ea08ca971deae6ca786193678eb0d596e8d29e37d96414d8b395b3b60645aa28"},"schema_version":"1.0"},"canonical_sha256":"5d27d8ddfa91615fddd386d33fb5b210b4509954114cd560f3a89759ca74d026","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:02.961199Z","signature_b64":"2tYzVb0HXYz6MwNqTcB29N2aR8gCNo+kfj30BVeEjOAhdHfVs7dkkREvCFNDs57P0HCP7XMpGElQnuHc32L0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d27d8ddfa91615fddd386d33fb5b210b4509954114cd560f3a89759ca74d026","last_reissued_at":"2026-05-18T02:18:02.960468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:02.960468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05999","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-18T02:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMlid0RJ9tRxlcZ43xtQbPUtBJxkl/yaTqeiwqzoW7HJ67ncJ492v47p+QrQb2J6leTHUmx3mne1LLDXEodoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:14.812624Z"},"content_sha256":"814076711132d4c78107882f44a22700052ade941b8abebc562f91d822384130","schema_version":"1.0","event_id":"sha256:814076711132d4c78107882f44a22700052ade941b8abebc562f91d822384130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LUT5RXP2SFQV7XOTQ3JT7NNSCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Securing Data against Limited-Knowledge Adversaries in Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rawad Bitar, Salim El Rouayheb","submitted_at":"2015-04-22T22:25:24Z","abstract_excerpt":"We study the problem of constructing secure regenerating codes that protect data integrity in distributed storage systems (DSS) in which some nodes may be compromised by a malicious adversary. The adversary can corrupt the data stored on and transmitted by the nodes under its control. The \"damage\" incurred by the actions of the adversary depends on how much information it knows about the data in the whole DSS. We focus on the limited-knowledge model in which the adversary knows only the data on the nodes under its control. The only secure capacity-achieving codes known in the literature for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05999","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-18T02:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGE433r6gfuNy9i500elVjBeRw8Q6XFDYacoEc4t9kmOygj2w/NpT5IwJ8AOQQ2WAdB1XxsWRRC1Apnu5nbBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:14.813352Z"},"content_sha256":"ec06629bacfb8e3b1a5903207642dd3678f7a905961a3bae1d4402356a8c6343","schema_version":"1.0","event_id":"sha256:ec06629bacfb8e3b1a5903207642dd3678f7a905961a3bae1d4402356a8c6343"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUT5RXP2SFQV7XOTQ3JT7NNSCC/bundle.json","state_url":"https://pith.science/pith/LUT5RXP2SFQV7XOTQ3JT7NNSCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUT5RXP2SFQV7XOTQ3JT7NNSCC/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-26T13:56:14Z","links":{"resolver":"https://pith.science/pith/LUT5RXP2SFQV7XOTQ3JT7NNSCC","bundle":"https://pith.science/pith/LUT5RXP2SFQV7XOTQ3JT7NNSCC/bundle.json","state":"https://pith.science/pith/LUT5RXP2SFQV7XOTQ3JT7NNSCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUT5RXP2SFQV7XOTQ3JT7NNSCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LUT5RXP2SFQV7XOTQ3JT7NNSCC","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":"ea08ca971deae6ca786193678eb0d596e8d29e37d96414d8b395b3b60645aa28","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T22:25:24Z","title_canon_sha256":"be6b99b45e2780db71ead030ea5305652bb3738b423804a918b63f01850abf16"},"schema_version":"1.0","source":{"id":"1504.05999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05999","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05999v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05999","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"LUT5RXP2SFQV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LUT5RXP2SFQV7XOT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LUT5RXP2","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:ec06629bacfb8e3b1a5903207642dd3678f7a905961a3bae1d4402356a8c6343","target":"graph","created_at":"2026-05-18T02:18:02Z","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 study the problem of constructing secure regenerating codes that protect data integrity in distributed storage systems (DSS) in which some nodes may be compromised by a malicious adversary. The adversary can corrupt the data stored on and transmitted by the nodes under its control. The \"damage\" incurred by the actions of the adversary depends on how much information it knows about the data in the whole DSS. We focus on the limited-knowledge model in which the adversary knows only the data on the nodes under its control. The only secure capacity-achieving codes known in the literature for th","authors_text":"Rawad Bitar, Salim El Rouayheb","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T22:25:24Z","title":"Securing Data against Limited-Knowledge Adversaries in Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05999","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:814076711132d4c78107882f44a22700052ade941b8abebc562f91d822384130","target":"record","created_at":"2026-05-18T02:18:02Z","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":"ea08ca971deae6ca786193678eb0d596e8d29e37d96414d8b395b3b60645aa28","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T22:25:24Z","title_canon_sha256":"be6b99b45e2780db71ead030ea5305652bb3738b423804a918b63f01850abf16"},"schema_version":"1.0","source":{"id":"1504.05999","kind":"arxiv","version":1}},"canonical_sha256":"5d27d8ddfa91615fddd386d33fb5b210b4509954114cd560f3a89759ca74d026","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d27d8ddfa91615fddd386d33fb5b210b4509954114cd560f3a89759ca74d026","first_computed_at":"2026-05-18T02:18:02.960468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:02.960468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2tYzVb0HXYz6MwNqTcB29N2aR8gCNo+kfj30BVeEjOAhdHfVs7dkkREvCFNDs57P0HCP7XMpGElQnuHc32L0CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:02.961199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:814076711132d4c78107882f44a22700052ade941b8abebc562f91d822384130","sha256:ec06629bacfb8e3b1a5903207642dd3678f7a905961a3bae1d4402356a8c6343"],"state_sha256":"7e2ef75304082c67dbc183069a090937affc1324f49505b48a895c8b2a31bbfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mkyLJx9+ZAEmtqdA+pwV45g1jYmk5okgI5+rljxaCgJDsK4k/y1GdRUHM5tajYPs69OpU6Aopvk6mGaTEFLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:56:14.817057Z","bundle_sha256":"0192456b37cec20b5e2cc0938541a8ccc3b4cde6bed21899af11f52be8bdc9e9"}}