{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6H33N5H5FMUKSL7R52HKM5NHC4","short_pith_number":"pith:6H33N5H5","canonical_record":{"source":{"id":"1406.6783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T06:52:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c89b0864aa64d586e740bc7380cfdcccf51a38fbf96a39f4ab36c8dfab1f234","abstract_canon_sha256":"9c11c2049422297f9bc664b58cf24a5ca620e5d880e44c86cd34b7024f5aaf54"},"schema_version":"1.0"},"canonical_sha256":"f1f7b6f4fd2b28a92ff1ee8ea675a717234e721cdc179c4d2c930a64d5f55c87","source":{"kind":"arxiv","id":"1406.6783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6783","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6783v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6783","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"6H33N5H5FMUK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6H33N5H5FMUKSL7R","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6H33N5H5","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6H33N5H5FMUKSL7R52HKM5NHC4","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T06:52:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c89b0864aa64d586e740bc7380cfdcccf51a38fbf96a39f4ab36c8dfab1f234","abstract_canon_sha256":"9c11c2049422297f9bc664b58cf24a5ca620e5d880e44c86cd34b7024f5aaf54"},"schema_version":"1.0"},"canonical_sha256":"f1f7b6f4fd2b28a92ff1ee8ea675a717234e721cdc179c4d2c930a64d5f55c87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:55.886085Z","signature_b64":"dYCLCZDampMGcUKF3LvX39DElHSkafG1tG/+RfD/cKfuFynGGegNro7fA7oAg7KKWaoQlN+eFX3MB0suIiorBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f7b6f4fd2b28a92ff1ee8ea675a717234e721cdc179c4d2c930a64d5f55c87","last_reissued_at":"2026-05-18T02:48:55.885330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:55.885330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6783","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:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BpRiM3CwTGuTHrNsqC2A4G+bdw9tsBcQh4aYyMsW5PQ0XXjmTZN5S98RdaELvgqByKWsTPVVAzw9cElfvWiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:22:20.311246Z"},"content_sha256":"b928374f15964178d077be65adec1886a2843a5b936ebb5ef76ed46e8d8daca1","schema_version":"1.0","event_id":"sha256:b928374f15964178d077be65adec1886a2843a5b936ebb5ef76ed46e8d8daca1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6H33N5H5FMUKSL7R52HKM5NHC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluation of Codes with Inherent Double Replication for Hadoop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, M. Nikhil Krishnan, N. Prakash, P. Vijay Kumar, Ranjit Kumar, Siddhartha Nandi, Srinivasan Narayanamurthy, V. Lalitha","submitted_at":"2014-06-26T06:52:49Z","abstract_excerpt":"In this paper, we evaluate the efficacy, in a Hadoop setting, of two coding schemes, both possessing an inherent double replication of data. The two coding schemes belong to the class of regenerating and locally regenerating codes respectively, and these two classes are representative of recent advances made in designing codes for the efficient storage of data in a distributed setting. In comparison with triple replication, double replication permits a significant reduction in storage overhead, while delivering good MapReduce performance under moderate work loads. The two coding solutions unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6783","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:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHC13hTui8zzB3QjbruSGZyq2dsAsK0+1mAqgjO9Vzgks1mUZsz3LJASVZuPj+QBMrM/wb4u62C/YRaH3n26DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:22:20.311726Z"},"content_sha256":"37422b7f138efc1acd8a8b0c463e4975a78e3dea626bc6b1ea9e5eb4c8a06df4","schema_version":"1.0","event_id":"sha256:37422b7f138efc1acd8a8b0c463e4975a78e3dea626bc6b1ea9e5eb4c8a06df4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6H33N5H5FMUKSL7R52HKM5NHC4/bundle.json","state_url":"https://pith.science/pith/6H33N5H5FMUKSL7R52HKM5NHC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6H33N5H5FMUKSL7R52HKM5NHC4/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:22:20Z","links":{"resolver":"https://pith.science/pith/6H33N5H5FMUKSL7R52HKM5NHC4","bundle":"https://pith.science/pith/6H33N5H5FMUKSL7R52HKM5NHC4/bundle.json","state":"https://pith.science/pith/6H33N5H5FMUKSL7R52HKM5NHC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6H33N5H5FMUKSL7R52HKM5NHC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6H33N5H5FMUKSL7R52HKM5NHC4","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":"9c11c2049422297f9bc664b58cf24a5ca620e5d880e44c86cd34b7024f5aaf54","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T06:52:49Z","title_canon_sha256":"7c89b0864aa64d586e740bc7380cfdcccf51a38fbf96a39f4ab36c8dfab1f234"},"schema_version":"1.0","source":{"id":"1406.6783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6783","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6783v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6783","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"6H33N5H5FMUK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6H33N5H5FMUKSL7R","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6H33N5H5","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:37422b7f138efc1acd8a8b0c463e4975a78e3dea626bc6b1ea9e5eb4c8a06df4","target":"graph","created_at":"2026-05-18T02:48:55Z","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":"In this paper, we evaluate the efficacy, in a Hadoop setting, of two coding schemes, both possessing an inherent double replication of data. The two coding schemes belong to the class of regenerating and locally regenerating codes respectively, and these two classes are representative of recent advances made in designing codes for the efficient storage of data in a distributed setting. In comparison with triple replication, double replication permits a significant reduction in storage overhead, while delivering good MapReduce performance under moderate work loads. The two coding solutions unde","authors_text":"Birenjith Sasidharan, M. Nikhil Krishnan, N. Prakash, P. Vijay Kumar, Ranjit Kumar, Siddhartha Nandi, Srinivasan Narayanamurthy, V. Lalitha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T06:52:49Z","title":"Evaluation of Codes with Inherent Double Replication for Hadoop"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6783","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:b928374f15964178d077be65adec1886a2843a5b936ebb5ef76ed46e8d8daca1","target":"record","created_at":"2026-05-18T02:48:55Z","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":"9c11c2049422297f9bc664b58cf24a5ca620e5d880e44c86cd34b7024f5aaf54","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T06:52:49Z","title_canon_sha256":"7c89b0864aa64d586e740bc7380cfdcccf51a38fbf96a39f4ab36c8dfab1f234"},"schema_version":"1.0","source":{"id":"1406.6783","kind":"arxiv","version":1}},"canonical_sha256":"f1f7b6f4fd2b28a92ff1ee8ea675a717234e721cdc179c4d2c930a64d5f55c87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1f7b6f4fd2b28a92ff1ee8ea675a717234e721cdc179c4d2c930a64d5f55c87","first_computed_at":"2026-05-18T02:48:55.885330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:55.885330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dYCLCZDampMGcUKF3LvX39DElHSkafG1tG/+RfD/cKfuFynGGegNro7fA7oAg7KKWaoQlN+eFX3MB0suIiorBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:55.886085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b928374f15964178d077be65adec1886a2843a5b936ebb5ef76ed46e8d8daca1","sha256:37422b7f138efc1acd8a8b0c463e4975a78e3dea626bc6b1ea9e5eb4c8a06df4"],"state_sha256":"65b8d713812db7c3a5204f42633439f30c0ce41748dd6adba5a728c2cbee7807"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/vM12XVje+PypOIHNCjBS6E5TPsfadEv/PNVCe3t+nDlY3hdtDt7GpaOxdS1Ay1BCsg1eBvCfdETl7/RQtSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:22:20.314892Z","bundle_sha256":"8965792f8c97af2a16d0fe319f6193c85e3cd27254634936a4e70e8d7b52741e"}}