{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:45JU4DQIWGD4IU35MSUVCFHBQ3","short_pith_number":"pith:45JU4DQI","schema_version":"1.0","canonical_sha256":"e7534e0e08b187c4537d64a95114e186d1498eb20bac8c4b74aba0f3cbf8cc11","source":{"kind":"arxiv","id":"1701.03023","version":1},"attestation_state":"computed","paper":{"title":"On the Tradeoff Region of Secure Exact-Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Cong Shen, Shuo Shao, Tie Liu","submitted_at":"2017-01-11T15:36:10Z","abstract_excerpt":"We consider the $(n,k,d,\\ell)$ secure exact-repair regenerating code problem, which generalizes the $(n,k,d)$ exact-repair regenerating code problem with the additional constraint that the stored file needs to be kept information-theoretically secure against an eavesdropper, who can access the data transmitted to regenerate a total of $\\ell$ different failed nodes. For all known results on this problem, the achievable tradeoff regions between the normalized storage capacity and repair bandwidth have a single corner point, achieved by a scheme proposed by Shah, Rashmi and Kumar (the SRK point)."},"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":"1701.03023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T15:36:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9789d1c067d9b3f9d530817728e12b55b74e9ee5d4eef2c7f10f764d7d09155a","abstract_canon_sha256":"768aaafb003d57cc39d08ac4b4efa24cf658fc444310040cdecdfc14f2b96868"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:59.526796Z","signature_b64":"gFqlGlRyTDKacUQ/TwQSFLE6Nz0ec8q/excwdvKfi6TQZMBAv5LOOCNnjnkHf2bqPSIwhes2N6oPxjFvT6LXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7534e0e08b187c4537d64a95114e186d1498eb20bac8c4b74aba0f3cbf8cc11","last_reissued_at":"2026-05-18T00:52:59.526272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:59.526272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Tradeoff Region of Secure Exact-Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Cong Shen, Shuo Shao, Tie Liu","submitted_at":"2017-01-11T15:36:10Z","abstract_excerpt":"We consider the $(n,k,d,\\ell)$ secure exact-repair regenerating code problem, which generalizes the $(n,k,d)$ exact-repair regenerating code problem with the additional constraint that the stored file needs to be kept information-theoretically secure against an eavesdropper, who can access the data transmitted to regenerate a total of $\\ell$ different failed nodes. For all known results on this problem, the achievable tradeoff regions between the normalized storage capacity and repair bandwidth have a single corner point, achieved by a scheme proposed by Shah, Rashmi and Kumar (the SRK point)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03023","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":"1701.03023","created_at":"2026-05-18T00:52:59.526364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03023v1","created_at":"2026-05-18T00:52:59.526364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03023","created_at":"2026-05-18T00:52:59.526364+00:00"},{"alias_kind":"pith_short_12","alias_value":"45JU4DQIWGD4","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"45JU4DQIWGD4IU35","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"45JU4DQI","created_at":"2026-05-18T12:30:58.224056+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/45JU4DQIWGD4IU35MSUVCFHBQ3","json":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3.json","graph_json":"https://pith.science/api/pith-number/45JU4DQIWGD4IU35MSUVCFHBQ3/graph.json","events_json":"https://pith.science/api/pith-number/45JU4DQIWGD4IU35MSUVCFHBQ3/events.json","paper":"https://pith.science/paper/45JU4DQI"},"agent_actions":{"view_html":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3","download_json":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3.json","view_paper":"https://pith.science/paper/45JU4DQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03023&json=true","fetch_graph":"https://pith.science/api/pith-number/45JU4DQIWGD4IU35MSUVCFHBQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/45JU4DQIWGD4IU35MSUVCFHBQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3/action/storage_attestation","attest_author":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3/action/author_attestation","sign_citation":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3/action/citation_signature","submit_replication":"https://pith.science/pith/45JU4DQIWGD4IU35MSUVCFHBQ3/action/replication_record"}},"created_at":"2026-05-18T00:52:59.526364+00:00","updated_at":"2026-05-18T00:52:59.526364+00:00"}