{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5Z4M4FB2JGP6V445QCUDADLJP5","short_pith_number":"pith:5Z4M4FB2","canonical_record":{"source":{"id":"1501.04760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:01:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"05aa94a4041ce60163201aa8eefae20720de724aad96ec8ad3b4b96f4b9cb390","abstract_canon_sha256":"1f2645a18797a935a6963771c5ced3261e9e3d9fc316508d50908d2956df2924"},"schema_version":"1.0"},"canonical_sha256":"ee78ce143a499feaf39d80a8300d697f73f69541e94a87eb6ed31c5ac80f1314","source":{"kind":"arxiv","id":"1501.04760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04760","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04760v1","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04760","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"5Z4M4FB2JGP6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5Z4M4FB2JGP6V445","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5Z4M4FB2","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5Z4M4FB2JGP6V445QCUDADLJP5","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:01:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"05aa94a4041ce60163201aa8eefae20720de724aad96ec8ad3b4b96f4b9cb390","abstract_canon_sha256":"1f2645a18797a935a6963771c5ced3261e9e3d9fc316508d50908d2956df2924"},"schema_version":"1.0"},"canonical_sha256":"ee78ce143a499feaf39d80a8300d697f73f69541e94a87eb6ed31c5ac80f1314","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:02.909595Z","signature_b64":"2d3qaLCa7c4hS0sdDum4apeLAwpHp9TMNB5ZC+Pmeh0+rcGzh554MJAtYb+dSOcfPQpT1ZzS3jLCl9kUaiblBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee78ce143a499feaf39d80a8300d697f73f69541e94a87eb6ed31c5ac80f1314","last_reissued_at":"2026-05-18T02:29:02.909152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:02.909152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04760","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-18T02:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgTtCX5s0vYD6Vut3U41dhuzK3n92LvQ9WFU0s43hDXWgjUU5Kr1sDd9sM8IkHRwhzMmhuf+VKLBm0bSjczLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:05.511433Z"},"content_sha256":"48926ed56132a16837cf25dd4496fc266f2839b24c62cf5ffd1038036fdeeaba","schema_version":"1.0","event_id":"sha256:48926ed56132a16837cf25dd4496fc266f2839b24c62cf5ffd1038036fdeeaba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5Z4M4FB2JGP6V445QCUDADLJP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Alternate Construction of an Access-Optimal Regenerating Code with Optimal Sub-Packetization Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","submitted_at":"2015-01-20T11:01:47Z","abstract_excerpt":"Given the scale of today's distributed storage systems, the failure of an individual node is a common phenomenon. Various metrics have been proposed to measure the efficacy of the repair of a failed node, such as the amount of data download needed to repair (also known as the repair bandwidth), the amount of data accessed at the helper nodes, and the number of helper nodes contacted. Clearly, the amount of data accessed can never be smaller than the repair bandwidth. In the case of a help-by-transfer code, the amount of data accessed is equal to the repair bandwidth. It follows that a help-by-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04760","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-18T02:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BuvIeQQ08vn3gH1q1mjvLLDqu7QKZX4WUX+OLAzOUSx+ScBR3Amil2WE42xkNdN7VN3ndmxsi1TaDs0b9u9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:05.512182Z"},"content_sha256":"a70df96a5449ae24dc41807f1117d74f045830c071709c166e1867c928ab0678","schema_version":"1.0","event_id":"sha256:a70df96a5449ae24dc41807f1117d74f045830c071709c166e1867c928ab0678"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Z4M4FB2JGP6V445QCUDADLJP5/bundle.json","state_url":"https://pith.science/pith/5Z4M4FB2JGP6V445QCUDADLJP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Z4M4FB2JGP6V445QCUDADLJP5/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-30T23:14:05Z","links":{"resolver":"https://pith.science/pith/5Z4M4FB2JGP6V445QCUDADLJP5","bundle":"https://pith.science/pith/5Z4M4FB2JGP6V445QCUDADLJP5/bundle.json","state":"https://pith.science/pith/5Z4M4FB2JGP6V445QCUDADLJP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Z4M4FB2JGP6V445QCUDADLJP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5Z4M4FB2JGP6V445QCUDADLJP5","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":"1f2645a18797a935a6963771c5ced3261e9e3d9fc316508d50908d2956df2924","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:01:47Z","title_canon_sha256":"05aa94a4041ce60163201aa8eefae20720de724aad96ec8ad3b4b96f4b9cb390"},"schema_version":"1.0","source":{"id":"1501.04760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04760","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04760v1","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04760","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"5Z4M4FB2JGP6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5Z4M4FB2JGP6V445","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5Z4M4FB2","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a70df96a5449ae24dc41807f1117d74f045830c071709c166e1867c928ab0678","target":"graph","created_at":"2026-05-18T02:29:02Z","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":"Given the scale of today's distributed storage systems, the failure of an individual node is a common phenomenon. Various metrics have been proposed to measure the efficacy of the repair of a failed node, such as the amount of data download needed to repair (also known as the repair bandwidth), the amount of data accessed at the helper nodes, and the number of helper nodes contacted. Clearly, the amount of data accessed can never be smaller than the repair bandwidth. In the case of a help-by-transfer code, the amount of data accessed is equal to the repair bandwidth. It follows that a help-by-","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:01:47Z","title":"An Alternate Construction of an Access-Optimal Regenerating Code with Optimal Sub-Packetization Level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04760","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:48926ed56132a16837cf25dd4496fc266f2839b24c62cf5ffd1038036fdeeaba","target":"record","created_at":"2026-05-18T02:29:02Z","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":"1f2645a18797a935a6963771c5ced3261e9e3d9fc316508d50908d2956df2924","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:01:47Z","title_canon_sha256":"05aa94a4041ce60163201aa8eefae20720de724aad96ec8ad3b4b96f4b9cb390"},"schema_version":"1.0","source":{"id":"1501.04760","kind":"arxiv","version":1}},"canonical_sha256":"ee78ce143a499feaf39d80a8300d697f73f69541e94a87eb6ed31c5ac80f1314","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee78ce143a499feaf39d80a8300d697f73f69541e94a87eb6ed31c5ac80f1314","first_computed_at":"2026-05-18T02:29:02.909152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:02.909152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2d3qaLCa7c4hS0sdDum4apeLAwpHp9TMNB5ZC+Pmeh0+rcGzh554MJAtYb+dSOcfPQpT1ZzS3jLCl9kUaiblBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:02.909595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48926ed56132a16837cf25dd4496fc266f2839b24c62cf5ffd1038036fdeeaba","sha256:a70df96a5449ae24dc41807f1117d74f045830c071709c166e1867c928ab0678"],"state_sha256":"3a194150a2f9d32b22b0416ca4d4a051d50d294cc244d4274a690e177cddd49b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpSu+opIzbEOlQKFFCKW0YJ5NwgIcc51otDWwF+5lx+qJtNEuoQOQ+Vg0pcINVVjWQ4dFU8uz+TRxh0P9S2MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:14:05.516061Z","bundle_sha256":"44cfb41488d3054432a3ec3d5c2c9f1d7a55b7688292835558232673f46a6233"}}