{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q2ANI73Q6N5YFWRMPOIKYON5AN","short_pith_number":"pith:Q2ANI73Q","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"},"canonical_sha256":"8680d47f70f37b82da2c7b90ac39bd0370123ec203edca98c39bd3ed64a12d50","source":{"kind":"arxiv","id":"1711.02770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02770","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02770v1","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02770","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"Q2ANI73Q6N5Y","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2ANI73Q6N5YFWRM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2ANI73Q","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q2ANI73Q6N5YFWRMPOIKYON5AN","target":"record","payload":{"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"},"canonical_sha256":"8680d47f70f37b82da2c7b90ac39bd0370123ec203edca98c39bd3ed64a12d50","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"},"source_kind":"arxiv","source_id":"1711.02770","source_version":1,"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-18T00:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tI6+maq4s/DPaeWZE4dQJdr0e94EJtBn2QuiOQSzfoFC9yUCyZnNly9SjMgUzRfW5Fk/zgDWq1c5EzZL4rklAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:14:52.607490Z"},"content_sha256":"4b4aad8770b519c6a47b7b5b6c692d8a6092e7549ccdf72febf999bf44f37b32","schema_version":"1.0","event_id":"sha256:4b4aad8770b519c6a47b7b5b6c692d8a6092e7549ccdf72febf999bf44f37b32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q2ANI73Q6N5YFWRMPOIKYON5AN","target":"graph","payload":{"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"},"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-18T00:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sIYMCWWBCfj0zlvZaH1UDxg/RjL8vqVg3AzGFUApyM3md3crET2XukvJ42hwJOvatgZOOfUotArKPZ0O0TrfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:14:52.608120Z"},"content_sha256":"1e8e6ce868400c919191821d4bdbb1df50fa967a892584cd6113d20f6dc562f4","schema_version":"1.0","event_id":"sha256:1e8e6ce868400c919191821d4bdbb1df50fa967a892584cd6113d20f6dc562f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/bundle.json","state_url":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/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-26T06:14:52Z","links":{"resolver":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN","bundle":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/bundle.json","state":"https://pith.science/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2ANI73Q6N5YFWRMPOIKYON5AN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q2ANI73Q6N5YFWRMPOIKYON5AN","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":"76b7780a3936db913d02cd5aa9c16e20f3892089895bd106a7a82a6676a18dd9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-07T23:36:29Z","title_canon_sha256":"ec69840483c44a251717b89350468b13b4fbd27fbf2430c25065a6658fbfecca"},"schema_version":"1.0","source":{"id":"1711.02770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02770","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02770v1","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02770","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"Q2ANI73Q6N5Y","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2ANI73Q6N5YFWRM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2ANI73Q","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:1e8e6ce868400c919191821d4bdbb1df50fa967a892584cd6113d20f6dc562f4","target":"graph","created_at":"2026-05-18T00:31:01Z","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":"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","authors_text":"Ashish Khisti, Kaveh Mahdaviani, Soheil Mohajer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-07T23:36:29Z","title":"Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02770","kind":"arxiv","version":1},"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:4b4aad8770b519c6a47b7b5b6c692d8a6092e7549ccdf72febf999bf44f37b32","target":"record","created_at":"2026-05-18T00:31:01Z","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":"76b7780a3936db913d02cd5aa9c16e20f3892089895bd106a7a82a6676a18dd9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-07T23:36:29Z","title_canon_sha256":"ec69840483c44a251717b89350468b13b4fbd27fbf2430c25065a6658fbfecca"},"schema_version":"1.0","source":{"id":"1711.02770","kind":"arxiv","version":1}},"canonical_sha256":"8680d47f70f37b82da2c7b90ac39bd0370123ec203edca98c39bd3ed64a12d50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8680d47f70f37b82da2c7b90ac39bd0370123ec203edca98c39bd3ed64a12d50","first_computed_at":"2026-05-18T00:31:01.821283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:01.821283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dhpI50wOwLKk0zYI4FIC/kicMYe3cVVbZOFsEzSrVyIHCHeMpQWlLLwC43k0+xyE/WZlFyQn6bNyAH6ts+gDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:01.821980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b4aad8770b519c6a47b7b5b6c692d8a6092e7549ccdf72febf999bf44f37b32","sha256:1e8e6ce868400c919191821d4bdbb1df50fa967a892584cd6113d20f6dc562f4"],"state_sha256":"bfab230a429b78584e859f94ea6d9806a3e75e82bf1b434c6834c58ecc6882b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+GQ5C+woF1Ql3bfxpQl9FJd7IAG8Sfsi5dmwn5g3W+QcwbnedDdFb3hZFPYx4Y3tnnjTgrTTHfSUix4WxkAjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:14:52.611927Z","bundle_sha256":"7922934a2bb86416475be99861af5936b8b513729393184585e394e540fa452e"}}