{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7O56LQERCHQVDHQ5AAQEM2BAQE","short_pith_number":"pith:7O56LQER","schema_version":"1.0","canonical_sha256":"fbbbe5c09111e1519e1d0020466820812f269ed34a26519ff271150a6185a955","source":{"kind":"arxiv","id":"1501.03983","version":2},"attestation_state":"computed","paper":{"title":"The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case $d = k = n-1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Nikhil Krishnan, N. Prakash","submitted_at":"2015-01-16T13:57:46Z","abstract_excerpt":"In this paper, we consider the setting of exact repair linear regenerating codes. Under this setting, we derive a new outer bound on the storage-repair-bandwidth trade-off for the case when $d = k = n -1$, where $(n, k, d)$ are parameters of the regenerating code, with their usual meaning. Taken together with the achievability result of Tian et. al. [1], we show that the new outer bound derived here completely characterizes the trade-off for the case of exact repair linear regenerating codes, when $d = k = n -1$. The new outer bound is derived by analyzing the dual code of the linear regenerat"},"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":"1501.03983","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-16T13:57:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ddc6b7ade91ad5aa80e0f4a86c683d1d2a609fe3ad9dad44266c3b164582a77","abstract_canon_sha256":"b9cf8c8305256710a1dfafb76c99b735c753f2b1e7534cdb10869c4826802b11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.258211Z","signature_b64":"IFkup+x2mkxY8OqJGqrvW2eFRIAKakOmMD0aYOUGM84P2d+kp4QZy1e1C2w3MfpW3TI80nrI3gtSxZ6lJ7CgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbbbe5c09111e1519e1d0020466820812f269ed34a26519ff271150a6185a955","last_reissued_at":"2026-05-18T02:28:47.257803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.257803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case $d = k = n-1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Nikhil Krishnan, N. Prakash","submitted_at":"2015-01-16T13:57:46Z","abstract_excerpt":"In this paper, we consider the setting of exact repair linear regenerating codes. Under this setting, we derive a new outer bound on the storage-repair-bandwidth trade-off for the case when $d = k = n -1$, where $(n, k, d)$ are parameters of the regenerating code, with their usual meaning. Taken together with the achievability result of Tian et. al. [1], we show that the new outer bound derived here completely characterizes the trade-off for the case of exact repair linear regenerating codes, when $d = k = n -1$. The new outer bound is derived by analyzing the dual code of the linear regenerat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03983","kind":"arxiv","version":2},"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":"1501.03983","created_at":"2026-05-18T02:28:47.257879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03983v2","created_at":"2026-05-18T02:28:47.257879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03983","created_at":"2026-05-18T02:28:47.257879+00:00"},{"alias_kind":"pith_short_12","alias_value":"7O56LQERCHQV","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7O56LQERCHQVDHQ5","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7O56LQER","created_at":"2026-05-18T12:29:10.953037+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/7O56LQERCHQVDHQ5AAQEM2BAQE","json":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE.json","graph_json":"https://pith.science/api/pith-number/7O56LQERCHQVDHQ5AAQEM2BAQE/graph.json","events_json":"https://pith.science/api/pith-number/7O56LQERCHQVDHQ5AAQEM2BAQE/events.json","paper":"https://pith.science/paper/7O56LQER"},"agent_actions":{"view_html":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE","download_json":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE.json","view_paper":"https://pith.science/paper/7O56LQER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03983&json=true","fetch_graph":"https://pith.science/api/pith-number/7O56LQERCHQVDHQ5AAQEM2BAQE/graph.json","fetch_events":"https://pith.science/api/pith-number/7O56LQERCHQVDHQ5AAQEM2BAQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/action/storage_attestation","attest_author":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/action/author_attestation","sign_citation":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/action/citation_signature","submit_replication":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/action/replication_record"}},"created_at":"2026-05-18T02:28:47.257879+00:00","updated_at":"2026-05-18T02:28:47.257879+00:00"}