{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GXDCLCKWHTSOTOBGRX5KULXOCT","short_pith_number":"pith:GXDCLCKW","canonical_record":{"source":{"id":"1005.0426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-04T00:45:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"801af13a6af4751ea349b0bbf85d49c8fd9910d065786487eecf24dd43e626e6","abstract_canon_sha256":"b34d1fcc3180dcb795bf3563da5a743cd22f56f3c8a79caf9dfddd315710c12e"},"schema_version":"1.0"},"canonical_sha256":"35c62589563ce4e9b8268dfaaa2eee14f2a7afcf0eaf04feaccf7e6e21ce41ad","source":{"kind":"arxiv","id":"1005.0426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0426","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0426v1","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0426","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"GXDCLCKWHTSO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GXDCLCKWHTSOTOBG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GXDCLCKW","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GXDCLCKWHTSOTOBGRX5KULXOCT","target":"record","payload":{"canonical_record":{"source":{"id":"1005.0426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-04T00:45:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"801af13a6af4751ea349b0bbf85d49c8fd9910d065786487eecf24dd43e626e6","abstract_canon_sha256":"b34d1fcc3180dcb795bf3563da5a743cd22f56f3c8a79caf9dfddd315710c12e"},"schema_version":"1.0"},"canonical_sha256":"35c62589563ce4e9b8268dfaaa2eee14f2a7afcf0eaf04feaccf7e6e21ce41ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:09.169006Z","signature_b64":"jzGKmiYyEEtW5sathwdKn22+VU47dkEVw+d69s4xeDMW63NJ7tyiir086wjRTShtTbxlnJS1sBCROgRp2mcXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c62589563ce4e9b8268dfaaa2eee14f2a7afcf0eaf04feaccf7e6e21ce41ad","last_reissued_at":"2026-05-18T02:24:09.168572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:09.168572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.0426","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:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwngHVLNkO7u5iey0AZHR17GUwODeYHrBZJYIAGnULS66A2vY5RzoHm58M+CKCUlQowBUw4c1Qlo/yjr1sxlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:50:55.996863Z"},"content_sha256":"b0fe5482bc6a14cc6ed422b4062ad51abcbf382a0e1de108b07babeadf03c9c3","schema_version":"1.0","event_id":"sha256:b0fe5482bc6a14cc6ed422b4062ad51abcbf382a0e1de108b07babeadf03c9c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GXDCLCKWHTSOTOBGRX5KULXOCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alexandros G. Dimakis, Theodoros K. Dikaliotis, Tracey Ho","submitted_at":"2010-05-04T00:45:53Z","abstract_excerpt":"We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that are built into the existing redundancy of the system, we propose a simple linear hashing scheme to detect errors in the storage nodes. Our main result is that for storing a data object of total size $\\size$ using an $(n,k)$ MDS code over a finite field $\\F_q$, up to $t_1=\\lfloor(n-k)/2\\rfloor$ errors can be detected, with probability of failure smaller than $1/ \\size$, by communicating only $O(n(n-k)\\log \\size)$ bits to a trust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0426","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:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXA09yBtKpeioVYL8W5i6VHjS1BYuQeNj5TbKPRc+Dhnt5g6ZXzM+6FYbfItKnOC0TZ2rjNA5KwrDaKfQBmhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:50:55.997267Z"},"content_sha256":"af6dbb48a13f23bcf452b7de242ffe7b4737bc228fc825d27cbe7c38c563ddad","schema_version":"1.0","event_id":"sha256:af6dbb48a13f23bcf452b7de242ffe7b4737bc228fc825d27cbe7c38c563ddad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXDCLCKWHTSOTOBGRX5KULXOCT/bundle.json","state_url":"https://pith.science/pith/GXDCLCKWHTSOTOBGRX5KULXOCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXDCLCKWHTSOTOBGRX5KULXOCT/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-27T15:50:55Z","links":{"resolver":"https://pith.science/pith/GXDCLCKWHTSOTOBGRX5KULXOCT","bundle":"https://pith.science/pith/GXDCLCKWHTSOTOBGRX5KULXOCT/bundle.json","state":"https://pith.science/pith/GXDCLCKWHTSOTOBGRX5KULXOCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXDCLCKWHTSOTOBGRX5KULXOCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GXDCLCKWHTSOTOBGRX5KULXOCT","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":"b34d1fcc3180dcb795bf3563da5a743cd22f56f3c8a79caf9dfddd315710c12e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-04T00:45:53Z","title_canon_sha256":"801af13a6af4751ea349b0bbf85d49c8fd9910d065786487eecf24dd43e626e6"},"schema_version":"1.0","source":{"id":"1005.0426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0426","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0426v1","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0426","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"GXDCLCKWHTSO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GXDCLCKWHTSOTOBG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GXDCLCKW","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:af6dbb48a13f23bcf452b7de242ffe7b4737bc228fc825d27cbe7c38c563ddad","target":"graph","created_at":"2026-05-18T02:24:09Z","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 investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that are built into the existing redundancy of the system, we propose a simple linear hashing scheme to detect errors in the storage nodes. Our main result is that for storing a data object of total size $\\size$ using an $(n,k)$ MDS code over a finite field $\\F_q$, up to $t_1=\\lfloor(n-k)/2\\rfloor$ errors can be detected, with probability of failure smaller than $1/ \\size$, by communicating only $O(n(n-k)\\log \\size)$ bits to a trust","authors_text":"Alexandros G. Dimakis, Theodoros K. Dikaliotis, Tracey Ho","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-04T00:45:53Z","title":"Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0426","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:b0fe5482bc6a14cc6ed422b4062ad51abcbf382a0e1de108b07babeadf03c9c3","target":"record","created_at":"2026-05-18T02:24:09Z","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":"b34d1fcc3180dcb795bf3563da5a743cd22f56f3c8a79caf9dfddd315710c12e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-04T00:45:53Z","title_canon_sha256":"801af13a6af4751ea349b0bbf85d49c8fd9910d065786487eecf24dd43e626e6"},"schema_version":"1.0","source":{"id":"1005.0426","kind":"arxiv","version":1}},"canonical_sha256":"35c62589563ce4e9b8268dfaaa2eee14f2a7afcf0eaf04feaccf7e6e21ce41ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35c62589563ce4e9b8268dfaaa2eee14f2a7afcf0eaf04feaccf7e6e21ce41ad","first_computed_at":"2026-05-18T02:24:09.168572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:09.168572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jzGKmiYyEEtW5sathwdKn22+VU47dkEVw+d69s4xeDMW63NJ7tyiir086wjRTShtTbxlnJS1sBCROgRp2mcXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:09.169006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.0426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0fe5482bc6a14cc6ed422b4062ad51abcbf382a0e1de108b07babeadf03c9c3","sha256:af6dbb48a13f23bcf452b7de242ffe7b4737bc228fc825d27cbe7c38c563ddad"],"state_sha256":"a356fd76e10c9824e4ef8129bbd68c23152c6f75aeebb3216487c224210e8626"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRQk6+xyRAM/QYC9C01RSv5uokGLtiklbRSPbR90EGDOMbNy7gJufxEAgz+etRXMSh4Sv1ZrXAV5IS+rrMzkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:50:55.999897Z","bundle_sha256":"2c9a79642f97e3782faed23e366ac5ef5109448943e1831104dd3980e4af47ba"}}