{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X64M33WTIHYAE7Q2D6LDTJRPYH","short_pith_number":"pith:X64M33WT","schema_version":"1.0","canonical_sha256":"bfb8cdeed341f0027e1a1f9639a62fc1d113c7151383cdc64094e9966edca932","source":{"kind":"arxiv","id":"1608.01732","version":1},"attestation_state":"computed","paper":{"title":"A Note on Secure Minimum Storage Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat","submitted_at":"2016-08-05T01:04:58Z","abstract_excerpt":"This short note revisits the problem of designing secure minimum storage regenerating (MSR) codes for distributed storage systems. A secure MSR code ensures that a distributed storage system does not reveal the stored information to a passive eavesdropper. The eavesdropper is assumed to have access to the content stored on $\\ell_1$ number of storage nodes in the system and the data downloaded during the bandwidth efficient repair of an additional $\\ell_2$ number of storage nodes. This note combines the Gabidulin codes based precoding [18] and a new construction of MSR codes (without security r"},"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":"1608.01732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-05T01:04:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64f98f519f17d2659141ad49bcc8ab5e44c674d1426511febeb93b199df60bb3","abstract_canon_sha256":"5ab8be5cd1913bd1153279df6b3a6639b46d2bc2beab6a93c044de97a70dea5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:44.749879Z","signature_b64":"WRKmwu1vcTyBkUi0UtDxCzTShi6PNLimGWIntl9peXEk4cxexb/Je3DK8YTMV9Bk3rT9vdW9FJZWtRG7bpNYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfb8cdeed341f0027e1a1f9639a62fc1d113c7151383cdc64094e9966edca932","last_reissued_at":"2026-05-18T01:09:44.749137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:44.749137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Secure Minimum Storage Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat","submitted_at":"2016-08-05T01:04:58Z","abstract_excerpt":"This short note revisits the problem of designing secure minimum storage regenerating (MSR) codes for distributed storage systems. A secure MSR code ensures that a distributed storage system does not reveal the stored information to a passive eavesdropper. The eavesdropper is assumed to have access to the content stored on $\\ell_1$ number of storage nodes in the system and the data downloaded during the bandwidth efficient repair of an additional $\\ell_2$ number of storage nodes. This note combines the Gabidulin codes based precoding [18] and a new construction of MSR codes (without security r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01732","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.01732","created_at":"2026-05-18T01:09:44.749261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01732v1","created_at":"2026-05-18T01:09:44.749261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01732","created_at":"2026-05-18T01:09:44.749261+00:00"},{"alias_kind":"pith_short_12","alias_value":"X64M33WTIHYA","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X64M33WTIHYAE7Q2","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X64M33WT","created_at":"2026-05-18T12:30:51.357362+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/X64M33WTIHYAE7Q2D6LDTJRPYH","json":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH.json","graph_json":"https://pith.science/api/pith-number/X64M33WTIHYAE7Q2D6LDTJRPYH/graph.json","events_json":"https://pith.science/api/pith-number/X64M33WTIHYAE7Q2D6LDTJRPYH/events.json","paper":"https://pith.science/paper/X64M33WT"},"agent_actions":{"view_html":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH","download_json":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH.json","view_paper":"https://pith.science/paper/X64M33WT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01732&json=true","fetch_graph":"https://pith.science/api/pith-number/X64M33WTIHYAE7Q2D6LDTJRPYH/graph.json","fetch_events":"https://pith.science/api/pith-number/X64M33WTIHYAE7Q2D6LDTJRPYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH/action/storage_attestation","attest_author":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH/action/author_attestation","sign_citation":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH/action/citation_signature","submit_replication":"https://pith.science/pith/X64M33WTIHYAE7Q2D6LDTJRPYH/action/replication_record"}},"created_at":"2026-05-18T01:09:44.749261+00:00","updated_at":"2026-05-18T01:09:44.749261+00:00"}