{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3VIQKUHAIQEHREDYFQNBAZ2YR3","short_pith_number":"pith:3VIQKUHA","canonical_record":{"source":{"id":"1709.00178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-01T07:11:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e7423b333c71c3a2447b78dda23276957b5ed10adfcc1e74fc452f651d4f2cdc","abstract_canon_sha256":"58119675ca9b6bf373ae00f0bd4e2d0fc45c42f7d0df04f832dff342df62685f"},"schema_version":"1.0"},"canonical_sha256":"dd510550e044087890782c1a1067588ed11ebd1c856c2dd2466af8c72cc14481","source":{"kind":"arxiv","id":"1709.00178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00178","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00178v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00178","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"3VIQKUHAIQEH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3VIQKUHAIQEHREDY","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3VIQKUHA","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3VIQKUHAIQEHREDYFQNBAZ2YR3","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-01T07:11:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e7423b333c71c3a2447b78dda23276957b5ed10adfcc1e74fc452f651d4f2cdc","abstract_canon_sha256":"58119675ca9b6bf373ae00f0bd4e2d0fc45c42f7d0df04f832dff342df62685f"},"schema_version":"1.0"},"canonical_sha256":"dd510550e044087890782c1a1067588ed11ebd1c856c2dd2466af8c72cc14481","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:13.155656Z","signature_b64":"p8mWMAPau9BjsseJi2a0lDDDhS2MJQqD+APQ2kLcvJkHXqdUrhqwAFKjipepKjPh5I4GahalQUefoZxGF98CDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd510550e044087890782c1a1067588ed11ebd1c856c2dd2466af8c72cc14481","last_reissued_at":"2026-05-18T00:36:13.155093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:13.155093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00178","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-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRcegLGs3hxUm5eRmJcwaxDEZu8JFmuyrQ05fRDraUkVCv+6spbneiywWus+6svGoTlWB/XnvZ+oRrmcHOsVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:02:07.978616Z"},"content_sha256":"bbdfff4bcbe1738ae2ebb2edb5a4d5573e9be7b2df20a6e19f78f3ab32bb7ab2","schema_version":"1.0","event_id":"sha256:bbdfff4bcbe1738ae2ebb2edb5a4d5573e9be7b2df20a6e19f78f3ab32bb7ab2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3VIQKUHAIQEHREDYFQNBAZ2YR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the coding speed of erasure codes with polynomial ring transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J\\'er\\^ome Lacan, Jonathan Detchart","submitted_at":"2017-09-01T07:11:58Z","abstract_excerpt":"Erasure codes are widely used in today's storage systems to cope with failures. Most of them use the finite field arithmetic. In this paper, we propose an implementation and a coding speed evaluation of an original method called PYRIT (PolYnomial RIng Transform) to perform operations between elements of a finite field into a bigger ring by using fast transforms between these two structures. Working in such a ring is much easier than working in a finite field. Firstly, it reduces the coding complexity by design. Secondly, it allows simple but efficient \\texttt{xor}-based implementations by unro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00178","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-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZuKSHBTl3ovIxBV5fl3PuDeDwGXWy+/2TfXjDfnWdgR8UX/jCooxyQNHHN8YTsJyM5uvmfT9ztiJ5iva7sfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:02:07.979175Z"},"content_sha256":"1b814b17f83e7df9bdef9d77d7e15b108c3bcfe3987623d0ec1e3f0dcee0d520","schema_version":"1.0","event_id":"sha256:1b814b17f83e7df9bdef9d77d7e15b108c3bcfe3987623d0ec1e3f0dcee0d520"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VIQKUHAIQEHREDYFQNBAZ2YR3/bundle.json","state_url":"https://pith.science/pith/3VIQKUHAIQEHREDYFQNBAZ2YR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VIQKUHAIQEHREDYFQNBAZ2YR3/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-06-09T01:02:07Z","links":{"resolver":"https://pith.science/pith/3VIQKUHAIQEHREDYFQNBAZ2YR3","bundle":"https://pith.science/pith/3VIQKUHAIQEHREDYFQNBAZ2YR3/bundle.json","state":"https://pith.science/pith/3VIQKUHAIQEHREDYFQNBAZ2YR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VIQKUHAIQEHREDYFQNBAZ2YR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3VIQKUHAIQEHREDYFQNBAZ2YR3","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":"58119675ca9b6bf373ae00f0bd4e2d0fc45c42f7d0df04f832dff342df62685f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-01T07:11:58Z","title_canon_sha256":"e7423b333c71c3a2447b78dda23276957b5ed10adfcc1e74fc452f651d4f2cdc"},"schema_version":"1.0","source":{"id":"1709.00178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00178","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00178v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00178","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"3VIQKUHAIQEH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3VIQKUHAIQEHREDY","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3VIQKUHA","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:1b814b17f83e7df9bdef9d77d7e15b108c3bcfe3987623d0ec1e3f0dcee0d520","target":"graph","created_at":"2026-05-18T00:36:13Z","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":"Erasure codes are widely used in today's storage systems to cope with failures. Most of them use the finite field arithmetic. In this paper, we propose an implementation and a coding speed evaluation of an original method called PYRIT (PolYnomial RIng Transform) to perform operations between elements of a finite field into a bigger ring by using fast transforms between these two structures. Working in such a ring is much easier than working in a finite field. Firstly, it reduces the coding complexity by design. Secondly, it allows simple but efficient \\texttt{xor}-based implementations by unro","authors_text":"J\\'er\\^ome Lacan, Jonathan Detchart","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-01T07:11:58Z","title":"Improving the coding speed of erasure codes with polynomial ring transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00178","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:bbdfff4bcbe1738ae2ebb2edb5a4d5573e9be7b2df20a6e19f78f3ab32bb7ab2","target":"record","created_at":"2026-05-18T00:36:13Z","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":"58119675ca9b6bf373ae00f0bd4e2d0fc45c42f7d0df04f832dff342df62685f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-01T07:11:58Z","title_canon_sha256":"e7423b333c71c3a2447b78dda23276957b5ed10adfcc1e74fc452f651d4f2cdc"},"schema_version":"1.0","source":{"id":"1709.00178","kind":"arxiv","version":1}},"canonical_sha256":"dd510550e044087890782c1a1067588ed11ebd1c856c2dd2466af8c72cc14481","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd510550e044087890782c1a1067588ed11ebd1c856c2dd2466af8c72cc14481","first_computed_at":"2026-05-18T00:36:13.155093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:13.155093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p8mWMAPau9BjsseJi2a0lDDDhS2MJQqD+APQ2kLcvJkHXqdUrhqwAFKjipepKjPh5I4GahalQUefoZxGF98CDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:13.155656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbdfff4bcbe1738ae2ebb2edb5a4d5573e9be7b2df20a6e19f78f3ab32bb7ab2","sha256:1b814b17f83e7df9bdef9d77d7e15b108c3bcfe3987623d0ec1e3f0dcee0d520"],"state_sha256":"9b5e22ef7e1943ed9e0b50c72ea5c736991880d7f1c8edf0f7659dece3ceaad7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjfN7r/mdXFJqBq4ga6NptXG9mDJagqk+f3QfvoimdLbBopuNLHFlBsDHckNllQhnt4EiXn9aXIFqDJ8PAgoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:02:07.981821Z","bundle_sha256":"4bdcfaa621fc2178a39ca1f4f2b4d6e3d95ff1400bfeef38fdf692e825aa231f"}}