{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LPW7TMD625HJJP33BXEXK2CY7N","short_pith_number":"pith:LPW7TMD6","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"},"canonical_sha256":"5bedf9b07ed74e94bf7b0dc9756858fb60cd331eb6bceebe021a74a118e274c7","source":{"kind":"arxiv","id":"1505.01986","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01986","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01986v3","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01986","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"LPW7TMD625HJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPW7TMD625HJJP33","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPW7TMD6","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LPW7TMD625HJJP33BXEXK2CY7N","target":"record","payload":{"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"},"canonical_sha256":"5bedf9b07ed74e94bf7b0dc9756858fb60cd331eb6bceebe021a74a118e274c7","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"},"source_kind":"arxiv","source_id":"1505.01986","source_version":3,"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-18T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiYOyP/UIZug9mkJ2D5EQKy4xvpJr1xl5vnm1WcPVb78zKqbYOOMpeHO1ziL8/ed2Klb2iTjmNCoYxE1MwkfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:10:43.808630Z"},"content_sha256":"60f394fc62a5252345b3c744fc1559137ee2569c9fa10d274f09db4addae4b8e","schema_version":"1.0","event_id":"sha256:60f394fc62a5252345b3c744fc1559137ee2569c9fa10d274f09db4addae4b8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LPW7TMD625HJJP33BXEXK2CY7N","target":"graph","payload":{"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"},"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-18T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qkvq8wYPrb1FzYGvH7TjyDBgOTytlaYED41p9I+oUJv8EkssvZ8aOKZj2h22kspDS0f+73l/PjKaB8xGYS9yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:10:43.809100Z"},"content_sha256":"173e02a96998da0bc201fd42e0be759ad6a2dd5c38014c5f7ab26394a56ae3b8","schema_version":"1.0","event_id":"sha256:173e02a96998da0bc201fd42e0be759ad6a2dd5c38014c5f7ab26394a56ae3b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/bundle.json","state_url":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPW7TMD625HJJP33BXEXK2CY7N/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-30T05:10:43Z","links":{"resolver":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N","bundle":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/bundle.json","state":"https://pith.science/pith/LPW7TMD625HJJP33BXEXK2CY7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPW7TMD625HJJP33BXEXK2CY7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LPW7TMD625HJJP33BXEXK2CY7N","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":"e4b88079709c6f6dbb3300f96cb4bb0de36ddad21503b5fc3ea0bb87d62f62c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T10:38:35Z","title_canon_sha256":"95c03a17b41e6839e3b97d4e6cf1250e8895e3742eef82203163048542f9ce19"},"schema_version":"1.0","source":{"id":"1505.01986","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01986","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01986v3","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01986","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"LPW7TMD625HJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPW7TMD625HJJP33","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPW7TMD6","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:173e02a96998da0bc201fd42e0be759ad6a2dd5c38014c5f7ab26394a56ae3b8","target":"graph","created_at":"2026-05-18T01:09:36Z","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":"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","authors_text":"Kun Huang, Ming Xian, Udaya Parampalli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T10:38:35Z","title":"On Secrecy Capacity of Minimum Storage Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01986","kind":"arxiv","version":3},"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:60f394fc62a5252345b3c744fc1559137ee2569c9fa10d274f09db4addae4b8e","target":"record","created_at":"2026-05-18T01:09:36Z","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":"e4b88079709c6f6dbb3300f96cb4bb0de36ddad21503b5fc3ea0bb87d62f62c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T10:38:35Z","title_canon_sha256":"95c03a17b41e6839e3b97d4e6cf1250e8895e3742eef82203163048542f9ce19"},"schema_version":"1.0","source":{"id":"1505.01986","kind":"arxiv","version":3}},"canonical_sha256":"5bedf9b07ed74e94bf7b0dc9756858fb60cd331eb6bceebe021a74a118e274c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bedf9b07ed74e94bf7b0dc9756858fb60cd331eb6bceebe021a74a118e274c7","first_computed_at":"2026-05-18T01:09:36.768137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:36.768137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f0vt6jDFKM2ETQTDdcJf2MKzNVihGjRIqf8qZ64kyg6SXqyWKYFEThaPvLG0RZpfQXTKsucpbWRZUdxSih4hCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:36.768603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01986","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60f394fc62a5252345b3c744fc1559137ee2569c9fa10d274f09db4addae4b8e","sha256:173e02a96998da0bc201fd42e0be759ad6a2dd5c38014c5f7ab26394a56ae3b8"],"state_sha256":"42d22570b59bde0bdea42ec84fbee3a30676beb75f07e6e871075655fb389804"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHZCBYBej4mF7ODI54eQcCNb8yBpyWHFRHMDXYC+HMGDlbNqPLinyExVIztg46aoHJ9uqP6RhH7Pdfb73M7tAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:10:43.812408Z","bundle_sha256":"17f85f4c0959ecf343a2c4300a816b9522492a971e40966395f01e3d6fd5828f"}}