{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WZ3DIU3PR6SNTMEH7ZXEVFBJ44","short_pith_number":"pith:WZ3DIU3P","schema_version":"1.0","canonical_sha256":"b67634536f8fa4d9b087fe6e4a9429e730928a1eb4f8000a4288409bbc1c5db1","source":{"kind":"arxiv","id":"1003.0488","version":2},"attestation_state":"computed","paper":{"title":"On Secure Distributed Data Storage Under Repair Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Salim El Rouayheb, Sameer Pawar","submitted_at":"2010-03-02T01:13:47Z","abstract_excerpt":"We address the problem of securing distributed storage systems against passive eavesdroppers that can observe a limited number of storage nodes. An important aspect of these systems is node failures over time, which demand a repair mechanism aimed at maintaining a targeted high level of system reliability. If an eavesdropper observes a node that is added to the system to replace a failed node, it will have access to all the data downloaded during repair, which can potentially compromise the entire information in the system. We are interested in determining the secrecy capacity of distributed s"},"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":"1003.0488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-02T01:13:47Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"e16ac07aefbee51387912ed14c1bb5d2e20623a7bdfabaf822b9de490f1b2e38","abstract_canon_sha256":"a99f4e45b532722cb9aee9e328fee07d3b17d7d3e3ec8753028c0fac3244de04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.873720Z","signature_b64":"xofRrDrZq1Turxs/frwo/QuZ649whRRRLuJJdPuNVQHJxipViGVJ95TfHoA9Rb9s0nNf5b/U2+frdWeEa0r2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b67634536f8fa4d9b087fe6e4a9429e730928a1eb4f8000a4288409bbc1c5db1","last_reissued_at":"2026-05-18T00:57:57.872992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.872992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Secure Distributed Data Storage Under Repair Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Salim El Rouayheb, Sameer Pawar","submitted_at":"2010-03-02T01:13:47Z","abstract_excerpt":"We address the problem of securing distributed storage systems against passive eavesdroppers that can observe a limited number of storage nodes. An important aspect of these systems is node failures over time, which demand a repair mechanism aimed at maintaining a targeted high level of system reliability. If an eavesdropper observes a node that is added to the system to replace a failed node, it will have access to all the data downloaded during repair, which can potentially compromise the entire information in the system. We are interested in determining the secrecy capacity of distributed s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0488","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":"1003.0488","created_at":"2026-05-18T00:57:57.873124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.0488v2","created_at":"2026-05-18T00:57:57.873124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0488","created_at":"2026-05-18T00:57:57.873124+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZ3DIU3PR6SN","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZ3DIU3PR6SNTMEH","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZ3DIU3P","created_at":"2026-05-18T12:26:17.028572+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/WZ3DIU3PR6SNTMEH7ZXEVFBJ44","json":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44.json","graph_json":"https://pith.science/api/pith-number/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/graph.json","events_json":"https://pith.science/api/pith-number/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/events.json","paper":"https://pith.science/paper/WZ3DIU3P"},"agent_actions":{"view_html":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44","download_json":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44.json","view_paper":"https://pith.science/paper/WZ3DIU3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.0488&json=true","fetch_graph":"https://pith.science/api/pith-number/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/graph.json","fetch_events":"https://pith.science/api/pith-number/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/action/storage_attestation","attest_author":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/action/author_attestation","sign_citation":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/action/citation_signature","submit_replication":"https://pith.science/pith/WZ3DIU3PR6SNTMEH7ZXEVFBJ44/action/replication_record"}},"created_at":"2026-05-18T00:57:57.873124+00:00","updated_at":"2026-05-18T00:57:57.873124+00:00"}