{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7O56LQERCHQVDHQ5AAQEM2BAQE","short_pith_number":"pith:7O56LQER","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"},"canonical_sha256":"fbbbe5c09111e1519e1d0020466820812f269ed34a26519ff271150a6185a955","source":{"kind":"arxiv","id":"1501.03983","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03983","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03983v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03983","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"7O56LQERCHQV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7O56LQERCHQVDHQ5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7O56LQER","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7O56LQERCHQVDHQ5AAQEM2BAQE","target":"record","payload":{"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"},"canonical_sha256":"fbbbe5c09111e1519e1d0020466820812f269ed34a26519ff271150a6185a955","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"},"source_kind":"arxiv","source_id":"1501.03983","source_version":2,"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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QdT34NC14JonLkvJxbO5gp1K4WhbVwS3971xcwr31JUflCgk4y2qxSMnsKsbxXzb9+MX3BzNIkMcqcO2TrvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:36.960119Z"},"content_sha256":"8eb14473ba2d605deae50dfe5bbee427722948fc8b5bff2ffd57cd5be1a81da2","schema_version":"1.0","event_id":"sha256:8eb14473ba2d605deae50dfe5bbee427722948fc8b5bff2ffd57cd5be1a81da2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7O56LQERCHQVDHQ5AAQEM2BAQE","target":"graph","payload":{"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"},"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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWBE9YD2dYMpm0xt01z5cl1gaLtcbizv4NdoAp8qcz/qbNIJDAhKwttSzxJ4wS+GqxqcHDoo3PjP2t0ytxuNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:36.960975Z"},"content_sha256":"02735ec7eecb1eef40112d4a126c64700df247bdbeafd2f29881ecb32ecc98da","schema_version":"1.0","event_id":"sha256:02735ec7eecb1eef40112d4a126c64700df247bdbeafd2f29881ecb32ecc98da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/bundle.json","state_url":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/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-31T09:58:36Z","links":{"resolver":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE","bundle":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/bundle.json","state":"https://pith.science/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7O56LQERCHQVDHQ5AAQEM2BAQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7O56LQERCHQVDHQ5AAQEM2BAQE","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":"b9cf8c8305256710a1dfafb76c99b735c753f2b1e7534cdb10869c4826802b11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-16T13:57:46Z","title_canon_sha256":"0ddc6b7ade91ad5aa80e0f4a86c683d1d2a609fe3ad9dad44266c3b164582a77"},"schema_version":"1.0","source":{"id":"1501.03983","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03983","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03983v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03983","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"7O56LQERCHQV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7O56LQERCHQVDHQ5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7O56LQER","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:02735ec7eecb1eef40112d4a126c64700df247bdbeafd2f29881ecb32ecc98da","target":"graph","created_at":"2026-05-18T02:28:47Z","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 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","authors_text":"M. Nikhil Krishnan, N. Prakash","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-16T13:57:46Z","title":"The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case $d = k = n-1$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03983","kind":"arxiv","version":2},"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:8eb14473ba2d605deae50dfe5bbee427722948fc8b5bff2ffd57cd5be1a81da2","target":"record","created_at":"2026-05-18T02:28:47Z","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":"b9cf8c8305256710a1dfafb76c99b735c753f2b1e7534cdb10869c4826802b11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-16T13:57:46Z","title_canon_sha256":"0ddc6b7ade91ad5aa80e0f4a86c683d1d2a609fe3ad9dad44266c3b164582a77"},"schema_version":"1.0","source":{"id":"1501.03983","kind":"arxiv","version":2}},"canonical_sha256":"fbbbe5c09111e1519e1d0020466820812f269ed34a26519ff271150a6185a955","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbbbe5c09111e1519e1d0020466820812f269ed34a26519ff271150a6185a955","first_computed_at":"2026-05-18T02:28:47.257803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.257803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IFkup+x2mkxY8OqJGqrvW2eFRIAKakOmMD0aYOUGM84P2d+kp4QZy1e1C2w3MfpW3TI80nrI3gtSxZ6lJ7CgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.258211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03983","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eb14473ba2d605deae50dfe5bbee427722948fc8b5bff2ffd57cd5be1a81da2","sha256:02735ec7eecb1eef40112d4a126c64700df247bdbeafd2f29881ecb32ecc98da"],"state_sha256":"24bfaa0eb2a39df41522a4d5132d079cc4a32cce5e315ff911a8cda0b28f7db7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1//dYcsI0u/yk9wnxvidG3LAhfTi31dcStgYvoxSv+CV+E8fUc3aOl6rDbahzMMgmsIuvF44OcdQe1lMXFiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:58:36.964925Z","bundle_sha256":"a4b098dfd88dbf1ad78df3750636076979b35eca0a99d3559db2070a78fb3e69"}}