{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I4TR43WFYYWDXZ32V4PSZZQAVB","short_pith_number":"pith:I4TR43WF","canonical_record":{"source":{"id":"1312.5155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-16T09:51:15Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"0c2aea50d00f75640f67be2db468040d2fbdf640d436fc7795c197807c7b0a85","abstract_canon_sha256":"77679ff861881a9997eeaf3229ae866a2f22bdd0d85d7ebca023f3cb59098b0d"},"schema_version":"1.0"},"canonical_sha256":"47271e6ec5c62c3be77aaf1f2ce600a878dfdec82833410383d65ddbcda54853","source":{"kind":"arxiv","id":"1312.5155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5155","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5155v1","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5155","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"I4TR43WFYYWD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I4TR43WFYYWDXZ32","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I4TR43WF","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I4TR43WFYYWDXZ32V4PSZZQAVB","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-16T09:51:15Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"0c2aea50d00f75640f67be2db468040d2fbdf640d436fc7795c197807c7b0a85","abstract_canon_sha256":"77679ff861881a9997eeaf3229ae866a2f22bdd0d85d7ebca023f3cb59098b0d"},"schema_version":"1.0"},"canonical_sha256":"47271e6ec5c62c3be77aaf1f2ce600a878dfdec82833410383d65ddbcda54853","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:16.103228Z","signature_b64":"0cJGilhNTWpeAf+UXAST8c8cwmmOmY3L03YMI/PkyMDWPgQvW7kTi7PQ74/wCPbeLNm7ehpLj41ovz86bZeUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47271e6ec5c62c3be77aaf1f2ce600a878dfdec82833410383d65ddbcda54853","last_reissued_at":"2026-05-18T03:04:16.102546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:16.102546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5155","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-18T03:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEibF+cCEx22VangMRFx6rTh4mJlELABDsZOFVVXo/FTI+VzwV1uJCjFojFB1ixC656FYcRybS20gbAEQEX2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:22:40.133040Z"},"content_sha256":"49cb24c744ef90a2a2dc397b6a8def4d4f1d27d80c0f5d5f3661265aa43c3de9","schema_version":"1.0","event_id":"sha256:49cb24c744ef90a2a2dc397b6a8def4d4f1d27d80c0f5d5f3661265aa43c3de9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I4TR43WFYYWDXZ32V4PSZZQAVB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Effectiveness of Polynomial Realization of Reed-Solomon Codes for Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Anwitaman Datta, Kyumars Sheykh Esmaili","submitted_at":"2013-12-16T09:51:15Z","abstract_excerpt":"There are different ways to realize Reed Solomon (RS) codes. While in the storage community, using the generator matrices to implement RS codes is more popular, in the coding theory community the generator polynomials are typically used to realize RS codes. Prominent exceptions include HDFS-RAID, which uses generator polynomial based erasure codes, and extends the Apache Hadoop's file system.\n  In this paper we evaluate the performance of an implementation of polynomial realization of Reed-Solomon codes, along with our optimized version of it, against that of a widely-used library (Jerasure) t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5155","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-18T03:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZevP/Hspno81RRelnvntbpsoe+MOHtqmOEnCPcYNOoiJ5wkSki2K4NuVQ0GXz/dxP5kjyRkXXXhjth9WOEIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:22:40.133696Z"},"content_sha256":"000a125ea6eee09069be1c7c61c90df3e54ba3980e7ad6a80a8d676692fd9feb","schema_version":"1.0","event_id":"sha256:000a125ea6eee09069be1c7c61c90df3e54ba3980e7ad6a80a8d676692fd9feb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4TR43WFYYWDXZ32V4PSZZQAVB/bundle.json","state_url":"https://pith.science/pith/I4TR43WFYYWDXZ32V4PSZZQAVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4TR43WFYYWDXZ32V4PSZZQAVB/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-27T21:22:40Z","links":{"resolver":"https://pith.science/pith/I4TR43WFYYWDXZ32V4PSZZQAVB","bundle":"https://pith.science/pith/I4TR43WFYYWDXZ32V4PSZZQAVB/bundle.json","state":"https://pith.science/pith/I4TR43WFYYWDXZ32V4PSZZQAVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4TR43WFYYWDXZ32V4PSZZQAVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I4TR43WFYYWDXZ32V4PSZZQAVB","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":"77679ff861881a9997eeaf3229ae866a2f22bdd0d85d7ebca023f3cb59098b0d","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-16T09:51:15Z","title_canon_sha256":"0c2aea50d00f75640f67be2db468040d2fbdf640d436fc7795c197807c7b0a85"},"schema_version":"1.0","source":{"id":"1312.5155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5155","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5155v1","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5155","created_at":"2026-05-18T03:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"I4TR43WFYYWD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I4TR43WFYYWDXZ32","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I4TR43WF","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:000a125ea6eee09069be1c7c61c90df3e54ba3980e7ad6a80a8d676692fd9feb","target":"graph","created_at":"2026-05-18T03:04:16Z","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":"There are different ways to realize Reed Solomon (RS) codes. While in the storage community, using the generator matrices to implement RS codes is more popular, in the coding theory community the generator polynomials are typically used to realize RS codes. Prominent exceptions include HDFS-RAID, which uses generator polynomial based erasure codes, and extends the Apache Hadoop's file system.\n  In this paper we evaluate the performance of an implementation of polynomial realization of Reed-Solomon codes, along with our optimized version of it, against that of a widely-used library (Jerasure) t","authors_text":"Anwitaman Datta, Kyumars Sheykh Esmaili","cross_cats":["cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-16T09:51:15Z","title":"On the Effectiveness of Polynomial Realization of Reed-Solomon Codes for Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5155","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:49cb24c744ef90a2a2dc397b6a8def4d4f1d27d80c0f5d5f3661265aa43c3de9","target":"record","created_at":"2026-05-18T03:04:16Z","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":"77679ff861881a9997eeaf3229ae866a2f22bdd0d85d7ebca023f3cb59098b0d","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-16T09:51:15Z","title_canon_sha256":"0c2aea50d00f75640f67be2db468040d2fbdf640d436fc7795c197807c7b0a85"},"schema_version":"1.0","source":{"id":"1312.5155","kind":"arxiv","version":1}},"canonical_sha256":"47271e6ec5c62c3be77aaf1f2ce600a878dfdec82833410383d65ddbcda54853","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47271e6ec5c62c3be77aaf1f2ce600a878dfdec82833410383d65ddbcda54853","first_computed_at":"2026-05-18T03:04:16.102546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:16.102546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0cJGilhNTWpeAf+UXAST8c8cwmmOmY3L03YMI/PkyMDWPgQvW7kTi7PQ74/wCPbeLNm7ehpLj41ovz86bZeUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:16.103228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49cb24c744ef90a2a2dc397b6a8def4d4f1d27d80c0f5d5f3661265aa43c3de9","sha256:000a125ea6eee09069be1c7c61c90df3e54ba3980e7ad6a80a8d676692fd9feb"],"state_sha256":"515fb8e788f3b6f76f83c1fc491646c46a7e40e56309c4975dcb1886e662d10f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+9lrDOkQhC9Q7dfwCQsbZZ3F7jWu0aBci+nNNsEsQq5xh4zkhbvYzLaNP7ZEk5NMgAJRRGopncoeGMvG7x0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:22:40.137054Z","bundle_sha256":"ab99d28156e588d616cb31118cc87c9dc732a4d145c08acd7273881a1bb7335b"}}