{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZN3MHB7AQVZ3JCUEU2FV5YUMH3","short_pith_number":"pith:ZN3MHB7A","schema_version":"1.0","canonical_sha256":"cb76c387e08573b48a84a68b5ee28c3ecc2d7ff463c06dc7733777660ef4f964","source":{"kind":"arxiv","id":"1312.6079","version":1},"attestation_state":"computed","paper":{"title":"An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Kaushik Senthoor, P. Vijay Kumar","submitted_at":"2013-12-20T19:18:25Z","abstract_excerpt":"In this paper we establish an improved outer bound on the storage-repair-bandwidth tradeoff of regenerating codes under exact repair. The result shows that in particular, it is not possible to construct exact-repair regenerating codes that asymptotically achieve the tradeoff that holds for functional repair. While this had been shown earlier by Tian for the special case of $[n,k,d]=[4,3,3]$ the present result holds for general $[n,k,d]$. The new outer bound is obtained by building on the framework established earlier by Shah et al."},"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":"1312.6079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T19:18:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2f2131957de0140dedc71aa09853c54c9692bcf3afacc9460f4a5ea42a449d6","abstract_canon_sha256":"bc068cf47cad9d2decd4ef6ac26866e50f840dd98a7b3510a212f13e878b6866"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:07.205297Z","signature_b64":"Pvyfz+eqNO/DJURPmv2QCrs+YSnN3thgkekyYdfTyfhy7y3HavcUoHFkf1EQbYATAz1VHXha0ggLci37ePV7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb76c387e08573b48a84a68b5ee28c3ecc2d7ff463c06dc7733777660ef4f964","last_reissued_at":"2026-05-18T03:04:07.204772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:07.204772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Kaushik Senthoor, P. Vijay Kumar","submitted_at":"2013-12-20T19:18:25Z","abstract_excerpt":"In this paper we establish an improved outer bound on the storage-repair-bandwidth tradeoff of regenerating codes under exact repair. The result shows that in particular, it is not possible to construct exact-repair regenerating codes that asymptotically achieve the tradeoff that holds for functional repair. While this had been shown earlier by Tian for the special case of $[n,k,d]=[4,3,3]$ the present result holds for general $[n,k,d]$. The new outer bound is obtained by building on the framework established earlier by Shah et al."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6079","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":"1312.6079","created_at":"2026-05-18T03:04:07.204851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6079v1","created_at":"2026-05-18T03:04:07.204851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6079","created_at":"2026-05-18T03:04:07.204851+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZN3MHB7AQVZ3","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZN3MHB7AQVZ3JCUE","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZN3MHB7A","created_at":"2026-05-18T12:28:09.283467+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/ZN3MHB7AQVZ3JCUEU2FV5YUMH3","json":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3.json","graph_json":"https://pith.science/api/pith-number/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/graph.json","events_json":"https://pith.science/api/pith-number/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/events.json","paper":"https://pith.science/paper/ZN3MHB7A"},"agent_actions":{"view_html":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3","download_json":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3.json","view_paper":"https://pith.science/paper/ZN3MHB7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6079&json=true","fetch_graph":"https://pith.science/api/pith-number/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/action/storage_attestation","attest_author":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/action/author_attestation","sign_citation":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/action/citation_signature","submit_replication":"https://pith.science/pith/ZN3MHB7AQVZ3JCUEU2FV5YUMH3/action/replication_record"}},"created_at":"2026-05-18T03:04:07.204851+00:00","updated_at":"2026-05-18T03:04:07.204851+00:00"}