{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2GX4QPF2XEXKIZ6764MWPMIN2T","short_pith_number":"pith:2GX4QPF2","schema_version":"1.0","canonical_sha256":"d1afc83cbab92ea467dff71967b10dd4f531dd685180976de815d42ddecbeefe","source":{"kind":"arxiv","id":"1309.2712","version":3},"attestation_state":"computed","paper":{"title":"On Block Security of Regenerating Codes at the MBR Point for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2013-09-11T01:36:37Z","abstract_excerpt":"A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system (DSS). Previous work in the literature focuses on code constructions that trade storage capacity for perfect security. In other words, by decreasing the amount of original data that it can store, the system can guarantee that the adversary, which eavesdrops up to a certain number of storage nodes, obtains no information (in Shannon's sense) about the original data. In this work we introduce the concept of block secur"},"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":"1309.2712","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-11T01:36:37Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"225319004984032c7cee7224079625e0c19c710f41c8c44bac6114a322263140","abstract_canon_sha256":"08726cd3c3cd44a85cd1499786cf8250364b7d6379a72c0817d232f73e5f8ba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:45.779176Z","signature_b64":"NYtyod1ehK5kQ5QsAqNi0O7Bi9TIcKnC53NljbqcLcLVHYRy3aoWvU+9uo2pcq+9EQDhPBVfIn4RTXtaiUztBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1afc83cbab92ea467dff71967b10dd4f531dd685180976de815d42ddecbeefe","last_reissued_at":"2026-05-18T02:58:45.778539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:45.778539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Block Security of Regenerating Codes at the MBR Point for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2013-09-11T01:36:37Z","abstract_excerpt":"A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system (DSS). Previous work in the literature focuses on code constructions that trade storage capacity for perfect security. In other words, by decreasing the amount of original data that it can store, the system can guarantee that the adversary, which eavesdrops up to a certain number of storage nodes, obtains no information (in Shannon's sense) about the original data. In this work we introduce the concept of block secur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2712","kind":"arxiv","version":3},"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":"1309.2712","created_at":"2026-05-18T02:58:45.778650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2712v3","created_at":"2026-05-18T02:58:45.778650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2712","created_at":"2026-05-18T02:58:45.778650+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GX4QPF2XEXK","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GX4QPF2XEXKIZ67","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GX4QPF2","created_at":"2026-05-18T12:27:30.460161+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/2GX4QPF2XEXKIZ6764MWPMIN2T","json":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T.json","graph_json":"https://pith.science/api/pith-number/2GX4QPF2XEXKIZ6764MWPMIN2T/graph.json","events_json":"https://pith.science/api/pith-number/2GX4QPF2XEXKIZ6764MWPMIN2T/events.json","paper":"https://pith.science/paper/2GX4QPF2"},"agent_actions":{"view_html":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T","download_json":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T.json","view_paper":"https://pith.science/paper/2GX4QPF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2712&json=true","fetch_graph":"https://pith.science/api/pith-number/2GX4QPF2XEXKIZ6764MWPMIN2T/graph.json","fetch_events":"https://pith.science/api/pith-number/2GX4QPF2XEXKIZ6764MWPMIN2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T/action/storage_attestation","attest_author":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T/action/author_attestation","sign_citation":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T/action/citation_signature","submit_replication":"https://pith.science/pith/2GX4QPF2XEXKIZ6764MWPMIN2T/action/replication_record"}},"created_at":"2026-05-18T02:58:45.778650+00:00","updated_at":"2026-05-18T02:58:45.778650+00:00"}