{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EKPFPECC2J6LQAKJ4LU7JYGGPH","short_pith_number":"pith:EKPFPECC","canonical_record":{"source":{"id":"1011.2361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-10T12:34:46Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"cb8c5f89a7dc6c1f858e5a777e312e89563799c30f028adc0831711497286ddd","abstract_canon_sha256":"f9965d33fbe85adc85d484c998a894ac010c89904d2a079996d066fbdf4933af"},"schema_version":"1.0"},"canonical_sha256":"229e579042d27cb80149e2e9f4e0c679e7852688f65659140d5daddbc8d559ea","source":{"kind":"arxiv","id":"1011.2361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2361","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2361v2","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2361","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"EKPFPECC2J6L","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EKPFPECC2J6LQAKJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EKPFPECC","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EKPFPECC2J6LQAKJ4LU7JYGGPH","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-10T12:34:46Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"cb8c5f89a7dc6c1f858e5a777e312e89563799c30f028adc0831711497286ddd","abstract_canon_sha256":"f9965d33fbe85adc85d484c998a894ac010c89904d2a079996d066fbdf4933af"},"schema_version":"1.0"},"canonical_sha256":"229e579042d27cb80149e2e9f4e0c679e7852688f65659140d5daddbc8d559ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.110487Z","signature_b64":"uiquMOEpuFZ8I+493+/FHC0Ho1CBs2VKY48YlMOr+iHNXoixtkHeSDQLJ9ZWo3Blj54RFUupjgY6VQwjBwSVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229e579042d27cb80149e2e9f4e0c679e7852688f65659140d5daddbc8d559ea","last_reissued_at":"2026-05-18T02:23:37.109843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.109843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2361","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:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Am5Oo99OCG3j+v/UeujbAEaS1NIEDVOORwHM/+8R+lwlHkC8578o1lHlFqJMQ6lum714zHJbQivXvt1gYbNdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:16:48.753664Z"},"content_sha256":"a3f1ead482d17a7e49eb9bd137c4256d3dc5241259746a5825101c2027459eec","schema_version":"1.0","event_id":"sha256:a3f1ead482d17a7e49eb9bd137c4256d3dc5241259746a5825101c2027459eec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EKPFPECC2J6LQAKJ4LU7JYGGPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","submitted_at":"2010-11-10T12:34:46Z","abstract_excerpt":"Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional-repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional-repair is exact-repair where the replacement node is required to store data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2361","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:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPnetXr1hM5ZD3QaO6dUo3mQX8rOVDNeKUFGcVFaalTCnrjtUTdd9WEOi0/WxrBlOYUKHyn/kKiEtli7txUQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:16:48.754026Z"},"content_sha256":"9b70494635eb51f588d38b3517a12341150f1fd2e1cda3ec839eaa756cc0393f","schema_version":"1.0","event_id":"sha256:9b70494635eb51f588d38b3517a12341150f1fd2e1cda3ec839eaa756cc0393f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/bundle.json","state_url":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/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-31T03:16:48Z","links":{"resolver":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH","bundle":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/bundle.json","state":"https://pith.science/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKPFPECC2J6LQAKJ4LU7JYGGPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EKPFPECC2J6LQAKJ4LU7JYGGPH","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":"f9965d33fbe85adc85d484c998a894ac010c89904d2a079996d066fbdf4933af","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-10T12:34:46Z","title_canon_sha256":"cb8c5f89a7dc6c1f858e5a777e312e89563799c30f028adc0831711497286ddd"},"schema_version":"1.0","source":{"id":"1011.2361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2361","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2361v2","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2361","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"EKPFPECC2J6L","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EKPFPECC2J6LQAKJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EKPFPECC","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:9b70494635eb51f588d38b3517a12341150f1fd2e1cda3ec839eaa756cc0393f","target":"graph","created_at":"2026-05-18T02:23:37Z","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 a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional-repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional-repair is exact-repair where the replacement node is required to store data","authors_text":"Kannan Ramchandran, K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar","cross_cats":["cs.DC","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-10T12:34:46Z","title":"Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2361","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:a3f1ead482d17a7e49eb9bd137c4256d3dc5241259746a5825101c2027459eec","target":"record","created_at":"2026-05-18T02:23:37Z","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":"f9965d33fbe85adc85d484c998a894ac010c89904d2a079996d066fbdf4933af","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-10T12:34:46Z","title_canon_sha256":"cb8c5f89a7dc6c1f858e5a777e312e89563799c30f028adc0831711497286ddd"},"schema_version":"1.0","source":{"id":"1011.2361","kind":"arxiv","version":2}},"canonical_sha256":"229e579042d27cb80149e2e9f4e0c679e7852688f65659140d5daddbc8d559ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"229e579042d27cb80149e2e9f4e0c679e7852688f65659140d5daddbc8d559ea","first_computed_at":"2026-05-18T02:23:37.109843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:37.109843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uiquMOEpuFZ8I+493+/FHC0Ho1CBs2VKY48YlMOr+iHNXoixtkHeSDQLJ9ZWo3Blj54RFUupjgY6VQwjBwSVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:37.110487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3f1ead482d17a7e49eb9bd137c4256d3dc5241259746a5825101c2027459eec","sha256:9b70494635eb51f588d38b3517a12341150f1fd2e1cda3ec839eaa756cc0393f"],"state_sha256":"ac183b8c683fdc142578c05af76ef96de6c35e4c7b3701db613b88cb3c086598"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INc8s1TzqMB3tGLXWXSFR4LWcbkFHK6bp6xi2eIsBe9PNrr8Vk5epFRdDwOyGog5qgtvv9OT+14b5FWx5qJtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:16:48.756264Z","bundle_sha256":"a8fdd2d102fba5489951095ce14696bb153d1c081c50d6819efec91e1dd95436"}}