{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q2ANI73Q6N5YFWRMPOIKYON5AN","short_pith_number":"pith:Q2ANI73Q","schema_version":"1.0","canonical_sha256":"8680d47f70f37b82da2c7b90ac39bd0370123ec203edca98c39bd3ed64a12d50","source":{"kind":"arxiv","id":"1711.02770","version":1},"attestation_state":"computed","paper":{"title":"Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Kaveh Mahdaviani, Soheil Mohajer","submitted_at":"2017-11-07T23:36:29Z","abstract_excerpt":"Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen storage nodes in the network. In this work we consider two simultaneous extensions to the original regenerating codes framework introduced in [1]; i) both data reconstruction and repair are resilient to the presence of a certain number of erroneous nodes in the network and ii) the number of helper nodes in every repair is not fixed, but is a flexible parameter"},"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":"1711.02770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-07T23:36:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ec69840483c44a251717b89350468b13b4fbd27fbf2430c25065a6658fbfecca","abstract_canon_sha256":"76b7780a3936db913d02cd5aa9c16e20f3892089895bd106a7a82a6676a18dd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:01.821980Z","signature_b64":"dhpI50wOwLKk0zYI4FIC/kicMYe3cVVbZOFsEzSrVyIHCHeMpQWlLLwC43k0+xyE/WZlFyQn6bNyAH6ts+gDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8680d47f70f37b82da2c7b90ac39bd0370123ec203edca98c39bd3ed64a12d50","last_reissued_at":"2026-05-18T00:31:01.821283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:01.821283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Kaveh Mahdaviani, Soheil Mohajer","submitted_at":"2017-11-07T23:36:29Z","abstract_excerpt":"Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen storage nodes in the network. In this work we consider two simultaneous extensions to the original regenerating codes framework introduced in [1]; i) both data reconstruction and repair are resilient to the presence of a certain number of erroneous nodes in the network and ii) the number of helper nodes in every repair is not fixed, but is a flexible parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02770","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":"1711.02770","created_at":"2026-05-18T00:31:01.821429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02770v1","created_at":"2026-05-18T00:31:01.821429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02770","created_at":"2026-05-18T00:31:01.821429+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2ANI73Q6N5Y","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2ANI73Q6N5YFWRM","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2ANI73Q","created_at":"2026-05-18T12:31:37.085036+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/Q2ANI73Q6N5YFWRMPOIKYON5AN","json":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN.json","graph_json":"https://pith.science/api/pith-number/Q2ANI73Q6N5YFWRMPOIKYON5AN/graph.json","events_json":"https://pith.science/api/pith-number/Q2ANI73Q6N5YFWRMPOIKYON5AN/events.json","paper":"https://pith.science/paper/Q2ANI73Q"},"agent_actions":{"view_html":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN","download_json":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN.json","view_paper":"https://pith.science/paper/Q2ANI73Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02770&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2ANI73Q6N5YFWRMPOIKYON5AN/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2ANI73Q6N5YFWRMPOIKYON5AN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/action/storage_attestation","attest_author":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/action/author_attestation","sign_citation":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/action/citation_signature","submit_replication":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/action/replication_record"}},"created_at":"2026-05-18T00:31:01.821429+00:00","updated_at":"2026-05-18T00:31:01.821429+00:00"}