{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7QGZDC7JT2SWAKWIWYS776GYD7","short_pith_number":"pith:7QGZDC7J","schema_version":"1.0","canonical_sha256":"fc0d918be99ea5602ac8b625fff8d81fdf2d9f637ff3f307de2bb4fb0c9cd543","source":{"kind":"arxiv","id":"1606.04467","version":1},"attestation_state":"computed","paper":{"title":"Outer Bounds 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, M. Nikhil Krishnan, Myna Vajha, N. Prakash, P. Vijay Kumar","submitted_at":"2016-06-14T17:28:59Z","abstract_excerpt":"In this paper, three outer bounds on the normalized storage-repair bandwidth (S-RB) tradeoff of regenerating codes having parameter set $\\{(n,k,d),(\\alpha,\\beta)\\}$ under the exact-repair (ER) setting are presented. The first outer bound is applicable for every parameter set $(n,k,d)$ and in conjunction with a code construction known as {\\em improved layered codes}, it characterizes the normalized ER tradeoff for the case $(n,k=3,d=n-1)$. It establishes a non-vanishing gap between the ER and functional-repair (FR) tradeoffs for every $(n,k,d)$. The second bound is an improvement upon an existi"},"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":"1606.04467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-14T17:28:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"064c4cf88fea63086f2a7dd2725f15e0ab242949f1ea3c09857210be01a9b1bb","abstract_canon_sha256":"d80950f1151aa9c55407d331c0d942f1dabcd285d1a323f5d45869c0f2692d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.575225Z","signature_b64":"bizuDbl6py2vQaga8FOJnKW9Sh3KgXJAtCxBHlVXjXlbHYNullquiyiVTOOA0Vpg9gX87b72/rvntOFFeXGkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc0d918be99ea5602ac8b625fff8d81fdf2d9f637ff3f307de2bb4fb0c9cd543","last_reissued_at":"2026-05-18T01:12:25.574853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.574853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Outer Bounds 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, M. Nikhil Krishnan, Myna Vajha, N. Prakash, P. Vijay Kumar","submitted_at":"2016-06-14T17:28:59Z","abstract_excerpt":"In this paper, three outer bounds on the normalized storage-repair bandwidth (S-RB) tradeoff of regenerating codes having parameter set $\\{(n,k,d),(\\alpha,\\beta)\\}$ under the exact-repair (ER) setting are presented. The first outer bound is applicable for every parameter set $(n,k,d)$ and in conjunction with a code construction known as {\\em improved layered codes}, it characterizes the normalized ER tradeoff for the case $(n,k=3,d=n-1)$. It establishes a non-vanishing gap between the ER and functional-repair (FR) tradeoffs for every $(n,k,d)$. The second bound is an improvement upon an existi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04467","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":"1606.04467","created_at":"2026-05-18T01:12:25.574904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04467v1","created_at":"2026-05-18T01:12:25.574904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04467","created_at":"2026-05-18T01:12:25.574904+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QGZDC7JT2SW","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QGZDC7JT2SWAKWI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QGZDC7J","created_at":"2026-05-18T12:30:04.600751+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/7QGZDC7JT2SWAKWIWYS776GYD7","json":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7.json","graph_json":"https://pith.science/api/pith-number/7QGZDC7JT2SWAKWIWYS776GYD7/graph.json","events_json":"https://pith.science/api/pith-number/7QGZDC7JT2SWAKWIWYS776GYD7/events.json","paper":"https://pith.science/paper/7QGZDC7J"},"agent_actions":{"view_html":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7","download_json":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7.json","view_paper":"https://pith.science/paper/7QGZDC7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04467&json=true","fetch_graph":"https://pith.science/api/pith-number/7QGZDC7JT2SWAKWIWYS776GYD7/graph.json","fetch_events":"https://pith.science/api/pith-number/7QGZDC7JT2SWAKWIWYS776GYD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7/action/storage_attestation","attest_author":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7/action/author_attestation","sign_citation":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7/action/citation_signature","submit_replication":"https://pith.science/pith/7QGZDC7JT2SWAKWIWYS776GYD7/action/replication_record"}},"created_at":"2026-05-18T01:12:25.574904+00:00","updated_at":"2026-05-18T01:12:25.574904+00:00"}