{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3A5ZKL5TTCU5NE3QLCZE35DSWZ","short_pith_number":"pith:3A5ZKL5T","canonical_record":{"source":{"id":"1005.1634","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T19:50:04Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"bff671eb117e7ea84850d4799e87bc35c76f83f28d62c5474cb5c3b8118daa2a","abstract_canon_sha256":"7399d2c5d277f28f226e613a307b6486a3e63e904abbd0c8328084c012258eb3"},"schema_version":"1.0"},"canonical_sha256":"d83b952fb398a9d6937058b24df472b65eb3c738d937f8e615ae15f520f64d24","source":{"kind":"arxiv","id":"1005.1634","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1634","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1634v3","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1634","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"3A5ZKL5TTCU5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3A5ZKL5TTCU5NE3Q","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3A5ZKL5T","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3A5ZKL5TTCU5NE3QLCZE35DSWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1005.1634","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T19:50:04Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"bff671eb117e7ea84850d4799e87bc35c76f83f28d62c5474cb5c3b8118daa2a","abstract_canon_sha256":"7399d2c5d277f28f226e613a307b6486a3e63e904abbd0c8328084c012258eb3"},"schema_version":"1.0"},"canonical_sha256":"d83b952fb398a9d6937058b24df472b65eb3c738d937f8e615ae15f520f64d24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:08.566184Z","signature_b64":"11JOmH2h3ApjQTwVFDbKRDMJJ9vmsg3fleCg/j7rwl2qJ1X3CA8aWCPfVFoXlofCEfe0Hf3hvzgFiXIwZQ0tAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d83b952fb398a9d6937058b24df472b65eb3c738d937f8e615ae15f520f64d24","last_reissued_at":"2026-05-18T02:24:08.565666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:08.565666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.1634","source_version":3,"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:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHj25SVmCb8ujszAGGuOneCgNuZrONbvzJxU1oUjn8y+POxb/c6SmYSpEAWoQCipAmi7FLB4KKJkIrjIRpSADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:44:59.219564Z"},"content_sha256":"14882e9ecbdbcdb38ef8db10e4f15055b00eba9252465f8c1623f266d20f9f74","schema_version":"1.0","event_id":"sha256:14882e9ecbdbcdb38ef8db10e4f15055b00eba9252465f8c1623f266d20f9f74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3A5ZKL5TTCU5NE3QLCZE35DSWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions","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-05-10T19:50:04Z","abstract_excerpt":"Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary k of n nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary d nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1634","kind":"arxiv","version":3},"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:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbRJDjqdJIKdcXqoBCg7HBsWCXFxG9EoPUI1NTf3Q7kk4tfh2PxPOnqYTfNOSr4ByOmJ/9dRu1gtc8tCupGPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:44:59.219925Z"},"content_sha256":"ecc287df73c7b62581de3aad71498b4f30354ebb3dde877fa77d9aed7957be83","schema_version":"1.0","event_id":"sha256:ecc287df73c7b62581de3aad71498b4f30354ebb3dde877fa77d9aed7957be83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3A5ZKL5TTCU5NE3QLCZE35DSWZ/bundle.json","state_url":"https://pith.science/pith/3A5ZKL5TTCU5NE3QLCZE35DSWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3A5ZKL5TTCU5NE3QLCZE35DSWZ/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:44:59Z","links":{"resolver":"https://pith.science/pith/3A5ZKL5TTCU5NE3QLCZE35DSWZ","bundle":"https://pith.science/pith/3A5ZKL5TTCU5NE3QLCZE35DSWZ/bundle.json","state":"https://pith.science/pith/3A5ZKL5TTCU5NE3QLCZE35DSWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3A5ZKL5TTCU5NE3QLCZE35DSWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3A5ZKL5TTCU5NE3QLCZE35DSWZ","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":"7399d2c5d277f28f226e613a307b6486a3e63e904abbd0c8328084c012258eb3","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-05-10T19:50:04Z","title_canon_sha256":"bff671eb117e7ea84850d4799e87bc35c76f83f28d62c5474cb5c3b8118daa2a"},"schema_version":"1.0","source":{"id":"1005.1634","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1634","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1634v3","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1634","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"3A5ZKL5TTCU5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3A5ZKL5TTCU5NE3Q","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3A5ZKL5T","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:ecc287df73c7b62581de3aad71498b4f30354ebb3dde877fa77d9aed7957be83","target":"graph","created_at":"2026-05-18T02:24:08Z","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 arbitrary k of n nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary d nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum dis","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-05-10T19:50:04Z","title":"Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1634","kind":"arxiv","version":3},"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:14882e9ecbdbcdb38ef8db10e4f15055b00eba9252465f8c1623f266d20f9f74","target":"record","created_at":"2026-05-18T02:24:08Z","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":"7399d2c5d277f28f226e613a307b6486a3e63e904abbd0c8328084c012258eb3","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-05-10T19:50:04Z","title_canon_sha256":"bff671eb117e7ea84850d4799e87bc35c76f83f28d62c5474cb5c3b8118daa2a"},"schema_version":"1.0","source":{"id":"1005.1634","kind":"arxiv","version":3}},"canonical_sha256":"d83b952fb398a9d6937058b24df472b65eb3c738d937f8e615ae15f520f64d24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d83b952fb398a9d6937058b24df472b65eb3c738d937f8e615ae15f520f64d24","first_computed_at":"2026-05-18T02:24:08.565666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:08.565666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11JOmH2h3ApjQTwVFDbKRDMJJ9vmsg3fleCg/j7rwl2qJ1X3CA8aWCPfVFoXlofCEfe0Hf3hvzgFiXIwZQ0tAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:08.566184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.1634","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14882e9ecbdbcdb38ef8db10e4f15055b00eba9252465f8c1623f266d20f9f74","sha256:ecc287df73c7b62581de3aad71498b4f30354ebb3dde877fa77d9aed7957be83"],"state_sha256":"84a4cafca75a3c17f3dfb9c25ba1c4c4f4ff344900c5732976f0e996e48c0252"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbxfdCtjiKLCpbdSTMAg3FMHPYrQ6OTqyxlQJMoSyaniXGiy1WLSulVnPalMBmEaPpr+n8AHsZdHGKA0zAUXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:44:59.221767Z","bundle_sha256":"4c69bea3439ddd90ed4ff049f52f83ace19fc3933725ce253f40f3dda3c59877"}}