{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LPW7TMD625HJJP33BXEXK2CY7N","short_pith_number":"pith:LPW7TMD6","schema_version":"1.0","canonical_sha256":"5bedf9b07ed74e94bf7b0dc9756858fb60cd331eb6bceebe021a74a118e274c7","source":{"kind":"arxiv","id":"1505.01986","version":3},"attestation_state":"computed","paper":{"title":"On Secrecy Capacity of Minimum Storage Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kun Huang, Ming Xian, Udaya Parampalli","submitted_at":"2015-05-08T10:38:35Z","abstract_excerpt":"In this paper, we revisit the problem of characterizing the secrecy capacity of minimum storage regenerating (MSR) codes under the passive $(l_1,l_2)$-eavesdropper model, where the eavesdropper has access to data stored on $l_1$ nodes and the repair data for an additional $l_2$ nodes. We study it from the information-theoretic perspective. First, some general properties of MSR codes as well as a simple and generally applicable upper bound on secrecy capacity are given. Second, a new concept of \\emph{stable} MSR codes is introduced, where the stable property is shown to be closely linked with 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":"1505.01986","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T10:38:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95c03a17b41e6839e3b97d4e6cf1250e8895e3742eef82203163048542f9ce19","abstract_canon_sha256":"e4b88079709c6f6dbb3300f96cb4bb0de36ddad21503b5fc3ea0bb87d62f62c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:36.768603Z","signature_b64":"f0vt6jDFKM2ETQTDdcJf2MKzNVihGjRIqf8qZ64kyg6SXqyWKYFEThaPvLG0RZpfQXTKsucpbWRZUdxSih4hCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bedf9b07ed74e94bf7b0dc9756858fb60cd331eb6bceebe021a74a118e274c7","last_reissued_at":"2026-05-18T01:09:36.768137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:36.768137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Secrecy Capacity of Minimum Storage Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kun Huang, Ming Xian, Udaya Parampalli","submitted_at":"2015-05-08T10:38:35Z","abstract_excerpt":"In this paper, we revisit the problem of characterizing the secrecy capacity of minimum storage regenerating (MSR) codes under the passive $(l_1,l_2)$-eavesdropper model, where the eavesdropper has access to data stored on $l_1$ nodes and the repair data for an additional $l_2$ nodes. We study it from the information-theoretic perspective. First, some general properties of MSR codes as well as a simple and generally applicable upper bound on secrecy capacity are given. Second, a new concept of \\emph{stable} MSR codes is introduced, where the stable property is shown to be closely linked with s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01986","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":"1505.01986","created_at":"2026-05-18T01:09:36.768206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01986v3","created_at":"2026-05-18T01:09:36.768206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01986","created_at":"2026-05-18T01:09:36.768206+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPW7TMD625HJ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPW7TMD625HJJP33","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPW7TMD6","created_at":"2026-05-18T12:29:29.992203+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/LPW7TMD625HJJP33BXEXK2CY7N","json":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N.json","graph_json":"https://pith.science/api/pith-number/LPW7TMD625HJJP33BXEXK2CY7N/graph.json","events_json":"https://pith.science/api/pith-number/LPW7TMD625HJJP33BXEXK2CY7N/events.json","paper":"https://pith.science/paper/LPW7TMD6"},"agent_actions":{"view_html":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N","download_json":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N.json","view_paper":"https://pith.science/paper/LPW7TMD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01986&json=true","fetch_graph":"https://pith.science/api/pith-number/LPW7TMD625HJJP33BXEXK2CY7N/graph.json","fetch_events":"https://pith.science/api/pith-number/LPW7TMD625HJJP33BXEXK2CY7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/action/storage_attestation","attest_author":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/action/author_attestation","sign_citation":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/action/citation_signature","submit_replication":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/action/replication_record"}},"created_at":"2026-05-18T01:09:36.768206+00:00","updated_at":"2026-05-18T01:09:36.768206+00:00"}