{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MAGUQSYCF4JMBLUDH7HXIDCH3O","short_pith_number":"pith:MAGUQSYC","canonical_record":{"source":{"id":"1605.06927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-23T08:16:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"673826153ef0f13587b0f08c564ce95558507390f689d72ef8da18d83b2b7afd","abstract_canon_sha256":"2460ac2236f30c13ca718ded73014af62fd822970bc809240de75f76fe3d30eb"},"schema_version":"1.0"},"canonical_sha256":"600d484b022f12c0ae833fcf740c47dba302a3477d69e7d02c13028c912c9e87","source":{"kind":"arxiv","id":"1605.06927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06927","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06927v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06927","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"MAGUQSYCF4JM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAGUQSYCF4JMBLUD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAGUQSYC","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MAGUQSYCF4JMBLUDH7HXIDCH3O","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-23T08:16:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"673826153ef0f13587b0f08c564ce95558507390f689d72ef8da18d83b2b7afd","abstract_canon_sha256":"2460ac2236f30c13ca718ded73014af62fd822970bc809240de75f76fe3d30eb"},"schema_version":"1.0"},"canonical_sha256":"600d484b022f12c0ae833fcf740c47dba302a3477d69e7d02c13028c912c9e87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.837728Z","signature_b64":"IgAWkWRKr1Yi2Em7FTtQNZDQ0FKvKfEmdvzAXY8xnVV4usDMMnV8riH7pIFUXv601e5FMP5mkeE+1cuZdAm3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600d484b022f12c0ae833fcf740c47dba302a3477d69e7d02c13028c912c9e87","last_reissued_at":"2026-05-18T01:14:10.837105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.837105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06927","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-18T01:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKDhb3fP/CPvaxSnLLYwuFz9TrXvZ3OFXarQQquyRmlot/eM71ibPRtkRGLxC+FO2kIv5GUhuD1amJ54+lYwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:42:15.608442Z"},"content_sha256":"be994e94d9701018e4787ea546d83a9fe899dd70186060b1e9aa81049a3bf13a","schema_version":"1.0","event_id":"sha256:be994e94d9701018e4787ea546d83a9fe899dd70186060b1e9aa81049a3bf13a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MAGUQSYCF4JMBLUDH7HXIDCH3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MDS Codes with Progressive Engagement Property for Cloud Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Jafarkhani, Mahdi Hajiaghayi","submitted_at":"2016-05-23T08:16:28Z","abstract_excerpt":"Fast and efficient failure recovery is a new challenge for cloud storage systems with a large number of storage nodes. A pivotal recovery metric upon the failure of a storage node is repair bandwidth cost which refers to the amount of data that must be downloaded for regenerating the lost data. Since all the surviving nodes are not always accessible, we intend to introduce a class of maximum distance separable (MDS) codes that can be re-used when the number of selected nodes varies yet yields close to optimal repair bandwidth. Such codes provide flexibility in engaging more surviving nodes in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06927","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-18T01:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iVF9O/LpelPSSY2yuOMrAx2M8kdBa96z8e+T6VsI4INEFaz2YLgV+E+14lIBMnOPNhb1/iA2YMcw8lkIptKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:42:15.608982Z"},"content_sha256":"cb5fab10af2753dce11bbf897ca64a788ee995f1eb462a76853d3716d6448d05","schema_version":"1.0","event_id":"sha256:cb5fab10af2753dce11bbf897ca64a788ee995f1eb462a76853d3716d6448d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAGUQSYCF4JMBLUDH7HXIDCH3O/bundle.json","state_url":"https://pith.science/pith/MAGUQSYCF4JMBLUDH7HXIDCH3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAGUQSYCF4JMBLUDH7HXIDCH3O/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-27T19:42:15Z","links":{"resolver":"https://pith.science/pith/MAGUQSYCF4JMBLUDH7HXIDCH3O","bundle":"https://pith.science/pith/MAGUQSYCF4JMBLUDH7HXIDCH3O/bundle.json","state":"https://pith.science/pith/MAGUQSYCF4JMBLUDH7HXIDCH3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAGUQSYCF4JMBLUDH7HXIDCH3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MAGUQSYCF4JMBLUDH7HXIDCH3O","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":"2460ac2236f30c13ca718ded73014af62fd822970bc809240de75f76fe3d30eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-23T08:16:28Z","title_canon_sha256":"673826153ef0f13587b0f08c564ce95558507390f689d72ef8da18d83b2b7afd"},"schema_version":"1.0","source":{"id":"1605.06927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06927","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06927v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06927","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"MAGUQSYCF4JM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAGUQSYCF4JMBLUD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAGUQSYC","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:cb5fab10af2753dce11bbf897ca64a788ee995f1eb462a76853d3716d6448d05","target":"graph","created_at":"2026-05-18T01:14:10Z","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":"Fast and efficient failure recovery is a new challenge for cloud storage systems with a large number of storage nodes. A pivotal recovery metric upon the failure of a storage node is repair bandwidth cost which refers to the amount of data that must be downloaded for regenerating the lost data. Since all the surviving nodes are not always accessible, we intend to introduce a class of maximum distance separable (MDS) codes that can be re-used when the number of selected nodes varies yet yields close to optimal repair bandwidth. Such codes provide flexibility in engaging more surviving nodes in ","authors_text":"Hamid Jafarkhani, Mahdi Hajiaghayi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-23T08:16:28Z","title":"MDS Codes with Progressive Engagement Property for Cloud Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06927","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:be994e94d9701018e4787ea546d83a9fe899dd70186060b1e9aa81049a3bf13a","target":"record","created_at":"2026-05-18T01:14:10Z","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":"2460ac2236f30c13ca718ded73014af62fd822970bc809240de75f76fe3d30eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-23T08:16:28Z","title_canon_sha256":"673826153ef0f13587b0f08c564ce95558507390f689d72ef8da18d83b2b7afd"},"schema_version":"1.0","source":{"id":"1605.06927","kind":"arxiv","version":1}},"canonical_sha256":"600d484b022f12c0ae833fcf740c47dba302a3477d69e7d02c13028c912c9e87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"600d484b022f12c0ae833fcf740c47dba302a3477d69e7d02c13028c912c9e87","first_computed_at":"2026-05-18T01:14:10.837105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:10.837105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IgAWkWRKr1Yi2Em7FTtQNZDQ0FKvKfEmdvzAXY8xnVV4usDMMnV8riH7pIFUXv601e5FMP5mkeE+1cuZdAm3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:10.837728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be994e94d9701018e4787ea546d83a9fe899dd70186060b1e9aa81049a3bf13a","sha256:cb5fab10af2753dce11bbf897ca64a788ee995f1eb462a76853d3716d6448d05"],"state_sha256":"531bb5db906baaecd614881fd9b5118e14271e093242d9a89eed57751eb28e22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtAIq56yebECZqM40MuNoRY09i2l0HaE8I9TyZsaDc/lJ+nH0iXODxSuvCCQzQBhW/u1tYPryIPsW/5tKqiBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:42:15.612579Z","bundle_sha256":"0fa353235761f3469a7c4bbf809fb51aa2cd794027b7b3286c2bb5473c019d18"}}